{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T21:02:53Z","timestamp":1780434173138,"version":"3.54.1"},"reference-count":10,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    A much beloved and widely used example showing the elegance and simplicity of lazy functional programming represents itself as \u201cThe Sieve of Eratosthenes.\u201d This paper shows that this example is\n                    <jats:italic>not<\/jats:italic>\n                    the sieve and presents an implementation that actually is.\n                  <\/jats:p>","DOI":"10.1017\/s0956796808007004","type":"journal-article","created":{"date-parts":[[2008,10,9]],"date-time":"2008-10-09T08:06:38Z","timestamp":1223539598000},"page":"95-106","source":"Crossref","is-referenced-by-count":31,"title":["The Genuine Sieve of Eratosthenes"],"prefix":"10.1017","volume":"19","author":[{"given":"MELISSA E.","family":"O'NEILL","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2009,1,1]]},"reference":[{"key":"S0956796808007004_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811326"},{"key":"S0956796808007004_ref9","first-page":"3","article-title":"An upper bound for the number of cancelled numbers in the Sieve of Eratosthenes","volume":"19","author":"Selberg","year":"1946","journal-title":"Det kongelige Norske videnskabers selskabs forhandlinger, Trondhjem"},{"key":"S0956796808007004_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9316-0"},{"key":"S0956796808007004_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(87)90024-4"},{"key":"S0956796808007004_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289493"},{"key":"S0956796808007004_ref3","first-page":"354","volume-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1979"},{"key":"S0956796808007004_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796804005210"},{"key":"S0956796808007004_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58691-1_67"},{"key":"S0956796808007004_ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002670"},{"key":"S0956796808007004_ref10","volume-title":"SASL Language Manual","author":"Turner","year":"1975"}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796808007004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:36:13Z","timestamp":1779834973000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796808007004\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["S0956796808007004"],"URL":"https:\/\/doi.org\/10.1017\/s0956796808007004","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}