Implementing term rewriting by jungle evaluation

Berthold Hoffmann, Detlef Plump

RAIRO - Theoretical Informatics and Applications · 1991 · 48 citations · 4 references

DOIFull text

Open access

Concepts

Abstract

Jungles are acyclic hypergraphs which represent sets of terms such that common subterms can be shared. Term rewrite rules are translated into jungle valuation rules which implement parallel term rewriting steps. By using additional hypergraph rules which "fold" equal subterms, even non-left-linear term rewriting Systems can be implemented. As a side effect, these folding rules can speed up the valuation process considerably. It is shown that terminating term rewriting Systems resuit in terminating jungle valuation Systems which are capable to normalize every term. Moreover, confluent and terminating term rewriting Systems give rise to confluent and terminating jungle valuation Systems, provided that the "garbage" produced by the valuation steps is ignored.

References

4