[GHC] #7633: Checkable "minimal complete definitions"

[GHC]

#7633: Checkable "minimal complete definitions"
-------------------------------------+------------------------------------
        Reporter:  shachaf           |            Owner:
            Type:  feature request   |           Status:  patch
        Priority:  normal            |        Milestone:  7.8.1
       Component:  Compiler          |          Version:  7.6.1
      Resolution:                    |         Keywords:
Operating System:  Unknown/Multiple  |     Architecture:  Unknown/Multiple
 Type of failure:  None/Unknown      |       Difficulty:  Unknown
       Test Case:                    |       Blocked By:
        Blocking:                    |  Related Tickets:  #6028
-------------------------------------+------------------------------------

Comment (by jstolarek):

 twanvl: I feel that work you've done could use more comments. Could you
 add some more explanation what and why the code does? I'm thinking mostly
 about !BooleanFormula module - there is no comment explaining its purpose
 ("Boolean formulas without negation (qunatifier free)" is a bit criptic!)
 and design decisions that you've made (in 2 or 3 months you will not
 remeber them!). Thanks

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