Course Schedule
Table of Contents
This is a tentative course schedule, which will evolve during the semester.
1. Lectures
| Week | Topic | Lecturer |
| 1 | Intro, Haskell, Induction | Thomas |
| 2 | Natural Deduction, Rule Induction, Syntax | Thomas |
| 3 | Assignment 0, Operational Semantics, λ Calculus | Thomas |
| 4 | Imperative Programming, MinHS | Thomas |
| 5 | Assignment 1, Abstract Machines, Environments | Thomas |
| 6 | Flexibility Week | |
| 7 | Properties, Type safety, Type theory | Rob |
| 8 | Polymorphism, Type Inference, Assignment 2 | Rob |
| 9 | Abstract Data Types, Overloading and Subtyping | Rob |
| 10 | Concurrency, Revision | Rob |
\(\quad\)