That's the main idea!
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…
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…
That's the main idea!
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…
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…