Jungle evaluation for efficient term rewriting. (English) Zbl 0708.68029

Hoffmann, B.; Plump, P.

Algebraic and logic programming, Proc. Int. Workshop, Gaussig/GDR 1988, Lect. Notes Comput. Sci. 343, 191-203 (1989).

[For the entire collection see Zbl 0708.68001.]
The authors show how term rewrite rules can be translated into efficient jungle evaluation rules so that confluence and termination are presented. ‘Jungles’ are hypergraphs representing terms in a compact form.

Reviewer: M.Steinby

MSC:

68Q42	Grammars and rewriting systems
68Q45	Formal languages and automata

Keywords:

term rewriting; graph rewriting; graph grammars; confluence; termination

Citations:

Zbl 0708.68001