Course Schedule

TS
Please note that this schedule is tentative, and may be adapted as need arises.

Date Time Topic
6 Sep 13-15 Introduction, Projects, Planning
11 Sep 11-13 (Stefan Holdermans) Luís Damas and Robin Milner. Principal type-schemes for functional programs, Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, January 1982, pages 207–212, ACM Press, 1982; (Atze Dijkstra) Essential Haskell (EH) project overview.
13 Sep 13-15 (Atze Dijkstra) A short introduction to the StudentProjects; (Stefan Holdermans) Damas and Milner (1982, cont'd)
18 Sep 11-13 Bastiaan Heeren, Jurriaan Hage, and S. Doaitse Swierstra. Generalizing Hindley-Milner type inference algorithms. Technical Report UU-CS-2002-031, Utrecht University, 2002.
20 Sep 13-15 Continuing Generalizing HM type inference algorithms, starting Pierce I-23, Universal Types (System F)
25 Sep 11-13 Pierce I-23, Universal Types (System F)
27 Sep 13-15 Pierce I-24, Existential Types
2 Oct no meeting
4 Oct 13-15 projects: intermediate presentations
9 Oct 11-13 Pierce I-30, Higher-order Polymorphism (Fω, λ-cube)
11 Oct 13-15 Simply Easy
16 Oct 11-13 Simply Easy
18 Oct 13-15 Epigram AFP Lecture Notes (See also Using Epigram)
23 Oct 11-13 Epigram AFP Lecture Notes (See also Using Epigram)
25 Oct 13-15 type classes I: A Theory of Qualified Types
30 Oct 11-13 type classes II: Design Space, data vs. codata: Turner/Total Functional Programming or Partiality is an Effect
1 Nov 11-13 summary and evaluation
5 Nov 9-13 final presentations
7 Nov 13-17 exam

Please also look at the Possible topics.

-- AndresLoeh - 23 Oct 2007