Just another update

Task/Y-combinator/Haskell/y-combinator-2.hs

@@ -1,25 +1,25 @@
 fix :: (a -> a) -> a
-fix f = f (fix f)
+fix f = f (fix f)        -- _not_ the {fix f = x where x = f x}
 
 fac :: Integer -> Integer
-fac' f n | n <= 0    = 1
+fac_ f n | n <= 0    = 1
          | otherwise = n * f (n-1)
-fac = fix fac'
+fac = fix fac_           -- fac_ (fac_ . fac_ . fac_ . fac_ . ...)
 
 -- a simple but wasteful exponential time definition:
 fib :: Integer -> Integer
-fib' f 0 = 0
-fib' f 1 = 1
-fib' f n = f (n-1) + f (n-2)
-fib = fix fib'
+fib_ f 0 = 0
+fib_ f 1 = 1
+fib_ f n = f (n-1) + f (n-2)
+fib = fix fib_
 
 -- Or for far more efficiency, compute a lazy infinite list. This is
 -- a Y-combinator version of: fibs = 0:1:zipWith (+) fibs (tail fibs)
 fibs :: [Integer]
-fibs' a = 0:1:(fix zipP a (tail a))
+fibs_ a = 0:1:(fix zipP a (tail a))
     where
       zipP f (x:xs) (y:ys) = x+y : f xs ys
-fibs = fix fibs'
+fibs = fix fibs_
 
 -- This code shows how the functions can be used:
 main = do