DM509, Fall 2006, 2nd quarter - Weekly Note 2

Lecture November 16

Useful library functions on lists.

Reading

Rest of non-proof parts of Sections 4.1-5 in Bird. Slides: preludeExtract.hs.

Lecture November 21 (Expected Contents)

More examples of Haskel code. Start on trees.

Reading

Sections 5.5 and 6.1-2 in Bird.

Lecture November 23 (Expected Contents)

The undefined value. Strict and non-strict functions. Proofs of properties of code.

Reading

Chapters 1 and 2, now with a focus on the undefined value, and on proofs.

Exercises November 20

Exercises 4.2.2, 4.3.9 ("distinct" means that (1,2) and (2,1) should be regarded as equal, i.e. the pairs are unordered), 4.3.10, 4.3.11 (combinatory style means using map, filter, and concat), 4.5.1, 4.5.2, 4.5.3, and 4.5.5 in Bird.

Exam of winter 2001 (pdf), exercise 3.