'Prove p node' presentation slideshows

Functional Programming Lecture 14 - induction on algebraic data types and lazy evaluation

Functional Programming Lecture 14 - induction on algebraic data types and lazy evaluation. We can reason, using induction, over any inductively defined set. That includes algebraic data types. Proof by induction on Trees. data Tree a = Nil | Node a (Tree a) (Tree a)

379 views • 8 slides