| dc.contributor.author | Guttag, John V. | en_US |
| dc.contributor.author | Kapur, Deepak | en_US |
| dc.contributor.author | Musser, David R. | en_US |
| dc.date.accessioned | 2023-03-29T15:05:51Z | |
| dc.date.available | 2023-03-29T15:05:51Z | |
| dc.date.issued | 1981-12 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149546 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-268 | |
| dc.title | Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term Rewriting Systems | en_US |
| dc.identifier.oclc | 10160234 | |
