Reflections on Landin's J-operator: a partly historical note
Computer Languages
Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Essentials of programming languages
Essentials of programming languages
Basic proof theory
Revised Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
An Introduction to Landin‘s “A Generalization of Jumps and Labels”
Higher-Order and Symbolic Computation
A Generalization of Jumps and Labels
Higher-Order and Symbolic Computation
Definitional Interpreters Revisited
Higher-Order and Symbolic Computation
Definitional Interpreters for Higher-Order Programming Languages
Higher-Order and Symbolic Computation
Continuations: A Mathematical Semantics for Handling FullJumps
Higher-Order and Symbolic Computation
Comparing Control Constructs by Double-Barrelled CPS
Higher-Order and Symbolic Computation
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
Comparing Control Constructs by Double-Barrelled CPS
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
A type-theoretic foundation of continuations and prompts
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Frame rules from answer types for code pointers
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combining algebraic effects with continuations
Theoretical Computer Science
Functional pearl: the great escape or, how to jump the border without getting caught
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Compiling with continuations, continued
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Compiling self-adjusting programs with continuations
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A System F with Call-by-Name Exceptions
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
The worker/wrapper transformation
Journal of Functional Programming
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
A type-theoretic foundation of delimited continuations
Higher-Order and Symbolic Computation
Hi-index | 0.00 |
We investigate call-by-value continuation-passing style transforms that pass two continuations. Altering a single variable in the translation of λ-abstraction gives rise to different control operators: first-class continuations; dynamic control; and (depending on a further choice of a variable) either the \tt return statement of C; or Landin's J-operator. In each case there is an associated simple typing. For those constructs that allow upward continuations, the typing is classical, for the others it remains intuitionistic, giving a clean distinction independent of syntactic details. Moreover, those constructs that make the typing classical in the source of the CPS transform break the linearity of continuation use in the target.