Abstract
We study bisimulation and context equivalence in a probabilistic lambda-calculus. The contributions of this paper are threefold. Firstly we show a technique for proving congruence of probabilistic applicative bisimilarity. While the technique follows Howe's method, some of the technicalities are quite different, relying on non-trivial "disentangling" properties for sets of real numbers. Secondly we show that, while bisimilarity is in general strictly finer than context equivalence, coincidence between the two relations is attained on pure lambda-terms. The resulting equality is that induced by Levy-Longo trees, generally accepted as the finest extensional equivalence on pure lambda-terms under a lazy regime. Finally, we derive a coinductive characterisation of context equivalence on the whole probabilistic language, via an extension in which terms akin to distributions may appear in redex position. Another motivation for the extension is that its operational semantics allows us to experiment with a different congruence technique, namely that of logical bisimilarity.
Supplemental Material
- S. Abramsky. The Lazy λ-Calculus. In D. Turner, editor, Research Topics in Functional Programming, pages 65--117. Addison Wesley, 1990. Google Scholar
Digital Library
- S. Abramsky and C.-H. L. Ong. Full abstraction in the lazy lambda calculus. Inf. Comput., 105(2):159--267, 1993. Google Scholar
Digital Library
- E. Astesiano and G. Costa. Distributive semantics for nondeterministic typed lambda-calculi. Theor. Comput. Sci., 32:121--156, 1984.Google Scholar
Cross Ref
- H. P. Barendregt. The Lambda Calculus -- Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984.Google Scholar
- M. Bernardo, R. De Nicola, and M. Loreti. A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences. Inf. Comput., 225:29--82, 2013. Google Scholar
Digital Library
- G. Boudol. Lambda-calculi for (strict) parallel functions. Inf. Comput., 108(1):51--127, 1994. Google Scholar
Digital Library
- G. Boudol and C. Laneve. The discriminating power of the calculus with multiplicities. Inf. Comput., 126(1):83--102, 1996. Google Scholar
Digital Library
- D. Comaniciu, V. Ramesh, and P. Meer. Kernel-based object tracking. IEEE Trans. on Pattern Analysis and Machine Intelligence,, 25(5): 564--577, 2003. Google Scholar
Digital Library
- U. Dal Lago and M. Zorzi. Probabilistic operational semantics for the lambda calculus. RAIRO - Theor. Inf. and Applic., 46(3):413--450, 2012.Google Scholar
- U. Dal Lago, D. Sangiorgi, and M. Alberti. On coinductive equivalences for probabilistic higher-order functional programs (long version). Available at http://arxiv.org/abs/1311.1722, 2013.Google Scholar
- V. Danos and R. Harmer. Probabilistic game semantics. ACM Trans. Comput. Log., 3(3):359--382, 2002. Google Scholar
Digital Library
- R. De Nicola and M. Hennessy. Testing equivalences for processes. Theor. Comput. Sci., 34:83--133, 1984.Google Scholar
Cross Ref
- U. de'Liguoro and A. Piperno. Non deterministic extensions of untyped lambda-calculus. Inf. Comput., 122(2):149--177, 1995. Google Scholar
Digital Library
- M. Dezani-Ciancaglini and E. Giovannetti. From bohm's theorem to observational equivalences: an informal account. Electr. Notes Theor. Comput. Sci., 50(2):83--116, 2001.Google Scholar
Cross Ref
- M. Dezani-Ciancaglini, J. Tiuryn, and P. Urzyczyn. Discrimination by parallel observers: The algorithm. Inf. Comput., 150(2):153--186, 1999. Google Scholar
Digital Library
- T. Ehrhard, M. Pagani, and C. Tasson. The computational meaning of probabilistic coherence spaces. In LICS, pages 87--96, 2011. Google Scholar
Digital Library
- S. Goldwasser and S. Micali. Probabilistic encryption. J. Comput. Syst. Sci., 28(2):270--299, 1984.Google Scholar
Cross Ref
- N. D. Goodman. The principles and practice of probabilistic programming. In POPL, pages 399--402, 2013. Google Scholar
Digital Library
- A. D. Gordon. Bisimilarity as a theory of functional programming. Electr. Notes Theor. Comput. Sci., 1:232--252, 1995.Google Scholar
Cross Ref
- A. D. Gordon, M. Aizatulin, J. Borgström, G. Claret, T. Graepel, A. V. Nori, S. K. Rajamani, and C. V. Russo. A model-learner pattern for bayesian reasoning. In POPL, pages 403--416, 2013. Google Scholar
Digital Library
- M. Hennessy. Exploring probabilistic bisimulations, part I. Formal Asp. Comput., 24(4--6):749--768, 2012. Google Scholar
Cross Ref
- D. J. Howe. Proving congruence of bisimulation in functional programming languages. Inf. Comput., 124(2):103--112, 1996. Google Scholar
Digital Library
- R. Jagadeesan and P. Panangaden. A domain-theoretic model for a higher-order process calculus. In ICALP, pages 181--194, 1990. Google Scholar
Digital Library
- C. Jones and G. D. Plotkin. A probabilistic powerdomain of evaluations. In LICS, pages 186--195, 1989. Google Scholar
Digital Library
- V. Koutavas, P. B. Levy, and E. Sumii. From applicative to environmental bisimulation. Electr. Notes Theor. Comput. Sci., 276: 215?235, 2011. Google Scholar
Digital Library
- K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Inf. Comput., 94(1):1?28, 1991. Google Scholar
Digital Library
- S. B. Lassen. Relational Reasoning about Functions and Nondeterminism. PhD thesis, University of Aarhus, 1998.Google Scholar
- S. Lenglet, A. Schmitt, and J.-B. Stefani. Howe's method for calculi with passivation. In CONCUR, pages 448--462, 2009. Google Scholar
Digital Library
- C. D. Manning and H. Schütze. Foundations of statistical natural language processing, volume 999. MIT Press, 1999. Google Scholar
Digital Library
- C.-H. L. Ong. Non-determinism in a functional setting. In LICS, pages 275--286, 1993.Google Scholar
Cross Ref
- P. Panangaden. Labelled Markov Processes. Imperial College Press, 2009. Google Scholar
Digital Library
- S. Park, F. Pfenning, and S. Thrun. A probabilistic language based on sampling functions. ACM Trans. Program. Lang. Syst., 31(1), 2008. Google Scholar
Digital Library
- J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, 1988. Google Scholar
Digital Library
- A. Pfeffer. IBAL: A probabilistic rational programming language. In IJCAI, pages 733--740. Morgan Kaufmann, 2001. Google Scholar
Digital Library
- A. M. Pitts. Operationally-based theories of program equivalence. In Semantics and Logics of Computation, pages 241--298. Cambridge University Press, 1997.Google Scholar
Cross Ref
- A. M. Pitts. Howe's method for higher-order languages. In D. Sangiorgi and J. Rutten, editors, Advanced Topics in Bisimulation and Coinduction, pages 197--232. Cambridge University Press, 2011.Google Scholar
Cross Ref
- N. Ramsey and A. Pfeffer. Stochastic lambda calculus and monads of probability distributions. In POPL, pages 154--165, 2002. Google Scholar
Digital Library
- N. Saheb-Djahromi. Probabilistic LCF. In MFCS, volume 64 of LNCS, pages 442--451, 1978.Google Scholar
- D. Sands. From SOS rules to proof principles: An operational metatheory for functional languages. In POPL, pages 428--441, 1997. Google Scholar
Digital Library
- D. Sangiorgi and D. Walker. The pi-Calculus -- a theory of mobile processes. Cambridge University Press, 2001. Google Scholar
Digital Library
- D. Sangiorgi, N. Kobayashi, and E. Sumii. Logical bisimulations and functional languages. In FSEN, volume 4767 of LNCS, pages 364--379, 2007. Google Scholar
Digital Library
- D. Sangiorgi, N. Kobayashi, and E. Sumii. Environmental bisimulations for higher-order languages. ACM Trans. Program. Lang. Syst., 33(1):5, 2011. Google Scholar
Digital Library
- K. Sieber. Call-by-value and nondeterminism. In TLCA, volume 664 of LNCS, pages 376--390, 1993. Google Scholar
Digital Library
- S. Thrun. Robotic mapping: A survey. Exploring artificial intelligence in the new millennium, pages 1--35, 2002. Google Scholar
Digital Library
Index Terms
On coinductive equivalences for higher-order probabilistic functional programs
Recommendations
On coinductive equivalences for higher-order probabilistic functional programs
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesWe study bisimulation and context equivalence in a probabilistic lambda-calculus. The contributions of this paper are threefold. Firstly we show a technique for proving congruence of probabilistic applicative bisimilarity. While the technique follows ...
Coinductive Verification of Program Optimizations Using Similarity Relations
Formal verification methods have gained increased importance due to their ability to guarantee system correctness and improve reliability. Nevertheless, the question how proofs are to be formalized in theorem provers is far from being trivial, yet very ...
First-order reasoning for higher-order concurrency
We present a practical first-order theory of a higher-order @p-calculus which is both sound and complete with respect to a standard semantic equivalence. The theory is a product of combining and simplifying two of the most prominent theories for [email protected] of ...







Comments