P. Baillot, V. Danos, T. Ehrhard, and L. Regnier, Timeless games, International Workshop on Computer Science Logic, pp.56-77, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00519856

H. P. Barendregt, The lambda calculus, vol.2, 1984.

J. Borgström, U. D. Lago, A. D. Gordon, and M. Szymczak, A LambdaCalculus Foundation for Universal Probabilistic Programming, 2015.

A. Bucciarelli, T. Ehrhard, and G. Manzonetto, Not enough points is enough, International Workshop on Computer Science Logic, pp.298-312, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00148820

S. Castellan, P. Clairambault, H. Paquet, and G. Winskel, The Concurrent Game Semantics of Probabilistic PCF, Logic in Computer Science (LICS), 2018 33rd Annual ACM/IEEE Symposium, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01886965

S. Castellan, P. Clairambault, and G. Winskel, Symmetry in Concurrent Games, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), p.28, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00990020

S. Castellan, P. Clairambault, and G. Winskel, The Parallel Intensionally Fully Abstract Games Model of PCF, 30th Annual ACM/IEEE Symposium on, pp.232-243, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01286477

S. Castellan, P. Clairambault, and G. Winskel, Concurrent hyland-ong games. arXiv, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01068769

V. Danos and T. Ehrhard, Probabilistic coherence spaces as a model of higherorder probabilistic computation. Information and Computation, vol.209, pp.966-991, 2011.

V. Danos and . Harmer, Probabilistic game semantics, ACM Transactions on Computational Logic (TOCL), vol.3, issue.3, pp.359-382, 2002.

T. Ehrhard, M. Pagani, and C. Tasson, The computational meaning of probabilistic coherence spaces, Logic in Computer Science (LICS), pp.87-96, 2011.

J. Martin, E. Hyland, and C. Ong, On full abstraction for PCF: I, II, and III. Information and computation, vol.163, pp.285-408, 2000.

H. Andrew-d-ker, C. Nickau, and . Ong, Innocent game models of untyped ?-calculus, Theoretical Computer Science, vol.272, issue.1-2, pp.247-292, 2002.

D. Kozen, Semantics of probabilistic programs, Foundations of Computer Science, 1979., 20th Annual Symposium on, pp.101-114, 1979.

J. Laird, G. Manzonetto, G. Mccusker, and M. Pagani, Weighted relational models of typed lambda-calculi, Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.301-310, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01144064

T. Leventis, Probabilistic lambda-theories, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01427279

T. Leventis, Probabilistic Böhm Trees and Probabilistic Separation, Logic in Computer Science (LICS), 2018 33rd Annual ACM/IEEE Symposium on, vol.16, p.17, 2018.

P. Mellies, Categorical semantics of linear logic. Panoramas et syntheses, vol.27, pp.15-215, 2009.

A. Paul-, S. Mellies, and . Mimram, Asynchronous games: innocence without alternation, International Conference on Concurrency Theory, pp.395-411, 2007.

S. Rideau and G. Winskel, Concurrent strategies, Logic in Computer Science (LICS), 2011 26th Annual IEEE Symposium on, pp.409-418, 2011.

N. Saheb-djahromi, Cpo's of measures for nondeterminism, Theoretical Computer Science, vol.12, issue.1, pp.19-37, 1980.
DOI : 10.1016/0304-3975(80)90003-1
URL : https://doi.org/10.1016/0304-3975(80)90003-1

G. Winskel, Events in Computation, 1980.

G. Winskel, Event structures with symmetry, Electronic Notes in Theoretical Computer Science, vol.172, pp.611-652, 2007.
DOI : 10.1016/j.entcs.2007.02.022
URL : https://doi.org/10.1016/j.entcs.2007.02.022

G. Winskel, Distributed probabilistic and quantum strategies, Electronic Notes in Theoretical Computer Science, vol.298, pp.403-425, 2013.
DOI : 10.1016/j.entcs.2013.09.024
URL : https://doi.org/10.1016/j.entcs.2013.09.024