Name
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 partof the terms and not just meta-information about them. These paths are represented by words 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 are inspired by de Bruijn indexes.In this paper, we define an original framework called Referenced Term Rewriting where paths are used to represent pointers between subterms. Using this approach, any term-graph rewriting systems can be simulated using a term rewrite-based environment. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-70590-1_3 | RTA |
Keywords | Field | DocType |
main idea,original framework,term rewrite-based environment,first-order term,graph theory,de bruijn index,term-graph rewriting via explicit,relative address,classical notion,referenced term,indexation,first order | Graph theory,Integer,Discrete mathematics,Computer science,Algorithm,Canonical form,Graph rewriting,Confluence,Rewriting,Abstract semantic graph,De Bruijn sequence | Conference |
Volume | ISSN | Citations |
5117 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 15 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emilie Balland | 1 | 233 | 14.22 |
| Pierre-etienne Moreau | 2 | 598 | 40.40 |