Check out what GHC is doing these days, and come back with an analysis
of what still needs to be improved. We can't wait to hear!
can you point me to any haskell code that is as fast as it's C
equivalent?
You should do your own benchmarking!
Please, folks! This is hardly helpful.
It isn't
Hello John,
Wednesday, February 11, 2009, 11:55:47 PM, you wrote:
it's exactly example of tight loop. and let's compare HP code written
for this task with analogous code written in C. i expect that haskell
code is much more complex
I think it's fair to point out that tight loops are nearly
bulat.ziganshin:
Hello John,
Wednesday, February 11, 2009, 11:55:47 PM, you wrote:
it's exactly example of tight loop. and let's compare HP code written
for this task with analogous code written in C. i expect that haskell
code is much more complex
I think it's fair to point out
On Thu, Feb 12, 2009 at 8:11 AM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Wednesday, February 11, 2009, 11:55:47 PM, you wrote:
And ghc is still making large improvements with
each release, whereas gcc isn't likely to get significantly better.
yes, it's close to perfect
LOL!
Hello Don,
Thursday, February 12, 2009, 12:23:16 AM, you wrote:
Check out what GHC is doing these days, and come back with an analysis
of what still needs to be improved. We can't wait to hear!
can you point me to any haskell code that is as fast as it's C
equivalent?
--
Best regards,
bulat.ziganshin:
Hello Don,
Thursday, February 12, 2009, 12:23:16 AM, you wrote:
Check out what GHC is doing these days, and come back with an analysis
of what still needs to be improved. We can't wait to hear!
can you point me to any haskell code that is as fast as it's C
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? :)
--
Best
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/
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
