I'm working on developing my own language. The best way I can describe it is: imagine Python but statically-typed with type inference, proper concurrency suppo

I'm working on developing my own language. The best way I can describe it is: imagine Python but statically-typed with type inference, proper concurrency support (via greenthreads), sum types (like enums in Rust), and immutable data structures in the standard library (like Clojure). I may even add optional checks that a function is pure. The stage I'm at right now is learning how type inference works well enough to be able to implement a correct type inference engine for it.