developedby

8 ms·

1. 1.▲
   by developedby 2y ago

   That's the main idea!
2. 2.▲
   by developedby 2y ago

   Bending is an operation similar to folding, both in real life and in the language. While fold is recursive on data, bend is recursive on a boolean condition (like a pure while that supports multiple branching recursion points). I was actual
3. 3.▲
   by developedby 2y ago

   The first `fork` is from using bend and passing the initial state The program above will initialize a state (`x = 0`), and then, for as long as `x < 3`, it will "fork" that state in two, creating a `Tree/Node`, and c