The language design, that on EVM v.s. that on Others

The current development is concentrating on the procedure that transforms AST into program graph.
Once it is established we can have a lot of good analytics which is derived from simple linear algebra.

Program Graph might be then considered as a “weighted pushdown automata”.
“Weighted automata” is equivalent to linear algebra over semi-ring (or rig).
see for the introduction to weighted automata.