diff options
| author | Krzysztof Gogolewski <krz.gogolewski@gmail.com> | 2013-10-09 20:02:57 +0200 |
|---|---|---|
| committer | Krzysztof Gogolewski <krz.gogolewski@gmail.com> | 2013-10-09 20:02:57 +0200 |
| commit | 9a04e1c7257f93f0c1cadc56a5e2a177574f6871 (patch) | |
| tree | 204e69d995d322421b8b2e2c9cf202ed72a10d49 /compiler | |
| parent | 16c401137a0d2aa803a5806493889056538c2de4 (diff) | |
| download | haskell-9a04e1c7257f93f0c1cadc56a5e2a177574f6871.tar.gz | |
Typos
Diffstat (limited to 'compiler')
| -rw-r--r-- | compiler/typecheck/TcType.lhs | 2 | ||||
| -rw-r--r-- | 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 8e5bac4e77..751b2eea7b 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 77010de984..bd0f7d79c1 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") ] |