4 ms·
What is "improper" about this implementation in Haskel? fix :: (a -> a) -> a fix f = let x = f x in x
by hackyhacky 3y ago
What is "improper" about this implementation in Haskel?
fix :: (a -> a) -> a
fix f = let x = f x in x
- lambdas 3y agoThe y combinator is used to implement recursion in a language without recursion no? That definition is dependent on recursion already being present.