Abstract
This paper develops a formal string diagram language for monoidal closed categories. Previous work has shown that string diagrams for freely generated symmetric monoidal categories can be viewed as hypergraphs with interfaces, and the axioms of these categories can be realized by rewriting systems. This work proposes hierarchical hypergraphs as a suitable formalization of string diagrams for monoidal closed categories. We then show double pushout rewriting captures the axioms of these closed categories.
| Original language | English |
|---|---|
| Title of host publication | 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022) |
| Editors | Amy P. Felty |
| Publisher | Schloss Dagstuhl |
| Number of pages | 20 |
| ISBN (Electronic) | 9783959772334 |
| DOIs | |
| Publication status | Published - 28 Jun 2022 |
| Event | 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 - Haifa, Israel Duration: 2 Aug 2022 → 5 Aug 2022 |
Publication series
| Name | Leibniz international proceedings in informatics |
|---|---|
| Volume | 228 |
| ISSN (Electronic) | 1868-8969 |
Conference
| Conference | 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 |
|---|---|
| Country/Territory | Israel |
| City | Haifa |
| Period | 2/08/22 → 5/08/22 |
Bibliographical note
Funding Information:Funding This work was supported by the Engineering and Physical Sciences Research Council [grant numbers EP/V001612/1 and EP/V002376/1].
Publisher Copyright:
© Mario Alvarez-Picallo, Dan Ghica, David Sprunger, and Fabio Zanasi
Keywords
- hierarchical hypergraph
- monoidal closed category
- rewriting
- string diagrams
ASJC Scopus subject areas
- Software