This paper proposes a general semantic framework for verifying programs with arbitrary
monadic side-effects using Dijkstra monads, which we define as monad-like structures …

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

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 …

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 …

We present a new version of ReLoC: a relational separation logic for proving refinements of
programs with higher-order state, fine-grained concurrency, polymorphism and recursive …

Model-checking is one of the most powerful techniques for verifying systems and programs,
which since the pioneering results by Knapik et al., Ong, and Kobayashi, is known to be …

This work investigates three notions of program equivalence for a higher-order functional
language with recursion and general algebraic effects, in which programs are written in …

This dissertation investigates notions of program equivalence and metric for higher-order
sequential languages with algebraic effects. Computational effects are those aspects of …

Applicative bisimiliarity is a coinductively-defined program equivalence in which programs
are tested as argument-passing processes. Starting with the seminal work by Abramsky …

We aim to reason about the correctness of behaviour-preserving transformations of Erlang
programs. Behaviour preservation is characterised by semantic equivalence. Based upon …