Computations in Graph Rewriting: Inductive Types and Pullbacks in DPO Approach

摘要

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 computa tions as well.