The concurrent game semantics of Probabilistic PCF
- Submitting institution
-
University of Strathclyde
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 107580195
- Type
- E - Conference contribution
- DOI
-
10.1145/3209108.3209187
- Title of conference / published proceedings
- Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018
- First page
- 215
- Volume
- -
- Issue
- -
- ISSN
- 1043-6871
- Open access status
- Other exception
- Month of publication
- July
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Presents a fully abstract concurrent game semantics for probabilistic PCF. It demonstrated the power of concurrent games in probabilistic computation and connected to the French school based on probabilistic coherence spaces [Ehrhard, Tasson]. The work has been refined later to cope with continuous probability distributions [Paquet and Winskel] and used to provide causal analysis of probabilistic programs [Castellan and Paquet]. The work was a necessary precursor to work on quantum strategies and solution to the open problem of full-abstraction of the quantum lambda calculus [Clairambault, de Visme, POPL’20]. It led to Paquet’s Cambridge PhD thesis.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -