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

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01527378
Contributor : Hal Ifip <>
Submitted on : Wednesday, May 24, 2017 - 12:48:51 PM
Last modification on : Thursday, October 17, 2019 - 8:56:01 AM
Long-term archiving on : Monday, August 28, 2017 - 12:17:46 AM

File

978-3-642-28038-2_12_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

267

Files downloads

129