On Fri, 2008-04-25 at 09:08 -0700, Don Stewart wrote:
Geraint.Jones:
Are there well-known differences in the implementations of Haskell in ghci and hugs? I've got some moderately intricate code (simulations of pipelined processors) that behave differently - apparently because ghci Haskell is stricter than hugs Haskell, and I cannot find any obviously relevant claims about strictness in the documentation.
I think they should give the same answer. It sounds like a bug in one implementation or the other.
Hugs does no optimisations, while GHC does a truckload, including strictness analysis. Some of these optimisations prevent space leaks.
Though none should change the static semantics. Post the code. Even if you don't have time to track down the difference, someone might. Duncan