Efficient, purely functional generation of prime numbers

Version on this page:
LTS Haskell 13.23:
Stackage Nightly 2019-05-25:
Latest on Hackage:

See all snapshots primes appears in

BSD-3-Clause licensed and maintained by Sebastian Fischer

Module documentation for

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]: <>
[2]: <>

comments powered byDisqus