Related papers: Rewriting modulo symmetric monoidal structure
We initiate the study of higher dimensional topological finiteness properties of monoids. This is done by developing the theory of monoids acting on CW complexes. For this we establish the foundations of $M$-equivariant homotopy theory…
When designing plans in engineering, it is often necessary to consider attributes associated to objects, e.g. the location of a robot. Our aim in this paper is to incorporate attributes into existing categorical formalisms for planning,…
We give an alternate conception of string diagrams as labeled 1-dimensional oriented cobordisms, the operad of which we denote by Cob/O, where O is the set of string labels. The axioms of traced (symmetric monoidal) categories are fully…
Encodings of term rewriting systems (TRSs) into graph rewriting systems usually lose global termination, meaning the encodings do not terminate on all graphs. A typical encoding of the terminating TRS rule a(b(x)) -> b(a(x)), for example,…
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids…
We present a Rocq library for monoidal categories, which includes a decision procedure for proving equality of morphisms as well as notations that make it possible to reason as if they were strict, inferring MacLane isomorphims…
This tutorial gives an advanced introduction to string diagrams and graph languages for higher-order computation. The subject matter develops in a principled way, starting from the two dimensional syntax of key categorical concepts such as…
Rewriting methods have been developed for the study of coherence for algebraic objects. This consists in starting with a convergent presentation, and expliciting a family of generating confluences to obtain a coherent presentation -- one…
Properties of morphisms represented by so-called 'string diagrams' of monoidal categories (and their braided and symmetric derivatives), mainly their resistance in value to isotopic deformation, have made the usage of graphical calculi…
A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…
A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of…
This is a draft of the textbook/monograph that presents computability theory using string diagrams. The introductory chapters have been taught as graduate and undergraduate courses and evolved through 8 years of lecture notes. The later…
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 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…
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:…
This paper is an extended abstract of an analysis of term rewriting where the terms in the rewrite rules as well as the term to be rewritten are compressed by a singleton tree grammar (STG). This form of compression is more general than…
Beginning with a review of the arguments leading to the so-called c=1 barrier in the continuum formulation of noncritical string theory, the pathology is then exhibited in a discretized version of the theory, formulated through dynamical…
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
We extend the notion of compositional associative rewriting as recently studied in the rule algebra framework literature to the setting of rewriting rules with conditions. Our methodology is category-theoretical in nature, where the…