E. Ohlebusch. Modularity of termination for disjoint term graph rewrite systems: A simple proof. Bulletin of the European Association for Theoretical Computer Science, 66:171--177, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Term Graph Rewriting - Plump (1998) (21 citations) (Correct)
....while [85,94,60,15,37,64, 32] also consider cyclic graphs. By equipping function symbols with additional labels, sharing of different occurrences of a subterm in a term can be expressed through identical labels. Such labelled terms correspond to acyclic term graphs and have been studied in [77,75,83,84]. In [36,4,2,68] systems of recursion equations realize finite and infinite terms with sharing. As to the complexity of collapsing, arbitrary term graphs can be made fully collapsed in time O(n log n) where n is the size of term graphs. This bound reduces to O(n) for term graphs over finite ....
....side. In this form the result generalizes Theorem 1.6.5. Bibliographic Notes Theorem 1.6. 5 was established in the framework of jungle evaluation, a proof for the present setting can be found in [91] A short proof for the special case that R 0 and R 1 have disjoint function symbols is given in [84] (in an approach based on terms with labels) A result even more general than Theorem 1.6.8 (and its extension) is presented in [72,73] but we refrain from stating it because of its technically involved premise. In [73] one can also find a condition more general then ....
Enno Ohlebusch. Modularity of termination for disjoint term graph rewrite systems: A simple proof. EATCS Bulletin, 66:171--177, 1998.
A Uniform Framework for Term and Graph Rewriting Applied to.. - Ohlebusch Self-citation (Ohlebusch) (Correct)
....evaluation. Kurihara and Ohuchi [KO95] obtained the same result for noncopying rewriting. Here we only deal with disjoint systems; for results on more general kinds of combinations, the reader is referred to [Plu91, KO95, KR98, Plu98] A simpler proof for both results has been presented in [Ohl98] The simple proof uses essentially the same ideas as that of [Ohl93] and it shows that there is a very close relationship between nonduplicating term rewriting and graph rewriting. We will take this one step further. In the uniform framework of term, graph, and noncopying rewriting, it is ....
E. Ohlebusch. Modularity of termination for disjoint term graph rewrite systems: A simple proof. Bulletin of the European Association for Theoretical Computer Science, 66:171--177, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC