I agree with Fergus. minimumBy should be consistent with sortBy and
insertBy, and we can't and shouldn't redefine sortBy and insertBy in
terms of min. Also (minimumBy f) should not be the same function as
(maximumBy f). That's confusing, to say the least. (minimumBy min) is
also sounds redundant.
OTOH, if we were to redefine all the xxxBy functions that involve
comparison, I'd vote for ((<=) :: a->a->Bool) over (compare ::
a->a->Ordering) as the comparison function since (<=) is often easier to
create a quick definition for. I wouldn't consider such a change until
Haskell 2, though.
Just my $0.02.
Matt Harden
