Typos

compiler/cmm/CmmSink.hs

@@ -565,7 +565,7 @@ localRegistersConflict dflags expr node =
 --      We will attempt to sink { x = R1 } but we will detect conflict with
 --      { P64[Sp - 8]  = x } and hence we will drop { x = R1 } without even
 --      checking whether it conflicts with { call f() }. In this way we will
---      never need to check any assignment conflicts with CmmCall. Remeber
+--      never need to check any assignment conflicts with CmmCall. Remember
 --      that we still need to check for potential memory conflicts.
 --
 -- So the result is that we only need to worry about CmmUnsafeForeignCall nodes

compiler/coreSyn/PprCore.lhs

@@ -108,7 +108,7 @@ ppr_expr :: OutputableBndr b => (SDoc -> SDoc) -> Expr b -> SDoc
         -- an atomic value (e.g. function args)
 
 ppr_expr _       (Var name)    = ppr name
-ppr_expr add_par (Type ty)     = add_par (ptext (sLit "TYPE") <+> ppr ty)       -- Wierd
+ppr_expr add_par (Type ty)     = add_par (ptext (sLit "TYPE") <+> ppr ty)       -- Weird
 ppr_expr add_par (Coercion co) = add_par (ptext (sLit "CO") <+> ppr co)
 ppr_expr add_par (Lit lit)     = pprLiteral add_par lit
 

compiler/deSugar/DsExpr.lhs

@@ -838,7 +838,7 @@ warnDiscardedDoBindings rhs rhs_ty
                               -> warnDs (wrongMonadBind rhs elt_ty)
            _ -> return () } }
 
-  | otherwise   -- RHS does have type of form (m ty), which is wierd
+  | otherwise   -- RHS does have type of form (m ty), which is weird
   = return ()   -- but at lesat this warning is irrelevant
 
 unusedMonadBind :: LHsExpr Id -> Type -> SDoc

compiler/deSugar/MatchLit.lhs

@@ -265,7 +265,7 @@ tidyNPat tidy_lit_pat (OverLit val False _ ty) mb_neg _
         -- Once that is settled, look for cases where the type of the
         -- entire overloaded literal matches the type of the underlying literal,
         -- and in that case take the short cut
-        -- NB: Watch out for wierd cases like Trac #3382
+        -- NB: Watch out for weird cases like Trac #3382
         --        f :: Int -> Int
         --        f "blah" = 4
         --     which might be ok if we hvae 'instance IsString Int'

compiler/ghci/RtClosureInspect.hs

@@ -412,7 +412,7 @@ type CustomTermPrinter m = TermPrinterM m
                          -> [Precedence -> Term -> (m (Maybe SDoc))]
 
 -- | Takes a list of custom printers with a explicit recursion knot and a term, 
+-- and returns the output of the first successful printer, or the default printer
 cPprTerm :: Monad m => CustomTermPrinter m -> Term -> m SDoc
 cPprTerm printers_ = go 0 where
   printers = printers_ go

compiler/main/HscTypes.lhs

@@ -1006,7 +1006,7 @@ data ModGuts
         -- ^ Class instance environment from /home-package/ modules (including
         -- this one); c.f. 'tcg_inst_env'
         mg_fam_inst_env :: FamInstEnv,
-        -- ^ Type-family instance enviroment for /home-package/ modules
+        -- ^ Type-family instance environment for /home-package/ modules
         -- (including this one); c.f. 'tcg_fam_inst_env'
         mg_safe_haskell :: SafeHaskellMode,
         -- ^ Safe Haskell mode

compiler/nativeGen/RegAlloc/Graph/SpillCost.hs

@@ -204,7 +204,7 @@ spillCost_chaitin
 
 spillCost_chaitin info graph reg
         -- Spilling a live range that only lives for 1 instruction
-        -- isn't going to help us at all - and we definately want to avoid
+        -- isn't going to help us at all - and we definitely want to avoid
         -- trying to re-spill previously inserted spill code.
         | lifetime <= 1         = 1/0
 

compiler/parser/Lexer.x

@@ -1600,7 +1600,7 @@ data PState = PState {
         -- This is the next token to be considered or, if it is Nothing,
         -- we need to get the next token from the input stream:
         alr_next_token :: Maybe (RealLocated Token),
-        -- This is what we consider to be the locatino of the last token
+        -- This is what we consider to be the location of the last token
         -- emitted:
         alr_last_loc :: RealSrcSpan,
         -- The stack of layout contexts:

compiler/prelude/PrimOp.lhs

@@ -292,7 +292,7 @@ Invariants:
 -- KSW: v, the second arg in parAt# and parAtForNow#, is used only to determine
 --   `the processor containing the expression v'; it is not evaluated
 
-These primops are pretty wierd.
+These primops are pretty weird.
 
         dataToTag# :: a -> Int    (arg must be an evaluated data type)
         tagToEnum# :: Int -> a    (result type must be an enumerated type)

compiler/simplCore/OccurAnal.lhs

@@ -190,7 +190,7 @@ We put bindings {f = ef; g = eg } in a Rec group if "f uses g"
 and "g uses f", no matter how indirectly.  We do a SCC analysis
 with an edge f -> g if "f uses g".
 
-More precisely, "f uses g" iff g should be in scope whereever f is.
+More precisely, "f uses g" iff g should be in scope wherever f is.
 That is, g is free in:
   a) the rhs 'ef'
   b) or the RHS of a rule for f (Note [Rules are extra RHSs])

compiler/specialise/Specialise.lhs

@@ -488,7 +488,7 @@ Some Ids have types like
 This seems curious at first, because we usually only have dictionary
 args whose types are of the form (C a) where a is a type variable.
 But this doesn't hold for the functions arising from instance decls,
-which sometimes get arguements with types of form (C (T a)) for some
+which sometimes get arguments with types of form (C (T a)) for some
 type constructor T.
 
 Should we specialise wrt this compound-type dictionary?  We used to say

compiler/types/Type.lhs

@@ -577,7 +577,7 @@ newTyConInstRhs tycon tys
 Notes on type synonyms
 ~~~~~~~~~~~~~~~~~~~~~~
 The various "split" functions (splitFunTy, splitRhoTy, splitForAllTy) try
-to return type synonyms whereever possible. Thus
+to return type synonyms wherever possible. Thus
 
         type Foo a = a -> a
 

compiler/utils/Pretty.lhs

@@ -71,7 +71,7 @@ Version 2.0     24 April 1997
         nest k empty = empty
     which wasn't true before.
 
-  * Fixed an obscure bug in sep that occassionally gave very wierd behaviour
+  * Fixed an obscure bug in sep that occasionally gave very weird behaviour
 
   * Added $+$
 

compiler/vectorise/Vectorise/Monad/Local.hs

@@ -34,7 +34,7 @@ readLEnv f  = VM $ \_ genv lenv -> return (Yes genv lenv (f lenv))
 setLEnv :: LocalEnv -> VM ()
 setLEnv lenv  = VM $ \_ genv _ -> return (Yes genv lenv ())
 
--- |Update the enviroment using the provided function.
+-- |Update the environment using the provided function.
 --
 updLEnv :: (LocalEnv -> LocalEnv) -> VM ()
 updLEnv f  = VM $ \_ genv lenv -> return (Yes genv (f lenv) ())