GL—a denotational testbed with continuations and partial continuations as first-class objects
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Stores and partial continuations as first-class objects in a language and its environment
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The theory and practice of first-class prompts
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning with continuations II: full abstraction for models of control
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
POPL '94 Proceedings of the 21st 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
Functional back-ends within the lambda-sigma calculus
Proceedings of the first ACM SIGPLAN international conference on Functional programming
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Categorical completeness results for the simply-typed lambda-calculus
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Games and Weak-Head Reduction for Classical PCF
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Call-by-Value Separability and Computability
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A CPS-Translation of the Lambda-µ-Calculus
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Game semantics and abstract machines
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in 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
Proceedings of ACM conference on Proving assertions about programs
A sound and complete axiomatization of delimited continuations
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Call-by-value is dual to call-by-name
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Control categories and duality: on the categorical semantics of the lambda-mu 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
Control reduction theories: The benefit of structural substitution
Journal of Functional Programming
A type-theoretic foundation of delimited continuations
Higher-Order and Symbolic Computation
A sound and complete CPS-translation for λµ-calculus
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
On the Relations between the Syntactic Theories of λμ-Calculi
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Context-based proofs of termination for typed delimited-control operators
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Typing streams in the Λμ-calculus
ACM Transactions on Computational Logic (TOCL)
Equational axiomatization of call-by-name delimited control
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Typing control operators in the CPS hierarchy
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
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
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
We show that a variant of Parigot's λμ-calculus, originally due to de Groote and proved to satisfy Boehm's theorem by Saurin, is canonically interpretable as a call-by-name calculus of delimited control. This observation is expressed using Ariola et al's call-by-value calculus of delimited control, an extension of λμ-calculus with delimited control known to be equationally equivalent to Danvy and Filinski's calculus with shift and reset. Our main result then is that de Groote and Saurin's variant of λμ-calculus is equivalent to a canonical call-by-name variant of Ariola et al's calculus. The rest of the paper is devoted to a comparative study of the call-by-name and call-by-value variants of Ariola et al's calculus, covering in particular the questions of simple typing, operational semantics, and continuation-passing-style semantics. Finally, we discuss the relevance of Ariola et al's calculus as a uniform framework for representing different calculi of delimited continuations, including "lazy" variants such as Sabry's shift and lazy reset calculus.