I think they're working on a language for mere mortals instead of FP wizards. Seems cool to me. I mean, you could respond to claims like: > This addresses prob

I think they're working on a language for mere mortals instead of FP wizards. Seems cool to me. I mean, you could respond to claims like: > This addresses problems under which functional programming (FP) labors, like creating cycles of immutable objects. ...that in Haskell we can create cyclical data structures using laziness via tying the knot. But uhh, wouldn't it just be a whole lot easier to build cyclical relationships using mutable state then freeze the whole thing? I guess what I'm saying is Haskell is hard, let's go shopping... for sufficiently smart compilers!