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
On the expressive power of programming languages
Proceedings of the third European symposium on programming on ESOP '90
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typing first-class continuations in ML
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A library of high level control operators
ACM SIGPLAN Lisp Pointers
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
A Computational Interpretation of the lambda-µ-Calculus
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Extracting Constructive Content from Classical Logic via Control-like Reductions
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
A confluent λ-calculus with a catch/throw mechanism
Journal of Functional Programming
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
Call-by-value is dual to call-by-name
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Characterizing strong normalization in a language with control operators
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
A type-theoretic foundation of continuations and prompts
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
A complete, co-inductive syntactic theory of sequential control and state
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A proof-theoretic foundation of abortive continuations
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
Control reduction theories: The benefit of structural substitution
Journal of Functional Programming
Computation with classical sequents
Mathematical Structures in Computer Science
Proofs, tests and continuation passing style
ACM Transactions on Computational Logic (TOCL)
A type-theoretic foundation of delimited continuations
Higher-Order and Symbolic Computation
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
Classical call-by-need and duality
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Strong normalization of the dual classical sequent calculus
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
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
Böhm theorem and Böhm trees for the Λμ-calculus
Theoretical Computer Science
| Hi-index | 0.00 |
We give an analysis of various classical axioms and characterize a notion of minimal classical logic that enforces Peirce's law without enforcing Ex Falso Quodlibet. We show that a "natural" implementation of this logic is Parigot's classical natural deduction. We then move on to the computational side and emphasize that Parigot's λµ corresponds to minimal classical logic. A continuation constant must be added to λµ to get full classical logic. We then map the extended λµ to a new theory of control, λ-C--top, which extends Felleisen's reduction theory. λ-C--top allows one to distinguish between aborting and throwing to a continuation. It is also in correspondence with the proofs of a refinement of Prawitz's natural deduction.