Algebraic Monograph Transformations
Thierry Boy de la Tour

TL;DR
This paper introduces monographs as a flexible graph-like structure, analyzing their transformations and generalizations, and establishing their categorical properties and relation to graph structures.
Contribution
It defines monographs and their transformations, explores their categorical properties, and generalizes typed attributed E-graphs within this framework.
Findings
Monographs are universal graph-like structures without a terminal object.
Detailed analysis of single and double pushout transformations of monographs.
Introduction of attributed typed monographs generalizing E-graphs.
Abstract
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), 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.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Model-Driven Software Engineering Techniques · semigroups and automata theory
