primes: Efficient, purely functional generation of prime numbers

[ algorithms, bsd3, library, numerical ] [ Propose Tags ]

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


[Skip to Readme]
Versions [faq] 0.1, 0.1.1, 0.1.1.1, 0.2.0.0, 0.2.1.0
Dependencies base [details]
License LicenseRef-PublicDomain
Author Sebastian Fischer
Maintainer Sebastian Fischer
Category Algorithms, Numerical
Home page http://github.com/sebfisch/primes
Bug tracker mailto:sebf@informatik.uni-kiel.de
Source repo head: git clone git://github.com/sebfisch/primes.git
Uploaded by SebastianFischer at Thu Apr 16 13:10:01 UTC 2009
Distributions Arch:0.2.1.0, Debian:0.2.1.0, LTSHaskell:0.2.1.0, NixOS:0.2.1.0, Stackage:0.2.1.0
Downloads 12753 total (312 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for primes-0.1

[back to package description]
This Haskell library provides an efficient lazy wheel sieve for prime
generation ispired 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>