[GHC] #5395: Context reduction stack overflow without undecidable instances

[GHC]

#5395: Context reduction stack overflow without undecidable instances
-------------------------------------+-------------------------------------
        Reporter:  guest             |            Owner:
            Type:  bug               |           Status:  new
        Priority:  normal            |        Milestone:
       Component:  Compiler          |          Version:  7.0.4
      Resolution:                    |         Keywords:  type family,
Operating System:  Unknown/Multiple  |  termination
 Type of failure:  GHC rejects       |     Architecture:  Unknown/Multiple
  valid program                      |       Difficulty:  Unknown
       Test Case:                    |       Blocked By:
        Blocking:                    |  Related Tickets:
-------------------------------------+-------------------------------------
Changes (by nomeata):

 * status:  closed => new
 * difficulty:   => Unknown
 * resolution:  fixed =>


Comment:

 I am just implementing separate counters for type family applications and
 constraints solving. Should I change the constraint limit back to `20`
 then, and leave the type family application limit at `200`? Or even
 higher?

 (Reopening as some discussion is required.)

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