In this paper, we give a new formalism for attributed graph rewrites resting on category theory and type theory. Our main goal is to offer a single theoretical foundation that embeds the rewrite of structural parts of graphs and attribute computations which has more expressive power for attribute computations as well.
Swipe to navigate through the chapters of this book
Please log in to get access to this content
To get access to this content you need the following product:
- Computations in Graph Rewriting: Inductive Types and Pullbacks in DPO Approach
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA