15-150: Functional Programming, Fall 2017

Schedule of Lectures

Number  Date     Topics Covered Notes and Readings
01 29 August Introduction slides notes
02 31 August Basics slides notes
03 5 September Specs and proofs slides Academic Integrity Form
04 7 September Using induction slides notes
05 12 September Asymptotic analysis (work and span) slides notes
06 14 September Sorting lists (work and span) slides notes
07 19 September Sorting trees slides notes
08 21 September Datatypes slides
09 26 September Datatypes (continued) slides
10 28 September MIDTERM 1 self test answers
11 3 October Types and polymorphism slides notes
12 5 October Higher order list functions slides notes
13 10 October Higher order sorting slides notes
14 12 October Continuations (success & failure) slides notes
15 17 October Continuations (n-queens) slides notes
16 19 October Exceptions slides notes
17 24 October Signatures, structures, functors, parametrized ADTs slides notes (Part 1) notes (Part 2)
18 26 October Case study: building a set slides
19 31 October MIDTERM 2
20 2 November Cost semantics slides notes
21 7 November Parallelism (n-body simulation) slides notes
22 9 November 2-person games and minimax slides notes code
23 14 November Guest lecture (Yaron Minsky)
24 16 November Minimax and alpha-beta pruning slides notes code
25 21 November Lazy programming slides
26 22 November THANKSGIVING (no labs)
27 23 November THANKSGIVING (no classes)
28 28 November Lazy regular languages
29 30 November Imperative constructs
30 5 December Scheduling and effects
31 7 December Review


The "Notes and Readings" field will usually be blank until it is updated after lecture.

Disclaimer: All topics and dates are subject to minor change.

last modified 13:42, 21 Nov 2017
Valid CSS! Valid XHTML 1.0 Strict