Any views expressed within media held on this service are those of the contributors, should not be taken as approved or endorsed by the University, and do not necessarily reflect the views of the University in respect of any particular issue.

Upcoming paper: Rewriting for monoidal closed categories at FSCD 2022

Rewriting for monoidal closed categories

David SprungerDan GhicaFabio Zanasi and Mario Alvarez-Picallo. 

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.

Report this page

To report inappropriate content on this page, please use the form below. Upon receiving your report, we will be in touch as per the Take Down Policy of the service.

Please note that personal data collected through this form is used and stored for the purposes of processing this report and communication with you.

If you are unable to report a concern about content via this form please contact the Service Owner.

Please enter an email address you wish to be contacted on. Please describe the unacceptable content in sufficient detail to allow us to locate it, and why you consider it to be unacceptable.
By submitting this report, you accept that it is accurate and that fraudulent or nuisance complaints may result in action by the University.