finding primes

[S.D.Mechveliani]

Hello,

I wrote recently on generating prime numbers

> [..]
> The DoCon program written in Haskell (again, no arrays) gives
> [..]
>  take 5 $ filter isPrime [(10^9 ::Integer) ..] 
>  -->
>  [1000000007,1000000009,1000000021,1000000033,1000000087]
>
> This takes  0.05 sec.
> [..]


But it is better to refer to the  BAL  library for Haskell 
(basAlgPropos)
            http://www.botik.ru/pub/local/Mechveliani/basAlgPropos/

It is easier to use.

------------------
Sergey Mechveliani
mechvel@botik.ru