J. Andreoli, Logic Programming with Focusing Proofs in Linear Logic, Journal of Logic and Computation, vol.2, issue.3, pp.297-347, 1992.
DOI : 10.1093/logcom/2.3.297

Z. M. Ariola, H. Herbelin, and A. Sabry, A type-theoretic foundation of delimited continuations, Higher Order and Symbolic Computation, pp.233-273, 2009.
DOI : 10.1007/s10990-007-9006-0
URL : https://hal.archives-ouvertes.fr/inria-00177326

V. Danos, J. Joinet, and H. Schellinx, LKT and LKQ: sequent calculi for second order logic based upon dual linear decompositions of classical implication, Advances in Linear Logic, number 222 in London Mathematical Society Lecture Note Series, pp.211-224, 1995.

V. Danos, J. Joinet, and H. Schellinx, The structure of exponentials: Uncovering the dynamics of linear logic proofs, LNCS, vol.713, pp.159-171, 1993.
DOI : 10.1007/BFb0022564

O. Danvy and A. Filinski, Abstracting control, Proceedings of the 1990 ACM conference on LISP and functional programming , LFP '90, pp.151-160, 1990.
DOI : 10.1145/91556.91622

M. Felleisen, The theory and practice of first-class prompts, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.180-190, 1988.
DOI : 10.1145/73560.73576

J. Girard, A new constructive logic: classic logic, Mathematical Structures in Computer Science, vol.7, issue.2, pp.255-296, 1991.
DOI : 10.1016/0304-3975(87)90045-4

T. Griffin, A formulae-as-type notion of control, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.47-57, 1990.
DOI : 10.1145/96709.96714

D. Ilik, Delimited control operators prove Double-negation Shift, Annals of Pure and Applied Logic, vol.163, issue.11, pp.1549-1559, 2012.
DOI : 10.1016/j.apal.2011.12.008
URL : https://hal.archives-ouvertes.fr/hal-00647389

Y. Kameyama, Axioms for Delimited Continuations in the CPS Hierarchy, Computer Science Logic, 18th International Workshop, pp.442-457, 2004.
DOI : 10.1007/978-3-540-30124-0_34

Y. Kameyama and T. Yonezawa, Typed Dynamic Control Operators for Delimited Continuations, Symposium on Functional and Logic Programming, pp.239-254, 2008.
DOI : 10.1007/978-3-540-78969-7_18

C. Liang and D. Miller, Focusing and polarization in linear, intuitionistic, and classical logics, Theoretical Computer Science, vol.410, issue.46, pp.4747-4768, 2009.
DOI : 10.1016/j.tcs.2009.07.041

C. Liang and D. Miller, On subexponentials, synthetic connectives, and multilevel delimited control -long version. Unpublished manuscript available online at http://www.lix.polytechnique.fr, 2015.

M. Materzok and D. Biernacki, A Dynamic Interpretation of the CPS Hierarchy, Programming Languages and Systems -10th Asian Symposium, APLAS, pp.296-311, 2012.
DOI : 10.1007/978-3-642-35182-2_21

V. Nigam and D. Miller, Algorithmic specifications in linear logic with subexponentials, Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, PPDP '09, pp.129-140, 2009.
DOI : 10.1145/1599410.1599427

C. H. , L. Ong, and C. Stewart, A Curry-Howard foundation for functional computation with control, Symposium on Principles of Programming Languages, pp.215-227, 1997.

M. Parigot, ?µ-calculus: An algorithmic interpretation of classical natural deduction, LPAR: Logic Programming and Automated Reasoning, International Conference, pp.190-201, 1992.

A. Saurin, A Hierarchy for Delimited Continuations in Call-by-Name, Foundations of Software Science and Computational Structures, 13th International Conference, FOSSACS. Proceedings, pp.374-388, 2010.
DOI : 10.1007/978-3-642-12032-9_26
URL : https://hal.archives-ouvertes.fr/hal-00527925