[Haskell-cafe] least fixed points above something

[Jens Blanck]

Hi,

I found myself writing the following

leastFixedPoint :: (Eq a) => (a -> a) -> a -> a
leastFixedPoint f x = fst . head . dropWhile (uncurry (/=)) $ zip l (tail l)
    where l = iterate f x

and was a bit surprised that I couldn't get any matches on hoogle for the
type above. The closest one is fix :: (a -> a) -> a but that sort of assumes
that we're starting the fixed point search from the bottom element
(undefined).

Anyway, is there a nicer way of doing the above?

Jens
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20090319/113cfeab/attachment.htm