The concurrent game semantics of Probabilistic PCF

DOI10.1145/3209108.3209187zbMath1497.68331OpenAlexW2798278864MaRDI QIDQ5145294

Glynn Winskel, Pierre Clairambault, Simon Castellan, Hugo Paquet

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10044/1/58832

Mathematics Subject Classification ID

Applications of game theory (91A80) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (8)

Taylor expansion, finiteness and strategies ⋮ Continuous probability distributions in concurrent games ⋮ The geometry of Bayesian programming ⋮ Bayesian strategies: probabilistic programs as generalised graphical models ⋮ Causal Unfoldings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Concurrent Quantum Strategies

This page was built for publication: The concurrent game semantics of Probabilistic PCF