Induction in Proofs about Programs
Four methods for proving equivalence of programs by induction are described and compared. They are recursion induction, structural induction, mu-rule induction, and truncation induction. McCarthy's formalism for conditional expressions as function definitions is used and reinterpreted in view...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149405 |
| Summary: | Four methods for proving equivalence of programs by induction are described and compared. They are recursion induction, structural induction, mu-rule induction, and truncation induction. McCarthy's formalism for conditional expressions as function definitions is used and reinterpreted in view of Park's work on results on results in lattice theory as related to proofs about programs. The possible application of this work to automatic program verification is commented upon. |
|---|