Graded modal types systems and coeffects are becoming a standard formalism to deal with
context-dependent, usage-sensitive computations, especially when combined with …

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 …

The machine learning community has recently shown a lot of interest in practical
probabilistic programming systems that target the problem of Bayesian inference. Such …

This paper studies quantitative refinements of Abramsky's applicative similarity and
bisimilarity in the context of a generalisation of Fuzz, a call-by-value λ-calculus with a linear …

Constructive type theory combines logic and programming in one language. This is useful
both for reasoning about programs written in type theory, as well as for reasoning about …

Couplings are a powerful mathematical tool for reasoning about pairs of probabilistic
processes. Recent developments in formal verification identify a close connection between …

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 …