This artice is free to access.
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. © 2012 Springer-Verlag.
Rebout, M., Féraud, L., Marie-Magdeleine, L., & Soloviev, S. (2012). Computations in graph rewriting: Inductive types and pullbacks in DPO approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7054 LNCS, pp. 150–163). https://doi.org/10.1007/978-3-642-28038-2_12