A syntactic theory of sequential control
Theoretical Computer Science
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
Handbook of logic in 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
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
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
Continuation models are universal for lambda-mu-calculus
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
Strong Normalization of Second Order Symmetric lambda-Calculus
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Computational Interpretation of Negation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Call-by-value is dual to call-by-name, extended
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
A filter model for the λµ-calculus
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Game Semantics in String Diagrams
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We show that a certain simple call-by-name continuation semantics of Parigot's λµ -calculus is complete. More precisely, for every λµ-theory we construct a cartesian closed category such that the ensuing continuation-style interpretation of λµ, which maps terms to functions sending abstract continuations to responses, is full and faithful. Thus, any λµ-category in the sense of L. Ong (1996, in "Proceedings of LICS '96," IEEE Press. New York) is isomorphic to a continuation model (Y. Lafont, B. Reus, and T. Streicher, "Continuous Semantics or Expressing Implication by Negation," Technical Report 93-21, University of Munich) derived from a cartesian-closed category of continuations. We also extend this result to a later call-by-value version of λµ developed by C.-H. L. Ong and C. A. Stewart (1997), in "Proceedings of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Paris, January 1997," Assoc. Comput. Mach. Press. New York).