S. Abramsky, R. Jagadeesan, and P. Malacaria, Full abstraction for PCF, Information and Computation 163, pp.404-470, 2000.

S. Abramsky and P. A. Mellies, Concurrent games and full completeness, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.431-444, 1999.
DOI : 10.1109/LICS.1999.782638

S. Abramsky and V. , Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting, Mathematical Structures in Computer Science, vol.62, p.2013
DOI : 10.1016/S0304-3975(00)00056-6

P. Aczel, Non-wellfounded sets, CSLI Lecture Notes 14, 1988.

J. Barwise and L. Moss, Vicious Circles, CSLI Lecture Notes 60, 1996.

J. Van-benthem, Extensive games as process models, Journal of Logic, Language and Information, vol.11, 2002.

E. Berlekamp, J. Conway, and R. Guy, Winning Ways, 1982.

G. Bierman, What is a categorical Model of Intuitionistic Linear Logic? TLCA'95, pp.78-93, 1995.

D. Cancila, F. Honsell, and M. Lenisa, Generalized Coiteration Schemata, CMCS'03, ENTCS, vol.82, issue.1, 2003.

P. Clairambault, J. Gutierrez, and G. , The Winning Ways of Concurrent Games, 2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012.
DOI : 10.1109/LICS.2012.34

J. H. Conway, On Numbers and Games, A K Peters Ltd, 2001.

M. Forti and F. Honsell, Set-theory with free construction principles, Ann. Scuola Norm. Sup. Pisa, Cl. Sci, vol.10, issue.4, pp.493-522, 1983.

D. Ghica and M. N. Menaa, On the compositionality of round abstraction, CONCUR 2010, pp.417-431, 2010.

F. Honsell and M. Lenisa, Conway Games, coalgebraically, CALCO, pp.300-316, 2009.
DOI : 10.1007/978-3-642-03741-2_21

F. Honsell and M. Lenisa, Conway games, algebraically and coalgebraically, Logical Methods in Computer Science, vol.7, issue.3, 2011.
DOI : 10.2168/LMCS-7(3:8)2011

F. Honsell, M. Lenisa, and R. Redamalla, Categories of Coalgebraic Games, MFCS, vol.2012, pp.503-515, 2012.
DOI : 10.1007/978-3-642-32589-2_45

F. Honsell, M. Lenisa, and D. Pellarini, Categories of Coalgebraic Games with Selective Sum, Fundamenta Informaticae, 2013.

F. Honsell and M. Lenisa, Polarized Multigames, draft paper, 2013.

M. Hyland and L. Ong, On Full Abstraction for PCF: I, II, and III, Information and Computation 163, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917

URL : http://doi.org/10.1006/inco.2000.2917

B. Jacobs and J. Rutten, A tutorial on (co)algebras and (co)induction, Bulletin of the EATCS 62, pp.222-259, 1996.

P. Lescanne, Rationality and escalation in infinite extensive games, Arxiv preprint arXiv, pp.1112-1185, 2011.

P. Lescanne and M. , ???Backward??? coinduction, Nash equilibrium and the rationality of escalation, Acta Informatica, vol.97, issue.1, pp.1-21, 2012.
DOI : 10.1007/s00236-012-0153-3

P. A. Mellies, Comparing hierarchies of types in models of linear logic, Information and Computation, vol.189, issue.2, pp.202-234, 2004.
DOI : 10.1016/j.ic.2003.10.003

URL : https://hal.archives-ouvertes.fr/hal-00154200

P. A. Mellies, Asynchronous Games 3 An Innocent Model of Linear Logic, Electronic Notes in Theoretical Computer Science, vol.122, 2005.
DOI : 10.1016/j.entcs.2004.06.057

URL : https://hal.archives-ouvertes.fr/hal-00154294

P. A. Mellies, Asynchronous games 2: the true concurrency of innocence, Theoretical Computer Science, vol.358, issue.2-3, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00154286

P. A. Mellies, N. Tabareau, and C. Tasson, An Explicit Formula for the Free Exponential Modality of Linear Logic, 2009.
DOI : 10.1007/978-3-642-02930-1_21

URL : https://hal.archives-ouvertes.fr/hal-00391714

M. Pauly, From Programs to Games: Invariance and Safety for Bisimulation, CSL'09, LNCS, vol.5771, pp.485-496