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.
Work partially supported by the National Science Foundation under grant MCS78-01798 and by an Office of Naval Research Contract with DARPA funding #N00014-75-C-0661.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Dershowitz, “Termination of Linear Rewriting Systems — Preliminary Version,” in Automata, Languages, and Programming, Eighth Colloquium, Israel (Eds: S. Even and O. Kariv), LNCS 115, Springer Verlag, New York, 1981.
J.A. Goguen and J. Tardo, “An Introduction to OBJ-T.”Proc. of Conf. on Specification of Reliable Software (1979).
J.V. Guttag, E. Horowitz, and D.R. Musser, “Abstract Data Types and Software Validation,” Comm. A.C.M. 21 (1978), 1048–1064.
J.V. Guttag, D. Kapur, and D.R. Musser, On Proving Uniform Termination and Restricted Termination of Rewriting Systems, Report No. 81CRD272, G.E. C. Research and Development, Schenectady, New York, Nov. 1981.
G. Huet, “Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,” J. ACM 27 (1980), 797–821.
G. Huet, D.S. Lankford, “On the Uniform Halting Problem for Term Rewriting Systems,” Rapport Laboria 283, IRIA, March, 1978.
G. Huet, D.C. Oppen, “Equations and Rewrite Rules: a Survey,” Formal Languages Perspectives and Open Problems (R. Book, ed.), Academic Press (1980).
D.E. Knuth, P. Bendix, “Simple Word Problems in Universal Algebra.” Computational Problems in Abstract Algebra (J. Leech, ed.), Pergamon Press (1970), 263–297.
D. Musser, “Abstract Data Type Specification in the AFFIRM system.” IEEE Transactions on Software Engineering 6 (1980), 24–31.
G.E. Peterson and M.E. Stickel, Complete Sets of Reductions for Equational Theories With Complete Unification Algorithms, Tech. Report, Dept. of Computer Science, U. of Arizona, Tucson, Sept. 1977.
A. Pettorossi, “Comparing and Putting Together Recursive Path Ordering, Simplification Orderings, And Non-Ascending Property for Termination Proofs of Term Rewriting Systems,” in Automata, Language, and Programming, Eighth Coll., Israel (Eds: S. Even and O. Kariv), LNCS115, Springer Verlag, New York, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guttag, J.V., Kapur, D., Musser, D.R. (1982). Derived Pairs, overlap closures, and rewrite dominoes: New tools for analyzing term rewriting systems. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012778
Download citation
DOI: https://doi.org/10.1007/BFb0012778
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive