If you decide to continue working with infinite sets, then my advice
would be to change your representation. For infinite sets, do not use
an implicit representation (ie like a potentially infinite list) but
switch to an explicit symbolic-generator representation. In other
words, you need to
Am Dienstag, 20. Dezember 2005 14:04 schrieb Bulat Ziganshin:
> [...]
> SPJ> PS: GHC is now using Trac as its bug tracker, and has its own Wiki as
> SPJ> well. Please improve it! (Anyone can edit.)
> SPJ> http://hackage.haskell.org/trac/ghc
>
> why you are preffered to create new Wiki system ins
Hello Simon,
Tuesday, December 20, 2005, 12:30:56 PM, you wrote:
SPJ> * There were suggestions of newsgroups and web forums.
i think that newcomers, especially yonger ones, will prefer to see web
forum. it's like Mekka now - everyone know how to use it and those who
are not Internet-gurus in man
When I started the Ranged Sets library "infinite" sets (i.e. sets based
on infinite lists of ranges) looked easy. The set primitives of union
and intersection are simple merge algorithms, so they would work fine on
infinite lists of ranges. Set difference is implemented as a
combination of in
Version 0.0.2 of the Ranged Sets library is now available at
http://sourceforge.net/projects/ranged-sets/
The new release features infix operators, improved ability to handle
infinite lists, and lots of QuickCheck properties for added confidence.
Paul.
___
