Related papers: Coend Optics for Quantum Combs
Optics, aka functional references, are classes of tools that allow composable access into compound data structures. Usually defined as programming language libraries, they provide combinators to manipulate different shapes of data such as…
We extend the bar-cobar adjunction to operads and properads, not necessarily augmented. Due to the default of augmentation, the objects of the dual category are endowed with a curvature. We handle the lack of augmentation by extending the…
Optics are bidirectional data accessors that capture data transformation patterns such as accessing subfields or iterating over containers. Profunctor optics are a particular choice of representation supporting modularity, meaning that we…
We propose a new framework for integrating quantifiers with other logical connectives in a higher-categorical setting. Our method systematically incorporates key coherence conditions-including those akin to the Beck-Chevalley property-and…
In this paper we propose a categorical theory of intensionality. We first revisit the notion of intensionality, and discuss we its relevance to logic and computer science. It turns out that 1-category theory is not the most appropriate…
In fairly elementary terms this paper presents, and expands upon, a recent result by Garner by which the notion of topologicity of a concrete functor is subsumed under the concept of total cocompleteness of enriched category theory.…
A coextensive category can be defined as a category $\mathcal{C}$ with finite products such that for each pair $X,Y$ of objects in $\mathcal{C}$, the canonical functor $\times\colon X/\mathcal{C} \times Y/\mathcal{C} \to (X \times…
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
Cofunctors are a kind of map between categories which lift morphisms along an object assignment. In this paper, we introduce cofunctors between categories enriched in a distributive monoidal category. We define a double category of enriched…
In this paper we propose an approach to homotopical algebra where the basic ingredient is a category with two classes of distinguished morphisms: strong and weak equivalences. These data determine the cofibrant objects by an extension…
In this paper we describe a comma 2-comonad on the 2-category whose objects are functors, 1-cell are colax squares and 2-cells are their transformations. We give a complete description of the Eilenberg-Moore 2-category of colax coalgebras,…
Prolongations of a group extension can be studied in a more general situation that we call group extensions of the co-type of a crossed module. Cohomology classification of such extensions is obtained by applying the obstruction theory of…
We extend the comatrix coring to the case of a quasi-finite bicomodule. We also generalize some of its interesting properties. We study equivalences between categories of comodules over rather general corings. We particularize to the case…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
Lenses may be characterised as objects in the category of algebras over a monad, however they are often understood instead as morphisms, which propagate updates between systems. Working internally to a category with pullbacks, we define…
A modern insight due to Quillen, which is further developed by Lurie, asserts that many cohomology theories of interest are particular cases of a single construction, which allows one to define cohomology groups in an abstract setting using…
A coextensive category can be defined as a category $\mathcal{C}$ with finite products such that for each pair $X,Y$ of objects in $\mathcal{C}$, the canonical functor $\times\colon X/\mathcal{C} \times Y/\mathcal{C} \to (X \times…
We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…
We propose a type-theoretic framework for describing and proving properties of quantum computations, in particular those presented as quantum circuits. Our proposal is based on an observation that, in the polymorphic type system of Coq,…
The idea of "summing over all intermediate states" that is central for implementing locality in quantum systems can be realized by coend constructions. In the concrete case of systems of conformal blocks for a certain class of conformal…