S. Abramsky, Semantics of interaction, pp.1-31, 1996.
DOI : 10.1007/3-540-61064-2_24

S. Abramsky, K. Honda, and G. Mccusker, A fully abstract game semantics for general references, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), 1998.
DOI : 10.1109/LICS.1998.705669

S. Abramsky and G. Mccusker, Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions, Algol-like languages. Birkhaüser, 1997.

D. Baelde and D. Miller, Least and Greatest Fixed Points in Linear Logic, Lecture Notes in Computer Science, vol.4790, p.92, 2007.
DOI : 10.1007/978-3-540-75560-9_9

T. Coquand, A semantics of evidence for classical arithmetic, The Journal of Symbolic Logic, vol.54, issue.01, pp.325-337, 1995.
DOI : 10.1007/BFb0079691

P. Curien, Abstract B??hm trees, Mathematical Structures in Computer Science, vol.8, issue.6, pp.559-591, 1998.
DOI : 10.1017/S0960129598002631

V. Danos and R. Harmer, Probabilistic game semantics (extended abstract ), Proceedings, 15th Annual IEEE Symposium on Logic in Computer Science, 2000.

V. Danos, H. Herbelin, and L. Regnier, Game semantics and abstract machines, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp.394-405, 1996.
DOI : 10.1109/LICS.1996.561456

V. Danos and L. Regnier, How abstract machines implement head linear reduction, Submitted to Higher Order and Symbolic Computation, 2004.

J. De-lataillade, Second-order type isomorphisms through game semantics, Annals of Pure and Applied Logic, vol.151, issue.2-3, pp.115-150, 2008.
DOI : 10.1016/j.apal.2007.10.008
URL : https://hal.archives-ouvertes.fr/hal-00149525

C. Faggian and J. M. Hyland, Designs, disputes and strategies. Lecture notes in computer science, pp.442-457, 2002.

J. Girard, The system F of variable types, fifteen years later, Theoretical Computer Science, vol.45, issue.2, pp.159-192, 1986.
DOI : 10.1016/0304-3975(86)90044-7

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

R. Harmer, Innocent game semantics. Lecture notes, 2004.

R. Harmer, J. M. Hyland, and P. Mellies, Categorical Combinatorics for Innocent Strategies, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.379-388, 2007.
DOI : 10.1109/LICS.2007.14
URL : https://hal.archives-ouvertes.fr/hal-00150373

R. Harmer and O. Laurent, The Anatomy of Innocence Revisited, Proceedings , 26th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2006.
DOI : 10.1007/11944836_22
URL : https://hal.archives-ouvertes.fr/hal-00124569

C. A. Hoare, Communicating Sequential Processes, 1985.

D. Hughes, Games and definability for system F, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.76-86, 1997.
DOI : 10.1109/LICS.1997.614935

J. M. Hyland, Game semantics. Semantics and Logics of Computation, 1997.

J. M. Hyland and C. H. 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
URL : http://doi.org/10.1006/inco.2000.2917

J. Krivine, Dependent choice, ???quote??? and the clock, Theoretical Computer Science, vol.308, issue.1-3, pp.259-276, 2003.
DOI : 10.1016/S0304-3975(02)00776-4
URL : https://hal.archives-ouvertes.fr/hal-00154478

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3675

O. Laurent, Polarized games. Annals of Pure and Applied Logic, pp.79-123, 2004.
DOI : 10.1016/j.apal.2004.04.006
URL : https://hal.archives-ouvertes.fr/hal-00009138

G. Mccusker, Abstract, Bulletin of Symbolic Logic, vol.2, issue.03, pp.347-362, 1997.
DOI : 10.2307/2275407

R. Milner, Communication and concurrency, 1989.

H. Nickau, Hereditarily sequential functionals, Lecture Notes in Computer Science, vol.813, pp.253-264, 1994.
DOI : 10.1007/3-540-58140-5_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2978

R. A. Seely, Locally cartesian closed categories and type theory, Mathematical Proceedings of the Cambridge Philosophical Society, vol.IV, issue.01, pp.33-483, 1984.
DOI : 10.1017/S0305004100061284