论文标题
促进和可扩展的comoNAD
Propification and the Scalable Comonad
论文作者
论文摘要
字符串图可以很好地表达对称严格单体类别（SSMC）中的众多计算。完全准确地说，仅对道具：ssmcs的物体是免费的。在本文中，我们展示了一种促进定理，该理论断言任何SSMC在彩色道具上都相当于彩色道具。结果，所有SSMC均在图形方法的范围内。我们介绍了官僚同构的示意分子，使我们能够处理以图形方式的对象的无用单体。我们还将这种结构与以前引入的可扩展符号联系起来，以解决大规模的图形推理。
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.
