Spend some time trying to understand exactly what it
does: compute the tree-to-list transformation for a tree with two
leaves, performing all beta reduction by hand using the
- definitions for `bind_continuation`, `unit_continuation` and so on.
+ definitions for `continuation_bind`, `continuation_unit` and so on.
If you take this route, study the description of **streams** (a
particular kind of data structure) below. The goal will be to
arrange for the continuation-flavored `tree_monadizer` to transform