Name
Abstract | ||
|---|---|---|
Jungle evaluation is proposed as a new graph rewriting approach to the evaluation of functional expressions and, in particular, of algebraically specified operations. Jungles — being intuitively forests of coalesced trees with shared substructures — are certain acyclic hypergraphs (or equivalently, bipartite graphs) the nodes and edges of which are labeled with the sorts and operation symbols of a signature. Jungles are manipulated and evaluated by the application of jungle rewrite rules, which generalize equations or, more exactly, term rewrite rules. Indeed, jungle evaluation turns out to be a compromise between term rewriting and graph rewriting displaying some favorable properties: the inefficiency of term rewriting is partly avoided while the possibility of structural induction is maintained, and a good part of the existing graph grammar theory is applicable so that there is some hope that the rich theory of term rewriting is not lost forever without a substitute. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/3-540-50325-0_5 | ADT |
Keywords | DocType | Volume |
jungle evaluation | Journal | 15 |
Issue | ISBN | Citations |
1 | 0-387-50325-0 | 11 |
PageRank | References | Authors |
1.31 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Annegret Habel | 1 | 234 | 23.18 |
| Hans-jörg Kreowski | 2 | 298 | 37.05 |
| Detlef Plump | 3 | 11 | 1.31 |