Skip to content
  • Simon Peyton Jones's avatar
    Compiler performance is much worse in for loopy givens · ce9d6f25
    Simon Peyton Jones authored
    This is a deliberate choice, to simplify code, invariants, and I think
    performance in typical cases.  The "loopy givens" case is situations like
    
       [G]  a ~ TF (a, Int)
    
    where TF is a type function with TF (a,b) = (TF a, TF b).
    
    See Note [An alternative story for the inert substitution] in TcFlatten.
    ce9d6f25