Abstract
We present an abstract completion-based method for finding normal forms of terms with respect to given rewrite systems. The method uses the concept of a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on congruence closure-based normalization methods. The description of known methods within our formalism also allows a better understanding of these procedures.
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
L. Bachmair. Canonical equational proofs. Birkhäuser, Boston, 1991.
L. Bachmair and N. Dershowitz. Equational inference, canonical proofs, and proof orderings. JACM, 41:236–276, 1994.
L. P. Chew. An improved algorithm for computing with equations. In 21st Annual Symposium on Foundations of Computer Science, 1980.
L. P. Chew. Normal forms in term rewriting systems. PhD thesis, Purdue University, 1981.
N. Dershowitz and J. P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science (Vol. B: Formal Models and Semantics), Amsterdam, 1990. North-Holland.
D. Kapur. Shostak’s congruence closure as completion. In H. Comon, editor, Proc. 8th Intl. RTA, pages 23–37, 1997. LNCS 1232, Springer, Berlin.
J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 1, chapter 6, pages 2–116. Oxford University Press, Oxford, 1992.
G. Nelson and D. Oppen. Fast decision procedures based on congruence closure. JACM, 27(2):356–364, 1980.
D. J. Sherman and N. Magnier. Factotum: Automatic and systematic sharing support for systems analyzers. In Proc. TACAS, LNCS 1384, 1998.
R. M. Verma. A theory of using history for equational systems with applications. JACM, 42:984–1020, 1995.
R. M. Verma and I. V. Ramakrishnan. Nonoblivious normalization algorithms for nonlinear systems. In Proc. of the Int. Colloquium on Automata, Languages and Programming, New York, 1990. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bachmair, L., Ramakrishnan, C.R., Ramakrishnan, I.V., Tiwari, A. (1999). Normalization via Rewrite Closures. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_15
Download citation
DOI: https://doi.org/10.1007/3-540-48685-2_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66201-3
Online ISBN: 978-3-540-48685-5
eBook Packages: Springer Book Archive