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 Continuations and Prompts, Proc. ICFP, ACM, pp.40-53, 2004.

H. P. Barendregt, Handbook of Logic in Computer Science, ch. Lambda Calculi with Types, 1993.

N. Benton, A mixed linear and non-linear logic: Proofs, terms and models, Proc. CSL, 1994.
DOI : 10.1007/BFb0022251

N. Benton, G. Bierman, V. De-paiva, and M. Hyland, A term calculus for Intuitionistic Linear Logic, Proc. TLCA, pp.75-90, 1993.
DOI : 10.1007/BFb0037099

N. Benton and A. Kennedy, Exceptional syntax, Journal of Functional Programming, vol.11, issue.04, pp.395-410, 2001.
DOI : 10.1017/S0956796801004099

N. Benton and P. Wadler, Linear logic, monads and the lambda calculus, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1996.
DOI : 10.1109/LICS.1996.561458

G. Bierman, What is a categorical model of Intuitionistic Linear Logic?, Proc. TLCA, Lecture Notes in Computer Science, vol.902, pp.78-93, 1995.
DOI : 10.1007/BFb0014046

J. Robin, B. Cockett, A. Craig, and . Pastro, A language for multiplicativeadditive linear logic, Elec. Not. in Theor. Comp. Sci, vol.122, pp.23-65, 2005.

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

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

V. Danos, J. Joinet, and H. Schellinx, LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of the classical implication, London Mathematical Society Lecture Notes, vol.1, p.222, 1995.

B. Day, On closed categories of functors, Lecture Notes in Mathematics, issue.137, pp.1-38, 1970.

B. Day and S. Lack, Limits of small functors, Journal of Pure and Applied Algebra, vol.210, issue.3, pp.651-663, 2007.
DOI : 10.1016/j.jpaa.2006.10.019

J. Egger, R. Møgelberg, and A. Simpson, The enriched effect calculus: syntax and semantics, Journal of Logic and Computation, vol.24, issue.3, pp.615-654, 2014.
DOI : 10.1093/logcom/exs025

M. Fiore, Linearising Call-By-Push-Value, Note, 2011.

M. Fiore, R. D. Cosmo, and V. Balat, Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types, Proc. LICS, pp.147-156, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00149560

C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen, The Essence of Compiling with Continuations, Proc. PLDI, pp.237-247, 1993.

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

J. Girard and L. Logic, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

. Sci, The Blind Spot: Lectures on Logic, pp.255-296, 1991.

G. Bin, I. , and G. M. Kelly, A universal property of the convolution monoidal structure, Journal of Pure and Applied Algebra, issue.43, pp.75-88, 1986.

G. M. Kelly, Doctrinal adjunction, Lecture Notes in Mathematics, vol.XIII, issue.3, pp.257-280, 1974.
DOI : 10.1016/0022-4049(72)90019-9

A. Kennedy, Compiling with continuations, continued, ICFP, pp.177-190, 2007.

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

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

L. Paul-blain, Call-By-Push-Value: A Functional/Imperative Synthesis , Semantic Structures in Computation Adjunction models for Call-by-Push-Value with stacks, Theory and Applications of Categories, vol.232, issue.14 5, pp.75-110, 2004.

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

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

E. Moggi, Notions of computation and monads, Information and Computation, vol.93, issue.1, pp.55-92, 1991.
DOI : 10.1016/0890-5401(91)90052-4

G. Munch-maccagnoni, F. , C. Realisability, . Proc, L. Csl et al., Syntax and Models of a non-Associative Composition of Programs and Proofs Formulae-as-Types for an Involutive Negation, Proc. CSL- LICS Models of a Non-Associative Composition, Proc. FoSSaCS (A. Muscholl, pp.397-412, 2009.

G. Munch-maccagnoni and G. Scherer, Polarised Intermediate Representation of Lambda Calculus with Sums, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015.
DOI : 10.1109/LICS.2015.22
URL : https://hal.archives-ouvertes.fr/hal-01160579

R. Chetan and . Murthy, A Computational Analysis of Girard's Translation and LC, Proc. LICS, pp.90-101, 1992.

A. , J. Power, and E. Robinson, Premonoidal categories and notions of computation, Mathematical Structures in Computer Science, vol.5, issue.7, pp.453-468, 1997.

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

P. Wadler, There's no substitute for linear logic, 8'th International Workshop on the, Mathematical Foundations of Programming Semantics, 1992.

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