I like how they incorporate an SMT solver. They claim: “all code is proven”. What does that mean? What is proven about the code? Absence of memory bugs, or actual correctness of algorithms?
As I just rambled about in another comment in this thread, their project summary isn't clear about this. Still a great idea for a language though.
[0] https://github.com/aep/zz/tree/master/examples/hello/src
What does it even mean that the language is formally provable ?!