The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, redundant rewrite steps are avoided, and the termination behavior of a term-rewriting system can be improved. Some transformations of rewrite rules enable an implementation using the same primitives as an implementation of eager rewriting.
|Number of pages||42|
|Journal||ACM Transactions on Programming Languages and Systems|
|Publication status||Published - 1 Jan 2000|
- D.3.4 [Programming Languages]: Processors - Compilers
- Innermost reduction
- Lazy rewriting
- Specificity ordering