| Number | Date | Topics Covered | Notes and Readings |
|---|---|---|---|
| 01 | 26 Aug | Introduction, Equivalence, Evaluation, Typing, Binding, Scope | lecture 01 |
| 02 | 28 Aug | Functions and Patterns | lecture 02 |
| 03 | 02 Sep | Recursion and Induction | lecture 03 |
| 04 | 03 Sep | Lists and Structural Induction | lecture 04 |
| 05 | 09 Sep | Datatypes I | lecture 05 |
| 06 | 11 Sep | Datatypes II and Cost Analysis: Introduction | lecture 06 |
| 07 | 16 Sep | Cost Analysis: Introduction | lecture 07 |
| 08 | 18 Sep | Cost Analysis: Sorting | lecture 08 |
| 09 | 23 Sep | Polymorphism | lecture 09 |
| 25 Sep | MIDTERM EXAM #1 | ||
| 10 | 30 Sep | Higher-Order Functions I | lecture 10 |
| 11 | 02 Oct | Higher-Order Functions II | lecture 11 |
| 12 | 07 Oct | Higher-Order Functions III | lecture 12 |
| 13 | 09 Oct | Exceptions | lecture 13 |
| 14 Oct | FALL BREAK | ||
| 16 Oct | FALL BREAK | ||
| 14 | 21 Oct | Regular Expressions I | lecture 14 |
| 15 | 23 Oct | Regular Expressions II | lecture 15 |
| 16 | 28 Oct | Modules I: Signatures and Structures | lecture 16 |
| 17 | 30 Oct | Modules II: Functors | lecture 17 |
| 04 Nov | DEMOCRACY DAY | ||
| 06 Nov | MIDTERM EXAM #2 | ||
| 18 | 11 Nov | Parallelism and Sequences | lecture 18 |
| 19 | 13 Nov | Modules III: Red-Black Trees | lecture 19 |
| 20 | 18 Nov | Lazy Programming | lecture 20 |
| 21 | 20 Nov | Imperative Programming | lecture 21 |
| 22 | 25 Nov | Bonus Lecture: PL Theory | lecture 22 |
| 27 Nov | THANKSGIVING | ||
| 23 | 02 Dec | Games | lecture 23 |
| 24 | 04 Dec | Review |
The "Notes and Readings" field will usually be blank until it is updated after the given day's lectures (generally by evening).
Disclaimer: All topics and dates are subject to change.