> Is this true in practice?  That is, are there programs which have
> different asymptotic running times when compiled under ghc or hbc than
> when running under Hugs?
Theoretically it might happen, but in practice it would be very rare
(at least for hbc).

There one exception, hbc implements a true hack that turns potentially
quadratic behaviour of outputting concatenated lists into linear.
It's surprisingly useful.

    -- Lennart


Reply via email to