[GHC] #10493: Inaccessible code might be accessible with newtypes and Coercible

[GHC]

#10493: Inaccessible code might be accessible with newtypes and Coercible
-------------------------------------+-------------------------------------
        Reporter:  goldfire          |                   Owner:  goldfire
            Type:  bug               |                  Status:  new
        Priority:  normal            |               Milestone:
       Component:  Compiler          |                 Version:  7.11
      Resolution:                    |                Keywords:
Operating System:  Unknown/Multiple  |            Architecture:
 Type of failure:  None/Unknown      |  Unknown/Multiple
      Blocked By:                    |               Test Case:
 Related Tickets:                    |                Blocking:
                                     |  Differential Revisions:
-------------------------------------+-------------------------------------

Comment (by simonpj):

 Replying to [comment:3 goldfire]:
 > It would be nice to combine `typesCantMatch` with the apartness check,
 but there's a key difference: `typesCantMatch` is about representational
 equality, but apartness is about nominal equality.

 I don't agree at all!  If you look at the single call to `typesCantMatch`
 you'll see that it's passed a list of '''Nominal''' equalities, namely the
 ones bound by the GADT.  Admittedly this is not documented, and it should
 be. But it's true.

 Simon

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