Re: List functions - "Under" operations

G'day all. Quoting Brandon Michael Moore :

Hello, and welcome me to the list

Welcome you!

Almost all of the times I use the "By" functions follow that pattern: e.g. sortFoos :: [Foo] -> [Foo] sortFoos = sortBy (\x y -> compare (f x) (f y))

Just noting that this particular example has a very simple solution: http://haskell.org/hawiki/SchwartzianTransform This technique probably doesn't solve all your problems, though. Cheers, Andrew Bromage