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, 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

F. Atanassow and J. Jeuring, Inferring Type Isomorphisms Generically, Lecture Notes in Computer Science, vol.3125, pp.32-53
DOI : 10.1007/978-3-540-27764-4_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2950

G. Barthe and O. Pons, Type Isomorphisms and Proof Reuse in Dependent Type Theory, FoSSaCS, pp.57-71, 2001.
DOI : 10.1007/3-540-45315-6_4

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

K. B. Bruce, R. D. Cosmo, and G. Longo, Provable isomorphisms of types, Mathematical Structures in Computer Science, vol.19, issue.02, pp.231-247, 1992.
DOI : 10.1305/ndjfl/1093883461

B. Kim, G. Bruce, and . Longo, Provable isomorphisms and domain equations in models of typed languages (preliminary version), STOC, pp.263-272, 1985.

M. Dezani-ciancaglini, Characterization of normal forms possessing inverse in the ??-??-??-calculus, Theoretical Computer Science, vol.2, issue.3, pp.323-337, 1976.
DOI : 10.1016/0304-3975(76)90085-2

R. and D. Cosmo, Invertibility of terms and valid isomorphisms, a proof theoretic study on second order lambda-calculus with surjective pairing and terminal object, 1991.

M. P. Fiore, R. D. Cosmo, and V. Balat, Remarks on isomorphisms in typed lambda calculi with empty and sum types, Annals of Pure and Applied Logic, vol.141, issue.1-2, pp.35-50, 2006.
DOI : 10.1016/j.apal.2005.09.001
URL : https://hal.archives-ouvertes.fr/hal-00149560

K. Honda and N. Yoshida, Game-theoretic analysis of call-by-value computation, Theoretical Computer Science, vol.221, issue.1-2, pp.393-456, 1999.
DOI : 10.1016/S0304-3975(99)00039-0

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

M. Hyland and A. Schalk, Games on graphs and sequentially realizable functionals, Logic in Computer Science 02, pp.257-264, 2002.

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 CONCUR, pp.51-65, 2005.
DOI : 10.1007/11539452_8

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

O. Laurent, Classical isomorphisms of types, Mathematical Structures in Computer Science, vol.15, issue.05, pp.969-1004, 2005.
DOI : 10.1017/S0960129505004895
URL : https://hal.archives-ouvertes.fr/hal-00003761

G. Mccusker, Games and full abstraction for a functional metalanguage with recursive types Published in Springer-Verlag's Distinguished Dissertations in Computer Science series, 1996.

N. Paul-andrémellì-es and . Tabareau, An algebraic account of references in game semantics, Electr. Notes Theor. Comput. Sci, vol.249, pp.377-405, 2009.

E. Moggi, Notions of computation and monads. Information and Computation, pp.55-92, 1991.

A. S. Murawski and N. Tzevelekos, Full Abstraction for Reduced ML, Lecture Notes in Computer Science, vol.338, issue.1/3, pp.32-47, 2009.
DOI : 10.1007/3-540-58140-5_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.2452

M. Rittri, Abstract, Journal of Functional Programming, vol.19, issue.01, pp.71-89, 1991.
DOI : 10.1016/S0747-7171(89)80012-4

M. Rittri, Retrieving library functions by unifying types modulo linear isomorphism, RAIRO - Theoretical Informatics and Applications, vol.27, issue.6, pp.523-540, 1993.
DOI : 10.1051/ita/1993270605231