{"title":"专著的代数特性和变换","authors":"Thierry Boy de la Tour","doi":"10.1016/j.tcs.2024.114939","DOIUrl":null,"url":null,"abstract":"<div><div>Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and many others, like E-graphs or ∞-graphs. The category of monographs share many properties with the categories of graph structures (algebras of monadic many-sorted signatures, equivalent to presheaf toposes), except that there is no terminal monograph. It is universal in the sense that its slice categories (or categories of typed monographs) are equivalent to the categories of graph structures. Type monographs thus emerge as a natural way of specifying graph structures. A detailed analysis of single and double pushout transformations of monographs is provided, and a notion of attributed typed monographs generalizing typed attributed E-graphs is analyzed w.r.t. attribute-preserving transformations.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1024 ","pages":"Article 114939"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algebraic properties and transformations of monographs\",\"authors\":\"Thierry Boy de la Tour\",\"doi\":\"10.1016/j.tcs.2024.114939\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and many others, like E-graphs or ∞-graphs. The category of monographs share many properties with the categories of graph structures (algebras of monadic many-sorted signatures, equivalent to presheaf toposes), except that there is no terminal monograph. It is universal in the sense that its slice categories (or categories of typed monographs) are equivalent to the categories of graph structures. Type monographs thus emerge as a natural way of specifying graph structures. A detailed analysis of single and double pushout transformations of monographs is provided, and a notion of attributed typed monographs generalizing typed attributed E-graphs is analyzed w.r.t. attribute-preserving transformations.</div></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1024 \",\"pages\":\"Article 114939\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0304397524005565\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005565","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
摘要
专著是一种类似图的结构,其有向边的长度不受限制,可以自由地相互毗邻。标准节点用长度为零的边表示。它们的绘制方式与标准图和许多其他图(如 E 图或∞图)一致。单论范畴与图结构范畴(单论多排序签名代数,等同于预设拓扑)有许多相同的性质,只是没有终端单论。从它的切片范畴(或类型专著范畴)等同于图结构范畴的意义上讲,它是通用的。因此,类型专著是指定图结构的一种自然方式。本文对专著的单推出和双推出变换进行了详细分析,并结合属性保留变换分析了归属类型专著的概念,该概念概括了类型化归属电子图。
Algebraic properties and transformations of monographs
Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and many others, like E-graphs or ∞-graphs. The category of monographs share many properties with the categories of graph structures (algebras of monadic many-sorted signatures, equivalent to presheaf toposes), except that there is no terminal monograph. It is universal in the sense that its slice categories (or categories of typed monographs) are equivalent to the categories of graph structures. Type monographs thus emerge as a natural way of specifying graph structures. A detailed analysis of single and double pushout transformations of monographs is provided, and a notion of attributed typed monographs generalizing typed attributed E-graphs is analyzed w.r.t. attribute-preserving transformations.
期刊介绍:
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.