We overview a programme to provide a unified semantics for computational effects based
upon the notion of a countable enriched Lawvere theory. We define the notion of countable …

The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …

Trace semantics has been defined for various kinds of state-based systems, notably with
different forms of branching such as non-determinism vs. probability. In this paper we claim …

The present thesis reports most of the scientific results I obtained during a four year Ph. D.
project funded by the Dutch Science Foundation NWO in the context of the ProMACS …

Bialgebras and distributive laws are an abstract, categorical framework to study various
flavors of structural operational semantics. This paper aims to introduce the reader to the …

The powerset construction is a standard method for converting a nondeterministic
automaton into a deterministic one recognizing the same language. In this paper, we lift 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 …

This papers reviews the classical theory of deterministic automata and regular languages
from a categorical perspective. The basis is formed by Rutten's description of the Brzozowski …

Coalgebra is an abstract framework for the uniform study of different kinds of dynamical
systems. An endofunctor $ F $ determines both the type of systems ($ F $-coalgebras) and a …

Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient
proof techniques for checking properties of different kinds of systems. We prove the …