A: "X has some problems with runtime performance."
B: "My work solves all your problems. There is no problem."
"Beware of the Turing tar-pit in which everything is possible but
nothing of interest is easy" - Alan Perlis.
can /= can be bothered.
:)
Ben.
On 12/02/2009, at 5:26 PM, Daniel Peebles wrote:
These seem to be good starting points:
http://donsbot.wordpress.com/2008/05/06/write-haskell-as-fast-as-c-exploiting-strictness-laziness-and-recursion/
http://donsbot.wordpress.com/2008/06/04/haskell-as-fast-as-c-working-at-a-high-altitude-for-low-level-performance/
http://haskell.org/haskellwiki/Wc
On Wed, Feb 11, 2009 at 8:15 PM, Bulat Ziganshin
<bulat.zigans...@gmail.com> wrote:
Hello Don,
Thursday, February 12, 2009, 3:45:36 AM, you wrote:
You should do your own benchmarking!
well, when you say that ghc can generate code that is fast as gcc, i
expect that you can supply some arguments. is the your only argument
that ghc was improved in last years? :)
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
