Di Giorgio, Alessandro;
Ghica, Dan R;
Zanasi, Fabio;
(2025)
Rewriting for Traced Monoidal Closed Categories.
In: Endrullis, Jörg and Tichy, Matthias, (eds.)
ICGT 2025: Lecture Notes in Computer Science.
(pp. pp. 24-43).
Springer, Cham: Cham, Switzerland.
![[thumbnail of paperICGT25.pdf]](https://discovery.ucl.ac.uk/style/images/fileicons/text.png) |
Text
paperICGT25.pdf - Accepted Version Access restricted to UCL open access staff until 14 June 2026. Download (642kB) |
Abstract
Traced monoidal closed categories are a model for higher-order functional computation. We develop a formal language of string diagrams for these categories, and a faithful interpretation in terms of certain hypergraphs. We then use the interpretation to show that string diagram rewriting can be implemented as double-pushout rewriting in a sound and complete way. Finally, we showcase our approach on the -calculus with explicit recursion.
| Type: | Proceedings paper |
|---|---|
| Title: | Rewriting for Traced Monoidal Closed Categories |
| Event: | Graph Transformation (ICGT 2025) |
| ISBN-13: | 9783031947056 |
| DOI: | 10.1007/978-3-031-94706-3_2 |
| Publisher version: | https://doi.org/10.1007/978-3-031-94706-3_2 |
| Language: | English |
| Additional information: | This version is the author-accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | String diagrams, Hypergraphs, Rewriting |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10211429 |
Archive Staff Only
 |
View Item |
