January 2020
Intermediate to advanced
470 pages
11h 13m
English
12.1. Maybe tasks? In the Questions section of Chapter 8, Connecting Functions – Pipelining and Composition, a question (8.2) had to do with getting the pending tasks for a person while taking errors or border situations into account, such as the possibility that the selected person might not even exist. Redo that exercise but using Maybe or Either monads to simplify that code.
12.2. Extending your trees: To get a more complete implementation of our functional binary search trees, implement the following functions:
12.3. Functional lists: In the same spirit as ...
Read now
Unlock full access