The Benefit of Being Non-Lazy in Probabilistic λ-calculus

by   Gianluca Curzi, et al.

We consider the probabilistic applicative bisimilarity (PAB), a coinductive relation comparing the applicative behaviour of probabilistic untyped lambda terms according to a specific operational semantics. This notion has been studied with respect to the two standard parameter passing policies, call-by-value (cbv) and call-by-name (cbn), using a lazy reduction strategy not reducing within the body of a function. In particular, PAB has been proven to be fully abstract with respect to the contextual equivalence in cbv but not in lazy cbn. We overcome this issue of cbn by relaxing the laziness constraint: we prove that PAB is fully abstract with respect to the standard head reduction contextual equivalence. Our proof is based on the Leventis Separation Theorem, using probabilistic Nakajima trees as a tree-like representation of the contextual equivalence classes. Finally, we prove also that the inequality full abstraction fails, showing that the probabilistic applicative similarity is strictly contained in the contextual preorder.



There are no comments yet.


page 1

page 2

page 3

page 4


On Randomised Strategies in the λ-Calculus (Long Version)

In this work we introduce randomised reduction strategies, a notion alre...

Contextual Equivalence for Signal Flow Graphs

We extend the signal flow calculus—a compositional account of the classi...

Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion

We present a complete reasoning principle for contextual equivalence in ...

On the characterization of models of H* : The operational aspect

We give a characterization, with respect to a large class of models of u...

The Fox and the Hound: Comparing Fully Abstract and Robust Compilation

We prove a theorem relating fully abstract compilation (FAC) to robust c...

Divergence and unique solution of equations

We study proof techniques for bisimilarity based on unique solution of e...

Coherence of Type Class Resolution

Elaboration-based type class resolution, as found in languages like Hask...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.