3 ms·
I would have described the logic in the exact same way, but I still don't see where initial tree = fork(0) state comes from all the other "fork"s in the output
by anentropic 2y ago
I would have described the logic in the exact same way, but I still don't see where initial tree = fork(0) state comes from
all the other "fork"s in the output are produced explicitly by:
Tree/Node { lft: fork(x + 1), rgt: fork(x + 1) }
- anentropic 2y agowell, it seems fork is some kind of builtin function that is intimately related to the bend construct: https://github.com/HigherOrderCO/bend/blob/main/FEATURES.md#:~:text=%27fork%27%20calls%20the%20bend%20recursively%20with%20the%20provided%20values https://github.com/HigherOrderCO/bend/blob/main/FEATURES.md#.... so presumably the initial fork(0) state is implicitly produced by the bend