1. Functional Design and Programming Lecture 3: List processing

2. Literature (Pensum)  Paulson, chap. 3: Introduction to lists (3.1-3.2) Derived list functions (3.3-3.6) Application: Matrix transposition (3.9) Sets: list representation (3.14-3.15) Maps: association list representation (3.16) (Graphs: Depth-first search (3.17))

3. Exercises  Paulson, chap. 3: 3.1-3.7 3.8-3.10, 3.19-3.21, 3.33-3.35, 3.38-3.42 (obligatory: 3.8, 3.19-3.21, 3.33, 3.38, 3.41)

4. Introduction to lists  Basic list constructors  Basic list destructors (pattern matching)  Definition by pattern matching and recursion

5. Time complexity  Constant-time operations: definition  Constant-time operations: examples

6. Derived list functions  Derived constructors and destructors: hd, tl  Observer function: null  Derived complex list functions: append, reverse, drop, take

7. Application: Matrix transposition  Matrices: Definition  Transposition

8. Sets  Sets: intuition, notation  Basic set operations  Sets implemented as lists

9. Maps  Maps: finite functions  Maps implemented as association lists