[GHC] #9374: Investigate Static Argument Transformation

[GHC]

#9374: Investigate Static Argument Transformation
-------------------------------------+-------------------------------------
        Reporter:  jstolarek         |                Owner:  (none)
            Type:  task              |               Status:  new
        Priority:  lowest            |            Milestone:
       Component:  Compiler          |              Version:  7.9
      Resolution:                    |             Keywords:
                                     |  StaticArgumentTransformation
Operating System:  Unknown/Multiple  |         Architecture:
 Type of failure:  Runtime           |  Unknown/Multiple
  performance bug                    |            Test Case:
      Blocked By:                    |             Blocking:
 Related Tickets:                    |  Differential Rev(s):
       Wiki Page:                    |
-------------------------------------+-------------------------------------

Comment (by simonpj):

 Good data, thank you.

 Next step:

 * Characterise where the big wins come from
 * Characterise where the regressions come from

 I usually start with allocations and use `-ticky` to localise it.

 I think SAT is quite hard to ALWAYS win.  But I speculate that SAT on a
 join point IS always a win.  Joachim is the expert there.

-- 
Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/9374#comment:23>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler