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 | |
Publication status | Published - 1 Jan 1998 |
Keywords
- Abstract machine
- Automata
- D.3.4 [Programming Languages]: Processors - compilers; optimization
- Languages
- Specificity ordering
- Term rewriting