[Haskell-cafe] Re: Why no merge and listDiff?

Will Ness schrieb:

I meant strictly increasing ordered lists, without multiples, for which the two operations, 'merge' and 'minus', would also have to produce like lists, i.e strictly increasing, without multiples.

Why don't you use directly Data.Set?

I guess the first variety is more appropriate for bags, and the second one - for sets. The two would have to be de-conflated for that. (?)

There are also bags aka multisets: http://hackage.haskell.org/package/multiset Cheers Christian