Embedding continuations in procedural objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
The theory and practice of first-class prompts
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Control delimiters and their hierarchies
Lisp and Symbolic Computation
Models of control and their implications for programming language design
Models of control and their implications for programming language design
Revised5 report on the algorithmic language scheme
ACM SIGPLAN Notices
The mystery of the tower revealed: a non-reflective description of the reflective tower
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Implicit parameters: dynamic scoping with static types
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Definition of Standard ML
Comparing Control Constructs by Double-Barrelled CPS
Higher-Order and Symbolic Computation
A Syntactic Theory of Dynamic Binding
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
MIT Scheme Reference Manual
The calculi of lambda-nu-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages
On the static and dynamic extents of delimited continuations
Science of Computer Programming
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Status report: specifying javascript with ML
ML '07 Proceedings of the 2007 workshop on Workshop on ML
Modular rollback through control logging: a pair of twin functional pearls
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
Filinski showed that callcc and a single mutable reference cell are sufficient to express the delimited control operators shift and reset. However, this implementation interacts poorly with dynamic bindings like exception handlers. We present a variation on Filinski's encoding of delimited continuations that behaves appropriately in the presence of exceptions and give an implementation in Standard ML of New Jersey. We prove the encoding correct with respect to the semantics of delimited dynamic binding.