Paper Info
Title
Fast Knuth-Bendix completion with a term rewriting system compiler
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.
Year
DOI
Venue
1989
10.1016/0020-0190(89)90026-4
Inf. Process. Lett.
Keywords
DocType
Volume
system compiler,fast knuth-bendix completion
Journal
32
Issue
ISSN
Citations 
6
0020-0190
2
PageRank 
References 
Authors
0.90
5
1
Name
Order
Citations
PageRank
Yoshihito Toyama153349.60