[commit: ghc] wip/new-flatten-skolems-Aug14: Comment wibble (d6660a4)

git at git.haskell.org git at git.haskell.org
Tue Aug 26 13:55:59 UTC 2014


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

On branch  : wip/new-flatten-skolems-Aug14
Link       : http://ghc.haskell.org/trac/ghc/changeset/d6660a4a4b61d8422227e315cc4b2f4b4d465e9a/ghc

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

commit d6660a4a4b61d8422227e315cc4b2f4b4d465e9a
Author: Simon Peyton Jones <simonpj at microsoft.com>
Date:   Tue Aug 26 14:32:27 2014 +0100

    Comment wibble


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

d6660a4a4b61d8422227e315cc4b2f4b4d465e9a
 compiler/typecheck/TcSimplify.lhs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/compiler/typecheck/TcSimplify.lhs b/compiler/typecheck/TcSimplify.lhs
index 09bf63f..f69d614 100644
--- a/compiler/typecheck/TcSimplify.lhs
+++ b/compiler/typecheck/TcSimplify.lhs
@@ -1222,7 +1222,7 @@ ones that don't mention the skolem-bound variables.  But that is
 over-eager. Consider
    [2] forall a. F a beta[1] ~ gamma[2], G beta[1] gamma[2] ~ Int
 The second constraint doesn't mention 'a'.  But if we float it
-we'll promote gamma to gamma'[1].  Now suppose that we learn that
+we'll promote gamma[2] to gamma'[1].  Now suppose that we learn that
 beta := Bool, and F a Bool = a, and G Bool _ = Int.  Then we'll
 we left with the constraint
    [2] forall a. a ~ gamma'[1]



More information about the ghc-commits mailing list