[GHC] #8779: Exhaustiveness checks for pattern synonyms

[GHC]

#8779: Exhaustiveness checks for pattern synonyms
--------------------------------------------+------------------------------
        Reporter:  nomeata                  |            Owner:
            Type:  feature request          |           Status:  new
        Priority:  normal                   |        Milestone:
       Component:  Compiler (Type checker)  |          Version:  7.6.3
      Resolution:                           |         Keywords:
Operating System:  Unknown/Multiple         |     Architecture:
 Type of failure:  None/Unknown             |  Unknown/Multiple
       Test Case:                           |       Difficulty:  Unknown
        Blocking:                           |       Blocked By:
                                            |  Related Tickets:
--------------------------------------------+------------------------------

Comment (by dfranke):

 In the common case where all pattern synonyms in a set of binding clauses
 are simply bidirectional, exhaustiveness can be inferred automatically. It
 would be nice if GHC did this.

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