Conditional term graph rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1298, Issue , 1997, Pages 144-158

  Ohlebusch, Enno ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

EXTRA VARIABLES; GRAPH REWRITING; RIGHT-HAND SIDES; SOUND AND COMPLETE; TERM GRAPH REWRITING; TERM REWRITING; TERM REWRITING SYSTEMS;

COMPUTER CIRCUITS;

EID: 0343422085     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0027008     Document Type: Conference Paper

References (14)

1. [AEH94] S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In Proc. 21st ACM Symposium on Principles of Programming Languages, pages 268-279, 1994.
2. +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. In Proc. Parallel Architectures and Languages Europe, pages 141-158. LNCS 259, 1987.
3. [BK86] J.A. Bergstra and J.W. Klop. Conditional Rewrite Rules: Confluence and Termination. Journal of Computer and System Sciences 32(3), pages 323-362, 1986.
4. [DJ90] N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6. Elsevier-The MIT Press, 1990.
5. [Han94a] M. Hanus. On Extra Variables in (Equational) Logic Programming. Technical Report MPI-I-94-246, Max-Plank-Institut für Informatik, 1994.
6. [Han94b] M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. The Journal of Logic Programming 19,20, pages 583-628, 1994.
7. [Han95] M. Hanus. On Extra Variables in (Equational) Logic Programming. In Proceedings of the 12th International Conference on Logic Programming, pages 665-679. MIT Press, 1995.
8. [Klo92] J.W. Klop. Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1-116. Oxford University Press, 1992.
9. [K095] M. Kurihara and A. Ohuchi. Modularity in Noncopying Term Rewriting. Theoretical Computer Science 152, pages 139-169, 1995.
10. [MH94] A. Middeldorp and E. Hamoen. Completeness Results for Basic Narrowing. Applicable Algebra in Engineering, Communication and Computing 5, pages 213-253, 1994.
11. [0'D77] M.J. O'Donnell. Computing in Systems Described by Equations. LNCS 58, 1977.
12. [Plu93] D. Plump. Evaluation of Functional Expressions by Hypergraph Rewriting. PhD thesis, Universität Bremen, 1993.
13. [SMI95] T. Suzuki, A. Middeldorp, and T. Ida. Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications, pages 179-193. LNCS 914, 1995.
14. [Sta75] J. Staples. Church-Rosser Theorems for Replacement Systems. In J. Crosley, editor, Algebra and Logic, pages 291-307. Lecture Notes in Mathematics 450, 1975.