Lecture: Proving Properties of Recursive Functions and Data Structures
Background Material
Reading
- Little Prover (chapters 1-9)
Topics
- Structural induction
- Proving properties of binary trees (height, ipl and complete binary trees)
- Proving properties of arithmetic expressions
- Differentiation
- Simplification
Lecture Notes
Programs
Resources
Created: May 31, 2016 (modified June 1, 2016) by jjohnson@cs.drexel.edu