primes

Efficient, purely functional generation of prime numbers http://github.com/sebfisch/primes

Version on this page:0.2.1.0
LTS Haskell 8.15:0.2.1.0
Stackage Nightly 2017-05-27:0.2.1.0
Latest on Hackage:0.2.1.0
BSD3 licensed and maintained by Sebastian Fischer

Module documentation for 0.2.1.0

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>

comments powered byDisqus