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
Typing first-class continuations in ML
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Notions of computation and monads
Information and Computation
Compiling with continuations
Lisp and Symbolic Computation
The discoveries of continuations
Lisp and Symbolic Computation - Special issue on continuations—part I
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
The π-calculus in direct style
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Thunks: a way of compiling procedure statements with some comments on procedure declarations
Communications of the ACM
Revised Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
A Generalization of Jumps and Labels
Higher-Order and Symbolic Computation
Continuations: A Mathematical Semantics for Handling FullJumps
Higher-Order and Symbolic Computation
Axioms for Recursion in Call-by-Value
Higher-Order and Symbolic Computation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Declarative Continuations: an Investigation of Duality in Programming Language Semantics
Category Theory and Computer Science
Proceedings of ACM conference on Proving assertions about programs
Rabbit: A Compiler for Scheme
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Journal of Functional Programming
A sound and complete axiomatization of delimited continuations
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Classical linear logic of implications
Mathematical Structures in Computer Science
Combining algebraic effects with continuations
Theoretical Computer Science
Proofs, tests and continuation passing style
ACM Transactions on Computational Logic (TOCL)
On the Observational Theory of the CPS-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We investigate continuations in the context of idealized call-by-value programming languages. On the semantic side, we analyze the categorical structures that arise from continuation models of call-by-value languages. On the syntactic side, we study the call-by-value continuation-passing transformation as a translation between equational theories. Among the novelties are an unusually simple axiomatization of control operators and a strengthened completeness result with a proof based on a delaying transform.