Lazy rewriting on eager machinery

Wan J. Fokkink; Jasper F.Th Kamperman; Pum Walters

doi:10.1145/345099.345102

Lazy rewriting on eager machinery

Wan J. Fokkink^*, Jasper F.Th Kamperman, Pum Walters

^*Corresponding author for this work

Research output: Contribution to Journal › Article › Academic › peer-review

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.

Original language	English
Pages (from-to)	45-86
Number of pages	42
Journal	ACM Transactions on Programming Languages and Systems
Volume	22
Issue number	1
DOIs	https://doi.org/10.1145/345099.345102
Publication status	Published - 1 Jan 2000

Keywords

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

Access to Document

10.1145/345099.345102

Handle.net

Persistent link

Cite this

@article{2dbee48cb1e94cce8379250af6639cd6,

title = "Lazy rewriting on eager machinery",

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.",

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

author = "Fokkink, {Wan J.} and Kamperman, {Jasper F.Th} and Pum Walters",

year = "2000",

month = jan,

day = "1",

doi = "10.1145/345099.345102",

language = "English",

volume = "22",

pages = "45--86",

journal = "ACM Transactions on Programming Languages and Systems",

issn = "0164-0925",

publisher = "Association for Computing Machinery (ACM)",

number = "1",

}

TY - JOUR

T1 - Lazy rewriting on eager machinery

AU - Fokkink, Wan J.

AU - Kamperman, Jasper F.Th

AU - Walters, Pum

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

KW - D.3.4 [Programming Languages]: Processors - Compilers

KW - Innermost reduction

KW - Languages

KW - Lazy rewriting

KW - Optimization

KW - Specificity ordering

UR - http://www.scopus.com/inward/record.url?scp=0002988669&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0002988669&partnerID=8YFLogxK

U2 - 10.1145/345099.345102

DO - 10.1145/345099.345102

M3 - Article

AN - SCOPUS:0002988669

SN - 0164-0925

VL - 22

SP - 45

EP - 86

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

IS - 1

ER -

Lazy rewriting on eager machinery

Abstract

Keywords

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this