Much recent research has been devoted to modeling effects within type theory. Building on
this work, we observe that effectful type theories can provide a foundation on which to build …

Resumptions appear in many forms as a convenient abstraction, such as in semantics of
concurrency and as a programming pattern. In this paper we introduce generalised …

In functional programming, monadic characterizations of computational effects are normally
understood denotationally: they describe how an effectful program can be systematically …

Bisimulation and bisimilarity are fundamental notions in comparing state-based systems.
Their extensions to a variety of systems have been actively pursued in recent years, a …

We introduce a method to lift monads on the base category of a fibration to its total category.
This method, which we call codensity lifting, is applicable to various fibrations which were …

We consider the problem of establishing a relationship between two interpretations of base
type terms of a λc-calculus extended with algebraic operations. We show that the given …

Pure functional languages such as Haskell support programming with impure effects by
exploiting mathematical notions such as monads, applicative functors, and arrows. However …

Free theorems are a charm, allowing the derivation of useful statements about programs
from their (polymorphic) types alone. We show how to reap such theorems not only from …

The study of programming with and reasoning about inductive datatypes such as lists and
trees has benefited from the simple categorical principle of initial algebras. In initial algebra …

In functional programming, monads are supposed to encapsulate computations, effectfully
producing the final result, but keeping to themselves the means of acquiring it. For various …