Repository : ssh://g...@git.haskell.org/ghc
On branch : master
Link :
http://ghc.haskell.org/trac/ghc/changeset/9a04e1c7257f93f0c1cadc56a5e2a177574f6871/ghc
>---------------------------------------------------------------
commit 9a04e1c7257f93f0c1cadc56a5e2a177574f6871
Author: Krzysztof Gogolewski <krz.gogolew...@gmail.com>
Date: Wed Oct 9 20:02:57 2013 +0200
Typos
>---------------------------------------------------------------
9a04e1c7257f93f0c1cadc56a5e2a177574f6871
compiler/typecheck/TcType.lhs | 2 +-
compiler/types/FunDeps.lhs | 2 +-
2 files changed, 2 insertions(+), 2 deletions(-)
diff --git a/compiler/typecheck/TcType.lhs b/compiler/typecheck/TcType.lhs
index 8e5bac4..751b2ee 100644
--- a/compiler/typecheck/TcType.lhs
+++ b/compiler/typecheck/TcType.lhs
@@ -421,7 +421,7 @@ equality. Example (with same T)
We decide (x::alpha), and generate an implication like
[1]forall a. (Bool ~ alpha[0])
We do NOT unify directly, bur rather float out (if the constraint
-does not memtion 'a') to get
+does not mention 'a') to get
(Bool ~ alpha[0]) /\ [1]forall a.()
and NOW we can unify alpha.
diff --git a/compiler/types/FunDeps.lhs b/compiler/types/FunDeps.lhs
index 77010de..bd0f7d7 100644
--- a/compiler/types/FunDeps.lhs
+++ b/compiler/types/FunDeps.lhs
@@ -487,7 +487,7 @@ checkInstCoverage be_liberal clas theta inst_taus
(if isSingleton ls
then ptext (sLit "does not")
else ptext (sLit "do not jointly"))
- <+> ptext (sLit "deternine rhs type")<>plural rs
+ <+> ptext (sLit "determine rhs type")<>plural rs
<+> pprQuotedList rs ]
, ppWhen (not be_liberal && liberal_ok) $
ptext (sLit "Using UndecidableInstances might help") ]
_______________________________________________
ghc-commits mailing list
ghc-commits@haskell.org
http://www.haskell.org/mailman/listinfo/ghc-commits
