The article discusses the notion of E-graphs, aiming to achieve an adhesive category composed of graphs featuring attributed nodes and edges, building on the concept of Typed Attributed Graph Transformations. This involves a data type algebra from which attributes, such as booleans and integers, are derived. The paper also introduces a theorem that generalizes a previous one, establishing an isomorphism between the category of attributed E-graphs and algebras of a specific attributed E-graph, emphasizing the condition of well-structured signatures.
The notion of E-graph aims to create an adhesive category of graphs with attributed nodes and edges based on Typed Attributed Graph Transformations.
The theorem established shows an isomorphism between attributed E-graphs and the category of algebras of an attributed E-graph, requiring well-structured signatures.
Collection
[
|
...
]