skip to main content
research-article
Open Access

On Feller continuity and full abstraction

Published:31 August 2022Publication History
Skip Abstract Section

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.

References

  1. Samson Abramsky. 1990. The Lazy Lambda Calculus. In Research Topics in Functional Programming, D. Turner (Ed.). Addison Wesley, 65–117. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Robert J. Aumann. 1961. Borel structures for function spaces. Illinois Journal of Mathematics, 5, 4 (1961), 614 – 630. https://doi.org/10.1215/ijm/1255631584 Google ScholarGoogle ScholarCross RefCross Ref
  3. Roland Carl Backhouse and Paul F. Hoogendijk. 1993. Elements of a Relational Theory of Datatypes. In Formal Program Development - IFIP TC2/WG 2.1 State-of-the-Art Report. 7–42. https://doi.org/10.1007/3-540-57499-9_15 Google ScholarGoogle ScholarCross RefCross Ref
  4. Hendrik Pieter Barendregt. 1984. The lambda calculus: its syntax and semantics. North-Holland. Google ScholarGoogle Scholar
  5. Michael Barr. 1970. Relational algebras. Lect. Notes Math., 137 (1970), 39–55. https://doi.org/10.1007/BFb0060439 Google ScholarGoogle ScholarCross RefCross Ref
  6. Gilles Barthe, Raphaëlle Crubillé, Ugo Dal Lago, and Francesco Gavazzo. 2022. On Feller Continuity and Full Abstraction (Long Version). arXiv preprint arXiv:2207.10590. Google ScholarGoogle Scholar
  7. Mathias Beiglböck, Christian Léonard, and Walter Schachermayer. 2009. A General Duality Theorem for the Monge–Kantorovich Transport Problem. arXiv preprint arXiv:0911.4347. Google ScholarGoogle Scholar
  8. Patrick Billingsley. 1986. Probability and Measure (second ed.). John Wiley and Sons. Google ScholarGoogle Scholar
  9. Richard Blute, Josée Desharnais, Abbas Edalat, and Prakash Panangaden. 1997. Bisimulation for Labelled Markov Processes. In Proc. of LICS 1997. IEEE Computer Society, 149–158. https://doi.org/10.1109/LICS.1997.614943 Google ScholarGoogle ScholarCross RefCross Ref
  10. Johannes Borgström, Ugo Dal Lago, Andrew D Gordon, and Marcin Szymczak. 2016. A lambda-calculus foundation for universal probabilistic programming. Prof. of ICFP 2016, 33–46. https://doi.org/10.1145/2951913.2951942 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Florence Clerc, Nathanaël Fijalkow, Bartek Klin, and Prakash Panangaden. 2019. Expressiveness of probabilistic modal logics: A gradual approach. Inf. Comput., 267 (2019), 145–163. https://doi.org/10.1016/j.ic.2019.04.002 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Raphaëlle Crubillé and Ugo Dal Lago. 2014. On Probabilistic Applicative Bisimulation and Call-by-Value λ -Calculi. In Proc. of ESOP 2014 (LNCS, Vol. 8410). Springer, 209–228. https://doi.org/10.1007/978-3-642-54833-8_12 Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Raphaëlle Crubillé, Ugo Dal Lago, Davide Sangiorgi, and Valeria Vignudelli. 2015. On Applicative Similarity, Sequentiality, and Full Abstraction. In Proc. of Symposium in Honor of Ernst-Rüdiger Olderog. (LNCS, Vol. 9360). Springer, 65–82. https://doi.org/10.1007/978-3-319-23506-6_7 Google ScholarGoogle ScholarCross RefCross Ref
  14. Ryan Culpepper and Andrew Cobb. 2017. Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring. In Proc. of ESOP 2017, Hongseok Yang (Ed.) (LNCS, Vol. 10201). Springer, 368–392. https://doi.org/10.1007/978-3-662-54434-1_14 Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Ugo Dal Lago and Francesco Gavazzo. 2019. On Bisimilarity in Lambda Calculi with Continuous Probabilistic Choice. In Proc. of MFPS 2019. 121–141. https://doi.org/10.1016/j.entcs.2019.09.007 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Ugo Dal Lago, Francesco Gavazzo, and Paul Blain Levy. 2017. Effectful applicative bisimilarity: Monads, relators, and Howe’s method. In Proc. of LICS 2017. IEEE Computer Society, 1–12. https://doi.org/10.1109/LICS.2017.8005117 Google ScholarGoogle ScholarCross RefCross Ref
  17. Ugo Dal Lago, Francesco Gavazzo, and Ryo Tanaka. 2020. Effectful applicative similarity for call-by-name lambda calculi. Theor. Comput. Sci., 813 (2020), 234–247. https://doi.org/10.1016/j.tcs.2019.12.025 Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Ugo Dal Lago, Davide Sangiorgi, and Michele Alberti. 2014. On coinductive equivalences for higher-order probabilistic functional programs. In Proc. of POPL 2014. 297–308. https://doi.org/10.1145/2535838.2535872 Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Vincent Danos, Josée Desharnais, François Laviolette, and Prakash Panangaden. 2006. Bisimulation and cocongruence for probabilistic systems. Inf. Comput., 204, 4 (2006), 503–523. https://doi.org/10.1016/j.ic.2005.02.004 Google ScholarGoogle ScholarCross RefCross Ref
  20. Vincent Danos, François Laviolette, Josée Desharnais, and Prakash Panangaden. 2005. Almost Sure Bisimulation in Labelled Markov Processes. Unpublished note. Available at https://www.cs.mcgill.ca/ prakash/Pubs/new-neg.pdf Google ScholarGoogle Scholar
  21. Josée Desharnais, Abbas Edalat, and Prakash Panangaden. 1998. A Logical Characterization of Bisimulation for Labeled Markov Processes. In Proc. of LICS 1998. IEEE Computer Society, 478–487. https://doi.org/10.1109/LICS.1998.705681 Google ScholarGoogle ScholarCross RefCross Ref
  22. Josée Desharnais, Abbas Edalat, and Prakash Panangaden. 2002. Bisimulation for Labelled Markov Processes. Inf. Comput., 179, 2 (2002), 163–193. https://doi.org/10.1006/inco.2001.2962 Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Josée Desharnais, Vineet Gupta, Radha Jagadeesan, and Prakash Panangaden. 1999. Metrics for Labeled Markov Systems. In Proc. of CONCUR 1999 (LNCS, Vol. 1664). Springer, 258–273. https://doi.org/10.1007/3-540-48320-9_19 Google ScholarGoogle ScholarCross RefCross Ref
  24. Josée Desharnais, Vineet Gupta, Radha Jagadeesan, and Prakash Panangaden. 2004. Metrics for labelled Markov processes. Theor. Comput. Sci., 318, 3 (2004), 323–354. https://doi.org/10.1016/j.tcs.2003.09.013 Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Josée Desharnais and Prakash Panangaden. 2003. Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. J. Log. Algebraic Methods Program., 56, 1-2 (2003), 99–115. https://doi.org/10.1016/S1567-8326(02)00068-1 Google ScholarGoogle ScholarCross RefCross Ref
  26. Thomas Ehrhard, Michele Pagani, and Christine Tasson. 2018. Measurable cones and stable, measurable functions: a model for probabilistic higher-order programming. In Proc. of POPL 2018. 59:1–59:28. https://doi.org/10.1145/3158147 Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Nathanaël Fijalkow, Bartek Klin, and Prakash Panangaden. 2017. Expressiveness of probabilistic modal logics, revisited. In Proc. of ICALP 2017 (LIPIcs, Vol. 80). 105:1–105:12. https://doi.org/10.4230/LIPIcs.ICALP.2017.105 Google ScholarGoogle ScholarCross RefCross Ref
  28. Francesco Gavazzo. 2019. Coinductive Equivalences and Metrics for Higher-order Languages with Algebraic Effects. (Equivalences coinductives et métriques pour les langages d’ordre supérieur avec des effets algébriques). Ph.D. Dissertation. University of Bologna, Italy. Google ScholarGoogle Scholar
  29. Michèle Giry. 1982. A categorical approach to probability theory. In Categorical Aspects of Topology and Analysis. Springer Berlin Heidelberg, 68–85. https://doi.org/10.1007/BFb0092872 Google ScholarGoogle Scholar
  30. Shin-ya Katsumata, Tetsuya Sato, and Tarmo Uustalu. 2018. Codensity Lifting of Monads and its Dual. Logical Methods in Computer Science, 14, 4 (2018), https://doi.org/10.23638/LMCS-14(4:6)2018 Google ScholarGoogle ScholarCross RefCross Ref
  31. Shin-ya Katsumata and Tetsuya Sato. 2015. Codensity liftings of monads. In Proc. of CALCO (LIPIcs, Vol. 35). 156–170. https://doi.org/10.4230/LIPIcs.CALCO.2015.156 Google ScholarGoogle ScholarCross RefCross Ref
  32. Alexander S. Kechris. 2012. Classical Descriptive Set Theory. Springer New York. Google ScholarGoogle Scholar
  33. Hans G. Kellerer. 1984. Duality theorems for marginal problems. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 67, 4 (1984), 399–432. https://doi.org/10.1007/BF00532047 Google ScholarGoogle ScholarCross RefCross Ref
  34. Gregory M. Kelly. 2005. Basic Concepts of Enriched Category Theory. Reprints in Theory and Applications of Categories, 1–136. Google ScholarGoogle Scholar
  35. Vasileios Koutavas, Paul Blain Levy, and Eijiro Sumii. 2011. From Applicative to Environmental Bisimulation. In Proc. of MFPS 2011. 215–235. https://doi.org/10.1016/j.entcs.2011.09.023 Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Kim G. Larsen and Arne Skou. 1991. Bisimulation through Probabilistic Testing. Inf. Comput., 94, 1 (1991), 1–28. https://doi.org/10.1016/0890-5401(91)90030-6 Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Søren Lassen. 1998. Relational Reasoning about Functions and Nondeterminism. Aarhus University. BRICS Dissertation Series BRICS DS-98-2. Google ScholarGoogle Scholar
  38. Søren B. Lassen. 1999. Bisimulation in Untyped Lambda Calculus: Böhm Trees and Bisimulation up to Context. Electr. Notes Theor. Comput. Sci., 20 (1999), 346–374. https://doi.org/10.1016/S1571-0661(04)80083-5 Google ScholarGoogle ScholarCross RefCross Ref
  39. Søren B. Lassen. 2005. Eager Normal Form Bisimulation. In Proceedings of LICS 2005. IEEE Computer Society, 345–354. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Paul Blain Levy, John Power, and Hayo Thielecke. 2003. Modelling environments in call-by-value programming languages. Inf. Comput., 185, 2 (2003), 182–210. https://doi.org/10.1016/S0890-5401(03)00088-9 Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Ernest G. Manes and Michael A. Arbib. 1986. Algebraic Approaches to Program Semantics. Springer. Google ScholarGoogle Scholar
  42. James H. Morris. 1969. Lambda Calculus Models of Programming Languages. Ph.D. Dissertation. MIT. Google ScholarGoogle Scholar
  43. C.-H. Luke Ong. 1988. The Lazy Lambda Calculus: An Investigation Into the Foundations of Functional Programming. Ph.D. Dissertation. Imperial College of Science and Technology. Google ScholarGoogle Scholar
  44. C.-H. Luke Ong. 1993. Non-Determinism in a Functional Setting. In Proc. of LICS 1993. IEEE Computer Society, 275–286. https://doi.org/10.1109/LICS.1993.287580 Google ScholarGoogle ScholarCross RefCross Ref
  45. Prakash Panangaden. 1999. The Category of Markov Kernels. Electron. Notes Theor. Comput. Sci., 22 (1999), 171–187. https://doi.org/10.1016/S1571-0661(05)80602-4 Google ScholarGoogle ScholarCross RefCross Ref
  46. Prakash Panangaden. 2009. Labelled Markov Processes. Imperial College Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Kalyanapuram Rangachari Parthasarathy. 2005. Probability measures on metric spaces. 352, American Mathematical Soc.. https://doi.org/10.1090/chel/352 Google ScholarGoogle ScholarCross RefCross Ref
  48. Zbigniew Piotrowski. 1985. Separate and joint continuity. Real Analysis Exchange, 11, 2 (1985), 293–322. https://doi.org/10.2307/44151750 Google ScholarGoogle ScholarCross RefCross Ref
  49. Marcin Sabok, Sam Staton, Dario Stein, and Michael Wolman. 2021. Probabilistic programming semantics for name generation. In Proc. of POPL 2021. 1–29. https://doi.org/10.1145/3434292 Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Davide Sangiorgi. 1994. The Lazy Lambda Calculus in a Concurrency Scenario. Inf. Comput., 111, 1 (1994), 120–153. https://doi.org/10.1006/inco.1994.1042 Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. Sam Staton. 2017. Commutative Semantics for Probabilistic Programming. In Proc. of ESOP 2017 (LNCS, Vol. 10201). Springer, 855–879. https://doi.org/10.1007/978-3-662-54434-1_32 Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. Sam Staton, Hongseok Yang, Frank D. Wood, Chris Heunen, and Ohad Kammar. 2016. Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. In Proc. of LICS 2016. 525–534. https://doi.org/10.1145/2933575.2935313 Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. Jan Swart and Anita Winter. 2013. Markov processes: Theory and Examples. Course Notes. Google ScholarGoogle Scholar
  54. Pedro Sánchez Terraf. 2011. Unprovability of the logical characterization of bisimulation. Inf. Comput., 209, 7 (2011), 1048–1056. https://doi.org/10.1016/j.ic.2011.02.003 Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. Matthijs Vákár, Ohad Kammar, and Sam Staton. 2019. A domain theory for statistical probabilistic programming. In Proc. of POPL 2019. 36:1–36:29. https://doi.org/10.1145/3290349 Google ScholarGoogle ScholarDigital LibraryDigital Library
  56. Franck van Breugel, Michael W. Mislove, Joël Ouaknine, and James Worrell. 2005. Domain theory, testing and simulation for labelled Markov processes. Theor. Comput. Sci., 333, 1-2 (2005), 171–197. https://doi.org/10.1016/j.tcs.2004.10.021 Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. Ignacio D. Viglizzo. 2005. Final Sequences and Final Coalgebras for Measurable Spaces. In Proc. of CALCO 2005 (LNCS, Vol. 3629). Springer, 395–407. https://doi.org/10.1007/11548133_25 Google ScholarGoogle ScholarDigital LibraryDigital Library
  58. Cédric Villani. 2008. Optimal Transport: Old and New. Springer Science & Business Media. Google ScholarGoogle Scholar
  59. Mitchell Wand, Ryan Culpepper, Theophilos Giannakopoulos, and Andrew Cobb. 2018. Contextual equivalence for a probabilistic language with continuous random variables and recursion. Proc. of ICFP 2018, 1–30. https://doi.org/10.1145/3236782 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On Feller continuity and full abstraction

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Article Metrics

        • Downloads (Last 12 months)136
        • Downloads (Last 6 weeks)11

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!