The genuine sieve of eratosthenes

Authors:
Melissa e. O'neill
Affiliations:
Harvey mudd college, claremont, ca, u.s.a (e-mail: oneill@acm.org)
Venue:
Journal of Functional Programming
Year:
2009

Citing 6
Cited 4

An incremental primal sieve

Acta Informatica
Linear prime-number sieves: a family tree

Science of Computer Programming
ML for the working programmer (2nd ed.)

ML for the working programmer (2nd ed.)
Improved incremental prime number sieves

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
FUNCTIONAL PEARL: Lazy wheel sieves and spirals of primes

Journal of Functional Programming
Calculating the Sieve of Eratosthenes

Journal of Functional Programming

A tutorial on parallel and concurrent programming in Haskell

AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Lazy UTP

UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
A note on the genuine sieve of eratosthenes

Journal of Functional Programming
Using XQuery for problem solving

Software—Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

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.