Completeness of Nominal PROPs
-
Published:2023-01-26
Issue:
Volume:Volume 19, Issue 1
Page:
-
ISSN:1860-5974
-
Container-title:Logical Methods in Computer Science
-
language:en
-
Short-container-title:
Author:
Balco Samuel,Kurz Alexander
Abstract
We introduce nominal string diagrams as string diagrams internal in the
category of nominal sets. This leads us to define nominal PROPs and nominal
monoidal theories. We show that the categories of ordinary PROPs and nominal
PROPs are equivalent. This equivalence is then extended to symmetric monoidal
theories and nominal monoidal theories, which allows us to transfer
completeness results between ordinary and nominal calculi for string diagrams.
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science