[Haskell-cafe] Detecting Cycles in Datastructures
simonpj at microsoft.com
Mon Nov 28 04:09:40 EST 2005
| Andrew Pimlott:
| //about my highly spiritual essay on lazy computing of PI//:
| > In addition to being clever and terribly funny, the conclusion
| > foreshadows (inspired?) later work on Enron .
| Come on, it is improbable that Master Simon ever read my essay...
I hadn't before, but I have now. Cool stuff. I once wrote a
continued-fraction package with the something of the same flavour (since
overtaken by David Lester's work, which to my deep sadness remains
unpublished to this day).
Your code clearly belongs in the nofib suite, as a splendid way to
consume compute cycles and test compilers. Do send me a Main.hs to
compute pi, with a changeable runtime (presumably just adjust 'take').
More information about the Haskell-Cafe