By the same authors

From the same journal

FUNCTIONAL PEARL : lazy wheel sieves and spirals of primes

Research output: Contribution to journalArticle

Standard

FUNCTIONAL PEARL : lazy wheel sieves and spirals of primes. / Runciman, C.

In: Journal of Functional Programming, Vol. 7, No. 2, 03.1997, p. 219-225.

Research output: Contribution to journalArticle

Harvard

Runciman, C 1997, 'FUNCTIONAL PEARL : lazy wheel sieves and spirals of primes', Journal of Functional Programming, vol. 7, no. 2, pp. 219-225. https://doi.org/10.1017/S0956796897002670

APA

Runciman, C. (1997). FUNCTIONAL PEARL : lazy wheel sieves and spirals of primes. Journal of Functional Programming, 7(2), 219-225. https://doi.org/10.1017/S0956796897002670

Vancouver

Runciman C. FUNCTIONAL PEARL : lazy wheel sieves and spirals of primes. Journal of Functional Programming. 1997 Mar;7(2):219-225. https://doi.org/10.1017/S0956796897002670

Author

Runciman, C. / FUNCTIONAL PEARL : lazy wheel sieves and spirals of primes. In: Journal of Functional Programming. 1997 ; Vol. 7, No. 2. pp. 219-225.

Bibtex - Download

@article{457cca50ed0f4f2ea90b078061313608,
title = "FUNCTIONAL PEARL : lazy wheel sieves and spirals of primes",
abstract = "The popular method of enumerating the primes is the Sieve of Eratosthenes. It can be programmed very neatly in a lazy functional language, but runs rather slowly. A little-known alternative method is the Wheel Sieve, originally formulated as a fast imperative algorithm for obtaining all primes up to a given limit, assuming destructive access to a bit-array. This article describes functional variants of the wheel sieve that enumerate all primes as a lazy list.",
author = "C. Runciman",
note = "{\circledC} 1997 Cambridge University Press. Reproduced in accordance with the publisher's self-archiving policy.",
year = "1997",
month = "3",
doi = "10.1017/S0956796897002670",
language = "English",
volume = "7",
pages = "219--225",
journal = "Journal of Functional Programming",
issn = "1469-7653",
publisher = "Cambridge University Press",
number = "2",

}

RIS (suitable for import to EndNote) - Download

TY - JOUR

T1 - FUNCTIONAL PEARL : lazy wheel sieves and spirals of primes

AU - Runciman, C.

N1 - © 1997 Cambridge University Press. Reproduced in accordance with the publisher's self-archiving policy.

PY - 1997/3

Y1 - 1997/3

N2 - The popular method of enumerating the primes is the Sieve of Eratosthenes. It can be programmed very neatly in a lazy functional language, but runs rather slowly. A little-known alternative method is the Wheel Sieve, originally formulated as a fast imperative algorithm for obtaining all primes up to a given limit, assuming destructive access to a bit-array. This article describes functional variants of the wheel sieve that enumerate all primes as a lazy list.

AB - The popular method of enumerating the primes is the Sieve of Eratosthenes. It can be programmed very neatly in a lazy functional language, but runs rather slowly. A little-known alternative method is the Wheel Sieve, originally formulated as a fast imperative algorithm for obtaining all primes up to a given limit, assuming destructive access to a bit-array. This article describes functional variants of the wheel sieve that enumerate all primes as a lazy list.

U2 - 10.1017/S0956796897002670

DO - 10.1017/S0956796897002670

M3 - Article

VL - 7

SP - 219

EP - 225

JO - Journal of Functional Programming

JF - Journal of Functional Programming

SN - 1469-7653

IS - 2

ER -