Lazy rewriting on eager machinery

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2000 English Publisher:Association for Computing Machinery (ACM)Journal:ACM Transactions on Programming Languages and Systems, volume 22, pages 45-86 (issn: 0164-0925, eissn: 1558-4593,

Copyright policy )

Authors: Fokkink, Wan J.; Kamperman, Jasper F.Th; Walters, Pum;

doi: 10.1145/345099.345102

handle: 1871.1/2dbee48c-b1e9-4cce-8379-250af6639cd6

Lazy rewriting on eager machinery

- Summary
- Subjects
- Metrics

Abstract

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.

Related Organizations

Vrije Universiteit Amsterdam
Netherlands
Swansea University
United Kingdom

Keywords

Optimization, Languages, Specificity ordering, D.3.4 [Programming Languages]: Processors - Compilers, Lazy rewriting, Innermost reduction

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	23
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%