Kenichi Asai (2004):
Offline partial evaluation for shift and reset.
In: Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation.
ACM Press,
pp. 3–14,
doi:10.1145/1014007.1014009.
Kenichi Asai & Yukiyoshi Kameyama (2007):
Polymorphic delimited continuations.
In: Proceedings of Fifth Asian Symposium on Programming Languages and Systems,
Lecture Notes in Computer Science 4807.
Springer Berlin Heidelberg,
pp. 239–254,
doi:10.1007/978-3-540-76637-7_16.
Robert Atkey (2006):
Parameterised notions of computation.
In: Proceedings of the Workshop on Mathematically Structured Functional Programming.
eWiC.
Robert Atkey (2009):
Parameterised notions of computation.
Journal of Functional Programming 19(3-4),
pp. 335,
doi:10.1017/S095679680900728X.
Malgorzata Biernacka & Dariusz Biernacki (2009):
Context-based proofs of termination for typed delimited-control operators.
Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming,
pp. 289,
doi:10.1145/1599410.1599446.
Jacques Carette, Oleg Kiselyov & Chung-Chieh Shan (2009):
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages.
Journal of Functional Programming 19(05),
pp. 509,
doi:10.1017/S0956796809007205.
Olivier Danvy (1988):
On some functional aspects of control.
In: Proceedings of the Workshop on Implementation of Lazy Functional Languages.
Program Methodology Group.
University of Göteborg and Chalmers University of Technology,
pp. 445–449.
Report 53.
Olivier Danvy & Andrzej Filinski (1989):
A Functional Abstraction of Typed Contexts.
Technical Report.
Computer Science Department, University of Copenhagen.
Olivier Danvy & Andrzej Filinski (1990):
Abstracting control.
In: Proceedings of the 1990 ACM conference on LISP and functional programming.
ACM Press,
pp. 151–160,
doi:10.1145/91556.91622.
Olivier Danvy & Andrzej Filinski (2009):
Representing Control: a Study of the CPS Transformation.
Mathematical Structures in Computer Science 2(04),
pp. 361,
doi:10.1017/S0960129500001535.
Matthias Felleisen (1988):
The theory and practice of first-class prompts.
In: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages.
ACM Press,
pp. 180–190,
doi:10.1145/73560.73576.
Carl A. Gunter, Didier Rémy & Jon G. Riecke (1995):
A generalization of exceptions and control in ML-like languages.
In: Proceedings of the seventh international conference on Functional programming languages and computer architecture.
ACM Press,
pp. 12–23,
doi:10.1145/224164.224173.
Oleg Kiselyov (2012):
Delimited control in OCaml, abstractly and concretely.
Theoretical Computer Science 435,
pp. 56–76,
doi:10.1016/j.tcs.2012.02.025.
Oleg Kiselyov (2012):
Typed Tagless Final Interpreters.
In: Spring School on Generic and Indexed Programming,
Lecture Notes in Computer Science 7470.
Springer Berlin Heidelberg,
pp. 130–174,
doi:10.1007/978-3-642-32202-0_3.
Moe Masuko & Kenichi Asai (2011):
Caml Light + shift/reset = Caml Shift.
In: First International Workshop on the Theory and Practice of Delimited Continuations,
pp. 33–46.
Tiark Rompf, Ingo Maier & Martin Odersky (2009):
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform.
In: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming.
ACM Press,
pp. 317,
doi:10.1145/1596550.1596596.
Philip Wadler (1994):
Monads and composable continuations.
LISP and Symbolic Computation 7(1),
pp. 39–55,
doi:10.1007/BF01019944.
eptcs@eptcs.org