| Lecture | Topic | PS for screen | PS for printer | PDF for screen | PDF for printer |
|---|---|---|---|---|---|
| 1 | Introduction. Defining functions | fetch | fetch | fetch | fetch |
| 2 | Types. Pattern matching | fetch | fetch | fetch | fetch |
| 3 | Polymorphism. Higher-order functions |
fetch | fetch | fetch | fetch |
| 4 | fetch | fetch | fetch | fetch | |
| 5 | Recursive data structure | fetch | fetch | fetch | fetch |
| 6 | Type classes | fetch | fetch | fetch | fetch |
| 7 | Red-black tree | fetch | fetch | fetch | fetch |
| 8 | Leftist heap. Queue | fetch | fetch | fetch | fetch |
| 9 | Lazy queue | fetch | fetch | fetch | fetch |
| 10 | Lazy incremental queue | fetch | fetch | fetch | fetch |
| 11 | I/O, do-notation, monad | fetch | fetch | fetch | fetch |
| 12 | Writing a monad | fetch | fetch | fetch | fetch |
| 13 | A parser monad | paper | |||
| 14 | A proof checker, tactic monad | code | |||
| 15 | HaskellDirect FFI | document | |||
| Assignment | PS | |
|---|---|---|
| 1 | fetch | fetch |
| 2 | fetch | fetch |