The concurrent game semantics of probabilistic PCF
DOI10.1145/3209108.3209187zbMATH Open1497.68331OpenAlexW2798278864MaRDI QIDQ5145294FDOQ5145294
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
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) 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)
Cited In (17)
- Continuous probability distributions in concurrent games
- Bayesian strategies: probabilistic programs as generalised graphical models
- Title not available (Why is that?)
- On the equivalence of game and denotational semantics for the probabilistic \(\mu\)-calculus
- Title not available (Why is that?)
- Zeta functions and the (linear) logic of Markov processes
- Taylor expansion, finiteness and strategies
- Game-Based Probabilistic Predicate Abstraction in PRISM
- Full abstraction for PCF
- The mays and musts of concurrent strategies
- A tale of additives and concurrency in game semantics
- Concurrent Quantum Strategies
- Causal Unfoldings
- Disentangling parallelism and interference in game semantics
- A Mathematical Game Semantics of Concurrency and Nondeterminism
- The Parallel Intensionally Fully Abstract Games Model of PCF
- The geometry of Bayesian programming
This page was built for publication: The concurrent game semantics of probabilistic PCF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145294)
