The concurrent game semantics of Probabilistic PCF

Castellan, Simon and Clairambault, Pierre and Paquet, Hugo and Winskel, Glynn; (2018) The concurrent game semantics of Probabilistic PCF. In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018. Proceedings - Symposium on Logic in Computer Science . ACM, GBR, pp. 215-224. ISBN 9781450355834 (https://doi.org/10.1145/3209108.3209187)

[thumbnail of Castellan-etal-LICS2018-The-concurrent-game-semantics-of-Probabilistic-PCF]
Preview
 Text. Filename: Castellan_etal_LICS2018_The_concurrent_game_semantics_of_Probabilistic_PCF.pdf
Accepted Author Manuscript
Download (888kB)| Preview

Abstract

We define a new games model of Probabilistic PCF (PPCF) by enriching thin concurrent games with symmetry, recently introduced by Castellan et al, with probability. This model supports two interpretations of PPCF, one sequential and one parallel. We make the case for this model by exploiting the causal structure of probabilistic concurrent strategies. First, we show that the strategies obtained from PPCF programs have a deadlock-free interaction, and therefore deduce that there is an interpretation-preserving functor from our games to the probabilistic relational model recently proved fully abstract by Ehrhard et al. It follows that our model is intensionally fully abstract. Finally, we propose a definition of probabilistic innocence and prove a finite definability result, leading to a second (independent) proof of full abstraction.

CORE (COnnecting REpositories)