Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Prime Numbers for Haskell
Haskell
Branch: master

allow arbitrary (and return for non-positive) integers as argument of…

… . fixed by ahammar.
latest commit c790609dbc
Sebastian Fischer authored
Failed to load latest commit information.
Data/Numbers allow arbitrary (and return for non-positive) integers as argument of…
.gitignore tests in gitignore
LICENSE initial commit
README typo in README
Setup.lhs
memory.hs More general interface with specialisation to Int and Integer. Also a…
primes.cabal allow arbitrary (and return for non-positive) integers as argument of…
runtime.hs More general interface with specialisation to Int and Integer. Also a…

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>

Something went wrong with that request. Please try again.