Abstract
The subject of this paper is theorem proving based on rewriting and induction. Both principles are implemented as tactics within the generic theorem prover Isabelle. Isabelle's higher-order features enable us to go beyond first-order rewriting and express rewriting with conditionals, induction schemata, higher-order functions and program transformers. Applications include the verification and transformation of functional versions of insertion sort and quicksort.
| Original language | English |
|---|---|
| Pages (from-to) | 320-338 |
| Number of pages | 19 |
| Journal | Formal Aspects of Computing |
| Volume | 1 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 1989 |
| Externally published | Yes |
Keywords
- Isabelle
- Quicksort
- Term rewriting
- Theorem proving