Computations in graph rewriting: inductive types and pullbacks in DPO approach

Authors:
Maxime Rebout;Louis Féraud;Lionel Marie-Magdeleine;Sergei Soloviev
Affiliations:
IRIT, Université Paul Sabatier, Toulouse cedex 9, France;IRIT, Université Paul Sabatier, Toulouse cedex 9, France;IRIT, Université Paul Sabatier, Toulouse cedex 9, France;IRIT, Université Paul Sabatier, Toulouse cedex 9, France
Venue:
CEE-SET'09 Proceedings of the 4th IFIP TC 2 Central and East European conference on Advances in Software Engineering Techniques
Year:
2009

Citing 9
Cited 0

Graph grammars with negative application conditions

Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
AToM3: A Tool for Multi-formalism and Meta-modelling

FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
Forwarding in Attribute Grammars for Modular Language Design

CC '02 Proceedings of the 11th International Conference on Compiler Construction
Introduction to the Algebraic Theory of Graph Grammars (A Survey)

Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Isomorphisms of simple inductive types through extensional rewriting

Mathematical Structures in Computer Science
ATL: A model transformation tool

Science of Computer Programming
A unified categorical approach for attributed graph rewriting

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Model transformations in practice workshop

MoDELS'05 Proceedings of the 2005 international conference on Satellite Events at the MoDELS

Quantified Score

Hi-index	0.00

Visualization

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.