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

S. Abramsky and R. Jagadeesan, Abstract, The Journal of Symbolic Logic, vol.417, issue.02, pp.543-574, 1994.
DOI : 10.1007/BF01622878

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930

J. Andréoli, Logic Programming with Focusing Proofs in Linear Logic, Journal of Logic and Computation, vol.2, issue.3
DOI : 10.1093/logcom/2.3.297

J. Beck, Distributive laws, Lecture Notes in Mathematics, vol.80, 1969.
DOI : 10.1007/BFb0083084

N. Benton, A mixed linear and non-linear logic: Proofs, terms and models, Third Annual Conference of the European Association for Computer Science Logic, 1995.
DOI : 10.1007/BFb0022251

G. Berry and P. Curien, Sequential algorithms on concrete data structures, Theoretical Computer Science, vol.20, issue.3, pp.265-321, 1982.
DOI : 10.1016/S0304-3975(82)80002-9

A. Blass, Degrees of indeterminacy of games, Fundations of Mathematics, vol.77, pp.151-166, 1972.

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

R. Cockett and R. Seely, Polarized category theory, modules, and game semantics, Theory and Applications of Categories, vol.18, issue.2, pp.4-101, 2007.

T. Ehrhard, Finiteness spaces, Mathematical Structures in Computer Science, vol.15, issue.4, pp.615-646, 2005.
DOI : 10.1017/S0960129504004645
URL : https://hal.archives-ouvertes.fr/hal-00150276

J. Girard, 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

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

R. Harmer, Games and full abstraction for nondeterministic languages, 2000.

M. Hofmann and T. Streicher, Completeness of Continuation Models for ????-Calculus, Information and Computation, vol.179, issue.2, pp.332-355, 2002.
DOI : 10.1006/inco.2001.2947

M. Hyland and L. Ong, On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917

M. Hyland and J. Power, Pseudo-commutative monads and pseudo-closed 2-categories, Journal of Pure and Applied Algebra, vol.175, issue.1-3, pp.141-185, 2002.
DOI : 10.1016/S0022-4049(02)00133-0

B. Jacobs, Semantics of weakening and contraction, Annals of Pure and Applied Logic, vol.69, issue.1, pp.73-106, 1994.
DOI : 10.1016/0168-0072(94)90020-5

M. Kelly and M. Laplaza, Coherence for compact closed categories, Journal of Pure and Applied Algebra, vol.19, pp.193-213, 1980.
DOI : 10.1016/0022-4049(80)90101-2
URL : http://doi.org/10.1016/0022-4049(80)90101-2

A. Kock, On Double Dualization Monads., MATHEMATICA SCANDINAVICA, vol.27, pp.151-165, 1970.
DOI : 10.7146/math.scand.a-10995

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

O. Laurent, Polarized games (extended abstract, 17th IEEE Symposium on Logic in Computer Science, 2002.

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

G. Mccusker, Games and full abstraction for a functional metalanguage with recursive types, 1996.
DOI : 10.1007/978-1-4471-0615-9

P. Melliès, Asynchronous games 2: the true concurrency of innocence, Proceedings of the 15th International Conference on Concurrency Theory, 2004.

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

P. Melliès, Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2005.
DOI : 10.1109/LICS.2005.6

P. Melliès, Functorial Boxes in String Diagrams, Computer Science Logic Lecture Notes in Computer Science, vol.4207, 2006.
DOI : 10.1007/11874683_1

P. Melliès, Categorical semantics of linear logic, in: Interactive models of computation and program behaviour, Panoramas et Synthèses, 2009.

P. Melliès and P. Selinger, Games are continuation models!, talk at Full Completeness and Full Abstraction, Satellite workshop of LICS, 2001.

P. Melliès and N. Tabareau, Resource modalities in game semantics, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007.
DOI : 10.1109/LICS.2007.41

P. Melliès and N. Tabareau, An Algebraic Account of References in Game Semantics, 25th conference on Mathematical Foundations of Programme Semantics, 2009.
DOI : 10.1016/j.entcs.2009.07.099

P. Melliès, N. Tabareau, and C. Tasson, An Explicit Formula for the Free Exponential Modality of Linear Logic, 36th International Colloquium on Automata, Languages and Programming, 2009.
DOI : 10.1007/978-3-642-02930-1_21

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

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

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

N. Tabareau, Modalités de ressources et contrôle en logique tensorielle, 2008.

H. Thielecke, Continuation Semantics and Self-adjointness, Electronic Notes in Theoretical Computer Science, vol.6, pp.348-364, 1997.
DOI : 10.1016/S1571-0661(05)80149-5