Z. M. Ariola, H. Herbelin, and A. Sabry, A typetheoretic foundation of continuations and prompts, pp.40-53, 2004.

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

[. Curien and H. Herbelin, The duality of computation, ACM SIGPLAN Notices, vol.35, issue.9, pp.233-243, 2000.
DOI : 10.1145/357766.351262
URL : https://hal.archives-ouvertes.fr/inria-00156377

[. Curien and G. Munch-maccagnoni, The Duality of Computation under Focus, Proc. IFIP TCS, 2010.
DOI : 10.1007/978-3-642-15240-5_13
URL : https://hal.archives-ouvertes.fr/hal-01054461

O. Danvy and A. Filinski, A functional abstraction of typed contexts, 1989.

J. Vincent-danos, H. Joinet, and . Schellinx, The structure of exponentials: Uncovering the dynamics of linear logic proofs, Proc. KGC '93, 1993.

[. Filinski, Declarative continuations and categorical duality, 1989.
DOI : 10.1007/bfb0018355

J. Girard, Linear logic, Linear logic, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

T. G. 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-58, 1990.
DOI : 10.1145/96709.96714

H. Herbelin and S. Ghilezan, An approach to call-byname delimited continuations [HGS10] Hugo Herbelin, Silvia Ghilezan, and Alexis Saurin, A uniform approach to call-by-name and call-by-value delimited control, Proc. POPL '08, 2008.

[. Kameyama and M. Hasegawa, A sound and complete axiomatization of delimited continuations, Proc. ICFP '03, 2003.

O. Kiselyov and C. Shan, A Substructural Type System for Delimited Continuations, Proc. TLCA'07 Thèse de doctorat, 2002.
DOI : 10.1007/978-3-540-73228-0_17

L. Paul-blain, Call-by-push-value: A subsuming paradigm, Proc. TLCA '99, pp.228-242, 1999.

[. Laurent, M. Quatrini, and L. Tortora-de-falco, Polarized and focalized linear and classical proofs, Annals of Pure and Applied Logic, vol.134, issue.2-3, pp.217-264, 2005.
DOI : 10.1016/j.apal.2004.11.002
URL : https://hal.archives-ouvertes.fr/hal-00009133

O. Laurent and L. Regnier, About translations of classical logic into polarized linear logic, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003.
DOI : 10.1109/LICS.2003.1210040
URL : https://hal.archives-ouvertes.fr/hal-00009139

[. Lafont, B. Reus, and T. Streicher, Continuation semantics or expressing implication by negation, 1993.

[. Moggi, Computational lambda-calculus and monads, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.14-23, 1989.
DOI : 10.1109/LICS.1989.39155
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2787

[. Maraist, M. Odersky, D. N. Turner, and P. Wadler, Call-by-name, call-by-value, call-by-need, and the linear lambda calculus, Proc. MFPS '95, 1994.

R. Chetan and . Murthy, A computational analysis of girard's translation and lc, LICS, pp.90-101, 1992.

[. Nipkow, Higher-order critical pairs, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.342-349, 1991.
DOI : 10.1109/LICS.1991.151658

[. Parigot, Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction, pp.190-201, 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

M. Quatrini and L. Falco, Polarisation des preuves classiques et renversement, Sciences, Paris t.322, Serie I, 1996.

A. Sabry, [Sel01] Peter Selinger, Control categories and duality: On the categorical semantics of the lambda-mu calculus, Math. Struct in Comp. Sci, issue.2, pp.11-207, 1996.

[. Shan, From shift and reset to polarized linear logic, Manuscript, 2003.

[. Wadler, Monads and composable continuations, Lisp Symb, Comput, vol.7, pp.39-56, 1994.

[. Wadler, Call-by-value is dual to call-by-name, SIG- PLAN Not, pp.189-201, 2003.

[. Zeilberger, On the unity of duality, Ann. Pure and App, Logic, vol.153, p.1, 2008.