Implementing term rewriting by jungle evaluation

 Access to full text

 Full (PDF)

1. [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. 
2. [DJ90] N. DERSHOWITZ and J.-P. JOUANNAUD, Rewrite Systems, Handbook of Theoretical Computer Science, Vol. B, chapter 15, North Holland, 1990. Zbl0900.68283MR1127191
3. [DM79] N. DERSHOWITZ and Z. MANNA, Proving Termination with Multiset Orderings, Comm. ACM, 1979, 22, (8), pp. 465-476. Zbl0431.68016MR540043
4. [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. Zbl0407.68072MR565034
5. [Ehr83] H. EHRIG, Aspects of Concurrency in Graph Grammars, Proc. 2nd Graph Grammar Workshop, Lecture Notes in Comp. Sci., 1983, 153, pp. 58-81. Zbl0522.68070
6. [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. Zbl0355.68053
7. [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. Zbl0661.68016
8. [Hof83] B. HOFFMANN, Compiler Generation: From Language Descriptions to Abstract Compilers, Dissertation, TU Berlin, 1983. 
9. [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. Zbl0708.68029MR987712
10. [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. Zbl0765.68008MR1076830
11. [KW87] H.-J. KREOWSKI and A. WILHARM, Is Parallelism Already Concurrency? Zbl0643.68024
12. - Part 2: Non-sequential Processes in Graph Grammars, Proc. 3rd Graph Grammar Workshop, Lecture Notes in Comput. Sci., 1987, 291, pp. 361-377. Zbl0643.68024
13. [Pad82] P. PADAWITZ, Graph Grammars and Operational Semantics, Theoret. Comput. Sci., 1982, 19, pp. 117-141. Zbl0486.68090MR666537
14. [Plu86] D. PLUMP, Im Dschungel: Ein neuer Graph-Grammatik-Ansatz zur effizienten Auswertung rekursiv definierter Funktionen, Diplomarbeit, Fachbereich Mathematik/Informatik, Universität Bremen, 1986. 
15. [Plu91] D. PLUMP, Graph-Reducible Term Rewriting Systems, Proc. 4th Graph Grammar Workshop, Lecture Notes in Comput. Sci., 1991 (to appear). Zbl0787.68058
16. [Rao84] J. C. RAOULT, On Graph Rewritings, Theoret. Comput. Sci., 32, 1984, pp. 1-24. Zbl0551.68065MR761158
17. [Sta80] J. STAPLES, Computations on Graph-like Expressions, Theoret.Comput.Sci., 1980, 10, pp. 171-185. Zbl0423.68007

1. Andrea Corradini, Fabio Gadducci, Rewriting on cyclic structures : equivalence between the operational and the categorical description
2. Andrea Corradini, Fabio Gadducci, Rewriting on cyclic structures: Equivalence between the operational and the categorical description