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 language | English |
|---|---|
| Title of host publication | Proceedings of WADT 2010, 20th International Workshop on Algebraic Development Techniques |
| Publication date | 2010 |
| Pages | 54-56 |
| Publication status | Published - 2010 |
| Externally published | Yes |
| Event | 20th International Workshop on Algebraic Development Techniques - Schloss Etelsen, Germany Duration: 1 Jul 2010 → 4 Jul 2010 Conference number: 20 |
Conference
| Conference | 20th International Workshop on Algebraic Development Techniques |
|---|---|
| Number | 20 |
| Country | Germany |
| City | Schloss Etelsen |
| Period | 01/07/2010 → 04/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)