Abstract
AbstractA 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.
Publisher
Cambridge University Press (CUP)
Reference10 articles.
1. ML for the Working Programmer
2. An upper bound for the number of cancelled numbers in the Sieve of Eratosthenes;Selberg;Det kongelige Norske videnskabers selskabs forhandlinger, Trondhjem,1946
3. Prime Numbers
4. Linear prime-number sieves: A family tree
5. An incremental primal sieve
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献