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.
Cite
CITATION STYLE
Bachmair, L., Ramakrishnan, C. R., Ramakrishnan, I. V., & Tiwari, A. (1999). Normalization via rewrite closures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1631, pp. 190–204). Springer Verlag. https://doi.org/10.1007/3-540-48685-2_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
