Runciman, C. orcid.org/0000-0002-0151-3233 (1997) FUNCTIONAL PEARL : lazy wheel sieves and spirals of primes. Journal of Functional Programming. pp. 219-225. ISSN 1469-7653
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.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 1997 Cambridge University Press. Reproduced in accordance with the publisher's self-archiving policy. |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Repository Officer |
Date Deposited: | 19 May 2008 11:35 |
Last Modified: | 11 Mar 2025 00:03 |
Published Version: | https://doi.org/10.1017/S0956796897002670 |
Status: | Published |
Refereed: | Yes |
Identification Number: | 10.1017/S0956796897002670 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:3784 |