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

Maxime Rebout (1) , Louis Féraud (1) , Lionel Marie-Magdeleine (2) , Sergei Soloviev (2)

1 IRIT - Institut de recherche en informatique de Toulouse
2 IRIT-ACADIE - Assistance à la Certification d’Applications DIstribuées et Embarquées

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.

Domaines: Informatique [cs]

Maxime Rebout, Louis Féraud, Lionel Marie-Magdeleine, Sergei Soloviev. Computations in Graph Rewriting: Inductive Types and Pullbacks in DPO Approach. 4th Central and East European Conference on Software Engineering Techniques (CEESET), Oct 2009, Krakow, Poland. pp.150-163, ⟨10.1007/978-3-642-28038-2_12⟩. ⟨hal-01527378⟩