News for hackers. Stuff that matters.
Re:The Evolution of a Haskell Programmer (2001) by lmm on Tuesday February 09, 2016 @03:14AM (#11063887)
To be clear, Y itself doesn't have to be recursive either. You can express it as an ordinary lambda, and write a recursive program without any named values or functions.
Re:The Evolution of a Haskell Programmer (2001) by ufo on Tuesday February 09, 2016 @10:58AM (#11066102)
The problem with Haskell is that you can't express Y as an ordinary lambda in a typed language unless your type system allows recursive datatypes (at which point you are also pushing the recursion back into a language primitive)