Computations in Graph Rewriting: Inductive Types and Pullbacks in DPO Approach - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

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

(1) , (1) , (2) , (2)
1
2

Abstract

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.
Fichier principal
Vignette du fichier
978-3-642-28038-2_12_Chapter.pdf (1.59 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01527378 , version 1 (24-05-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
234 View
70 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More