License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2022.29
URN: urn:nbn:de:0030-drops-163108
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16310/
Alvarez-Picallo, Mario ;
Ghica, Dan ;
Sprunger, David ;
Zanasi, Fabio
Rewriting for Monoidal Closed Categories
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.
BibTeX - Entry
@InProceedings{alvarezpicallo_et_al:LIPIcs.FSCD.2022.29,
author = {Alvarez-Picallo, Mario and Ghica, Dan and Sprunger, David and Zanasi, Fabio},
title = {{Rewriting for Monoidal Closed Categories}},
booktitle = {7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)},
pages = {29:1--29:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-233-4},
ISSN = {1868-8969},
year = {2022},
volume = {228},
editor = {Felty, Amy P.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16310},
URN = {urn:nbn:de:0030-drops-163108},
doi = {10.4230/LIPIcs.FSCD.2022.29},
annote = {Keywords: string diagrams, rewriting, hierarchical hypergraph, monoidal closed category}
}
|
Keywords: |
|
string diagrams, rewriting, hierarchical hypergraph, monoidal closed category |
|
Collection: |
|
7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
28.06.2022 |
