15-150: Functional Programming, Summer 2014

Schedule of Lectures

Number  Date     Topics Covered Notes and Readings PSML Chapters
01 May 19 Introduction notes
02 May 20 Basics notes 2, 3, 4
03 May 21 Structural Recursion and Structural Induction notes 24, 25, 26
04 May 22 Lists notes 9, 26
05 May 23 Asymptotic Analysis notes
May 26 MEMORIAL DAY
06 May 27 Sequential Sorting notes
07 May 28 Parallel Sorting notes
08 May 29 Polymorphism; Datatypes; Specs and Checks notes 10, 24
09 May 30 Options; Domain-specific Datatypes; Functions as Arguments notes 11
10 June 2 Higher-Order Functions notes 11, 30
11 June 3 Functions as Data; Tail Recursion; Continuations notes 29
12 June 4 Regular Expressions notes 29
13 June 5 Regular Expressions (above) 1, 27
14 June 6 Regular Expressions; Staging (above) 30
June 9 MIDTERM EXAM
15 June 10 Exceptions notes 12
16 June 11 Cost Semantics; Sequences notes
17 June 12 Signatures, Structures, and Type Abstraction notes 18, 19
18 June 13 N-Body notes
19 June 16 Dictionaries; Type Classes; Functors notes 23
20 June 17 Red-Black Trees notes
21 June 18 Two-Player Games notes
22 June 19 Two-Player Games (above) 22
23 June 20 Effects and Parallelism notes
24 June 23 Imperative Programming notes
25 June 24 Imperative Programming (above)
26 June 25 Monads notes
27 June 26 Course Retrospective slides
June 27 FINAL EXAM -- 2-5 PM in GHC 4307


last modified 15:02, 26 Jun 2014
Valid CSS! Valid XHTML 1.0 Strict