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

Typos in comments

parent 6fecb2a4
......@@ -357,7 +357,7 @@ stripTicksTop p = go []
go ts other = (reverse ts, other)
-- | Strip ticks satisfying a predicate from top of an expression,
-- returning the remaining expresion
-- returning the remaining expression
stripTicksTopE :: (Tickish Id -> Bool) -> Expr b -> Expr b
stripTicksTopE p = go
where go (Tick t e) | p t = go e
......
......@@ -102,7 +102,7 @@ stgTBAA
, (heapN, fsLit "heap", Just topN)
, (rxN, fsLit "rx", Just heapN)
, (baseN, fsLit "base", Just topN)
-- FIX: Not 100% sure if this heirarchy is complete. I think the big thing
-- FIX: Not 100% sure if this hierarchy is complete. I think the big thing
-- is Sp is never aliased, so might want to change the hierarchy to have Sp
-- on its own branch that is never aliased (e.g never use top as a TBAA
-- node).
......
......@@ -479,7 +479,7 @@ guessOutputFile = modifySession $ \env ->
name_exe = do
#if defined(mingw32_HOST_OS)
-- we must add the .exe extention unconditionally here, otherwise
-- we must add the .exe extension unconditionally here, otherwise
-- when name has an extension of its own, the .exe extension will
-- not be added by DriverPipeline.exeFileName. See #2248
name' <- fmap (<.> "exe") name
......
......@@ -468,7 +468,7 @@ callArityAnal arity int (Lam v e)
where
(ae, e') = callArityAnal (arity - 1) (int `delVarSet` v) e
-- Application. Increase arity for the called expresion, nothing to know about
-- Application. Increase arity for the called expression, nothing to know about
-- the second
callArityAnal arity int (App e (Type t))
= second (\e -> App e (Type t)) $ callArityAnal arity int e
......
......@@ -1033,7 +1033,7 @@ lookupVar le v = case lookupVarEnv (le_env le) v of
_ -> Var v
abstractVars :: Level -> LevelEnv -> DVarSet -> [OutVar]
-- Find the variables in fvs, free vars of the target expresion,
-- Find the variables in fvs, free vars of the target expression,
-- whose level is greater than the destination level
-- These are the ones we are going to abstract out
--
......
......@@ -703,7 +703,7 @@ match _ _ e@Tick{} _
-- Consider matching
-- \x->f against \f->f
-- When we meet the lambdas we must remember to rename f to f' in the
-- second expresion. The RnEnv2 does that.
-- second expression. The RnEnv2 does that.
--
-- Consider matching
-- forall a. \b->b against \a->3
......
......@@ -727,7 +727,7 @@ Deriving Functor, Foldable, and Traversable all require generating expressions
which perform an operation on each argument of a data constructor depending
on the argument's type. In particular, a generated operation can be different
depending on whether the type mentions the last type variable of the datatype
(e.g., if you have data T a = MkT a Int, then a generated foldr expresion would
(e.g., if you have data T a = MkT a Int, then a generated foldr expression would
fold over the first argument of MkT, but not the second).
This pattern is abstracted with the FFoldType datatype, which provides hooks
......
......@@ -86,7 +86,7 @@ The smart constructors (`mkAnd` and `mkOr`) do some attempt to simplify expressi
Implemented by mkAnd' / mkOr'
3. Conjunction with false, disjunction with true is simplified, i.e.
`mkAnd [mkFalse,x]` becomes `mkFalse`.
4. Common subexpresion elimination:
4. Common subexpression elimination:
`mkAnd [x,x,y]` is reduced to just `mkAnd [x,y]`.
This simplification is not exhaustive, in the sense that it will not produce
......
......@@ -84,7 +84,7 @@ vRec vs es = (Rec (zip vvs ves), Rec (zip lvs les))
(vvs, lvs) = unzip vs
(ves, les) = unzip es
-- |Make a vectorised let expresion.
-- |Make a vectorised let expression.
--
vLet :: VBind -> VExpr -> VExpr
vLet = zipWithVect Let
......
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