Double Adjunctions and Free Monads

We characterize double adjunctions in terms of presheaves and universal squares, and then apply these characterizations to free monads and Eilenberg--Moore objects in double categories. We improve upon our earlier result in "Monads in Double Categories", JPAA 215:6, pages 1174-1197, 2011, to conclude: if a double category with cofolding admits the construction of free monads in its horizontal 2-category, then it also admits the construction of free monads as a double category. We also prove that a double category admits Eilenberg--Moore objects if and only if a certain parameterized presheaf is representable. Along the way, we develop parameterized presheaves on double categories and prove a double-categorical Yoneda Lemma.Comment: 52 page

Monads in Double Categories

We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to that of double categories. In particular, we introduce the double category Mnd(C) of monads in a double category C and define what it means for a double category to admit the construction of free monads. Our main theorem shows that, under some mild conditions, a double category that is a framed bicategory admits the construction of free monads if its horizontal 2-category does. We apply this result to obtain double adjunctions which extend the adjunction between graphs and categories and the adjunction between polynomial endofunctors and polynomial monads.Comment: 30 pages; v2: accepted for publication in the Journal of Pure and Applied Algebra; added hypothesis in Theorem 3.7 that source and target functors preserve equalizers; on page 18, bottom, in the statement concerning the existence of a left adjoint, "if and only if" was replaced by "a sufficient condition"; acknowledgements expande

Double adjunctions and free monads

We characterize double adjunctions in terms of presheaves and universal squares, and then apply these characterizations to free monads and Eilenberg--Moore objects in double categories. We improve upon our earlier result in "Monads in Double Categories", JPAA 215:6, pages 1174-1197, 2011, to conclude: if a double category with cofolding admits the construction of free monads in its horizontal 2-category, then it also admits the construction of free monads as a double category. We also prove that a double category admits Eilenberg--Moore objects if and only if a certain parameterized presheaf is representable. Along the way, we develop parameterized presheaves on double categories and prove a double-categorical Yoneda Lemma

Double adjunctions

We characterize double adjunctions in terms of presheaves and universal squares, and then apply these characterizations to free monads and Eilenberg-Moore objects in double categories. We improve upon an earlier result of Fiore-Gambino-Kock in [7] to conclude: if a double category with cofolding admits the construction of free monads in its horizontal 2-category, then it also admits the construction of free monads as a double category horizontally and vertically, and also in its vertical 2-category. We also prove that a double category admits Eilenberg-Moore objects if and only if a certain parameterized presheaf is representable. Along the way, we develop parameterized presheaves on double categories and prove a double Yoneda Lemma

Monads in double categories

We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to that of double categories. In particular, we introduce the double category Mnd(C) of monads in a double category C and de ne what it means for a double category to admit the construction of free monads. Our main theorem shows that, under some mild conditions, a double category that is a framed bicategory admits the construction of free monads if its horizontal 2-category does. We apply this result to obtain double adjunctions which extend the adjunction between graphs and categories and the adjunction between polynomial endofunctors and polynomial monads

Recursive Program Schemes and Context-Free Monads

AbstractSolutions of recursive program schemes over a given signature Σ were characterized by Bruno Courcelle as precisely the context-free (or algebraic) Σ-trees. These are the finite and infinite Σ-trees yielding, via labelling of paths, context-free languages. Our aim is to generalize this to finitary endofunctors H of general categories: we construct a monad CH “generated” by solutions of recursive program schemes of type H, and prove that this monad is ideal. In case of polynomial endofunctors of Set our construction precisely yields the monad of context-free Σ-trees of Courcelle. Our result builds on a result by N. Ghani et al on solutions of algebraic systems

Tracing monadic computations and representing effects

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 reasons, we sometimes want to reveal the internals of a computation. To make that possible, in this paper we introduce monad transformers that add the ability to automatically accumulate observations about the course of execution as an effect. We discover that if we treat the resulting trace as the actual result of the computation, we can find new functionality in existing monads, notably when working with non-terminating computations.Comment: In Proceedings MSFP 2012, arXiv:1202.240