Lecture Notes, Week 09
- Reversing lists
- Programming using accumulators
- Generic programming with lists
- Resources
- Structural recursion over lists
- Example: computing the length of a list, generically
- Example: unparsing a polymorphic list in long hand, generically
- Example: unparsing a polymorphic list in short hand, generically
- Example: duplicating the elements of a list, generically
- Example: concatenating two lists, generically
- Example: list membership, generically
- Exercise 8
- Sets as lists, re2visited
- Exercise 9
- Solution for Exercise 9
- Exercise 10
- Exercise 11
- Exercise 12
- Example: the Cartesian product of two sets, generically
- Example: the Cartesian product of three sets, generically
- Exercise 13
- Structural recursion over lists using an accumulator
- Example: computing the length of a list using an accumulator, generically
- Exercise 14
- Sets as lists, re3visited
- Exercise 15
- Solution for Exercise 15
- Exercise 16
- Exercise 17
- Exercise 18
- The map function for lists, generically
- Aftermath
- Exercise 19
- Exercise 20
- Postlude
- Post-poslude
- Resources
- Version
- The Art of Computer Science
- The polymorphic option type
- Exercises for Week 09