Normalization via Rewrite Closures
Authors:
- 5 November 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 190-204
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Shostak's congruence closure as completion1997
- A theory of using history for equational systems with applicationsJournal of the ACM, 1995
- Equational inference, canonical proofs, and proof orderingsJournal of the ACM, 1994
- Canonical Equational Proofs1991
- Rewrite Systems1990
- Unique normal forms in term rewriting systems with repeated variables1981
- An improved algorithm for computing with equations1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980