S. Abramsky, Axioms for Definability and Full Completeness, 1999.

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 M. Lenisa, Axiomatizing Fully Complete Models for ML Polymorphic Types, Proceedings of the International Symposium on Mathematical Foundations of Computer Science Lecture Notes in Computer Science, 2000.
DOI : 10.1007/3-540-44612-5_10

S. Abramsky and G. Mccusker, 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

N. Benton, A mixed linear and non-linear logic: Proofs, terms and models, 3th 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

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

M. Hasegawa, On traced monoidal closed categories, Mathematical Structures in Computer Science, vol.902, issue.02, 2008.
DOI : 10.1016/S0022-4049(99)00180-2

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

A. Joyal, Remarques sur la théorie des jeux à deux personnes, Gazette des Sciences Mathématiques du Québec, vol.1, issue.4, pp.46-52, 1977.

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

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

J. Laird, A Categorical Semantics of Higher Order Store, Proceedings, 9th Conference on Category Theory and Computer Science, 2002.
DOI : 10.1016/S1571-0661(04)80566-8

J. Laird, A game semantics of names and pointers. Annals of Pure and Applied Logic, 2009.

L. Paul-blain, Global state considered helpful, Proceedings of Mathematical Foundations of Programming Semantics Electronic Notes in Computer Science, pp.241-259, 2008.

P. May, Duality in bicategories and topological applications. A brief memorial talk for Saunders MacLane, 2006.

G. Mccusker, On the semantics of Idealized Algol without the bad variable constructor, Proceedings of Mathematical Foundations of Programming Semantics, 2003.

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

R. Milner, Action Calculi V: reflexive molecular forms. Unpublished, third draf, 1994.

A. S. Murawski, Bad Variables Under Control, 21th Annual Conference of the European Association for Computer Science Logic, 2007.
DOI : 10.1007/978-3-540-74915-8_41

C. L. Ong and S. Sanjabi, Fully abstract semantics of additive aspects by translation, Proceedings of Sixth International Conference on Aspect-Oriented Software Development, 2007.

U. Reddy, Global state considered unnecessary: An introduction to object-based semantics, Lisp and Symbolic Computation, vol.3, issue.2, pp.7-76, 1996.
DOI : 10.1007/BF01806032

J. Reynolds, Syntactic control of interference, 5th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.39-46, 1978.

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

N. Tzevelekos, Full abstraction for nominal general references, 22th IEEE Symposium on Logic in Computer Science, pp.399-410, 2007.