String Diagram Rewrite Theory III: Confluence with and without Frobenius

09/13/2021
by   Filippo Bonchi, et al.
0

In this paper we address the problem of proving confluence for string diagram rewriting, which was previously shown to be characterised combinatorically as double-pushout rewriting with interfaces (DPOI) on (labelled) hypergraphs. For standard DPO rewriting without interfaces, confluence for terminating rewrite systems is, in general, undecidable. Nevertheless, we show here that confluence for DPOI, and hence string diagram rewriting, is decidable. We apply this result to give effective procedures for deciding local confluence of symmetric monoidal theories with and without Frobenius structure by critical pair analysis. For the latter, we introduce the new notion of path joinability for critical pairs, which enables finitely many joins of a critical pair to be lifted to an arbitrary context in spite of the strong non-local constraints placed on rewriting in a generic symmetric monoidal theory.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/08/2022

String Diagram Rewriting Modulo Commutative Monoid Structure

We characterise freely generated props with a chosen commutative monoid ...
04/29/2021

String Diagram Rewrite Theory II: Rewriting with Symmetric Monoidal Structure

Symmetric monoidal theories (SMTs) generalise algebraic theories in a wa...
04/16/2020

Completeness of Nominal PROPs

We introduce nominal string diagrams as string diagrams internal in the ...
03/01/2012

Pictures of Processes: Automated Graph Rewriting for Monoidal Categories and Applications to Quantum Computing

This work is about diagrammatic languages, how they can be represented, ...
04/17/2022

Intelligent Explorations of the String Theory Landscape

The goal of identifying the Standard Model of particle physics and its e...
05/28/2019

Confluence by Critical Pair Analysis Revisited (Extended Version)

We present two methods for proving confluence of left-linear term rewrit...
12/11/2021

CertiStr: A Certified String Solver (technical report)

Theories over strings are among the most heavily researched logical theo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.