Term-graph rewriting via explicit paths

Emilie Balland 1 Pierre-Etienne Moreau 1
1 PAREO - Formal islands: foundations and applications
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The notion of path is classical in graph theory but not directly used in the term rewriting community. The main idea of this work is to raise the notion of path to the level of first-order terms, i.e. paths become part of the terms and not just meta-information about them. These paths are represented by sequences of integers (positive or negative) and are interpreted as relative addresses in terms. In this way, paths can also be seen as a generalization of the classical notion of position for the first-order terms and of de Bruijn indexes for the lambda calculus. In this paper, we define an original framework called Addressed Term Rewriting where paths are used to represent pointers between subterms. Using this approach, any term-graph rewriting systems can be efficiently simulated using a rewrite-based environment.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/inria-00173535
Contributor : Emilie Balland <>
Submitted on : Saturday, April 26, 2008 - 12:28:42 PM
Last modification on : Thursday, January 11, 2018 - 6:22:10 AM
Long-term archiving on : Friday, November 25, 2016 - 10:36:47 PM

File

longversion.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00173535, version 4

Collections

Citation

Emilie Balland, Pierre-Etienne Moreau. Term-graph rewriting via explicit paths. RTA: International Conference on Rewriting Techniques and Applications, Jun 2008, Hagenberg, Austria. pp.32-47. ⟨inria-00173535v4⟩

Share

Metrics

Record views

341

Files downloads

175