Term-graph rewriting in Tom using relative positions

Emilie Balland 1 Paul Brauner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00129515
Contributor : Emilie Balland <>
Submitted on : Wednesday, February 7, 2007 - 5:18:02 PM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Long-term archiving on : Friday, September 21, 2012 - 11:13:17 AM

File

termgraph.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00129515, version 1

Collections

Citation

Emilie Balland, Paul Brauner. Term-graph rewriting in Tom using relative positions. 4th International Workshop on Computing with Terms and Graphs, Mar 2007, Braga, Portugal. pp.3-17. ⟨inria-00129515⟩

Share

Metrics

Record views

250

Files downloads

190