%0 Conference Proceedings
%T Computations in Graph Rewriting: Inductive Types and Pullbacks in DPO Approach
%+ Institut de recherche en informatique de Toulouse (IRIT)
%+ Assistance à la Certification d’Applications DIstribuées et Embarquées (IRIT-ACADIE)
%A Rebout, Maxime
%A Féraud, Louis
%A Marie-Magdeleine, Lionel
%A Soloviev, Sergei
%Z Part 2: Modelling and Formal Methods in Software Development
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 4th Central and East European Conference on Software Engineering Techniques (CEESET)
%C Krakow, Poland
%Y David Hutchison
%Y Takeo Kanade
%Y Madhu Sudan
%Y Demetri Terzopoulos
%Y Doug Tygar
%Y Moshe Y. Vardi
%Y Gerhard Weikum
%Y Tomasz Szmuc
%Y Marcin Szpyrka
%Y Jaroslav Zendulka
%Y Josef Kittler
%Y Jon M. Kleinberg
%Y Friedemann Mattern
%Y John C. Mitchell
%Y Moni Naor
%Y Oscar Nierstrasz
%Y C. Pandu Rangan
%Y Bernhard Steffen
%I Springer
%3 Advances in Software Engineering Techniques
%V LNCS-7054
%P 150-163
%8 2009-10-12
%D 2009
%R 10.1007/978-3-642-28038-2_12
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 2
%2 https://inria.hal.science/hal-01527378/document
%2 https://inria.hal.science/hal-01527378/file/978-3-642-28038-2_12_Chapter.pdf
%L hal-01527378
%U https://inria.hal.science/hal-01527378
%~ UNIV-TLSE2
%~ UNIV-TLSE3
%~ CNRS
%~ UT1-CAPITOLE
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC2
%~ IFIP-LNCS-7054
%~ IFIP-CEESET
%~ IRIT
%~ IRIT-ACADIE
%~ IRIT-FSL
%~ TOULOUSE-INP
%~ UNIV-UT3
%~ UT3-INP
%~ UT3-TOULOUSEINP