Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term Rewriting Systems
Name
MIT-LCS-TR-268.pdf
Size
768.69 KB
Format
Adobe PDF
Checksum (MD5)
323c4b7d2a5132047c1f2665b8540043
Author(s)
Guttag, John V.
Kapur, Deepak
Musser, David R.
Date Issued
December 1981
Series/Report no.
MIT-LCS-TR-268
Abstract
Starting from the seminal work of Knuth and Bendix, we develop several notions useful in the study of term rewriting systems. In particular we introduce the notions of "derived pairs" and "overlap closure" and show that they are useful in analyzing sets of rewrite rules for various properties related to termination. We also introduce a new representation, based on rewrite dominoes, for rewrite rules and sequences of rewrites.
Persistent DSpace Link
