News for hackers. Stuff that matters.
Re:The Evolution of a Haskell Programmer (2001) by tromp on Monday February 08, 2016 @03:26PM (#11060649)
The former is equivalent to

    fac' f 0 = 1
    fac' f n = n * f (n-1)
    fix f    = f (fix f)
    fac = fix fac'
so if the second is indeed faster then explicit fixpoints beat tail recursion

There are no comments on this comment yet.