Skip to content
  • Simon Peyton Jones's avatar
    Normalise the type of an inferred let-binding · a6e7654b
    Simon Peyton Jones authored
    With the new constraint solver, we don't guarantee to fully-normalise
    all constraints (if doing so is not necessary to solve them). So we
    may end up with an inferred type like
          f :: [F Int] -> Bool
    which could be simplifed to
          f :: [Char] -> Bool
    if there is a suitable family instance declaration.  This patch
    does this normalisation, in TcBinds.mkExport
    a6e7654b