Monads with arities and their associated theories
arXiv:1101.3064 · doi:10.1016/j.jpaa.2012.02.039
Abstract
After a review of the concept of "monad with arities" we show that the category of algebras for such a monad has a canonical dense generator. This is used to extend the correspondence between finitary monads on sets and Lawvere's algebraic theories to a general correspondence between monads and theories for a given category with arities. As application we determine arities for the free groupoid monad on involutive graphs and recover the symmetric simplicial nerve characterisation of groupoids.
New introduction; Section 1 shortened and redispatched with Section 2; Subsections on symmetric operads (3.14) and symmetric simplicial sets (4.17) added; Bibliography completed
References in corpus (1)
Cited by in corpus (35)
- Monads need not be endofunctors
- Decomposition spaces, incidence algebras and Möbius inversion I: basic theory
- The algebra of entanglement and the geometry of composition
- Decomposition spaces, incidence algebras and Möbius inversion II: completeness, length filtration, and finiteness
- From operator categories to topological operads
- Monads and theories
- Decomposition spaces, incidence algebras and Möbius inversion III: the decomposition space of Möbius intervals
- Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory
- Enriched algebraic theories and monads for a system of arities
- Modular operads and the nerve theorem
- Multitensor lifting and strictly unital higher category theory
- A homotopy coherent cellular nerve for bicategories
- Multitensors as monads on categories of enriched graphs
- Higher cyclic operads
- -Operads as Analytic Monads
- Regular polygraphs and the Simpson conjecture
- Simplicial spaces, lax algebras and the 2-Segal condition
- Rigidification of higher categorical structures
- Structure and Semantics
- Graphical combinatorics and a distributive law for modular operads
- The Next 700 Relational Program Logics
- Globular weak -categories as models of a type theory
- Computads for weak -categories as an inductive type
- Free decomposition spaces
- Completeness for monads and theories
- Segal conditions for generalized operads
- Brauer diagrams, modular operads, and a graphical nerve theorem for circuit algebras
- From dependent type theory to higher algebraic structures
- Combinatorial structure of type dependency
- Partial groups as symmetric simplicial sets
- Logical Relations as Types: Proof-Relevant Parametricity for Program Modules
- Clones of pigmented words and realizations of special classes of monoids
- What is a monoid?
- Lawvere theories, finitary monads and Cauchy-completion
- Factorization systems in -categories