[vorov2]

Ela is a strict dynamically typed impure functional language. Haskell is a non-strict statically typed pure functional language. Only 1 of four :)

Ela is not Haskell :)

And it does feel very different really. There are certain similaries in syntax - not by coincidence of course - mostly in the way how Ela supports function definition by pattern matching. I've experimented with syntax quite a lot, starting from C-style syntax but it really appears that ML-style syntax is more expressive if you take a functional language. IMHO of course. Also except of function definition Ela syntax is probably closer to OCaml\F#.

This is a pretty early stage of the project really, I can't even say that the concept is 100% finalized. The interpreter is fully functional but Ela really lacks some documentation, guides, how-tos and standard library. TBD.