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, D. R. Ghica, A. S. Murawski, and L. Ong, Applying Game Semantics to Compositional Software Modeling and Verification, LNCS, pp.421-435, 2004.
DOI : 10.1007/978-3-540-24730-2_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.8441

S. Abramsky and R. Jagadeesan, Games and Full Completeness for Multiplicative Linear Logic. The Journ. of Symb. Logic, pp.543-574, 1994.

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930

S. Abramsky and P. , Mellì es. Concurrent games and full completeness, LICS, pp.431-442, 1999.

J. M. Andreoli, Logic Programming with Focusing Proofs in Linear Logic, Journal of Logic and Computation, vol.2, issue.3, pp.297-347, 1992.
DOI : 10.1093/logcom/2.3.297

A. Blass, Degrees of indeterminacy of games, Fund. Math, vol.77, issue.2, pp.151-166, 1972.

K. Chaudhuri, D. Miller, and A. Saurin, Canonical Sequent Proofs via Multi-Focusing, International Conference on Theoretical Computer Science, 2008.
DOI : 10.1007/978-0-387-09680-3_26
URL : https://hal.archives-ouvertes.fr/hal-00527893

P. L. Curien, Definability and Full Abstraction, Electronic Notes in Theoretical Computer Science, vol.172, pp.301-310, 2007.
DOI : 10.1016/j.entcs.2007.02.011
URL : https://hal.archives-ouvertes.fr/hal-00144692

D. R. Ghica and A. S. Murawski, Angelic Semantics of Fine-Grained Concurrency, FoSSaCS, pp.211-225, 2004.

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

J. Laird, A Game Semantics of the Asynchronous ??-Calculus, Proceedings of 16th CONCUR, pp.51-65, 2005.
DOI : 10.1007/11539452_8

P. Mellì-es, Asynchronous games 2: the true concurrency of innocence, Proc. of the 15th CONCUR, number 3170 in LNCS, pp.448-465, 2004.

P. Mellì-es, Asynchronous games 4: a fully complete model of propositional linear logic, Proceedings of 20th LICS, pp.386-395, 2005.

P. Mellì-es and S. Mimram, Asynchronous Games: Innocence without Alternation, Proc. of the 18th CONCUR, pp.395-411, 2007.

S. Mimram, Sémantique des jeux asynchrones et réécriture 2-dimensionnelle, 2008.

G. D. Plotkin, LCF considered as a programming language, Theoretical Computer Science, vol.5, issue.3, pp.223-255, 1977.
DOI : 10.1016/0304-3975(77)90044-5

G. Winskel and M. Nielsen, Models for concurrency, Handbook of Logic in Computer Science, pp.1-148, 1995.