Obtaining coroutines with continuations
Computer Languages
A syntactic theory of sequential control
Theoretical Computer Science
Abstract continuations: a mathematical semantics for handling full jumps
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
The theory and practice of first-class prompts
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Control delimiters and their hierarchies
Lisp and Symbolic Computation
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
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Monads and composable continuations
Lisp and Symbolic Computation
Lisp and Symbolic Computation
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
A generalization of exceptions and control in ML-like languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Theoretical Computer Science
A Syntactic Theory of Dynamic Binding
Higher-Order and Symbolic Computation
Unchecked Exceptions Can Be Strictly More Powerful Than Call/CC
Higher-Order and Symbolic Computation
Continuation-Based Multiprocessing
Higher-Order and Symbolic Computation
Comparing Control Constructs by Double-Barrelled CPS
Higher-Order and Symbolic Computation
Proceedings of the Third International Conference on Logic Programming
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Partial Continuations as the Difference of Continuations - A Duumvirate of Control Operators
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
A sound and complete axiomatization of delimited continuations
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A Formulae-as-Types Interpretation of Subtractive Logic
Journal of Logic and Computation
Minimal classical logic and control operators
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Backtracking, interleaving, and terminating monad transformers: (functional pearl)
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control
Journal of Functional Programming
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Combining algebraic effects with continuations
Theoretical Computer Science
A proof-theoretic foundation of abortive continuations
Higher-Order and Symbolic Computation
A static simulation of dynamic delimited control
Higher-Order and Symbolic Computation
Axioms for control operators in the CPS hierarchy
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
A type-theoretic foundation of delimited continuations
Higher-Order and Symbolic Computation
A substructural type system for delimited continuations
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Self-Aware software – will it become a reality?
Self-star Properties in Complex Information Systems
Hi-index | 0.00 |
There is a correspondence between classical logic and programming language calculi with first-class continuations. With the addition of control delimiters (prompts), the continuations become composable and the calculi are believed to become more expressive. We formalise that the addition of prompts corresponds to the addition of a single dynamically-scoped variable modelling the special top-level continuation. From a type perspective, the dynamically-scoped variable requires effect annotations. From a logic perspective, the effect annotations can be understood in a standard logic extended with the dual of implication, namely subtraction.