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

Author(s)
Fokkink, Wan J.
Kamperman, Jasper F.Th
Walters, Pum
Keywords
Abstract machine
Automata
D.3.4 [Programming Languages]: Processors - compilers; optimization
Languages
Specificity ordering
Term rewriting
/dk/atira/pure/sustainabledevelopmentgoals/quality_education
SDG 4 - Quality Education

Full record
Show full item record
URI
http://hdl.handle.net/20.500.12424/4246805
Online Access
https://research.vu.nl/en/publications/f513fc46-3de0-40f3-bd24-8c5a261600c8
https://doi.org/10.1145/291889.291903
http://hdl.handle.net/1871.1/f513fc46-3de0-40f3-bd24-8c5a261600c8
http://www.scopus.com/inward/record.url?scp=0032057966&partnerID=8YFLogxK
http://www.scopus.com/inward/citedby.url?scp=0032057966&partnerID=8YFLogxK
Abstract
<
p
>
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).
/p
Date
1998-01-01
Type
Article
Identifier
oai:research.vu.nl:openaire_cris_publications/f513fc46-3de0-40f3-bd24-8c5a261600c8
https://research.vu.nl/en/publications/f513fc46-3de0-40f3-bd24-8c5a261600c8
https://doi.org/10.1145/291889.291903
http://hdl.handle.net/1871.1/f513fc46-3de0-40f3-bd24-8c5a261600c8
http://www.scopus.com/inward/record.url?scp=0032057966&amp;partnerID=8YFLogxK
http://www.scopus.com/inward/citedby.url?scp=0032057966&amp;partnerID=8YFLogxK
Copyright/License
info:eu-repo/semantics/restrictedAccess
Collections