We consider the probabilistic untyped lambda-calculus and prove a stronger form of the adequacy property for probabilistic coherence spaces (PCoh), showing how the denotation of a term statistically distributes over the denotations of its head-normal forms. We use this result to state a precise correspondence between PCoh and a notion of probabilistic Nakajima trees, recently introduced by Leventis in order to prove a separation theorem. As a consequence, we get full abstraction for PCoh. This latter result has already been mentioned as a corollary of Clairambault and Paquet’s full abstraction theorem for probabilistic concurrent games. Our approach allows to prove the property directly, without the need of a third model.
CITATION STYLE
Leventis, T., & Pagani, M. (2019). Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11425 LNCS, pp. 365–381). Springer Verlag. https://doi.org/10.1007/978-3-030-17127-8_21
Mendeley helps you to discover research relevant for your work.