Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems

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

doi:10.1145/291889.291903

Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems

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

^*Corresponding author for this work

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

Abstract

A new compilation technique for left-linear term-rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM).

Original language	English
Pages (from-to)	679-706
Number of pages	28
Journal	ACM Transactions on Programming Languages and Systems
Volume	20
Issue number	3
DOIs	https://doi.org/10.1145/291889.291903
Publication status	Published - 1 Jan 1998

Fingerprint

Keywords

Abstract machine
Automata
D.3.4 [Programming Languages]: Processors - compilers; optimization
Languages
Specificity ordering
Term rewriting

Cite this

Fokkink, W. J., Kamperman, J. F. T., & Walters, P. (1998). Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems. ACM Transactions on Programming Languages and Systems, 20(3), 679-706. https://doi.org/10.1145/291889.291903

@article{f513fc463de040f3bd248c5a261600c8,

title = "Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems",

abstract = "A new compilation technique for left-linear term-rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM).",

keywords = "Abstract machine, Automata, D.3.4 [Programming Languages]: Processors - compilers; optimization, Languages, Specificity ordering, Term rewriting",

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

year = "1998",

month = "1",

day = "1",

doi = "10.1145/291889.291903",

language = "English",

volume = "20",

pages = "679--706",

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

issn = "0164-0925",

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

number = "3",

}

TY - JOUR

T1 - Within ARM's Reach

T2 - Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems

AU - Fokkink, Wan J.

AU - Kamperman, Jasper F.Th

AU - Walters, Pum

PY - 1998/1/1

Y1 - 1998/1/1

N2 - A new compilation technique for left-linear term-rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM).

AB - A new compilation technique for left-linear term-rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM).

KW - Abstract machine

KW - Automata

KW - D.3.4 [Programming Languages]: Processors - compilers; optimization

KW - Languages

KW - Specificity ordering

KW - Term rewriting

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

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

U2 - 10.1145/291889.291903

DO - 10.1145/291889.291903

M3 - Article

AN - SCOPUS:0032057966

VL - 20

SP - 679

EP - 706

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

SN - 0164-0925

IS - 3

ER -

Access to Document

10.1145/291889.291903