The Y combinator is a higher-order function that allows a function that does not know its own name to call itself.
A regular function can contain a call to itself in its definition, no problem. I can't figure out how to …
python recursion lambda y-combinatorIs it possible to write the Y Combinator in Haskell? It seems like it would have an infinitely recursive type. …
haskell y-combinator