Implementing term rewriting by jungle evaluation
Hoffmann, Berthold ; Plump, Detlef
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991), p. 445-472 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@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},
     volume = {25},
     year = {1991},
     pages = {445-472},
     mrnumber = {1144009},
     zbl = {0706.68061},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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) pp. 445-472. http://gdmltest.u-ga.fr/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 1127191 | Zbl 0900.68283

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

[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 565034 | Zbl 0407.68072

[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 0522.68070

[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 0355.68053

[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 0661.68016

[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 987712 | Zbl 0708.68029

[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 1076830 | Zbl 0765.68008

[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 0643.68024

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

[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 0787.68058

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

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