Hostname: page-component-6766d58669-6mz5d Total loading time: 0 Render date: 2026-05-15T03:05:52.948Z Has data issue: false hasContentIssue false
  • English
  • Français

The Genuine Sieve of Eratosthenes

Part of: JFP Research Articles

Published online by Cambridge University Press:  01 January 2009

MELISSA E. O'NEILL
MELISSA E. O'NEILL*
Affiliation:
Harvey Mudd College, Claremont, CA, U.S.A (e-mail: oneill@acm.org)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Articles
Information
Journal of Functional Programming , Volume 19 , Issue 1 , January 2009 , pp. 95 - 106
Copyright
Copyright © Cambridge University Press 2008

References

Bengelloun, S. A. (1986) An incremental primal sieve. Acta Inf. 23, 119–125.CrossRefGoogle Scholar
Crandall, R. & Pomerance, C. (2001) Prime Numbers. A Computational Perspective. New York: Springer-Verlag.CrossRefGoogle Scholar
Hardy, G. H. & Wright, E. M. (1979) An Introduction to the Theory of Numbers. 5th ed.Oxford: Clarendon Press, pp. 354–358.Google Scholar
Meertens, L. (2004) Calculating the Sieve of Eratosthenes. J. Funct. Prog. 14 (6), 759–763.CrossRefGoogle Scholar
Paulson, L. C. (1996) ML for the Working Programmer. 2nd ed.Cambridge University Press.Google Scholar
Pritchard, P. (1987) Linear prime-number sieves: A family tree. Sci. Comput. Prog. 9, 17–35.CrossRefGoogle Scholar
Pritchard, P. (1994) Improved incremental prime number sieves. In Proceedings of the First International Symposium on Algorithmic Number Theory. London: Springer-Verlag, pp. 280–288.Google Scholar
Runciman, C. (1997) Lazy wheel sieves and spirals of primes. J. Funct. Prog. 7 (2), 219–225.CrossRefGoogle Scholar
Selberg, S. (1946) An upper bound for the number of cancelled numbers in the Sieve of Eratosthenes. Det kongelige Norske videnskabers selskabs forhandlinger, Trondhjem 19 (2), 3–6.Google Scholar
Turner, D. A. (1975) SASL Language Manual. Technical Report CS/75/1. Department of Computational Science, University of St. Andrews.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.