> 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
- RE: Reduction count as efficiency measure? Jan Skibinski
- Re: Reduction count as efficiency measure? Fergus Henderson
- Re: Reduction count as efficiency measure? Lennart Augustsson
- Re: Reduction count as efficiency measure? Graeme Moss
- Re: Reduction count as efficiency measure? Graeme Moss
- Re: Reduction count as efficiency measure? Keith Wansbrough
- Re: Reduction count as efficiency measure? Carl R. Witty
- Re: Reduction count as efficiency measure? Amr A Sabry
- Re: Reduction count as efficiency measure? Ralf Hinze
- Re: Reduction count as efficiency measure? Carl R. Witty
- RE: Reduction count as efficiency measure? Lennart Augustsson
- RE: Reduction count as efficiency measure? Simon Peyton-Jones
- Re: Reduction count as efficiency measure? Bart Demoen
- Re: Reduction count as efficiency measure? Olaf Chitil
