Fast Knuth-Bendix completion with a term rewriting system compiler

Yoshihito Toyama

doi:10.1016/0020-0190(89)90026-4

Fast Knuth-Bendix completion with a term rewriting system compiler

Yoshihito Toyama

Systems & Software Division

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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	https://doi.org/10.1016/0020-0190(89)90026-4
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

Access to Document

10.1016/0020-0190(89)90026-4

Cite this

@article{3172f54676c44cbf81ea8b1fb94a79aa,

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.",

keywords = "Term rewriting systems, compiler, completion algorithm",

author = "Yoshihito Toyama",

year = "1989",

month = oct,

day = "3",

doi = "10.1016/0020-0190(89)90026-4",

language = "English",

volume = "32",

pages = "325--328",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - Fast Knuth-Bendix completion with a term rewriting system compiler

AU - Toyama, Yoshihito

PY - 1989/10/3

Y1 - 1989/10/3

N2 - 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.

AB - 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.

KW - Term rewriting systems

KW - compiler

KW - completion algorithm

UR - http://www.scopus.com/inward/record.url?scp=0024960689&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024960689&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(89)90026-4

DO - 10.1016/0020-0190(89)90026-4

M3 - Article

AN - SCOPUS:0024960689

VL - 32

SP - 325

EP - 328

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 6

ER -

Fast Knuth-Bendix completion with a term rewriting system compiler

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this