S. Abramsky, K. Honda, and G. Mccusker, A fully abstract game semantics for general references, LICS, pp.334-344, 1998.

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full abstraction for PCF, Inf. Comput, vol.163, issue.2, pp.409-470, 2000.

S. Abramsky and G. Mccusker, Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions, ENTCS, vol.3, pp.2-14, 1996.

S. Abramsky and P. Melliès, Concurrent games and full completeness, LICS, pp.431-442, 1999.

R. Cartwright, P. Curien, and M. Felleisen, Fully abstract semantics for observably sequential languages, Inf. Comput, vol.111, issue.2, pp.297-401, 1994.

S. Castellan and P. Clairambault, Causality vs. interleavings in concurrent game semantics, CONCUR 2016, vol.32, pp.1-32, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01474550

S. Castellan, P. Clairambault, S. Rideau, and G. Winskel, Games and strategies as event structures, vol.12, p.16, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01302713

. Obs and . Det, Concurrent Strategies and Intensional Full Abstraction for Parallel-or

S. Castellan, P. Clairambault, and G. Winskel, The parallel intensionally fully abstract games model of PCF, LICS, pp.232-243, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01286477

G. Marc-de-visme and . Winskel, Strategies with Parallel Causes, 26th EACSL Annual Conference on Computer Science Logic (CSL 2017, vol.82, pp.1-41, 2017.

D. R. Ghica, Applications of game semantics: From program analysis to hardware synthesis, LICS, pp.17-26, 2009.

D. R. Ghica and A. S. Murawski, Angelic semantics of fine-grained concurrency, Ann. Pure Appl. Logic, vol.151, issue.2-3, pp.89-114, 2008.

T. Hirschowitz, Full abstraction for fair testing in CCS (expanded version), Logical Methods in Computer Science, vol.10, issue.4, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00869469

J. M. Hyland and C. Ong, On full abstraction for PCF: I, II, and III, Inf. Comput, vol.163, issue.2, pp.285-408, 2000.

J. Laird, Full abstraction for functional languages with control, Proceedings, p.12

, Annual IEEE Symposium on Logic in Computer Science, pp.58-67, 1997.

A. Paul-, S. Melliès, and . Mimram, Asynchronous games: Innocence without alternation, CONCUR, vol.4703, pp.395-411, 2007.

G. D. Plotkin, LCF considered as a programming language, Theor. Comput. Sci, vol.5, issue.3, pp.223-255, 1977.

S. Rideau and G. Winskel, Concurrent strategies, LICS, pp.409-418, 2011.
DOI : 10.1109/lics.2011.13

G. Winskel, Events in computation, 1980.

G. Winskel, Event structure semantics for CCS and related languages, ICALP, pp.561-576, 1982.

G. Winskel, Advances in Petri Nets, Petri Nets: Central Models and Their Properties, pp.325-392, 1986.

G. Winskel, Deterministic concurrent strategies, Formal Asp. Comput, vol.24, issue.4-6, pp.647-660, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01886926

G. Winskel, Strategies as profunctors, FOSSACS, Held as Part of ETAPS 2013, pp.418-433, 2013.