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: | Greif, Irene Gloria |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149405 |
Similar Items
-
Proof by induction [filem]
Published: (1969) -
Letter about proof format
by: Dijkstra, E
Published: (2015) -
Preservice teachers' knowledge of proof by mathematical induction
by: Stylianides, G, et al.
Published: (2007) -
Broken Circuits in Matroids—Dohmen’s Inductive Proof
by: Kordecki Wojciech, et al.
Published: (2013-07-01) -
Semantic of Communication Parallel Processes
by: Greif, Irene Gloria
Published: (2023)