Many functions can be generalised

Lana Black lanablack at
Wed Nov 30 23:25:15 UTC 2016

On 09:08 Wed 30 Nov     , Baldur Blöndal wrote:
> P.s. At least I did not propose ↓ yet :)
> > shuffleM :: (Foldable f, MonadRandom m) => f a -> m (f a)

This would be an utter nonsense, given that many if not most foldables
either don't have an order like Set or must have very specific order
like different kinds of trees and therefore cannot be shuffled.

More information about the Libraries mailing list