15-150: Principles of Functional Programming

Lecture 5: Datatypes, Recursion and Structural Induction on Trees

We introduced datatype declarations as a form of abstraction designed to relieve a programmer from the burden of keeping track of low-level hacking conventions.
We considered the predefined datatype order with constant constructors LESS, EQUAL, GREATER.
We made up some of our own datatypes, including a datatype to model the extended integers, two different tree datatypes, and a datatype for operator-operand trees.

We showed how to prove theorems about trees using structural induction.

Key Concepts

Sample Code

The notes from last lecture are also again relevant

Proof of totality of the depth function discussed in lecture

(today's lecture was a blackboard lecture, so no slides)