Lecture 6: Recursion and Type Preservation.

In today's class we have seen how to add a recursion to a functional language that is typed. We concluded this section with the proof of type preservation which states that every well-typed program evaluates to a value.

Further Reading:

Previous lecture: Lecture 5
Next lecture: Lecture 7