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
08 21 September Datatypes
09 26 September Types and polymorphism
10 28 September MIDTERM 1
11 3 October Higher order list functions
12 5 October Higher order sorting
13 10 October Code design
14 12 October Continuations (success & failure)
15 17 October Continuations (n-queens)
16 19 October Exceptions
17 24 October Signatures, structures, functors, parametrized ADTs
18 26 October Case study: heap
19 31 October MIDTERM 2
20 2 November Cost semantics
21 7 November Parallelism, sequences (n-body sim)
22 9 November 2-person games and minimax
23 14 November Games
24 16 November Lazy programming
25 21 November Imperative constructs
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 09:59, 15 Sep 2017
Valid CSS! Valid XHTML 1.0 Strict