The theory of monads on categories equipped with a dagger (a contravariant identity-on-objects involutive endofunctor) works best when all structure respects the dagger: the monad and adjunctions should preserve the dagger, and the monad and its algebras should satisfy the so-called Frobenius law. Then any monad resolves as an adjunction, with extremal solutions given by the categories of Kleis...

We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vector spaces, untyped and typed λ-calculus syntax and indexed containers. We show that the Kleisli and Eilenberg-Moore constructions carry over to relative monads and are related to relative adjunctions. Under reasonable assumptions...

We characterize the equational theories and Lawvere theories that correspond to the categories of analytic and polynomial monads on Set, and hence also the categories of the symmetric and rigid operads in Set. We show that the category of analytic monads is equivalent to the category of regular-linear theories. The category of polynomial monads is equivalent to the category of rigid theories, i...

The category of all monads over many-sorted sets (and over other " set-like " categories) is proved to have coequalizers and strong coin-tersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms and have arbitrarily large joint pre-fixpoints. In contrast, coequalizers fail to exist e.g. for monads over the (presheaf) category of graphs. For more ge...

For a small quantaloid Q we consider four fundamental 2-monads T on Q-Cat, given by the presheaf 2-monad P and the copresheaf 2-monad P†, as well as their two composite 2-monads, and establish that they all laxly distribute over P. These four 2-monads therefore admit lax extensions to the category Q-Dist of Q-categories and their distributors. We characterize the corresponding (T,Q)-categories ...

This is a short introduction to categories with some emphasis on coalgebras. We start from introducing basic notions (categories, functors, natural transformations), move to Kleisli tripels and monads, with a short discussion of monads in Haskell, and continue with displaying the interplay between algebras, adjunctions and monads. Coalgebras are discussed and applied to the semantics of modal l...

We consider HOL-Omega, a recent extension by Homeier to the type system of the HOL theorem prover. We describe how it permits an implementation of categories, where we model the objects of a category as the types of HOL-Omega. This gives a “light-weight” implementation of categories into a theorem prover: we explore how this is sufficient for easily proving some non-trivial results of category ...