[Haskell-cafe] Re: Why no merge and listDiff?

[Heinrich Apfelmus]

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