图的结构化和名义化表示
A Structural and Nominal Syntax for Diagrams
摘要:
monoidal范畴和图形语言之间的对应关系已经被广泛研究,导致在量子计算和通信,系统理论,电路设计等方面的应用。从分类的角度来看,图可以使用(无名称)组合子来指定,这些组合子具有优雅的等式属性。然而,用于图形结构的常规符号,诸如硬件描述语言(VHDL、Verilog)或图形语言(Dot),使用不同的风格,其是平面的、关系的并且依赖于名称(标签)的广泛使用。这样的语言不知道享受好的语法等式属性。然而,由于它们使得指定(和修改)任意图形结构相对容易,因此它们比组合子样式更受欢迎。在本文中,我们将展示如何在不改变语义和现有的等式理论的情况下,两种方法图语法可以调和和统一。此外,我们还对组合句法给出了合理而完整的等式理论。
英文摘要:
The correspondence between monoidal categories and graphical languages of diagrams has been studied extensively, leading to applications in quantum computing and communication, systems theory, circuit design and more. From the categorical perspective, diagrams can be specified using (name-free) combinators which enjoy elegant equational properties. However, conventional notations for diagrammatic structures, such as hardware description languages (VHDL, Verilog) or graph languages (Dot), use a different style, which is flat, relational, and reliant on extensive use of names (labels). Such languages are not known to enjoy nice syntactic equational properties. However, since they make it relatively easy to specify (and modify) arbitrary diagrammatic structures they are more popular than the combinator style. In this paper we show how the two approaches to diagram syntax can be reconciled and unified in a way that does not change the semantics and the existing equational theory. Additionally, we give sound and complete equational theories for the combined syntax.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。