#13360: Add a flag to enable inferring HasCallStack constraints -------------------------------------+------------------------------------- Reporter: gridaphobe | Owner: (none) Type: feature request | Status: new Priority: normal | Milestone: 8.4.1 Component: Compiler | Version: 8.0.1 Resolution: | Keywords: Operating System: Unknown/Multiple | Architecture: | Unknown/Multiple Type of failure: None/Unknown | Test Case: Blocked By: | Blocking: Related Tickets: | Differential Rev(s): Wiki Page: | -------------------------------------+------------------------------------- Comment (by simonpj): factorial is a very particular kind of program. I really doubt that a factor of 7 is typical. And I'd want to dig a bit more into what is happening here. Factorial 300 builds a stack of depth 300 -- but it also computes some extremly large `Integers`. As the size goes up I'd expect eventually 99% of the time to be spent in GMP. (This is another reason why this particular benchmark might be considered misleading.) So where is that increasing factor coming from? I'm not denying it's there; but sometimes these corner cases show up some stupid infelicity in GHC that is easily fixed. There are lots of programs in `nofib` that are a bit less unrealistic than factorial. -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/13360#comment:17 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler