Related papers: Enriching Diagrams with Algebraic Operations
Braided-enriched monoidal categories were introduced in work of Morrison-Penneys, where they were characterized using braided central functors. Recent work of Kong-Yuan-Zhang-Zheng and Dell extended this characterization to an equivalence…
A popular graphical calculus for monoidal categories makes computations tactile and intuitive. Complicated diagram chases can be expressed in a few pictures and discovered by playing with a shoelace. Joyal and Street's proof of the…
We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic…
A representation of finite-dimensional probabilistic models in terms of formally real Jordan algebras is obtained, in a strikingly easy way, from simple assumptions. This provides a framework in which real, complex and quaternionic quantum…
We define a higher-order generalisation of the CPM construction based on arbitrary finite abelian group symmetries of symmetric monoidal categories. We show that our new construction is functorial, and that its closure under iteration can…
We develop a theory of weighted colimits in the framework of weakly bienriched $\infty$-categories, an extension of Lurie's notion of enriched $\infty$-categories. We prove an existence result for weighted colimits, study weighted colimits…
In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be…
In this paper, a monad-based denotational model is introduced and shown adequate for the Proto-Quipper family of calculi, themselves being idealized versions of the Quipper programming language. The use of a monadic approach allows us to…
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…
We construct model category structures for monoids and modules in symmetric monoidal model categories which satisfy an extra axiom, the monoidal axiom, with applications to symmetric spectra and $\Gamma$-spaces.
We introduce a novel compositional description of Feynman diagrams, with well-defined categorical semantics as morphisms in a dagger-compact category. Our chosen setting is suitable for infinite-dimensional diagrammatic reasoning,…
Involutive category theory provides a flexible framework to describe involutive structures on algebraic objects, such as anti-linear involutions on complex vector spaces. Motivated by the prominent role of involutions in quantum (field)…
In this paper, we introduce the notion of Grothendieck enriched categories for categories enriched over a sufficiently nice Grothendieck monoidal category $\mathcal{V}$, generalizing the classical notion of Grothendieck categories. Then we…
We investigate the phenomenon that "every monad is a linear state monad". We do this by studying a fully-complete state-passing translation from an impure call-by-value language to a new linear type theory: the enriched call-by-value…
This article represents a preliminary attempt to link Kan extensions, and some of their further developments, to Fourier theory and quantum algebra through *-autonomous monoidal categories and related structures.
Circuit algebras, used in the study of finite-type knot invariants, are a symmetric analogue of Jones's planar algebras. They are very closely related to circuit operads, which are a variation of modular operads admitting an extra monoidal…
The data for many useful bidirectional constructions in applied category theory (optics, learners, games, quantum combs) can be expressed in terms of diagrams containing "holes" or "incomplete parts", sometimes known as comb diagrams. We…
We define a notion of Koszul dual of a monoid object in a monoidal biclosed model category. Our construction generalizes the classic Yoneda algebra $Ext_A(k,k)$. We apply this general construction to define the Koszul dual of a category…
It is well-known that the category of Kleisli algebras for a monoidal monad carries a canonical monoidal structure. We define the notion of a commutative graded monad and present a strictly two-categorical proof that Kleisli algebras for…
Probability monads on categories of topological spaces are classical objects of study in the categorical approach to probability theory, with important applications in the semantics of probabilistic programming languages. We construct a…