inria-00129515, version 1
Term-graph rewriting in Tom using relative positions
4th International Workshop on Computing with Terms and Graphs 203 (2007) 3-17
Abstract: 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.
- 1:
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- Domain : Computer Science/Computation and Language
- inria-00129515, version 1
- http://hal.inria.fr/inria-00129515
- oai:hal.inria.fr:inria-00129515
- From:
- Submitted on: Wednesday, 7 February 2007 17:18:02
- Updated on: Friday, 6 May 2011 15:11:15


Associated documents
Export