Abstract
A term rewriting system compiler can greatly improve the execution speed of reductions by transforming rewriting rules into target code. In this report, we present a new application of the term rewriting system compiler: the Knuth-Bendix completion algorithm. The compiling technique proposed in this algorithm, is dynamic in the sense that rewriting rules are repeatedly compiled in the completion process. The execution time of the completion with dynamic compiling is ten or more times as fast as that obtained with a traditional term rewriting system interpreter.
Original language | English |
---|---|
Pages (from-to) | 325-328 |
Number of pages | 4 |
Journal | Information Processing Letters |
Volume | 32 |
Issue number | 6 |
DOIs | |
Publication status | Published - 1989 Oct 3 |
Keywords
- Term rewriting systems
- compiler
- completion algorithm
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications