Theoretical Computer Science
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Equational term graph rewriting
Fundamenta Informaticae - Special issue on graph transformations
Handbook of graph grammars and computing by graph transformation
Addressed term rewriting systems: application to a typed object calculus
Mathematical Structures in Computer Science
ESOP'07 Proceedings of the 16th European conference on Programming
A pattern matching compiler for multiple target languages
CC'03 Proceedings of the 12th international conference on Compiler construction
Narrowing data-structures with pointers
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.00 |
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern matching and traversal controls to Java, Tom is a well-suited environment for defining program transformations or analyses. As some analyses, e.g. based on control flow, require graph-like structures, the use of this formalism is a natural way of expressing them by graph rewriting.