S. Abramsky, G. Mccusker, and . Linearity, Sharing and State: a Fully Abstract Game Semantics for Idealized Algol with active expressions, 1997.

S. Abramsky and G. Mccusker, Call-by-value games, 6th Annual Conference of the European Association for Computer Science Logic, 1998.
DOI : 10.1007/BFb0028004

A. Beckmann, Abstract, The Journal of Symbolic Logic, vol.103, issue.03, pp.1277-1285, 2001.
DOI : 10.1007/BF01621476

W. Blum, Thesis fascicle: Local computation of ?-reduction, 2008.

P. Clairambault, Logique et Interaction : uné Etude Sémantique de la Totalité, 2010.

P. Clairambault and R. Harmer, Totality in arena games, Annals of Pure and Applied Logic, vol.161, issue.5, 2009.
DOI : 10.1016/j.apal.2009.07.016
URL : https://hal.archives-ouvertes.fr/hal-00443535

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

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. Unpublished, 2003.

N. G. De-bruijn, Generalizing Automath by Means of a Lambda-Typed Lambda Calculus, Mathematical Logic and Theoretical Computer Science, vol.106, pp.71-92, 1987.
DOI : 10.1016/S0049-237X(08)70213-1

J. Girard, Light Linear Logic, Information and Computation, vol.143, issue.2, pp.175-204, 1998.
DOI : 10.1006/inco.1998.2700

W. Greenland, Game semantics for region analysis, 2004.

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

R. Harmer, M. Hyland, and P. Es, 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 G. Mccusker, A fully abstract game semantics for finite nondeterminism, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.422-430, 1999.
DOI : 10.1109/LICS.1999.782637

M. Hyland and C. Ong, On full abstraction for PCF: I, II and III. Information and Computation, pp.285-408, 2000.

U. Dal, L. , and O. Laurent, Quantitative game semantics for linear logic, CSL, pp.230-245, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00270933

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

J. Laird, A Game Semantics of the Asynchronous ??-Calculus, In CON- CUR, pp.51-65, 2005.
DOI : 10.1007/11539452_8

G. Mascari and M. Pedicini, Head linear reduction and pure proof net extraction, Theoretical Computer Science, vol.135, issue.1, pp.111-137, 1994.
DOI : 10.1016/0304-3975(94)90263-1
URL : http://doi.org/10.1016/0304-3975(94)90263-1

G. Mccusker, Games and Full Abstraction for FPC. Information and Computation, pp.1-61, 2000.

R. Nakajima, Infinite normal forms for the ?-calculus. ?-Calculus and Computer Science Theory, pp.62-82, 1975.

H. Schwichtenberg, Complexity of normalization in the pure typed lambdacalculus, Studies in Logic and the Foundations of Mathematics, pp.453-457, 1982.