Z. M. Ariola and H. Herbelin, Minimal classical logic and control operators. Pages 871? 885 of, Thirtieth international colloquium on automata, languages and programming , ICALP'03, eindhoven, the netherlands, 2003.
DOI : 10.1007/3-540-45061-0_68
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.6941

Z. M. Ariola, . Herbelin, . Hugo, and A. Sabry, A type-theoretic foundation of continuations and prompts. Pages 40?53 of, Acm sigplan international conference on functional programming, 2004.

Z. M. Ariola, . Herbelin, . Hugo, and A. Sabry, A proof-theoretic foundation of abortive continuations. Higher-order and symbolic computation, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00697242

Z. M. Ariola, . Herbelin, . Hugo, and A. Sabry, A type-theoretic foundation of delimited continuations. Higher-order and symbolic computation, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00177326

. Baba, . Kensuke, . Hirokawa, . Sachio, and K. Etsu-fujita, Parallel reduction in type free ? µcalculus . Electronic notes in theoretical computer science, pp.52-66, 2001.

P. Curien and H. Herbelin, The duality of computation, Pages 233?243 of: Acm sigplan international conference on functional programming, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00156377

P. De-groote, On the relation between the lambda-mu calculus and the syntactic theory of sequential control. Pages 31?43 of Logic programming and automated reasoning, proc, p.94, 1994.

B. F. Duba, R. Harper, and D. Macqueen, Typing first-class continuations in ML. Pages 163? 173 of, Conference record of the eighteenth annual ACM symposium on principles of programming languages, 1991.

M. Felleisen, The theory and practice of first-class prompts. Pages 180?190 of, Proceedings of the 15th acm symposium on principles of programming languages (popl '88, 1988.

M. Felleisen and D. Friedman, Control operators, the secd machine, and the lambda-calculus. Pages 193?217 of: Formal description of programming concepts-iii, 1986.

M. Felleisen and R. Hieb, The revised report on the syntactic theories of sequential control and state. Theoretical computer science, pp.235-271, 1992.

M. Felleisen, D. Friedman, E. Kohlbecker, and B. Duba, Reasoning with continuations. Pages 131?141 of: First symposium on logic and computer science, 1986.

M. Felleisen, D. P. Friedman, E. Kohlbecker, and B. Duba, A syntactic theory of sequential control. Theoretical computer science, Preliminary version: Reasoning with Continuations Proceedings of the 1st IEEE Symposium on Logic in Computer Science, pp.205-237, 1986.

R. E. Filman, . Friedman, and P. Daniel, Coordinated computing: Tools and techniques for distributed software, 1984.

T. G. Griffin, The formulae-as-types notion of control. Pages 47?57 of: Conf. record 17th annual ACM symp. on principles of programming languages, POPL'90, s an francisco, pp.17-19, 1990.

C. T. Haynes, . Friedman, and P. Daniel, Engines build process abstractions. Pages 18?24 of: Conference record of the, ACM symposium on lisp and functional programming, 1984.
DOI : 10.1145/800055.802018

G. Huet and J. Lévy, Computations in orthogonal rewriting systems 1 and 2. Computational logic. essays in honor of alan robinson, 1991.

C. Murthy, Control operators, hierarchies, and pseudo-classical type systems: A-translation at work, 1992.

C. Ong, . Luke, and C. A. Stewart, A Curry-Howard foundation for functional computation with control. Pages 215?227 of: Conf. record 24th ACM SIGPLAN-SIGACT symp. on principles of programming languages, pp.15-17, 1997.

M. Parigot, Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. Pages 190?201 of: Logic programming and automated reasoning: International conference lpar '92 proceedings, st. petersburg, russia, 1992.

G. D. Plotkin, Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975.
DOI : 10.1016/0304-3975(75)90017-1

. Van-oostrom and . Vincent, Confluence by decreasing diagrams. Theoretical computer science, pp.259-280, 1994.