Related papers: Monoid Structures on Indexed Containers
We propose a new description of Endofunctors of Module Categories, based upon a combinatorial category comprising finite sets and so-called mazes. Polynomial and numerical functors both find a natural interpretation in this frame-work.…
Monoidal categories enriched in a braided monoidal category $\mathcal{V}$ are classified by braided oplax monoidal functors from $\mathcal{V}$ to the Drinfeld centers of ordinary monoidal categories. In this article, we prove that this…
Constructor theory is a meta-theoretic approach that seeks to characterise concrete theories of physics in terms of the (im)possibility to implement certain abstract "tasks" by means of physical processes. Process theory, on the other hand,…
If T is a commutative monad on a cartesian closed category, then there exists a natural T-bilinear pairing from T(X) times the space of T(1)-valued functions on X ("integration"), as well as a natural T-bilinear action on T(X) by the space…
We construct a monoidal category of open transition systems that generate material history as transitions unfold, which we call situated transition systems. The material history generated by a composite system is composed of the material…
We consider a closed symmetric monoidal category $\mathcal{M}$. We show that if $I$ is a small category then $\mathcal{M}^I$ is a closed $\mathcal{M}$-module. We rewrite the Yoneda Lemma in the case of monoidal valued functors. We derive an…
This paper develops the basics of the theory of involutive categories and shows that such categories provide the natural setting in which to describe involutive monoids. It is shown how categories of Eilenberg-Moore algebras of involutive…
We extend the theory of Sweeder's measuring comonoids to the framework of duoidal categories: categories equipped with two compatible monoidal structures. We use one of the tensor products to endow the category of monoids for the other with…
It is known that factorisation systems in categories can be viewed as unitary pseudo algebras for the "squaring" monad in Cat. We show in this note that an analogous fact holds for proper (i.e., epi-mono) factorisation systems and a…
We denote the monoidal bicategory of two-sided modules (also called profunctors, bimodules and distributors) between categories by $\mathrm{Mod}$; the tensor product is cartesian product of categories. For a groupoid $\scr{G}$, we study the…
We detail a construction of a symmetric monoidal structure, called the reduced tensor product on the 2-category of braided tensor categories $\mathbf{BTC}(\mathcal{A})$ containing a fixed symmetric fusion subcategory $\mathcal{A}$. The…
In this paper we study grouplike monoids, these are monoids that contain a group to which we add an ordered set of idempotents. We classify finite categories with two objects having grouplike endomorphism monoids, and we give a count of…
A general result relating skew monoidal structures and monads is proved. This is applied to quantum categories and bialgebroids. Ordinary categories are monads in the bicategory whose morphisms are spans between sets. Quantum categories…
We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…
We develop and extend the theory of Mackey functors as an application of enriched category theory. We define Mackey functors on a lextensive category $\E$ and investigate the properties of the category of Mackey functors on $\E$. We show…
Monads govern computational side-effects in programming semantics. They can be combined in a ''bottom-up'' way to handle several instances of such effects. Indexed monads and graded monads do this in a modular way. Here, instead, we equip…
We show that each rigid monoidal category A over a field defines a family of universal tensor categories, which together classify all faithful monoidal functors from A to tensor categories. Each of the universal tensor categories classifies…
Applied category theory often studies symmetric monoidal categories (SMCs) whose morphisms represent open systems. These structures naturally accommodate complex wiring patterns, leveraging (co)monoidal structures for splitting and merging…
We present a framework for compositional program verification based on polynomial functors in dependent type theory. In this framework, polynomial functors serve as program interfaces, Kleisli morphisms for the free monad monad serve as…
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…