A syntactic theory of sequential control
Theoretical Computer Science
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The discoveries of continuations
Lisp and Symbolic Computation - Special issue on continuations—part I
Intuitionistic and classical natural deduction systems with the catch and the throw rules
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
A Symmetric Lambda Calculus for "Classical" Program Extraction
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Simple Calculus of Exception Handling
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
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
Classical Proofs as Programs: How, What and Why
Classical Proofs as Programs: How, What and Why
Extracting constructive content from classical proofs
Extracting constructive content from classical proofs
An environment machine for the λμ-calculus
Mathematical Structures in Computer Science
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
Strong normalizability of the non-deterministic catch/throw calculi
Theoretical Computer Science - Special issue on theories of types and proofs
A proof-theoretic foundation of abortive continuations
Higher-Order and Symbolic Computation
Intuitionistic Letcc via Labelled Deduction
Electronic Notes in Theoretical Computer Science (ENTCS)
Minimal classical logic and control operators
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the degeneracy of Σ-types in presence of computational classical logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
An output-based semantics of Λμ with explicit substitution in the π-calculus: extended abstract
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
The recursive polarized dual calculus
Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification
Unifying Classical and Intuitionistic Logics for Computational Control
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |
We derive a confluent λ-calculus with a catchF;throw mechanism (called λct-calculus) from Parigot's λμ-calculus. We also present several translations from one calculus into the other which are morphisms for the reduction. We use them to show that the λct-calculus is a retract of λμ-calculus (these calculi are isomorphic if we consider only convertibility). As a by-product, we obtain the subject reduction property for the λct-calculus, as well as the strong normalization for λct-terms typable in the second order classical natural deduction.