2012 | OriginalPaper | Chapter
Computations in Graph Rewriting: Inductive Types and Pullbacks in DPO Approach
Authors : Maxime Rebout, Louis Féraud, Lionel Marie-Magdeleine, Sergei Soloviev
Published in: Advances in Software Engineering Techniques
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.