[commit: ghc] wip/remove-EvCoercible: Unsorted end-of-day commit (e48ff04)

[git at git.haskell.org]

Repository : ssh://git@git.haskell.org/ghc

On branch  : wip/remove-EvCoercible
Link       : http://ghc.haskell.org/trac/ghc/changeset/e48ff047633a5589dbea31ba3fa7f54bb0f082c2/ghc

>---------------------------------------------------------------

commit e48ff047633a5589dbea31ba3fa7f54bb0f082c2
Author: Joachim Breitner <mail at joachim-breitner.de>
Date:   Tue Nov 26 18:14:51 2013 +0000

    Unsorted end-of-day commit
    
    I am trying to get rid of EvCoercible, and transfering the evidence in
    EvCoercion, just like for boxed evidence of nominal equalities. This
    refactoring would make it later easier to re-do the implementation of
    Coercible, i.e. finding the whole coercion in one go, instead of relying
    on the regular constraint solver. I hope that this opens a path to solve
    bug #8565, and might it easier to prevent recursive dictionaries,
    without using the current approach involving constraint depths.


>---------------------------------------------------------------

e48ff047633a5589dbea31ba3fa7f54bb0f082c2
 compiler/coreSyn/MkCore.lhs        |   12 +++++---
 compiler/deSugar/DsBinds.lhs       |   29 ++++++++++---------
 compiler/deSugar/Match.lhs         |    4 +--
 compiler/typecheck/Inst.lhs        |    3 +-
 compiler/typecheck/TcCanonical.lhs |   17 ++++++------
 compiler/typecheck/TcEvidence.lhs  |   27 ++++++++++++------
 compiler/typecheck/TcHsSyn.lhs     |    7 +++--
 compiler/typecheck/TcInteract.lhs  |   54 ++++++++++++++++++++++++------------
 compiler/typecheck/TcMType.lhs     |    2 +-
 compiler/typecheck/TcSMonad.lhs    |    8 ++++--
 compiler/types/Coercion.lhs        |    2 +-
 compiler/types/Type.lhs            |    2 +-
 12 files changed, 104 insertions(+), 63 deletions(-)

Diff suppressed because of size. To see it, use:

    git diff-tree --root --patch-with-stat --no-color --find-copies-harder --ignore-space-at-eol --cc e48ff047633a5589dbea31ba3fa7f54bb0f082c2