diff options
Diffstat (limited to 'compiler')
| -rw-r--r-- | compiler/deSugar/Desugar.hs | 2 | ||||
| -rw-r--r-- | compiler/simplCore/SetLevels.hs | 2 | ||||
| -rw-r--r-- | compiler/specialise/SpecConstr.hs | 2 | ||||
| -rw-r--r-- | compiler/typecheck/TcInteract.hs | 2 | ||||
| -rw-r--r-- | compiler/typecheck/TcTyDecls.hs | 2 |
5 files changed, 5 insertions, 5 deletions
diff --git a/compiler/deSugar/Desugar.hs b/compiler/deSugar/Desugar.hs index d5931d16e5..1458b91041 100644 --- a/compiler/deSugar/Desugar.hs +++ b/compiler/deSugar/Desugar.hs @@ -525,7 +525,7 @@ by 'competesWith' Class methods have a built-in RULE to select the method from the dictionary, so you can't change the phase on this. That makes id very dubious to match on class methods in RULE lhs's. See Trac #10595. I'm not happy -about this. For exmaple in Control.Arrow we have +about this. For example in Control.Arrow we have {-# RULES "compose/arr" forall f g . (arr f) . (arr g) = arr (f . g) #-} diff --git a/compiler/simplCore/SetLevels.hs b/compiler/simplCore/SetLevels.hs index 2976895ced..88220191f9 100644 --- a/compiler/simplCore/SetLevels.hs +++ b/compiler/simplCore/SetLevels.hs @@ -1104,7 +1104,7 @@ lvlBind env (AnnRec pairs) -- Both are checked by Lint is_fun = all isFunction rhss is_bot = False -- It's odd to have an unconditionally divergent - -- funtion in a Rec, and we don't much care what + -- function in a Rec, and we don't much care what -- happens to it. False is simple! do_rhs env (bndr,rhs) = lvlFloatRhs abs_vars dest_lvl env Recursive diff --git a/compiler/specialise/SpecConstr.hs b/compiler/specialise/SpecConstr.hs index c2470bd644..71628410c8 100644 --- a/compiler/specialise/SpecConstr.hs +++ b/compiler/specialise/SpecConstr.hs @@ -777,7 +777,7 @@ But it is much better to specialise f for the case where the argument is of form (I# x); then we build the box only when returning y, which is on the cold path. -Another exmaple: +Another example: f x = ...(g x).... diff --git a/compiler/typecheck/TcInteract.hs b/compiler/typecheck/TcInteract.hs index e1ad484d58..c710fd5c77 100644 --- a/compiler/typecheck/TcInteract.hs +++ b/compiler/typecheck/TcInteract.hs @@ -2475,7 +2475,7 @@ doTyLit kc t = do { kc_clas <- tcLookupClass kc {- Note [Typeable (T a b c)] ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ For type applications we always decompose using binary application, -via doTyApp, until we get to a *kind* instantiation. Exmaple +via doTyApp, until we get to a *kind* instantiation. Example Proxy :: forall k. k -> * To solve Typeable (Proxy (* -> *) Maybe) we diff --git a/compiler/typecheck/TcTyDecls.hs b/compiler/typecheck/TcTyDecls.hs index c518101638..2933890501 100644 --- a/compiler/typecheck/TcTyDecls.hs +++ b/compiler/typecheck/TcTyDecls.hs @@ -243,7 +243,7 @@ one approach is to instantiate all of C's superclasses, transitively. We can only do so if that set is finite. This potential loop occurs only through superclasses. This, for -exmaple, is fine +example, is fine class C a where op :: C b => a -> b -> b even though C's full definition uses C. |