Alvarez-Picallo, M;
Ghica, D;
Sprunger, D;
Zanasi, F;
(2022)
Rewriting for Monoidal Closed Categories.
In:
7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022).
(pp. 29:1-29:20).
Schloss Dagstuhl – Leibniz-Zentrum für Informatik: Dagstuhl, Germany.
Preview |
Text
LIPIcs-FSCD-2022-29.pdf - Published Version Download (845kB) | Preview |
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.
| Type: | Proceedings paper |
|---|---|
| Title: | Rewriting for Monoidal Closed Categories |
| Event: | 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022) |
| ISBN-13: | 9783959772334 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.4230/LIPIcs.FSCD.2022.29 |
| Publisher version: | https://doi.org/10.4230/LIPIcs.FSCD.2022.29 |
| Language: | English |
| Additional information: | This is an Open Access paper published under a Creative Commons Attribution 4.0 International (CC BY 4.0) Licence (https://creativecommons.org/licenses/by/4.0/). |
| Keywords: | string diagrams, rewriting, hierarchical hypergraph, monoidal closed category |
| UCL classification: | UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science UCL > Provost and Vice Provost Offices > UCL BEAMS UCL |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10152839 |
Archive Staff Only
 |
View Item |
