Abstract
The subject of this paper is rewriting in an LCF-like general theorem proving framework. It is shown how rewriting of both terms and formulae can be implemented by simple tactics in the generic theorem prover Isabelle. These tactics can easily be combined with induction to yield powerful theorem proving primitives. As a sample application the verification of an n-bit ripple-carry adder is demonstrated.
| Original language | English |
|---|---|
| Pages (from-to) | 34-41 |
| Number of pages | 8 |
| Journal | Computer Journal |
| Volume | 34 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1991 |
| Externally published | Yes |