12 Jul
2009
12 Jul
'09
5:03 a.m.
On 7/9/09, Heinrich Apfelmus
Of course, some part of algorithm has to be recursive, but this can be outsourced to a general recursion scheme, like the hylomorphism
hylo :: Functor f => (a -> f a) -> (f b -> b) -> (a -> b) hylo f g = g . fmap (hylo f g) . f
Is that definition of hylo actually usuable? A few on IRC tried to use that definition for a few examples, but the examples failed to terminate or blew up the stack.