<div dir="ltr"><div class="gmail_extra"><br><div class="gmail_quote">On Wed, Apr 29, 2015 at 8:36 AM, Doug McIlroy <span dir="ltr"><<a href="mailto:doug@cs.dartmouth.edu" target="_blank">doug@cs.dartmouth.edu</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div id=":17d" class="a3s" style="overflow:hidden">
I'm afraid I don't understand why the program isn't a sieve. <span class="il">Is</span><br>
the concern <span class="il">that</span> the sequence of integers <span class="il">is</span> thinned by dropping<br>
composites rather than by merely marking them and counting across<br>
them? Or <span class="il">is</span> it <span class="il">that</span> a trace of lazy evaluation will show <span class="il">that</span> all<br>
the divisibility tests on a single integer are clustered together<br>
in time? Or something I haven't thought of?</div></blockquote></div><br></div><div class="gmail_extra">When I reread Ertugrul's original email, I see that he's alerting to the danger of derision. There will be people who will mock Haskell for having an un-performant and un-Eratosthenian non-sieve on its front page.<br><br>As in, Haskell people don't even know their basic math, ha ha.<br></div><div class="gmail_extra"><br></div><div class="gmail_extra">It used to be fibonaccis. That's too inviting of derision. Primes are more noble, so the thinking goes.<br><br></div><div class="gmail_extra">That very small space on the face of Haskell must perform incredible duties. Among them, it has to showcase beautiful syntax, see:<br><br><a href="https://github.com/haskell-infra/hl/issues/46#issuecomment-72331664">https://github.com/haskell-infra/hl/issues/46#issuecomment-72331664</a><br></div><div class="gmail_extra"><br></div><div class="gmail_extra">HTH,<br clear="all"></div><div class="gmail_extra"><div><div class="gmail_signature">-- Kim-Ee</div></div>
</div></div>