[Haskell-cafe] Looking for the fastest Haskell primes algorithm

[wren ng thornton]

Edward Kmett wrote:
> You might want to start with the Sieve of Atkin:
> 
> http://en.wikipedia.org/wiki/Sieve_of_Atkin

Also worth reading _Lazy wheel sieves and spirals of primes_:

     http://www.cs.york.ac.uk/ftpdir/pub/colin/jfp97lw.ps.gz

-- 
Live well,
~wren