Earlier quoted context omitted.
Would that downvotes interested me... To your questions: OcaML: seems like a hack-ish [S]ML. There's a nice comparison between SML and OcaML here : http://adam.chlipala.net/mlcomp/ . I like SML's syntax, but OcaML made it too easy to be imperative and seemed too hackish. Most of the OcaML I've seen looks like weird C, but written in OcaML because it's F4ST3R. F# : I run Linux... next! Scala* : I can't stand it. I use…
[Scala] Type inferencing, but not powerful type inference? In Scala the Hindley–Milner type inferencing is not possible because Scala is OOP, compared to Haskell which isn't. Ocaml does have Hindley-Milner, but not for the OOP features and whenever I played with Ocaml it felt like 2 different type-systems shoved into the same language (much like Obj-C). Scala on the other hand is more consistent, elegant and simpler.…
I don't think that's true. You do the same thing (e.g. collections that choose better representations) via type families/associated data types in Haskell. E.g. in [1] or [2]
That said, what is true is that Odersky has modified the Scala type system in quite interesting ways, specifically to support his collections library. [3]
[1]: http://hackage.haskell.org/package/adaptive-containers