Equational Proofs

  • Leo Bachmair
Part of the Progress in Theoretical Computer Science book series (PTCS)


Equations occur in many computer applications, such as symbolic computation, functional programming, abstract data type specifications, program verification, program synthesis, and automated theorem proving. Rewrite systems are collections of directed equations (rewrite rules) used to compute by replacing subterms in a given formula by equal terms until a simplest form possible (a normal form) is obtained. Many formula manipulation systems, such as Reduce or Macsyma use equations in this manner. As a computational formalism, rewrite systems have the full power of Turing machines and various equational programming languages have been proposed that are based on the paradigm of rewriting (e. g., O’Donnell 1985; Goguen and Meseguer 1986). We shall study the application of rewrite techniques to reasoning about equations.


Normal Form Theorem Prover Function Symbol Automate Theorem Prove Proof Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 1991

Authors and Affiliations

  • Leo Bachmair
    • 1
  1. 1.Department of Computer ScienceState University of New York at Stony BrookStony BrookUSA

Personalised recommendations