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

ajb at spamcop.net ajb at spamcop.net
Thu Feb 22 17:37:18 EST 2007

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:


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

Andrew Bromage

More information about the Haskell-Cafe mailing list