Author:
Habel Annegret,Plump Detlef
Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. A needed narrowing strategy;Antoy;Journal of the ACM,2000
2. “Term Rewriting and All That,”;Baader,1998
3. Narrowing strategies for arbitrary canonical rewrite systems;Bockmayr;Fundamenta Informaticae,1995
4. Corradini A. and D. Wolz, Jungle rewriting: an abstract description of a lazy narrowing machine, in: Graph Transformations in Computer Science, Lecture Notes in Computer Science 776 (1994), pp. 119–137.
5. Echahed R., and J.-C. Janodet, Admissible graph rewriting and narrowing, in: Proc. of Joint International Conference and Symposium on Logic Programming (JICSLP'98) (1998), pp. 325–342.