[GHC] #8423: contraint solver doesn't reduce reducible closed type family expressions (even with undecidable instances!)

[GHC]

#8423: contraint solver doesn't  reduce reducible closed type family expressions
(even with undecidable instances!)
--------------------------------------------+------------------------------
        Reporter:  carter                   |            Owner:
            Type:  feature request          |           Status:  new
        Priority:  normal                   |        Milestone:  7.10.1
       Component:  Compiler (Type checker)  |          Version:  7.7
      Resolution:                           |         Keywords:
Operating System:  Unknown/Multiple         |     Architecture:
 Type of failure:  None/Unknown             |  Unknown/Multiple
       Test Case:                           |       Difficulty:  Unknown
        Blocking:                           |       Blocked By:
                                            |  Related Tickets:  #4259
--------------------------------------------+------------------------------

Comment (by carter):

 honestly i just want a way to check things, my ticket here is just noting
 limits that happen with type families. I'm open to anything that has a
 sane usability story and a sane engineering story (on the ghc and users
 sides both).

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