Related papers: Presenting Profunctors
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,…
Many visual scenes can be described as compositions of latent factors. Effective recognition, reasoning, and editing often require not only forming such compositional representations, but also solving the decomposition problem. One popular…
We give an explicit description of the generator of finitely presented objects of the coslice of a locally finitely presentable category under a given object, as consisting of all pushouts of finitely presented maps under this object. Then…
We identify morphisms of strong profunctors as a categorification of quantum supermaps. These black-box generalisations of diagrams-with-holes are hence placed within the broader field of profunctor optics, as morphisms in the category of…
A cyclic presentation of a group is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry. We characterise the orientable, non-orientable, and redundant cyclic presentations and obtain…
The purpose of this paper is to introduce the theory of presentations of monoids acts. We aim to construct `nice' general presentations for various act constructions pertaining to subacts and Rees quotients. More precisely, given an $M$-act…
Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for "eventually consistent" distributed querying, based on relational transducers. A tight link has been…
Stefanich generalized the notion of (locally) presentable $(\infty, 1)$-category to the notion of presentable $(\infty, n)$-category. We give a new description based on the new notion of $\kappa$-compactly generated $(\infty, n)$-category,…
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 review the close relationship between abstract machines for (call-by-name or call-by-value) lambda-calculi (extended with Felleisen's C) and sequent calculus, reintroducing on the way Curien-Herbelin's syntactic kit expressing the…
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…
We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…
We describe all fusion subcategories of the representation category of a twisted quantum double of a finite group. In view of the fact that every group-theoretical braided fusion category can be embedded into a representation category of a…
Coherence is here demonstrated for sesquicartesian categories, which are categories with nonempty finite products and arbitrary finite sums, including the empty sum, where moreover the first and the second projection from the product of the…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…
A notion of a coring extension is defined and it is related to the existence of an additive functor between comodule categories that factorises through forgetful functors. This correspondence between coring extensions and factorisable…
We consider profunctors $f : P \promap Q$ between posets and introduce their {\em graph} and {\em ascent}. The profunctors $\Pro(P,Q)$ form themselves a poset, and we consider a partition $\cI \sqcup \cF$ of this into a down-set $\cI$ and…
Tangent categories are categories equipped with a tangent functor: an endofunctor with certain natural transformations which make it behave like the tangent bundle functor on the category of smooth manifolds. They provide an abstract…
We compare two possible ways of defining a category of 1-combs, the first intensionally as coend optics and the second extensionally as a quotient by the operational behaviour of 1-combs on lower-order maps. We show that there is a full and…