Zena M. Ariola & Hugo Herbelin (2003):
Minimal Classical Logic and Control Operators.
In: Automata, Languages and Programming,
Lecture Notes in Computer Science 2719.
Springer Berlin Heidelberg,
pp. 871–885,
doi:10.1007/3-540-45061-0_68.
Zena M. Ariola & Hugo Herbelin (2008):
Control reduction theories: the benefit of structural substitution.
Journal of Functional Programming 18,
pp. 373–419,
doi:10.1017/S0956796807006612.
Olivier Danvy & Andrzej Filinski (1992):
Representing Control: a Study of the CPS Transformation.
Mathematical Structures in Computer Science 2,
pp. 361–391,
doi:10.1017/S0960129500001535.
R. Kent Dyvbig, Simon Peyton Jones & Amr Sabry (2007):
A monadic framework for delimited continuations.
Journal of Functional Programming 17,
pp. 687–730,
doi:10.1017/S0956796807006259.
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,
pp. 180–190,
doi:10.1145/73560.73576.
Matthias Felleisen & Daniel P. Friedman (1986):
Control operators, the SECD-machine, and the λ-calculus.
In: 3rd Working Conference on the Formal Description of Programming Concepts.
North-Holland Publishing,
pp. 193–219.
Matthias Felleisen, Daniel P. Friedman, Eugene Kohlbecker & Bruce Duba (1987):
A syntactic theory of sequential control.
Theoretical Computer Science 52(3),
pp. 205–237,
doi:10.1016/0304-3975(87)90109-5.
Timothy G. Griffin (1990):
A formulae-as-type notion of control.
In: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages.
ACM,
pp. 47–58,
doi:10.1145/96709.96714.
Paul Blain Levy (1999):
Call-by-Push-Value: A Subsuming Paradigm.
In: Typed Lambda Calculi and Applications,
Lecture Notes in Computer Science 1581.
Springer Berlin Heidelberg,
pp. 228–243,
doi:10.1007/3-540-48959-2_17.
Michel Parigot (1992):
λμ-calculus: An algorithmic interpretation of classical natural deduction.
In: Logic Programming and Automated Reasoning,
Lecture Notes in Computer Science 624.
Springer Berlin Heidelberg,
pp. 190–201,
doi:10.1007/BFb0013061.
G.D. Plotkin (1975):
Call-by-name, call-by-value and the λ-calculus.
Theoretical Computer Science 1(2),
pp. 125–159,
doi:10.1016/0304-3975(75)90017-1.
eptcs@eptcs.org