Coalgebras can be seen as a natural abstraction of Kripke frames. In the same sense,
coalgebraic logics are generalised modal logics. In this paper, we give an overview of the …

We have built the first family of tagless interpretations for a higher-order typed object
language in a typed metalanguage (Haskell or ML) that require no dependent types …

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 …

There is a large amount of literature on the topic of covarieties, coequations and
coequational specifications, dating back to the early seventies. Nevertheless, coequations …

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 …

Coinduction has recently been introduced as a powerful technique for reasoning about
unfounded sets, unbounded structures, and interactive computations. Where induction …

We introduce monoidal streams: a generalization of causal stream functions to monoidal
categories. In the same way that streams provide semantics to dataflow programming with …

In previous work ([1],[2],[3]), it has been shown how a range of model comparison games
which play a central role in finite model theory, including Ehrenfeucht-Fraïssé, pebbling, and …

Effectuses have recently been introduced as categorical models for quantum computation,
with probabilistic and Boolean (classical) computation as special cases. These …

The article investigates behavioural equivalence between programs in a call-by-value
functional language extended with a signature of (algebraic) effect-triggering operations …