Exercises for Week 02

Exercise 00

1. The index of concepts for this week is in a separate chapter. Go through them and make sure that they make sense to you.
2. The lecture notes start with updates (Chapter Updates). Make sure to check them out regularly, as they reflect the development of the lecture.
3. Do take the time to peruse the lecture notes of this week and to reproduce their technical content in a personal session with tCPA.

Mandatory exercises

• Exercise 00: reading the lecture notes of the week and reflecting on their content
• Exercise 01: implementing an accumulator-based version of the multiplication function
• Exercise 02: implementing a problematic accumulator-based function
• Exercise 03: implementing an accumulator-based function to compute the number of nodes in a binary tree of Peano numbers
• Exercise 04: playing with polymorphic binary trees
• Exercise 07: playing with the option type

Optional exercises

• Exercise 08: playing with polymorphic binary trees with payloads in the nodes
• Exercise 11: playing with the soundness and completeness of the boolean negation function

Exercise for the overachievers

• Exercise 13: formalizing the food for thought about baz_x and baz_y in Week 01

Version

Adjusted the wording of Exercise 00 [30 Jan 2025]

Added the exercise for the overachievers [26 Jan 2025]

Added the exercises [24 Jan 2025]

Created [24 Jan 2025]