[Haskell-cafe] Data.Set subset function?

I don't see a subset function in Data.Set. What is the preferred way to define this? I currently have: a `subset` b = isEmptySet (a `minusSet` b) (Hmmm... does library style prefer `subset`, `subsetOf`, `isSubset`, `isSubsetOf` ?) #g Graham Klyne For email: http://www.ninebynine

RE: [Haskell-cafe] STG optimization

On 20 July 2004 22:58, [EMAIL PROTECTED] wrote: > So far so good. Nonetheless, some doubts have arisen when I have > started to try to add updating. In the paper, implementation for > "update in place" is extensively discussed, although it is said it > could greatly increase the memory space usage

Re: [Haskell-cafe] Sets and Monads and comprehensions

On Tue, Jul 20, 2004 at 04:42:24PM +0100, Graham Klyne wrote: > I found myself treading a path which led me to asking the same question as > [1]. Given the answer [2], I'd like to stand back a little and ask if > there's another way to tackle my niggle: what I'm interested in is a set > compre