Lecture
This lecture introduces the concept of types in lambda calculus, focusing on two example languages: typing arithmetic expressions and simply typed lambda calculus. The instructor explains how to define types, specify typing rules, and prove soundness. The lecture covers topics such as evaluation rules, type safety, typechecking algorithm, canonical forms, progress, preservation, and properties of the typing relation.