Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. David, Walter Py (2001)
λμ-calculus and Böhm's theoremJournal of Symbolic Logic, 66
M. Parigot (1993)
Strong normalization for second order classical natural deduction[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
Hugo Herbelin, S. Ghilezan (2008)
An approach to call-by-name delimited continuations
(1969)
The formulae-as-type notion of construction Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism
M. Felleisen, Daniel Friedman, E. Kohlbecker, B. Duba (1987)
A Syntactic Theory of Sequential ControlTheor. Comput. Sci., 52
R. Statman (1983)
λ-definable functionals andβη conversionArchiv für mathematische Logik und Grundlagenforschung, 23
K. Baba, 馬場 謙介, S. Hirokawa, 廣川 佐千男, Ken-etsu Fujita, 藤田 憲悦 (2001)
Parallel Reduction in Type Free lambda/mu-Calculus
A. Saurin (2005)
Separation with Streams in the lambdaµ-calculus
Walter Py (1998)
Confluence en -calcul
P. Groote (1998)
An environment machine for the λμ-calculusMathematical Structures in Computer Science, 8
(2008)
Uné etude logique du contrôle, appliquéè a la programmation fonctionnelle et logique
(2008)
Stream associative nets and μ-calculus
P. Groote (2007)
On the Relation between the λ μ-Calculus and the Syntactic Theory of Sequential Control
T. Joly (2000)
Codages, separabilite et representation de fonctions en lambda-calcul simplement type et dans d'autres systemes de types
(1968)
Alcune proprietà delle forme βη-normali nel λK-calcolo
K. Dosen, Z. Petric (1999)
The Maximality of the Typed Lambda Calculus and of Cartesian Closed CategoriesarXiv: Category Theory
M. Parigot (1997)
Proofs of strong normalisation for second order classical natural deductionJournal of Symbolic Logic, 62
(2010)
ACM Transactions on Computational Logic
Z. Ariola, Hugo Herbelin, A. Sabry (2009)
A type-theoretic foundation of delimited continuationsHigher-Order and Symbolic Computation, 22
T. Griffin (1989)
A formulae-as-type notion of control
Chetan Murthy (1992)
A computational analysis of Girard's translation and LC[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science
P. Groote (1994)
On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control
J. Krivine (1993)
Lambda-calculus, types and models
M. Parigot (1992)
Lambda-Mu-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
(2008)
Received October
M. Parigot (1990)
Free Deduction: An Analysis of "Computations" in Classical Logic
J. Girard (1991)
A new constructive logic: classic logicMathematical Structures in Computer Science, 1
C. Ong (1996)
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizationsProceedings 11th Annual IEEE Symposium on Logic in Computer Science
M. Felleisen, Robert Hieb (1992)
The Revised Report on the Syntactic Theories of Sequential Control and StateTheor. Comput. Sci., 103
T. Crolard, Emmanuel Polonowski (2011)
Deriving a Hoare-Floyd logic for non-local jumps from a formulae-as-types notion of controlArXiv, abs/1112.2950
K. Dosen, Z. Petric (2001)
The Typed Bohm Theorem
Λμ-calculus is a Böhm-complete extension of Parigot's Λμ-calculus closely related with delimited control in functional programming. In this article, we investigate the meta-theory of untyped Λμ-calculus by proving confluence of the calculus and characterizing the basic observables for the Separation theorem, canonical normal forms . Then, we define Λ s , a new type system for Λμ-calculus that contains a special type construction for streams, and prove that strong normalization and type preservation hold. Thanks to the new typing discipline of Λ s , new computational behaviors can be observed, which were forbidden in previous type systems for λμ-calculi. Those new typed computational behaviors witness the stream interpretation of Λμ-calculus.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Jul 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.