developedby

It's just solarized, i imagine most developers are familiar with it

The benchmarks: https://github.com/bendlang/bend/tree/main/bench

The script we use to run them on our servers: https://github.com/bendlang/bend/blob/main/gates/perf.ts

If your game is big, then your proof will need to be huge. It works basically the same as Lean.

Old repo can be accessed here https://github.com/HigherOrderCO/Bend1 . I guess we could have it as a branch on the bend2 repo

Most of that is just the test suite. The actual code is about 10k lines

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 points).

I was actually looking forward to seeing someone from Bend to make a comment like this

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 continuing with `x + 1`.
  When `x >= 3`, it will halt and return a `Tree/Leaf` with `7`.
  When all is done, the result will be assigned to the `tree` variable: