A probabilistic Chomsky–Schützenberger hierarchy of grammars is introduced and studied,
with the aim of understanding the expressive power of generative models. We offer …

Probabilistic coherence spaces (PCoh) yield a semantics of higher-order probabilistic
computation, interpreting types as convex sets and programs as power series. We prove that …

We study Abramsky's applicative bisimilarity abstractly, in the context of call-by-value λ-
calculi with algebraic effects. We first of all endow a computational λ-calculus with a monadic …

A wide range of human reasoning patterns can be explained as conditioning in probabilistic
models; however, conditioning has traditionally been viewed as an operation applied to …

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 …

Probabilistic applicative bisimulation is a recently introduced coinductive methodology for
program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is …

Randomized higher-order computation can be seen as being captured by a λ-calculus
endowed with a single algebraic operation, namely a construct for binary probabilistic …

It is well-known that constructing models of higher-order probabilistic programming
languages is challenging. We show how to construct step-indexed logical relations for a …

Normal form bisimulation, also known as open bisimulation, is a coinductive technique for
higher-order program equivalence in which programs are compared by looking at their …

The speculative ambition of replacing the old theory of program approximation based on
syntactic continuity with the theory of resource consumption based on Taylor expansion and …