On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi

Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is applied to a typed, call-by-value, lambda-calculus. Surprisingly, the obtained relation coincides with context equivalence, contrary to what happens when call-by-name evaluation is considered. Even more surprisingly, full-abstraction only holds in a symmetric setting.

[1]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[2]  Douglas J. Howe.  Proving Congruence of Bisimulation in Functional Programming Languages , 1996, Inf. Comput..

[3]  Yehuda Lindell,et al.  Introduction to Modern Cryptography , 2004 .

[4]  Hinrich Schütze,et al.  Book Reviews: Foundations of Statistical Natural Language Processing , 1999, CL.

[5]  Noah D. Goodman.  The principles and practice of probabilistic programming , 2013, POPL.

[6]  Yehuda Lindell,et al.  Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series) , 2007 .

[7]  Judea Pearl,et al.  Chapter 2 – BAYESIAN INFERENCE , 1988 .

[8]  Norman Ramsey,et al.  Stochastic lambda calculus and monads of probability distributions , 2002, POPL '02.

[9]  Soren Lassen.  Relational reasoning about contexts , 1997 .

[10]  Sebastian Thrun,et al.  Robotic mapping: a survey , 2003 .

[11]  C. Jones,et al.  A probabilistic powerdomain of evaluations , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[12]  Glynn Winskel,et al.  Relational Reasoning about Functions and Nondeterminism , 1999 .

[13]  Jean Goubault-Larrecq,et al.  Logical Relations for Monadic Types , 2005 .

[14]  Joël Ouaknine,et al.  Domain theory, testing and simulation for labelled Markov processes , 2005, Theor. Comput. Sci..

[15]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[16]  Thomas Ehrhard,et al.  Probabilistic coherence spaces are fully abstract for probabilistic PCF , 2014, POPL.

[17]  Pierre-Louis Curien,et al.  Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..

[18]  Ugo Dal Lago,et al.  On coinductive equivalences for higher-order probabilistic functional programs , 2013, POPL.

[19]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..

[20]  Claudio V. Russo,et al.  A model-learner pattern for bayesian reasoning , 2013, POPL.

[21]  Andrew Pitts,et al.  Semantics and Logics of Computation: Operationally-Based Theories of Program Equivalence , 1997 .

[22]  Dorin Comaniciu,et al.  Kernel-Based Object Tracking , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[24]  Vincent Danos,et al.  Probabilistic game semantics , 2002, TOCL.

[25]  Ugo Dal Lago,et al.  Probabilistic operational semantics for the lambda calculus , 2011, RAIRO Theor. Informatics Appl..

[26]  Abbas Edalat,et al.  Bisimulation for labelled Markov processes , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[27]  Gerhard Lakemeyer,et al.  Exploring artificial intelligence in the new millennium , 2003 .

[28]  Avi Pfeffer,et al.  IBAL: A Probabilistic Rational Programming Language , 2001, IJCAI.

[29]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[30]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[31]  C.-H. Luke Ong,et al.  Non-determinism in a functional setting , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[32]  Samson Abramsky,et al.  The Lazy λ−Calculus , 1990 .