Rewriting nested graphs, through term graphs

Roberto Bruni, Andrea Corradini, Fabio Gadducci, Alberto Lluch Lafuente, Ugo Montanari

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

We present an algebra for graphs with nesting and restriction features as a handy linear syntax for denoting a class of hierarchical graphs. We discuss how such graphs can be encoded into term graphs, showing that through this translation we can borrow definitions and results from the established theory of term graph rewriting.
Original languageEnglish
Title of host publicationProceedings of WADT 2010, 20th International Workshop on Algebraic Development Techniques
Publication date2010
Pages54-56
Publication statusPublished - 2010
Externally publishedYes
Event20th International Workshop on Algebraic Development Techniques - Schloss Etelsen, Germany
Duration: 1 Jul 20104 Jul 2010
Conference number: 20

Conference

Conference20th International Workshop on Algebraic Development Techniques
Number20
CountryGermany
CitySchloss Etelsen
Period01/07/201004/07/2010

Cite this

Bruni, R., Corradini, A., Gadducci, F., Lluch Lafuente, A., & Montanari, U. (2010). Rewriting nested graphs, through term graphs. In Proceedings of WADT 2010, 20th International Workshop on Algebraic Development Techniques (pp. 54-56)