A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Basic proof theory (2nd ed.)
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Revisiting the Correspondence between Cut Elimination and Normalisation
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Call-by-Value λ-calculus and LJQ
Journal of Logic and Computation
The λ-Calculus and the Unity of Structural Proof Theory
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
λµ-calculus and duality: call-by-name and call-by-value
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
This paper studies a new classical natural deduction system, presented as a typed calculus named λµlet. It is designed to be isomorphic to Curien-Herbelin's λµµ-calculus, both at the level of proofs and reduction, and the isomorphism is based on the correct correspondence between cut (resp. left-introduction) in sequent calculus, and substitution (resp. elimination) in natural deduction. It is a combination of Parigot's λµ-calculus with the idea of "coercion calculus" due to Cervesato-Pfenning, accommodating let-expressions in a surprising way: they expand Parigot's syntactic class of named terms. This calculus aims to be the simultaneous answer to three problems. The first problem is the lack of a canonical natural deduction system for classical logic. λµlet is not yet another classical calculus, but rather a canonical reflection in natural deduction of the impeccable treatment of classical logic by sequent calculus. The second problem is the lack of a formalization of the usual semantics of λµµ-calculus, that explains co-terms and cuts as, respectively, contexts and hole-filling instructions. The mentioned isomorphism is the required formalization, based on the precise notions of context and hole-expression offered by λµlet. The third problem is the lack of a robust process of "read-back" into natural deduction syntax of calculi in the sequent calculus format, that affects mainly the recent proof-theoretic efforts of derivation of λ-calculi for call-byvalue. An isomorphic counterpart to the Q-subsystem of λµµ-calculus is derived, obtaining a new λ-calculus for call-by-value, combining control and let-expressions.