论文信息 - The Genuine Sieve of Eratosthenes

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.

Melissa E. O'Neill

[1] Kongelige Norske videnskabers selskab,et al. Det Kongelige Norske videnskabers selskabs forhandlinger , 1929 .

[2] LAMBERT MEERTENS. Calculating the Sieve of Eratosthenes , 2004, J. Funct. Program..

[3] Godfrey H. Hardy,et al. An introduction to the theory of numbers (5. ed.) , 1995 .

[4] Paul Pritchard. Linear Prime-Number Sieves: A Family Tree , 1987, Sci. Comput. Program..

[5] S. A. Bengelloun. An incremental primal sieve , 2004, Acta Informatica.

[6] Lawrence C. Paulson,et al. ML for the working programmer (2. ed.) , 1996 .

[7] Richard S. Bird,et al. FUNCTIONAL PEARL On building trees with minimum height , 1997, Journal of Functional Programming.

[8] Leonard M. Adleman,et al. Proceedings of the First International Symposium on Algorithmic Number Theory , 1994 .

[9] C. Pomerance,et al. Prime Numbers: A Computational Perspective , 2002 .

[10] Colin Runciman. FUNCTIONAL PEARL: Lazy wheel sieves and spirals of primes , 1997 .

[11] Paul Pritchard. Improved incremental prime number sieves , 1994, ANTS.

[12] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.

[13] Colin Runciman. Lazy Wheel Sieves and Spirals of Primes , 1997, J. Funct. Program..