CATEGORICAL LOGIC

The Computational Meaning of Probabilistic Coherence Spaces

Resource type
Authors/contributors
Title
The Computational Meaning of Probabilistic Coherence Spaces
Abstract
We study the probabilistic coherent spaces — a denotational semantics interpreting programs by power series with non negative real coefficients. We prove that this semantics is adequate for a probabilistic extension of the untyped λ-calculus: the probability that a term reduces to a head normal form is equal to its denotation computed on a suitable set of values. The result gives, in a probabilistic setting, a quantitative refinement to the adequacy of Scott’s model for untyped λ-calculus.
Date
06/2011
Proceedings Title
2011 IEEE 26th Annual Symposium on Logic in Computer Science
Conference Name
2011 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011)
Place
Toronto, ON, Canada
Publisher
IEEE
Pages
87-96
Language
en
DOI
10/cpv52n
ISBN
978-1-4577-0451-2
Accessed
2019-11-26T20:50:00Z
Library Catalog
Crossref
Extra
ZSCC: 0000036
Citation
Ehrhard, T., Pagani, M., & Tasson, C. (2011). The Computational Meaning of Probabilistic Coherence Spaces. In 2011 IEEE 26th Annual Symposium on Logic in Computer Science (pp. 87–96). Toronto, ON, Canada: IEEE. https://doi.org/10/cpv52n
Processing time: 0.03 seconds

Graph of references

(from Zotero to Gephi via Zotnet with this script)
Graph of references