Essentials of term graph rewriting

Electronic Notes in Theoretical Computer Science

Volumn 51, Issue , 2002, Pages 277-289

  Plump, Detlef ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; DECISION THEORY; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; NUMBER THEORY; QUADRATIC PROGRAMMING; THEOREM PROVING;

FACTORIAL FUNCTIONS; GRAPH REWRITING; GRAPH TRANSFORMATIONS; NATURAL NUMBERS;

GRAPH THEORY;

EID: 19344365900     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80210-X     Document Type: Conference Paper

References (18)

1. Zena Ariola M., Klop Jan Willem, Plump Detlef. Bisimilarity in term graph rewriting. Information and Computation. 156:(1/2):2000;2-24
2. Baader Franz, Nipkow Tobias. Term Rewriting and All That. 1998;Cambridge University Press
3. Henk Barendregt, Marko van Eekelen, John Glauert, Richard Kennaway, Rinus Plasmeijer, and Ronan Sleep. Term graph rewriting. In Proc. Parallel Architectures and Languages Europe, volume 259 of Lecture Notes in Computer Science, pages 141-158. Springer-Verlag, 1987.
4. Dershowitz Nachum. Termination of rewriting. Journal of Symbolic Computation. 3:1987;69-116
5. Annegret Habel, Hans-Jörg Kreowski, and Detlef Plump. Jungle evaluation. In Proc. Recent Trends in Data Type Specification, volume 332 of Lecture Notes in Computer Science, pages 92-112. Springer-Verlag, 1988.
6. Berthold Hoffmann and Detlef Plump. Jungle evaluation for efficient term rewriting. In Proc. Algebraic and Logic Programming. Mathematical Research 49, pages 191-203, Berlin, 1988. Akademie-Verlag.
7. Also in Springer Lecture Notes in Computer Science 343, 191-203, 1989.
8. Hoffmann Berthold, Plump Detlef. Implementing term rewriting by jungle evaluation. RAIRO Theoretical Informatics and Applications. 25:(5):1991;445-472
9. Donald Knuth E., Peter Bendix B. Simple word problems in universal algebras. Leech J. Computational Problems in Abstract Algebras. 1970;263-297 Pergamon Press
10. Madala Krishna Rao R.K. Modular aspects of term graph rewriting. Theoretical Computer Science. 208:(1-2):1998;59-86
11. Detlef Plump. Implementing term rewriting by graph reduction: Termination of combined systems. In Proc. Conditional and Typed Rewriting Systems, volume 516 of Lecture Notes in Computer Science, pages 307-317. Springer-Verlag, 1991.
12. Detlef Plump. Collapsed tree rewriting: Completeness, confluence, and modularity. In Proc. Conditional Term Rewriting Systems, volume 656 of Lecture Notes in Computer Science, pages 97-112. Springer-Verlag, 1993.
13. Detlef Plump. Evaluation of Functional Expressions by Hypergraph Rewriting. Doctoral dissertation, Universität Bremen, Fachbereich Mathematik und Informatik, 1993.
14. Detlef Plump. Critical pairs in term graph rewriting. In Proc. Mathematical Foundations of Computer Science 1994, volume 841 of Lecture Notes in Computer Science, pages 556-566. Springer-Verlag, 1994.
15. Detlef Plump. Simplification orders for term graph rewriting. In Proc. Mathematical Foundations of Computer Science 1997, volume 1295 of Lecture Notes in Computer Science, pages 458-467. Springer-Verlag, 1997.
16. Plump Detlef. Term graph rewriting. Ehrig H., Engels G., Kreowski H.-J., Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 1. 1999;3-61 World Scientific
17. Toyama Yoshihito. Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters. 25:1987;141-143
18. Toyama Yoshihito. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM. 34:(1):1987;128-143