[GHC] #4219: sequence is not tail recursive, doesn't work with large inputs in strict monads

[GHC]

#4219: sequence is not tail recursive, doesn't work with large inputs in strict
monads
-------------------------------+-------------------------------------------
        Reporter:  EyalLotem   |            Owner:
            Type:  bug         |           Status:  closed
        Priority:  normal      |        Milestone:  7.2.1
       Component:  Compiler    |          Version:  6.12.3
      Resolution:  wontfix     |         Keywords:  sequence tail recursive
Operating System:              |     Architecture:  x86
  Unknown/Multiple             |       Difficulty:  Unknown
 Type of failure:              |       Blocked By:
  None/Unknown                 |  Related Tickets:
       Test Case:              |
        Blocking:              |
-------------------------------+-------------------------------------------
Changes (by nh2):

 * difficulty:   => Unknown


Comment:

 Another way to treat this is to make the stack size unbounded by default.

 As far as understand, this is now more feasible than it was when this bug
 was opened.

 This way, the user would not have problems with the operational semantics
 as originally asked for.

 (By the way, while in this bug the problem is seen as something hard to
 optimize, you could also understand using the stack for lists as an
 optimization that breaks things.)

 I opened http://ghc.haskell.org/trac/ghc/ticket/8189 to discuss the issue.

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