Related papers: Rewriting techniques for relative coherence
The goal of this paper is to prove coherence results with respect to relational graphs for monoidal endofunctors, i.e. endofunctors of a monoidal category that preserve the monoidal structure up to a natural transformation that need not be…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
Quantum coherence, as a direct manifestation of the quantum superposition principle, is a crucial resource in quantum information processing. Block coherence resource theory generalizes the traditional coherence framework by defining…
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…
We introduce a general theory of quantitative and metric rewriting systems, namely systems with a rewriting relation enriched over quantales modelling abstract quantities. We develop theories of abstract and term-based systems, refining…
In this paper, we introduce a rewriting theory of linear monoidal categories. Those categories are a particular case of what we will define as linear (n, p)-categories. We will also define linear (n, p)-polygraphs, a linear adapation of…
The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear logic. Analogous graphs occur in Kelly's and Mac Lane's…
In this paper we adapt previous work on rewriting string diagrams using hypergraphs to the case where the underlying category has a traced comonoid structure, in which wires can be forked and the outputs of a morphism can be connected to…
Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are…
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…
Narrowing is a well-known technique that adds to term rewriting mechanisms the required power to search for solutions to equational problems. Rewriting and narrowing are well-studied in first-order term languages, but several problems…
We establish two versions of a central theorem, the Family Colimit Theorem, for the coarse coherence property of metric spaces. This is a coarse geometric property and so is well-defined for finitely generated groups with word metrics. It…
We provide a characterisation of strong bisimilarity in a fragment of CCS that contains only prefix, parallel composition, synchronisation and a limited form of replication. The characterisation is not an axiomatisation, but is instead…
We introduce cosurfaces with values in the group \(\PC_n(H)\) of \(H\)-valued reciprocal pairwise comparison matrices. The composition law is covariant on upper triangular coefficients and contravariant on lower triangular coefficients,…
Indexed symmetric monoidal categories are an important refinement of bicategories -- this structure underlies several familiar bicategories, including the homotopy bicategory of parametrized spectra, and its equivariant and fiberwise…
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving…
The concept of a system has proliferated through natural and social sciences. While myriad theories of systems exist, there is no mathematical general theory of systems. In this thesis, we take a first step towards formulating such a…
The category of coherent sheaves over a noetherian scheme is very important for studying the properties of a given scheme. For noetherian schemes it is a well-known fact that the topology can be fully recovered from the corresponding…
When can two sequential steps performed by a computing device be considered (causally) independent? This is a relevant question for concurrent and distributed systems, since independence means that they could be executed in any order, and…