@incollection(ariola2003,
 author       = "Zena~M. Ariola and Hugo Herbelin",
 year         = "2003",
 title        = "Minimal Classical Logic and Control Operators",
 booktitle    = "Automata, Languages and Programming",
 series       = "Lecture Notes in Computer Science",
 volume       = "2719",
 publisher    = "Springer Berlin Heidelberg",
 pages        = "871--885",
 doi          = "10.1007/3-540-45061-0\_68",
)
@article(ariola2007,
 author       = "Zena~M. Ariola and Hugo Herbelin",
 year         = "2008",
 title        = "Control reduction theories: the benefit of structural substitution",
 journal      = "Journal of Functional Programming",
 volume       = "18",
 pages        = "373--419",
 doi          = "10.1017/S0956796807006612",
)
@article(Danvy92,
 author       = "Olivier Danvy and Andrzej Filinski",
 year         = "1992",
 title        = "Representing Control: a Study of the CPS Transformation",
 journal      = "Mathematical Structures in Computer Science",
 volume       = "2",
 pages        = "361--391",
 doi          = "10.1017/S0960129500001535",
)
@article(Dyvbig07,
 author       = "R.~Kent Dyvbig and Simon~Peyton Jones and Amr Sabry",
 year         = "2007",
 title        = "A monadic framework for delimited continuations",
 journal      = "Journal of Functional Programming",
 volume       = "17",
 pages        = "687--730",
 doi          = "10.1017/S0956796807006259",
)
@inproceedings(Felleisen88,
 author       = "Matthias Felleisen",
 year         = "1988",
 title        = "The theory and practice of first-class prompts",
 booktitle    = "Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages",
 publisher    = "ACM",
 pages        = "180--190",
 doi          = "10.1145/73560.73576",
)
@inproceedings(felleisen1986,
 author       = "Matthias Felleisen and Daniel~P. Friedman",
 year         = "1986",
 title        = "{Control operators, the SECD-machine, and the $\lambda $-calculus}",
 booktitle    = "3rd Working Conference on the Formal Description of Programming Concepts",
 publisher    = "North-Holland Publishing",
 pages        = "193--219",
)
@article(felleisen1987,
 author       = "Matthias Felleisen and Daniel~P. Friedman and Eugene Kohlbecker and Bruce Duba",
 year         = "1987",
 title        = "A syntactic theory of sequential control",
 journal      = "Theoretical Computer Science",
 volume       = "52",
 number       = "3",
 pages        = "205--237",
 doi          = "10.1016/0304-3975(87)90109-5",
)
@inproceedings(griffin1990,
 author       = "Timothy~G. Griffin",
 year         = "1990",
 title        = "A formulae-as-type notion of control",
 booktitle    = "Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages",
 publisher    = "ACM",
 pages        = "47--58",
 doi          = "10.1145/96709.96714",
)
@incollection(Levy99,
 author       = "Paul~Blain Levy",
 year         = "1999",
 title        = "Call-by-Push-Value: A Subsuming Paradigm",
 booktitle    = "Typed Lambda Calculi and Applications",
 series       = "Lecture Notes in Computer Science",
 volume       = "1581",
 publisher    = "Springer Berlin Heidelberg",
 pages        = "228--243",
 doi          = "10.1007/3-540-48959-2\_17",
)
@inproceedings(parigot1992,
 author       = "Michel Parigot",
 year         = "1992",
 title        = "{$\lambda \mu $-calculus: An algorithmic interpretation of classical natural deduction}",
 booktitle    = "Logic Programming and Automated Reasoning",
 series       = "Lecture Notes in Computer Science",
 volume       = "624",
 publisher    = "Springer Berlin Heidelberg",
 pages        = "190--201",
 doi          = "10.1007/BFb0013061",
)
@article(Plotkin75,
 author       = "G.D. Plotkin",
 year         = "1975",
 title        = "{Call-by-name, call-by-value and the $\lambda $-calculus}",
 journal      = "Theoretical Computer Science",
 volume       = "1",
 number       = "2",
 pages        = "125--159",
 doi          = "10.1016/0304-3975(75)90017-1",
)