Within ARM's reach
- 1 May 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 20 (3) , 679-706
- https://doi.org/10.1145/291889.291903
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
This publication has 30 references indexed in Scilit:
- Simulation as a correct transformation of rewrite systemsPublished by Springer Nature ,1997
- A meta-environment for generating programming environmentsACM Transactions on Software Engineering and Methodology, 1993
- The syntax definition formalism SDF—reference manual—ACM SIGPLAN Notices, 1989
- Term-rewriting systems with rule prioritiesTheoretical Computer Science, 1989
- Non-strict Languages - Programming and ImplementationThe Computer Journal, 1989
- The Chalmers Lazy-ML CompilerThe Computer Journal, 1989
- The categorical abstract machineScience of Computer Programming, 1987
- Conditional rewrite rules: Confluence and terminationJournal of Computer and System Sciences, 1986
- Efficient compilation of lazy evaluationACM SIGPLAN Notices, 1984
- The next 700 programming languagesCommunications of the ACM, 1966