Commit a273c735 authored by Gabor Greif's avatar Gabor Greif 💬

Spelling fixes

parent cc839c57
......@@ -1652,7 +1652,7 @@ In unfoldings and rules, we guarantee that the template is occ-analysed,
so that the occurrence info on the binders is correct. This is important,
because the Simplifier does not re-analyse the template when using it. If
the occurrence info is wrong
- We may get more simpifier iterations than necessary, because
- We may get more simplifier iterations than necessary, because
once-occ info isn't there
- More seriously, we may get an infinite loop if there's a Rec
without a loop breaker marked
......
......@@ -649,7 +649,7 @@ sizeExpr dflags bOMB_OUT_SIZE top_args expr
-- Don't charge for args, so that wrappers look cheap
-- (See comments about wrappers with Case)
--
-- IMPORATANT: *do* charge 1 for the alternative, else we
-- IMPORTANT: *do* charge 1 for the alternative, else we
-- find that giant case nests are treated as practically free
-- A good example is Foreign.C.Error.errnoToIOError
......
......@@ -713,7 +713,7 @@ This gave rise to a horrible sequence of cases
and similarly in cascade for all the join points!
NB: it's important that all this is done in [InAlt], *before* we work
on the alternatives themselves, because Simpify.simplAlt may zap the
on the alternatives themselves, because Simplify.simplAlt may zap the
occurrence info on the binders in the alternatives, which in turn
defeats combineIdenticalAlts (see Trac #7360).
......
......@@ -409,14 +409,14 @@ getVarOffSets depth env = catMaybes . map getOffSet
Nothing -> Nothing
Just offset ->
-- michalt: I'm not entirely sure why we need the stack
-- adjustement by 2 here. I initially thought that there's
-- adjustment by 2 here. I initially thought that there's
-- something off with getIdValFromApStack (the only user of this
-- value), but it looks ok to me. My current hypothesis is that
-- this "adjustement" is needed due to stack manipulation for
-- this "adjustment" is needed due to stack manipulation for
-- BRK_FUN in Interpreter.c In any case, this is used only when
-- we trigger a breakpoint.
let adjustement = 2
in Just (id, trunc16 $ depth - offset + adjustement)
let adjustment = 2
in Just (id, trunc16 $ depth - offset + adjustment)
trunc16 :: Word -> Word16
trunc16 w
......
......@@ -284,7 +284,7 @@ getCoreToDo dflags
-- At least 3 iterations because otherwise we land up with
-- huge dead expressions because of an infelicity in the
-- simpifier.
-- simplifier.
-- let k = BIG in foldr k z xs
-- ==> let k = BIG in letrec go = \xs -> ...(k x).... in go xs
-- ==> let k = BIG in letrec go = \xs -> ...(BIG x).... in go xs
......
......@@ -1865,7 +1865,7 @@ latter's strictness when simplifying e2, e3. Moreover, suppose we have
Then given (f Int e1) we rewrite to
(\x. x True) e1
without simpifying e1. Now we can inline x into its unique call site,
without simplifying e1. Now we can inline x into its unique call site,
and absorb the True into it all in the same pass. If we simplified
e1 first, we couldn't do that; see Note [Avoiding exponential behaviour].
......
......@@ -617,7 +617,7 @@ bound on the LHS:
RULE forall (c :: a~b). f (x |> c) = e
Now, if that binding is inlined, so that a=b=Int, we'd get
RULE forall (c :: Int~Int). f (x |> c) = e
and now when we simpilfy the LHS (Simplify.simplRule) we
and now when we simplify the LHS (Simplify.simplRule) we
optCoercion will turn that 'c' into Refl:
RULE forall (c :: Int~Int). f (x |> <Int>) = e
and then perhaps drop it altogether. Now 'c' is unbound.
......
......@@ -126,7 +126,7 @@ canEvNC ev
canClassNC :: CtEvidence -> Class -> [Type] -> TcS (StopOrContinue Ct)
-- "NC" means "non-canonical"; that is, we have got here
-- from a NonCanonical constrataint, not from a CDictCan
-- from a NonCanonical constraint, not from a CDictCan
-- Precondition: EvVar is class evidence
canClassNC ev cls tys
| isGiven ev -- See Note [Eagerly expand given superclasses]
......
......@@ -954,7 +954,7 @@ Notice that
by checkInstConstraints.
* Overall instance implication. There is an overall enclosing
implication for the whole instance declaratation, with the expected
implication for the whole instance declaration, with the expected
skolems and givens. We need this to get the correct "redundant
constraint" warnings, gathering all the uses from all the methods
and superclasses. See TcSimplify Note [Tracking redundant
......
......@@ -1842,7 +1842,7 @@ getNoGivenEqs tclvl skol_tvs
eqs_given_here _ = False
ev_given_here :: CtEvidence -> Bool
-- True for a Given bound by the curent implication,
-- True for a Given bound by the current implication,
-- i.e. the current level
ev_given_here ev
= isGiven ev
......
......@@ -132,7 +132,7 @@ Compiler
(see :ghc-ticket:`12816`).
- GHC now reliably runs on macOS Sierra systems. Sierra introduced a linker
limitation which GHC occassionally surpassed when compiling programs with
limitation which GHC occasionally surpassed when compiling programs with
many package dependencies. (see :ghc-ticket:`12479`).
- The :ghc-flag:`-Wredundant-constraints` flag has been removed from the
......
{-# LANGUAGE NoMonoPatBinds #-}
-- Disable experimetal monomorphic pattern bindings
-- Disable experimental monomorphic pattern bindings
-- Nasty test for type signatures
-- In both groups of declarations below, the type variables 'a' and 'b'
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment