A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Term-graph Rewriting in Tom Using Relative Positions
2008
Electronical Notes in Theoretical Computer Science
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. Definition 2.1 (Relative position)
doi:10.1016/j.entcs.2008.03.030
fatcat:jkkw4inc4bcivkwxuqtamqeuri