A well-known challenge in the semantics of programming languages is how to combine non-
determinism and probability. At a technical level, the problem arises from the fact that there …

Combining probabilistic choice and non-determinism is a long standing problem in
denotational semantics. From a category theory perspective, the problem stems from the …

Monads are commonplace in computer science, and can be composed using Beck's
distributive laws. Unfortunately, finding distributive laws can be extremely difficult and error …

The Vietoris monad on the category of compact Hausdorff spaces is a topological analogue
of the power-set monad on the category of sets. Exploiting Manes' characterisation of the …

Monads in category theory are algebraic structures that can be used to model computational
effects in programming languages. We show how the notion of" centre", and more generally" …

We develop a modular method to build algebraic structures. Our approach is categorical: we
describe the layers of our construct as monads, and combine them using distributive laws …

Automata learning is a technique that has successfully been applied in verification, with the
automaton type varying depending on the application domain. Adaptations of automata …

Abstract Automata learning has been successfully applied in the verification of hardware
and software. The size of the automaton model learned is a bottleneck for scalability, and …

The powerset monad on the category of sets does not distribute over itself. Nevertheless a
weaker form of distributive law of the powerset monad over itself exists and it essentially …

Motivated by the study of effectful programming languages and computations, we introduce
a relational theory of monadic rewriting systems. The latter are rewriting systems whose …