Normalization via Rewrite Closures

Authors:
Leo Bachmair;C. R. Ramakrishnan;I. V. Ramakrishnan;Ashish Tiwari
Affiliations:
-;-;-;-
Venue:
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Year:
1999

Citing 10
Cited 0

Nonoblivious normalization algorithms for nonlinear rewrite systems

Proceedings of the seventeenth international colloquium on Automata, languages and programming
Rewrite systems

Handbook of theoretical computer science (vol. B)
Equational inference, canonical proofs, and proof orderings

Journal of the ACM (JACM)
A theory of using history for equational systems with applications

Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Canonical Equational Proofs

Canonical Equational Proofs
Factotum: Automatic and Systematic Sharing Support for Systems Analyzers

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Shostak's Congruence Closure as Completion

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Normal forms in term rewriting systems

Normal forms in term rewriting systems
An improved algorithm for computing with equations

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.