<br><font size=2 face="sans-serif">Hello,</font>
<br>
<br><tt><font size=2>One frequent criticism of Haskell (and by extension
GHC) is that it has unpredictable performance and memory consumption. I
personally do not find this to be the case. I suspect that most programmer
confusion is rooted in shaky knowledge of lazy evaluation; and I have been
able to fix, with relative ease, the various performance problems I've
run into. However I am not doing any sort of performance critical computing
(I care about minutes or seconds, but not about milliseconds). </font></tt>
<br>
<br><tt><font size=2>I would like to know what others think about this.
Is GHC predictable? Is a thorough knowledge of lazy evaluation good enough
to write efficient (whatever that means to you) code? Or is intimate knowledge
of GHC's innards necessary?</font></tt>
<br>
<br><tt><font size=2>thanks,</font></tt>
<br><tt><font size=2> Jeff</font></tt>
<br>
<br><tt><font size=2>PS I am conflating Haskell and GHC because I use GHC
(with its extensions) and it produces (to my knowledge) the fastest code.</font></tt>
<br>
<br>
<span style="font-family:'Arial',sans-serif; font-size:8pt; color:#000000">---<br>
<br>
This e-mail may contain confidential and/or privileged information. If you <br>
are not the intended recipient (or have received this e-mail in error) <br>
please notify the sender immediately and destroy this e-mail. Any <br>
unauthorized copying, disclosure or distribution of the material in this <br>
e-mail is strictly forbidden.</span>