Term-graph Rewriting in Tom Using Relative Positions

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.

• Type: Journal
• Year: 2008
• Where: ENTCS
• Authors: Emilie Balland, Paul Brauner
• Keywords: Algebraic Signature, ENTCS 2008, Pattern Matching, Well-suited Environment