Skip to Main content Skip to Navigation
Conference papers

Fully Abstract Models of the Probabilistic λ-calculus

Abstract : We compare three models of the probabilistic λ-calculus: the probabilistic Böhm trees of Leventis, the probabilistic concurrent games of Winskel et al., and the weighted relational model of Ehrhard et al. Probabilistic Böhm trees and probabilistic strategies are shown to be related by a precise correspondence theorem, in the spirit of existing work for the pure λ-calculus. Using Leventis' theorem (probabilistic Böhm trees characterise observational equivalence), we derive a full abstraction result for the games model. Then, we relate probabilistic strategies to the weighted relational model, using an interpretation-preserving functor from the former to the latter. We obtain that the relational model is also fully abstract.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Pierre Clairambault <>
Submitted on : Wednesday, October 3, 2018 - 2:11:09 PM
Last modification on : Monday, March 29, 2021 - 2:46:58 PM
Long-term archiving on: : Friday, January 4, 2019 - 2:38:01 PM


Files produced by the author(s)



Pierre Clairambault, Hugo Paquet. Fully Abstract Models of the Probabilistic λ-calculus. 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), Sep 2018, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.CSL.2018.16⟩. ⟨hal-01886956⟩



Record views


Files downloads