Term-graph rewriting in Tom using relative positions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Term-graph rewriting in Tom using relative positions

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.
Fichier principal
Vignette du fichier
termgraph.pdf (183.2 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00129515 , version 1 (07-02-2007)

Identifiers

  • HAL Id : inria-00129515 , version 1

Cite

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⟩
95 View
165 Download

Share

Gmail Mastodon Facebook X LinkedIn More