Algebraic Monograph Transformations

by   Thierry Boy de la Tour, et al.

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. attribute-preserving transformations.


page 1

page 2

page 3

page 4


True Parallel Graph Transformations: an Algebraic Approach Based on Weak Spans

We address the problem of defining graph transformations by the simultan...

Probabilistic prototype models for attributed graphs

This contribution proposes a new approach towards developing a class of ...

Categorical Data Structures for Technical Computing

Many mathematical objects can be represented as functors from finitely-p...

Twisted Cubes and their Applications in Type Theory

This thesis captures the ongoing development of twisted cubes, which is ...

A Set-Theoretic Framework for Parallel Graph Rewriting

We tackle the problem of attributed graph transformations and propose a ...

Central Submonads and Notions of Computation

The notion of "centre" has been introduced for many algebraic structures...

Parallel Independence in Attributed Graph Rewriting

In order to define graph transformations by the simultaneous application...

Please sign up or login with your details

Forgot password? Click here to reset