English
Related papers

Related papers: Monads need not be endofunctors

200 papers

We develop the theory of relative monads and relative adjunctions in a virtual equipment, extending the theory of monads and adjunctions in a 2-category. The theory of relative comonads and relative coadjunctions follows by duality. While…

Category Theory · Mathematics 2025-10-21 Nathanael Arkor , Dylan McDermott

Monoidal functors U:C --> M with left adjoints determine, in a universal way, monoids T in the category of oplax monoidal endofunctors on M. Such monads will be called bimonads. Treating bimonads as abstract "quantum groupoids" we derive…

Quantum Algebra · Mathematics 2007-05-23 K. Szlachanyi

We develop the formal theory of monads, as established by Street, in univalent foundations. This allows us to formally reason about various kinds of monads on the right level of abstraction. In particular, we define the bicategory of monads…

Logic in Computer Science · Computer Science 2025-02-26 Niels van der Weide

We revisit once again the connection between three notions of computation: monads, arrows and idioms (also called applicative functors). We employ monoidal categories of finitary functors and profunctors on finite sets as models of these…

Programming Languages · Computer Science 2018-07-12 Exequiel Rivas

The Eilenberg-Moore constructions and a Beck-type theorem for pairs of monads are described. More specifically, a notion of a {\em Morita context} comprising of two monads, two bialgebra functors and two connecting maps is introduced. It is…

Category Theory · Mathematics 2009-09-22 Tomasz Brzeziński , Adrian Vazquez Marquez , Joost Vercruysse

In the category of monoids we characterize monomorphisms that are normal, in an appropriate sense, to internal reflexive relations, preorders or equivalence relations. The zero-classes of such internal relations are first described in terms…

Category Theory · Mathematics 2022-10-10 Nelson Martins-Ferreira , Manuela Sobral

Generalized operads, also called generalized multicategories and $T$-monoids, are defined as monads within a Kleisli bicategory. With or without emphasizing their monoidal nature, generalized operads have been considered by numerous authors…

Category Theory · Mathematics 2015-04-22 Dimitri Chikhladze

We introduce the notion of a relative pseudomonad, which generalises the notion of a pseudomonad, and define the Kleisli bicategory associated to a relative pseudomonad. We then present an efficient method to define pseudomonas on the…

Category Theory · Mathematics 2019-05-16 Marcelo Fiore , Nicola Gambino , Martin Hyland , Glynn Winskel

It is known that the so-called monadic decomposition, applied to the adjunction connecting the category of bialgebras to the category of vector spaces via the tensor and the primitive functors, returns the usual adjunction between…

Category Theory · Mathematics 2021-02-15 Alessandro Ardizzoni , Claudia Menini

{\em Galois comodules} over a coring can be characterised by properties of the relative injective comodules. They motivated the definition of {\em Galois functors} over some comonad (or monad) on any category and in the first section of the…

Category Theory · Mathematics 2009-10-01 Bachuki Mesablishvili , Robert Wisbauer

We establish a relative monadicity theorem for relative monads with dense roots in a virtual equipment, specialising to a relative monadicity theorem for enriched relative monads. In particular, for a dense $\mathbb V$-functor $j \colon A…

Category Theory · Mathematics 2024-10-18 Nathanael Arkor , Dylan McDermott

Given a locally presentable enriched category $\mathcal{E}$ together with a small dense full subcategory $\mathcal A$ of arities, we study the relationship between monads on $\mathcal E$ and identity-on-objects functors out of $\mathcal A$,…

Category Theory · Mathematics 2020-06-03 John Bourke , Richard Garner

We develop an algebraic underpinning of backtracking monad transformers in the general setting of monoidal categories. As our main technical device, we introduce Eilenberg--Moore monoids, which combine monoids with algebras for strong…

Programming Languages · Computer Science 2016-08-22 Maciej Piróg

Containers represent a wide class of type constructions relevant for functional programming and (co)inductive reasoning. Indexed containers generalize this notion to better fit the scope of dependently typed programming. When interpreting…

Logic in Computer Science · Computer Science 2025-10-01 Michele De Pascalis , Tarmo Uustalu , Niccolò Veltrì

We introduce and study Hopf monads on autonomous categories (i.e., monoidal categories with duals). Hopf monads generalize Hopf algebras to a non-braided (and non-linear) setting. Indeed, any monoidal adjunction between autonomous…

Quantum Algebra · Mathematics 2007-05-23 Alain Bruguières , Alexis Virelizier

We study lax functors between bicategories as a generalized concept of monads and describe generalized notions and theorems of formal monad theory for lax functors. Our first approach is to use the 2-monad whose lax algebras are lax…

Category Theory · Mathematics 2024-09-20 Kengo Hirata

It is shown that the multiplicative monoids of Temperley-Lieb algebras generated out of the basis are isomorphic to monoids of endomorphisms in categories where an endofunctor is adjoint to itself. Such a self-adjunction is found in a…

Geometric Topology · Mathematics 2008-07-10 K. Dosen , Z. Petric

Given a monoidal adjunction, we show that the right adjoint induces a braided lax monoidal functor between the corresponding Drinfeld centers provided that certain natural transformations, called projection formula morphisms, are…

Category Theory · Mathematics 2024-02-16 Johannes Flake , Robert Laugwitz , Sebastian Posur

We give a 3-categorical, purely formal argument explaining why on the category of Kleisli algebras for a lax monoidal monad, and dually on the category of Eilenberg-Moore algebras for an oplax monoidal monad, we always have a natural…

Category Theory · Mathematics 2010-12-03 Marek Zawadowski

This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…

Formal Languages and Automata Theory · Computer Science 2024-07-04 Rafał Stefański
‹ Prev 1 2 3 10 Next ›