What is "improper" about this implementation in Haskel?
fix :: (a -> a) -> a
fix f = let x = f x in x fix :: (a -> a) -> a
fix f = let x = f x in xThat definition is dependent on recursion already being present.