J. Y. 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

C. R. Murthy, A computational analysis of Girard's translation and LC, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.90-101, 1992.
DOI : 10.1109/LICS.1992.185523

V. Danos, J. B. Joinet, and H. Schellinx, Abstract, The Journal of Symbolic Logic, vol.II, issue.03, pp.755-807, 1997.
DOI : 10.1007/BF00885763
URL : https://hal.archives-ouvertes.fr/inria-00528352

P. A. Melliès, Asynchronous Games 3 An Innocent Model of Linear Logic, Electronic Notes in Theoretical Computer Science, vol.122, pp.171-192, 2005.
DOI : 10.1016/j.entcs.2004.06.057

O. 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

J. L. Loday, Generalized bialgebras and triples of operads. arXiv preprint math, p.611885, 2006.

C. Führmann, Direct Models of the Computational Lambda-calculus, Electronic Notes in Theoretical Computer Science, vol.20, pp.245-292, 1999.
DOI : 10.1016/S1571-0661(04)80078-1

P. Selinger, Re: co-exponential question. Message to the Category Theory mailing list, 1999.

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

Y. Lafont, B. Reus, and T. Streicher, Continuation Semantics or Expressing Implication by Negation, 1993.

P. Selinger, Control categories and duality: on the categorical semantics of the lambda-mu calculus, Mathematical Structures in Computer Science, vol.11, issue.2, pp.207-260, 2001.
DOI : 10.1017/S096012950000311X

O. Laurent, Etude de la polarisation en logique, Thèse de doctorat, 2002.
URL : https://hal.archives-ouvertes.fr/tel-00007884

P. B. Levy, Call-by-Push-Value: A Subsuming Paradigm, Proc. TLCA '99, pp.228-242, 1999.

P. B. Levy, Adjunction Models For Call-By-Push-Value With Stacks, Proc. Cat. Th. and Comp. Sci., ENTCS, 2005.
DOI : 10.1016/S1571-0661(04)80568-1

H. Thielecke, Categorical Structure of Continuation Passing Style, 1997.

A. Blass, A game semantics for linear logic, Annals of Pure and Applied Logic, vol.56, issue.1-3, pp.183-220, 1992.
DOI : 10.1016/0168-0072(92)90073-9

S. Abramsky, Sequentiality vs. concurrency in games and logic, Mathematical Structures in Computer Science, vol.13, issue.4, pp.531-565, 2003.
DOI : 10.1017/S0960129503003980

P. L. 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

H. Herbelin, C'est maintenant qu'on calcule, 2005.

Z. M. Ariola and H. Herbelin, Control reduction theories: the benefit of structural substitution, Journal of Functional Programming, vol.18, issue.03, pp.373-419, 2008.
DOI : 10.1145/317636.317779
URL : https://hal.archives-ouvertes.fr/inria-00177320

N. Zeilberger, On the unity of duality, Annals of Pure and Applied Logic, vol.153, issue.1-3, p.1, 2008.
DOI : 10.1016/j.apal.2008.01.001

P. A. Melliès and N. Tabareau, Resource modalities in tensor logic, Annals of Pure and Applied Logic, vol.161, issue.5, pp.632-653, 2010.
DOI : 10.1016/j.apal.2009.07.018

B. Jacobs, Comprehension categories and the semantics of type dependency, Theoretical Computer Science, vol.107, issue.2, pp.169-207, 1993.
DOI : 10.1016/0304-3975(93)90169-T

G. Munch-maccagnoni, Focalisation and Classical Realisability, Proc. CSL '09, 2009.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00409793