A Critical Pair Enumeration Algorithm for String Diagram Rewriting
This paper presents and proves the correctness of an algorithm that automates critical pair analysis for string diagram rewriting in symmetric monoidal categories (without Frobenius structure) by enumerating all critical pairs through concrete hypergraph manipulation.
Anna Matsui (Johns Hopkins University, USA), Innocent Obi (University of Washington, USA), Guillaume Sabbagh (University of Technology of Compiègne, France), Leo Torres (Universidad Nacional de Còrdoba, Argentina), Diana Kessler (Tallinn University of Technology, Estonia), Juan F. Meleiro (University of São Paulo, Brazil), Koko Muroya (National Institute of Informatics, Japan,Ochanomizu University, Japan)Wed, 11 Ma🔢 math