15-150: Functional Programming, Fall 2019

Schedule of Lectures

Number  Date     Topics Covered Slides Notes
01 27 Aug Introduction Slides Notes
02 29 Aug SML Basics Slides Notes
03 3 Sept Specs and proofs Slides Notes
04 5 Sept Inductive proofs Slides
05 10 Sept Asymptotic analysis and recurrences Slides Notes
06 12 Sept Sequential sorting Slides Notes
07 17 Sept Parallel sorting Slides Notes
08 19 Sept Polymorphism Slides Notes
09 24 Sept Higher-order functions Slides Notes
10 26 Sept Higher-order sorting Slides Notes
11 1 Oct General Sorting Slides Notes
12 3 Oct Continuations Slides Notes
13 8 Oct N-Bishops Slides Notes (CPS) Notes (Backtracking)
14 10 Oct MIDTERM EXAM #1   
15 Oct Exceptions Slides Notes
15 17 Oct Modules Slides Notes
16 22 Oct Red Black Trees Slides Notes
17 24 Oct Sequences Slides Notes
18 29 Oct Case study: Gravity Slides Notes
19 31 Oct Games Slides Notes
20 5 Nov Games Slides Notes
7 Nov MIDTERM EXAM #2
21 12 Nov Games Slides
22 14 Nov Lazy programming Slides Notes
23 19 Nov Ron Minsky guest lecture   
24 14 Nov Lazy Programming Slides
25 26 Nov Imperative Programming Slides Slides
28 Nov No class (Thanksgiving Break)   
26 3 Dec Case study: benign side-effects Slides Notes
27 5 Dec Semester Review Slides
FINAL EXAM -- TBA


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.

last modified 21:58, 07 Dec 2019