[GHC] #15403: Compact Regions with Lazy Evaluation

[GHC]

#15403: Compact Regions with Lazy Evaluation
-------------------------------------+-------------------------------------
        Reporter:  andrewthad        |                Owner:  (none)
            Type:  feature request   |               Status:  new
        Priority:  normal            |            Milestone:  8.6.1
       Component:  Compiler          |              Version:  8.4.3
      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 bgamari):

 Right, I've thought a fair bit about how you might be able to use compact
 regions as an arena-style allocator for subcomputations. Of course, this
 involves teaching mutators to allocate directly into the compact. It turns
 out this is quite tricky to do for the reasons that Omer mentions. Our
 implementation of laziness is such that it's very hard to regain control
 over allocation behavior.

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