When modelling side-effects using a monad, we need to equip the monad with effectful
operations. This can be done by noting that each algebra of the monad carries …

We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility
of the approach with concrete examples such as the language semantics of weighted …

A large class of monads used to model computational effects have natural presentations by
operations and equations, for example, the list monad can be presented by a constant and a …

The Chomsky hierarchy plays a prominent role in the foundations of theoretical computer
science relating classes of formal languages of primary importance. In this paper we use …

This paper contributes to a theory of the behaviour of “finite-state” systems that is generic in
the system type. We propose that such systems are modeled as coalgebras with a finitely …

This paper contributes to a generic theory of behaviour of “finite-state” systems. Systems are
coalgebras with a finitely generated carrier for an endofunctor on a locally finitely …

It is well established that equational algebraic theories and the monads they generate can
be used to encode computational effects. An important insight of Power and Shkaravska is …

In the theory of coalgebras, trace semantics can be defined in various distinct ways,
including through algebraic logics, the Kleisli category of a monad or its Eilenberg–Moore …

Using recent developments in coalgebraic and monad-based semantics, we present a
uniform study of various notions of machines, eg, finite state machines, multi-stack …

Coalgebras are a generic and elegant way to talk about state and equation-systems. The
unique coalgebra homomorphism into the final coalgebra can be understood as the …