[Haskell-cafe] Performance difference between ghc and ghci

Tillmann Rendel rendel at Mathematik.Uni-Marburg.de
Tue Feb 22 10:23:05 CET 2011


C K Kashyap wrote:
> I missed out the optimization bit .... yes, that would make a difference.
> However beyond that is it not just about graph reduction which should be
> the same?

Even if the number of reduction steps is the same, the bytecode 
interpreter is still slower than compiled code, because it takes more 
processor cycles per reduction step. This interpretative overhead could 
be avoided, for example, using just-in-time compilation à la Smalltalk 
or Java.


More information about the Haskell-Cafe mailing list