Skip to main content
    • Aa
    • Aa

The Genuine Sieve of Eratosthenes


A much beloved and widely used example showing the elegance and simplicity of lazy functional programming represents itself as “The Sieve of Eratosthenes.” This paper shows that this example is not the sieve and presents an implementation that actually is.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

S. A. Bengelloun (1986) An incremental primal sieve. Acta Inf. 23, 119125.

R. Crandall & C. Pomerance (2001) Prime Numbers. A Computational Perspective. New York: Springer-Verlag.

P. Pritchard (1987) Linear prime-number sieves: A family tree. Sci. Comput. Prog. 9, 1735.

P. Pritchard (1994) Improved incremental prime number sieves. In Proceedings of the First International Symposium on Algorithmic Number Theory. London: Springer-Verlag, pp. 280288.

C. Runciman (1997) Lazy wheel sieves and spirals of primes. J. Funct. Prog. 7 (2), 219225.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 25 *
Loading metrics...

Abstract views

Total abstract views: 223 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 29th May 2017. This data will be updated every 24 hours.