no. 5
Implementing term rewriting by jungle evaluation
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 5, pp. 445-472. 
@article{ITA_1991__25_5_445_0,
     author = {Hoffmann, Berthold and Plump, Detlef},
     title = {Implementing term rewriting by jungle evaluation},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {445--472},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {5},
     year = {1991},
     mrnumber = {1144009},
     zbl = {0706.68061},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1991__25_5_445_0/}
}
TY  - JOUR
AU  - Hoffmann, Berthold
AU  - Plump, Detlef
TI  - Implementing term rewriting by jungle evaluation
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1991
SP  - 445
EP  - 472
VL  - 25
IS  - 5
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1991__25_5_445_0/
LA  - en
ID  - ITA_1991__25_5_445_0
ER  - 
%0 Journal Article
%A Hoffmann, Berthold
%A Plump, Detlef
%T Implementing term rewriting by jungle evaluation
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 445-472
%V 25
%N 5
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1991__25_5_445_0/
%G en
%F ITA_1991__25_5_445_0
Hoffmann, Berthold; Plump, Detlef. Implementing term rewriting by jungle evaluation. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 5, pp. 445-472. http://www.numdam.org/item/ITA_1991__25_5_445_0/

[BvEG*87] H. P. Barendregt, M. C. J. D. Van Eekelen, J. R. W. Glauert, J. R. Kennaway, M. J. Plasmeijer and M. R. Sleep, Term Graph Rewriting, Proc, PARLE, Lecture Notes in Comp. Sci., 1987, 259, pp. 141-158.

[DJ90] N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science, Vol. B, chapter 15, North Holland, 1990. | MR | Zbl

[DM79] N. Dershowitz and Z. Manna, Proving Termination with Multiset Orderings, Comm. ACM, 1979, 22, (8), pp. 465-476. | MR | Zbl

[Ehr79] H. Ehrig, Introduction to the Algebraic Theory of Graph Grammars, Proc. 1st Graph Grammar Workshop, Lecture Notes in Comp. Sci., 1979, 73, pp. 1-69. | MR | Zbl

[Ehr83] H. Ehrig, Aspects of Concurrency in Graph Grammars, Proc. 2nd Graph Grammar Workshop, Lecture Notes in Comp. Sci., 1983, 153, pp. 58-81. | Zbl

[ER76] H. Ehrig and B. K. Rosen, Commutativity of Independent Transformations on Complex Objects, Research Report RC 6251, IBM T. J. Watson Research Center, Yorktown Heights, 1976. | Zbl

[HKP88] A. Habel, H.-J. Kreowski and D. Plump, Jungle Evaluation, Proc. Fifth Workshop on Specification of Abstract Data Types. Lecture Notes in Comput. Sci., 1988, 332, pp. 92-112. Revised version to appear in Fundamentae Informaticae. | Zbl

[Hof83] B. Hoffmann, Compiler Generation: From Language Descriptions to Abstract Compilers, Dissertation, TU Berlin, 1983.

[HP88] B. Hoffmann and D. Plump, Jungle Evaluation for Efficient Term Rewriting, Proc. Algebraic and Logic Programming, Lecture Notes in Comput. Sci., 1988, 343, pp. 191-203. | MR | Zbl

[Klo90] J. W. Klop, Term Rewriting Systems: from Church-Rosser to Knuth-Bendix and Beyond, Proc. ICALP'90, Lecture Notes in Comput. Sci., 1990, 443, pp. 350-369. | MR | Zbl

[KW87] H.-J. Kreowski and A. Wilharm, Is Parallelism Already Concurrency?

- Part 2: Non-sequential Processes in Graph Grammars, Proc. 3rd Graph Grammar Workshop, Lecture Notes in Comput. Sci., 1987, 291, pp. 361-377. | Zbl

[Pad82] P. Padawitz, Graph Grammars and Operational Semantics, Theoret. Comput. Sci., 1982, 19, pp. 117-141. | MR | Zbl

[Plu86] D. Plump, Im Dschungel: Ein neuer Graph-Grammatik-Ansatz zur effizienten Auswertung rekursiv definierter Funktionen, Diplomarbeit, Fachbereich Mathematik/Informatik, Universität Bremen, 1986.

[Plu91] D. Plump, Graph-Reducible Term Rewriting Systems, Proc. 4th Graph Grammar Workshop, Lecture Notes in Comput. Sci., 1991 (to appear). | Zbl

[Rao84] J. C. Raoult, On Graph Rewritings, Theoret. Comput. Sci., 32, 1984, pp. 1-24. | MR | Zbl

[Sta80] J. Staples, Computations on Graph-like Expressions, Theoret.Comput.Sci., 1980, 10, pp. 171-185. | Zbl