Skip to main content
×
Home
    • Aa
    • Aa

The Genuine Sieve of Eratosthenes

  • MELISSA E. O'NEILL (a1)
Abstract
Abstract

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.

Copyright
References
Hide All
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? *
×

Metrics

Full text views

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

Abstract views

Total abstract views: 308 *
Loading metrics...

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