Related papers: On Structuring Functional Programs with Monoidal P…
We extend the free cornering of a symmetric monoidal category, a double categorical model of concurrent interaction, to support branching communication protocols and iterated communication protocols. We validate our constructions by showing…
This monograph is a study of the category of polynomial endofunctors on the category of sets and its applications to modeling interaction protocols and dynamical systems. We assume basic categorical background and build the categorical…
The category of (colored) props is an enhancement of the category of colored operads, and thus of the category of small categories. The titular category has nice formal properties: it is bicomplete and is a symmetric monoidal category, with…
The functional programming paradigm has a long and storied history, with its beginnings in the Lambda Calculus. In recent decades, pure functional languages such as Haskell have been shown to be highly effective in producing robust software…
We establish a correspondence between modules and spans of algebras within a general monoidal 2-category $\mathfrak{C}$. Specifically, for an algebra $A$ in $\mathfrak{C}$, we construct a normalized lax 3-functor from the 2-category of…
Functionals are an important research subject in Mathematics and Computer Science as well as a challenge in Information Technologies where the current programming paradigm states that only symbolic computations are possible on higher order…
CONTEXT: Data accessors allow one to read and write components of a data structure, such as the fields of a record, the variants of a union, or the elements of a container. These data accessors are collectively known as optics; they are…
The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…
Fong developed `decorated cospans' to model various kinds of open systems: that is, systems with inputs and outputs. In this framework, open systems are seen as the morphisms of a category and can be composed as such, allowing larger open…
We systematically develop the theory of definable functors between compactly generated triangulated categories. Such functors preserve pure triangles, pure injective objects, and definable subcategories, and as such appear in a wide range…
This paper is the first step in a general program for defining cocalculus towers of functors via sequences of compatible monads. Goodwillie's calculus of homotopy functors inspired many new functor calculi in a wide range of contexts in…
We introduce a bicategorical model of linear logic which is a novel variation of the bicategory of groupoids, profunctors, and natural transformations. Our model is obtained by endowing groupoids with additional structure, called a kit, to…
We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…
Modular functors, i.e. consistent systems of projective representations of mapping class groups of surfaces, have been constructed for non-semisimple modular categories already decades ago. Concepts from homological algebra have not been…
We study the monoidal structure of the standard strictification functor $\textrm{st}:\mathbf{Bicat} \rightarrow \mathbf{2Cat}$. In doing so, we construct monoidal structures on the 2-category whose objects are bicategories and on the…
Categorical semantics of type theories are often characterized as structure-preserving functors. This is because in category theory both the syntax and the domain of interpretation are uniformly treated as structured categories, so that we…
We give a description of unital operads in a symmetric monoidal category as monoids in a monoidal category of unital $\Lambda$-sequences. This is a new variant of Kelly's old description of operads as monoids in the monoidal category of…
A number of domain specific languages, such as circuits or data-science workflows, are best expressed as diagrams of boxes connected by wires. Unfortunately, functional languages have traditionally been ill-equipped to embed this sort of…
This paper gives two new categorical characterisations of lenses: one as a coalgebra of the store comonad, and the other as a monoidal natural transformation on a category of a certain class of coalgebras. The store comonad of the first…
A semantic model enjoys full definability if every semantic element in the model is a denotation of some proof or program. Full definability indicates that the model captures programs and proofs in a highly detailed manner. This paper…