Related papers: Categories and all that -- A Tutorial
We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…
We introduce the concept of cotensor coalgebra for a given bicomodule over a coalgebra in an abelian monoidal category. Under some further conditions we show that such a cotensor coalgebra exists and satisfies a meaningful universal…
We recognise Harada's generalized categories of diagrams as a particular case of modules over a monad defined on a finite direct product of additive categories. We work in the dual (albeit formally equivalent) situation, that is, with…
There are many category-theoretic notions of algebraic theory, including Lawvere theories, monads, PROPs and operads. The first central notion of this thesis is a common generalisation of these, which we call a proto-theory. In order to…
Let $A$ be a ring and $\M_A$ the category of $A$-modules. It is well known in module theory that for any $A $-bimodule $B$, $B$ is an $A$-ring if and only if the functor $-\otimes_A B: \M_A\to \M_A$ is a monad (or triple). Similarly, an $A…
We introduce contextads and the Ctx construction, unifying various structures and constructions in category theory dealing with context and contextful arrows -- comonads and their Kleisli construction, actegories and their Para…
We construct explicitly the weights on the simplicial category so that the colimits and limits of 2-functors with those weights provide the Kleisli objects and the Eilenberg-Moore objects, respectively, in any 2-category.
We study monoidal structures on the category of (co)modules over a weak bialgebra. Results due to Nill and Szlach\'anyi are unified and extended to infinite algebras. We discuss the coalgebra structure on the source and target space of a…
There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level…
We develop further the theory of monoidal bicategories by introducing and studying bicategorical counterparts of the notions of a linear exponential comonad, as considered in the study of linear logic, and of a codereliction transformation,…
We give an informal introduction to model categories, and treat three important examples in some details: the category of small categories, the category of dg algebras, and the category of small dg categories.
Fuhrmann introduced Abstract Kleisli structures to model call-by-value programming languages with side effects, and showed that they correspond to monads satisfying a certain equalising condition on the unit. We first extend this theory to…
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…
We study coalgebraic modal logic to characterise behavioural equivalence in the presence of side effects, i.e., when coalgebras live in a (co)Kleisli or an Eilenberg-Moore category. Our aim is to develop a general framework based on indexed…
We give an elementary introduction to the theory of triangulated categories covering their axioms, homological algebra in triangulated categories, triangulated subcategories, and Verdier localization. We try to use a minimal set of axioms…
Category theory provides a compact method of encoding mathematical structures in a uniform way, thereby enabling the use of general theorems on, for example, equivalence and universal constructions. In this article we develop the method of…
A quick overview of category theory and topos theory including slice categories, monics, epics, isos, diagrams, cones, cocones, limits, colimits, products and coproducts, pushouts and pullbacks, equalizers and coequalizers, initial and…
Monads are extensively used nowadays to abstractly model a wide range of computational effects such as nondeterminism, statefulness, and exceptions. It turns out that equipping a monad with a (uniform) iteration operator satisfying a set of…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
We present here definitions and constructions basic for the theory of monoidal and tensor categories. We provide references to the original sources, whenever possible. Group-theoretical categories are used as examples