[GHC] #9586: Implement Traversable/Foldable-Burning-Bridges Proposal

[GHC]

#9586: Implement Traversable/Foldable-Burning-Bridges Proposal
-------------------------------------+-------------------------------------
              Reporter:  hvr         |            Owner:  hvr
                  Type:  task        |           Status:  new
              Priority:  normal      |        Milestone:  7.10.1
             Component:              |          Version:
  libraries/base                     |         Keywords:
            Resolution:              |     Architecture:  Unknown/Multiple
      Operating System:              |       Difficulty:  Difficult (2-5
  Unknown/Multiple                   |  days)
       Type of failure:              |       Blocked By:
  None/Unknown                       |  Related Tickets:
             Test Case:              |
              Blocking:              |
Differential Revisions:  Phab:D209   |
-------------------------------------+-------------------------------------

Comment (by Herbert Valerio Riedel <hvr@…>):

 In [changeset:"b4060858f5201489e11ab57063e72380c03c3b55/ghc"]:
 {{{
 #!CommitTicketReference repository="ghc"
 revision="b4060858f5201489e11ab57063e72380c03c3b55"
 Generalise Control.Monad.{sequence_,msum,mapM_,forM_}

 This finally takes the gloves off, and performs the first actual
 generalization in order to implement #9586. This re-exports the
 respective definitions for the 4 combinators defined in Data.Foldable.

 This way, importing Data.Foldable and Control.Monad unqualified won't
 bring
 conflicting definitions of those 4 entities into scope anymore.

 This change seems to have some minor effect on rule-firing, which
 causes some wibble in the test-case T4007

 Reviewed By: ekmett, austin

 Differential Revision: https://phabricator.haskell.org/D226
 }}}

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