Covers types in lambda calculus, including defining types, specifying rules, and proving soundness.
Explores subtyping rules, challenges, and its connection to various forms of polymorphism in programming languages.
Introduces records, variants, evaluation rules, typing rules, aliasing challenges, and benefits in programming languages.
Covers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.
Focuses on implementing a type checker for Amy, covering name and type analysis, typing constraints generation, and the importance of type checking in compilation.
