Affiliation:
1. MPI-SP, Germany / IMDEA Software Institute, Spain
2. CNRS, France
3. University of Bologna, Italy / Inria, France
Abstract
We study the nature of applicative bisimilarity in λ-calculi endowed with operators for sampling from contin- uous distributions. On the one hand, we show that bisimilarity, logical equivalence, and testing equivalence all coincide with contextual equivalence when real numbers can be manipulated through continuous functions only. The key ingredient towards this result is a notion of Feller-continuity for labelled Markov processes, which we believe of independent interest, giving rise a broad class of LMPs for which coinductive and logically inspired equivalences coincide. On the other hand, we show that if no constraint is put on the way real numbers are manipulated, characterizing contextual equivalence turns out to be hard, and most of the aforementioned notions of equivalence are even unsound.
Funder
European Research Council
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference56 articles.
1. Samson Abramsky . 1990. The Lazy Lambda Calculus . In Research Topics in Functional Programming , D. Turner (Ed.). Addison Wesley , 65–117. Samson Abramsky. 1990. The Lazy Lambda Calculus. In Research Topics in Functional Programming, D. Turner (Ed.). Addison Wesley, 65–117.
2. Borel structures for function spaces
3. Elements of a relational theory of datatypes
4. Hendrik Pieter Barendregt. 1984. The lambda calculus: its syntax and semantics. North-Holland. Hendrik Pieter Barendregt. 1984. The lambda calculus: its syntax and semantics. North-Holland.
5. Relational algebras