A syntactic theory of sequential control
Theoretical Computer Science
The theory and practice of first-class prompts
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lambda-calculus, types and models
Lambda-calculus, types and models
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A symmetric lambda calculus for classical program extraction
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Infinite &lgr;-calculus and types
Theoretical Computer Science - Special issue: Gentzen
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
A Generalization of Jumps and Labels
Higher-Order and Symbolic Computation
Free Deduction: An Analysis of "Computations" in Classical Logic
Proceedings of the First Russian Conference on Logic Programming
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Infinitary Lambda Calculi and Böhm Models
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Infinitary lambda calculus and discrimination of Berarducci trees
Theoretical Computer Science - Australasian computer science
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
An environment machine for the λμ-calculus
Mathematical Structures in Computer Science
Separation with Streams in the ?µ-calculus
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
An approach to call-by-name delimited continuations
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the Relations between the Syntactic Theories of λμ-Calculi
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Minimal classical logic and control operators
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Typing streams in the Λμ-calculus
ACM Transactions on Computational Logic (TOCL)
An Intuitionistic Logic that Proves Markov's Principle
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Standardization and böhm trees for Λµ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A hierarchy for delimited continuations in call-by-name
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 5.23 |
Parigot's @l@m-calculus (Parigot, 1992 [1]) is now a standard reference about the computational content of classical logic as well as for the formal study of control operators in functional languages. In addition to the fine-grained Curry-Howard correspondence between minimal classical deductions and simply typed @l@m-terms and to the ability to encode many usual control operators such as call/cc in the @l@m-calculus (in its historical call-by-name presentation or in call-by-value versions), the success of the@l@m-calculus comes from its simplicity, its good meta-theoretical properties both as a typed and an untyped calculus (confluence, strong normalization, etc.) as well as the fact that it naturally extends Church's @l-calculus. Though, in 2001, David and Py proved [2] that Bohm's theorem, which is a fundamental result of the untyped @l-calculus, cannot be lifted to Parigot's calculus. In the present article, we exhibit a natural extension to Parigot's calculus, the@L@m-calculus, in which Bohm's property, also known as separation property, can be stated and proved. This is made possible by a careful and detailed analysis of David and Py's proof of non-separability and of the characteristics of the @l@m-calculus which break the property: we identify that the crucial point lies in the design of Parigot's @l@m-calculus with a two-level syntax. In addition, we establish a standardization theorem for the extended calculus, deduce a characterization of solvability, describe @L@m-Bohm trees and connect the calculus with stream computing and delimited control.