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 and G. Mccusker, Call-by-value games, CSL'97, 1998.
DOI : 10.1007/BFb0028004

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

A. Blass, Degrees of indeterminacy of games, Fund. Math, 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. Cartwright, P. Curien, and M. Felleisen, Fully Abstract Semantics for Observably Sequential Languages, Information and Computation, vol.111, issue.2, pp.297-401, 1994.
DOI : 10.1006/inco.1994.1047
URL : http://doi.org/10.1006/inco.1994.1047

J. Cockett and R. Seely, Polarized category theory, modules, game semantics

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

M. Hamano and P. Scott, A categorical semantics for polarized <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mstyle mathvariant="sans-serif"><mml:mi>MALL</mml:mi></mml:mstyle></mml:math>, Annals of Pure and Applied Logic, vol.145, issue.3, pp.276-313, 2007.
DOI : 10.1016/j.apal.2006.09.001

R. Harmer, Games and Full Abstraction for Nondeterministic Languages, 2000.

M. Hasegawa, Models of Sharing Graphs: A Categorical Semantics of Let and Letrec, 1999.
DOI : 10.1007/978-1-4471-0865-8

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
URL : http://doi.org/10.1016/s0022-4049(02)00133-0

A. Jeffrey, Premonoidal categories and a graphical view of programs. unpublished, 1998.

A. Joyal, R. Street, and D. Verity, Traced monoidal categories, Mathematical Proceedings of the Cambridge Philosophical Society, vol.1488, issue.03, pp.447-468, 1996.
DOI : 10.1007/BF02096491

M. Kelly and M. L. 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

J. Laird, Full abstraction for functional languages with control, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.58-67, 1997.
DOI : 10.1109/LICS.1997.614931

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

O. Laurent, Polarized games (extended abstract), LICS '02, pp.265-274, 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, Functorial Boxes in String Diagrams
DOI : 10.1007/11874683_1

P. Melliès, Asynchronous games 3: an innocent model of linear logic [29] P.-A. Melliès. Asynchronous games 4: a fully complete model of propositional linear logic, LICS '05, 2004.

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

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, De l'opérateur de trace dans les jeux de conway . Master's thesis, ENS Cachan, 2005.

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