Obtaining coroutines with continuations
Computer Languages
Journal of Logic Programming
Continuations may be unreasonable
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Scheme and the art of programming
Scheme and the art of programming
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
Typing first-class continuations in ML
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Commentary on standard ML
Essentials of programming languages
Essentials of programming languages
On the expressive power of programming languages
ESOP '90 Selected papers from the symposium on 3rd European symposium on programming
Full abstraction in the lazy lambda calculus
Information and Computation
The lazy Lambda calculus in a concurrency scenario
Information and Computation
The structure of continuation-passing styles
The structure of continuation-passing styles
The discriminating power of multiplicities in the &lgr;-calculus
Information and Computation
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Communications of the ACM
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
Declarative Continuations: an Investigation of Duality in Programming Language Semantics
Category Theory and Computer Science
Discrimination by Parallel Observers
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
An Interpreter for Extended Lambda Calculus
An Interpreter for Extended Lambda Calculus
SHOULD A FUNCTION CONTINUE?
Journal of Functional Programming
Higher-Order and Symbolic Computation
Axioms for Recursion in Call-by-Value
Higher-Order and Symbolic Computation
Typed Exeptions and Continuations Cannot Macro-Express Each Other
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Axioms for Recursion in Call-by-Value
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We study the implications for the expressive power of call/ccof upward continuations, specifically the idiom of using a continuation twice. Although such control effects were known to Landin and Reynolds whenthey invented J and {\tt escape}, the forebears of call/cc, they still act as a conceptual pitfall for some attempts to reason about continuations. We use this idiom to refute some recent conjectures about equivalences in a language with continuations, but no other effects. This shows that first-class continuations as given by call/cchave greater expressive power than one would expect from {\tt goto} or exits.