Completeness of Nominal PROPs
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 monoid...
Main Authors: | Samuel Balco, Alexander Kurz |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2023-01-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/6313/pdf |
Similar Items
-
Nominal Coalgebraic Data Types with Applications to Lambda Calculus
by: Alexander Kurz, et al.
Published: (2013-12-01) -
Modal Logics for Nominal Transition Systems
by: Joachim Parrow, et al.
Published: (2021-01-01) -
On Nominal Syntax and Permutation Fixed Points
by: Mauricio Ayala-Rincón, et al.
Published: (2020-02-01) -
From nominal to higher-order rewriting and back again
by: Jesús Domínguez, et al.
Published: (2015-12-01) -
Rule Formats for Nominal Process Calculi
by: Luca Aceto, et al.
Published: (2019-10-01)