[Haskell-cafe] Code and Perf. Data for Prime Finders (was: Genuine Eratosthenes sieve)

[ajb at spamcop.net]

G'day all.

Quoting Melissa O'Neill <oneill at cs.hmc.edu>:

> But talk is cheap.  What about some actual numbers, and some code for
> some actual implementations...?

Just to fill out the implementations:

    http://andrew.bromage.org/darcs/numbertheory/

Math/Prime.hs has an implementation  of the Atkin-Bernstein sieve.

Cheers,
Andrew Bromage