And IIRC, the fixed-point combinator can be defined in Haskell in a way not dissimilar to lambda’s Y combinator itself: fix :: (a -> a) -> a fix f = f (fix

And IIRC, the fixed-point combinator can be defined in Haskell in a way not dissimilar to lambda’s Y combinator itself: fix :: (a -> a) -> a fix f = f (fix f) (I’d say it’s even more aesthetically pleasing, even if a bit way too simple.)