Propification and the Scalable Comonad
From MaRDI portal
Publication:6399281
arXiv2205.07760MaRDI QIDQ6399281FDOQ6399281
Authors: Titouan Carette 
Publication date: 16 May 2022
Abstract: String diagrams can nicely express numerous computations in symmetric strict monoidal categories (SSMC). To be entirely exact, this is only true for props: the SSMCs whose monoid of objects are free. In this paper, we show a propification theorem asserting that any SSMC is monoidally equivalent to a coloured prop. As a consequence, all SSMCs are within reach of diagrammatical methods. We introduce a diagrammatical calculus of bureaucracy isomorphisms, allowing us to handle graphically non-free monoids of objects. We also connect this construction with the scalable notations previously introduced to tackle large-scale diagrammatic reasoning.
This page was built for publication: Propification and the Scalable Comonad
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6399281)
