got some good answers to my fibonacci question https://gist.github.com/3525074
-
-
Replying to @liammclennan
@liammclennan Is the infinite list faster? I am interested to know why the Haskell implementation is slower for you. Cc@dibblego4 replies 0 retweets 0 likes -
Replying to @tarnacious
@tarnacious@liammclennan The same code in any strict language would spin in a loop (or exception).3 replies 0 retweets 0 likes -
Replying to @dibblego
@dibblego@tarnacious what about Rob's IEnumerable + yield example?1 reply 0 retweets 0 likes
Replying to @liammclennan
@liammclennan @tarnacious That's quite different code, but it is linear. The haskell, ported to java, parallelised https://github.com/functionaljava/functionaljava/blob/master/demo/src/main/fj/demo/concurrent/Fibs.java …
4:10 PM - 30 Aug 2012
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.