 The former is equivalent to<p><pre><code>    fac&#x27; f 0 = 1
    fac&#x27; f n = n * f (n-1)
    fix f    = f (fix f)
    fac = fix fac&#x27;
</code></pre>
so if the second is indeed faster then explicit fixpoints beat tail recursion