Normalization via Rewrite Closures
- 5 November 1999
- book chapter
- Published by Springer Nature
- p. 190-204
- https://doi.org/10.1007/3-540-48685-2_15
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Nonoblivious normalization algorithms for nonlinear rewrite systemsPublished by Springer Nature ,2005
- Shostak's congruence closure as completionPublished by Springer Nature ,1997
- 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 ProofsPublished by Springer Nature ,1991
- Rewrite SystemsPublished by Elsevier ,1990
- Unique normal forms in term rewriting systems with repeated variablesPublished by Association for Computing Machinery (ACM) ,1981
- An improved algorithm for computing with equationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980