Related papers: Rewriting in Free Hypergraph Categories
Categorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories…
Process theories combine a graphical language for compositional reasoning with an underlying categorical semantics. They have been successfully applied to fields such as quantum computation, natural language processing, linear dynamical…
We demonstrate how category theory provides specifications that can efficiently be implemented via imperative algorithms and apply this to the field of graph rewriting. By examples, we show how this paradigm of software development makes it…
This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…
In this paper, we study rewriting modulo a set of algebraic axioms in categories enriched in linear categories, called linear~$(2,2)$-categories. We introduce the structure of linear~$(3,2)$-polygraph modulo as a presentation of a…
We prove that the arrow category of a monoidal model category, equipped with the pushout product monoidal structure and the projective model structure, is a monoidal model category. This answers a question posed by Mark Hovey, and has the…
We present an unbiased theory of symmetric multicategories, where sequences are replaced by families. To be effective, this approach requires an explicit consideration of indexing and reindexing of objects and arrows, handled by the double…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
Given an exact functor between triangulated categories which admits both adjoints and whose cotwist is either zero or an autoequivalence, we show how to associate a unique full triangulated subcategory of the codomain on which the functor…
Techniques from higher categories and higher-dimensional rewriting are becoming increasingly important for understanding the finer, computational properties of higher algebraic theories that arise, among other fields, in quantum…
In this article we investigate which categorical structures of a category C are inherited by its arrow category. In particular, we show that a monoidal equivalence between two categories gives rise to a monoidal equivalence between their…
This paper is a fundamental study of comodules and contramodules over a comonoid in a symmetric closed monoidal category. We study both algebraic and homotopical aspects of them. Algebraically, we enrich the comodule and contramodule…
We study categorical models for the unitless fragment of multiplicative linear logic. We find that the appropriate notion of model is a special kind of promonoidal category. Since the theory of promonoidal categories has not been developed…
Group-theoretical fusion categories are defined by data concerning finite groups and their cohomology: A finite group $G$ endowed with a three-cocycle $\omega$, and a subgroup $H\subset G$ endowed with a two-cochain whose coboundary is the…
A new approach is suggested to the problem of quantising causal sets, or topologies, or other such models for space-time (or space). The starting point is the observation that entities of this type can be regarded as objects in a category…
We give a characterization, in terms of simplicial sets, of Frobenius objects in the category of relations. This result generalizes a result of Heunen, Contreras, and Cattaneo showing that special dagger Frobenius objects in the category of…
We consider Frobenius algebras and their bimodules in certain abelian monoidal categories. In particular we study the Picard group of the category of bimodules over a Frobenius algebra, i.e. the group of isomorphism classes of invertible…
A coherent presentation of an n-category is a presentation by generators, relations and relations among relations. Confluent and terminating rewriting systems generate coherent presentations, whose relations among relations are defined by…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…
In this paper, we introduce monoidal rewriting systems (MRS), an abstraction of string rewriting in which reductions are defined over an arbitrary ambient monoid rather than a free monoid of words. This shift is partly motivated by logic:…