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.
Type de document :
Communication dans un congrès
27th EACSL Annual Conference on Computer Science Logic (CSL 2018), Sep 2018, Birmingham, United Kingdom. 〈10.4230/LIPIcs.CSL.2018.16〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01886956
Contributeur : Pierre Clairambault <>
Soumis le : mercredi 3 octobre 2018 - 14:11:09
Dernière modification le : vendredi 5 octobre 2018 - 01:16:33

Fichier

LIPIcs-CSL-2018-16.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

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〉

Partager

Métriques

Consultations de la notice

34

Téléchargements de fichiers

11