Prime Numbers for Haskell
Haskell
Latest commit c790609 Apr 29, 2011 Sebastian Fischer allow arbitrary (and return for non-positive) integers as argument of…
… . fixed by ahammar.
Permalink
Failed to load latest commit information.
Data/Numbers allow arbitrary (and return for non-positive) integers as argument of… Apr 29, 2011
.gitignore tests in gitignore Apr 17, 2009
LICENSE initial commit Apr 16, 2009
README typo in README Apr 17, 2009
Setup.lhs made Setup.lhs script executable. May 22, 2009
memory.hs More general interface with specialisation to Int and Integer. Also a… Aug 16, 2010
primes.cabal
runtime.hs More general interface with specialisation to Int and Integer. Also a… Aug 16, 2010

README

This Haskell library provides an efficient lazy wheel sieve for prime
generation inspired by "Lazy wheel sieves and spirals of primes" [1]
by Colin Runciman and "The Genuine Sieve of Eratosthenes" [2] by
Melissa O'Neil.

[1]: <http://www.cs.york.ac.uk/ftpdir/pub/colin/jfp97lw.ps.gz>
[2]: <http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf>