Heinrich Apfelmus <apfelmus <at> quantentunnel.de> writes: > > Will Ness wrote: > > You can check it out on the Haskellwiki Prime Numbers page (work still in > > progress, the comparison tables are missing). We had also a recent thread here > > in cafe under "FASTER primes". The original idea of Heinrich Apfelmus of > > treefold merging the composites really panned out. > > (Just for historical reference, credit for the data structure that works > with infinite merges goes to Dave Bayer, I merely contributed the > mnemonic aid of interpreting it in terms of VIPs.) > > Regards, > Heinrich Apfelmus > > -- > http://apfelmus.nfshost.com >
yes, yes, my bad. GMANE is very unreliable at presenting the discussion threads in full. :| I saw it first on the Haskellwiki page though, and it was your code there, that's the reason for my mistake. :) _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
