Proof that Haskell sucks!

Check out the Rosetta Code page on Y Combinator.  In many languages that you would not even expect, this functional combinator is simple and straighforward.

For instance, Algol 68!

Haskell? "The obvious definition of the Y combinator in Haskell canot be used because it contains an infinite recursive type (a = a -> b). Defining a data type (Mu) allows this recursion to be broken. "

What kind of a shit functional language doesn't let you define the Y combinator using the obvious definition?

Oh right, the same one in which contortions are required to put items of different types into the same linked list.

>>1
ugh. typed-lambda calculus was made with the intention of not admiting thing that can exploit the russel paradox (ie Y combinator) that why it's said the typed lambda calculus is less powerful that untyped one but safer.

tl;dr not haskell fault, it was with that purpose made the typed  lamda calculus