Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-19T23:54:12.587Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on the genuine Sieve of Eratosthenes

Published online by Cambridge University Press:  16 May 2011

MATTI NYKÄNEN
MATTI NYKÄNEN*
Affiliation:
School of Computing, University of Eastern Finland, FI-70211 Kuopio, Finland (e-mail: matti.nykanen@uef.fi)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

O'Neill (The genuine Sieve of Eratosthenes. J. Funct. Program. 19(1), 2009, 95–106) has previously considered a functional implementation for the genuine Sieve of Eratosthenes, based on the well-known heap data structure. Here, we develop it further by adapting this data structure to this particular application.

Type
Functional Pearls
Information
Journal of Functional Programming , Volume 21 , Issue 6 , November 2011 , pp. 563 - 572
Copyright
Copyright © Cambridge University Press 2011

References

Hutton, G. (2007) Programming in Haskell. Cambridge University Press.CrossRefGoogle Scholar
O'Neill, M. E. (2009) The genuine Sieve of Eratosthenes. J. Funct. Program. 19 (1), 95–106.Google Scholar
O'Neill, M. E. & Smith, L. P. (2009) The NumberSieves Package [online]. Accessed July 13, 2009. Available at: http://hackage.haskell.org/package/NumberSievesGoogle Scholar
Paulson, L. C. (1996) ML for The Working Programmer. 2nd ed.Cambridge University Press.CrossRefGoogle Scholar
Peyton Jones, S. (ed) (2003) Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press. Also available as J. Funct. Program., Special Issue, 13(1), 2003, and [online]. Available at: http://haskell.org/onlinereport/Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.