Fully Abstract Models of the Probabilistic λ-calculus - Archive ouverte HAL
Communication Dans Un Congrès Année : 2018

Fully Abstract Models of the Probabilistic λ-calculus

Résumé

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.
Fichier principal
Vignette du fichier
LIPIcs-CSL-2018-16.pdf (601.18 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01886956 , version 1 (03-10-2018)

Identifiants

Citer

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⟩
198 Consultations
116 Téléchargements

Altmetric

Partager

More