Daniel Fischer <daniel.is.fischer <at> web.de> writes:
> No, it's my own code. Nothing elaborate, just sieving numbers 6k±1, twice as fast as the haskellwiki code (here) and uses only 1/3 the memory. For the record: ..... thanks! will need to sift through it thoroughly... :) :) > > > > BTW I think a really smart compiler should just get a specification, like > > Turner's sieve, and just derive a good code from that by itself. > > Go ahead and write one. I would love such a beast. > > > > > Another example would be > > > > qq n m = sum $ take n $ cycle [1..m] > > > > which should really get compiled into just a math formula, IMO. Now _that_ > > I would call a good compiler. > > Dream on, dream on, with hope in your heart. Those who can't do, dream. And rant. :) > > Maybe you'd like > http://en.wikipedia.org/wiki/Shakespeare_(programming_language) ? niice. :) > > > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe <at> haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
