The Computational Meaning of Probabilistic Coherence Spaces

Authors:
Thomas Ehrhard;Michele Pagani;Christine Tasson
Affiliations:
-;-;-
Venue:
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Year:
2011

Citing 0
Cited 2

On coinductive equivalences for higher-order probabilistic functional programs

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Weighted Relational Models of Typed Lambda-Calculi

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 $\lambda$-calculus: the probability that a term reduces to ahead 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 $\lambda$-calculus.