summaryrefslogtreecommitdiff
path: root/compiler/GHC/Core
diff options
context:
space:
mode:
authorKrzysztof Gogolewski <krzysztof.gogolewski@tweag.io>2022-09-14 16:23:48 +0200
committerKrzysztof Gogolewski <krzysztof.gogolewski@tweag.io>2022-09-14 17:25:11 +0200
commitb52f59369a7b986e8b3389b30025a3f010b736cb (patch)
treea1b9b74199c548db3c0ba0545e6eb67a0b1965f7 /compiler/GHC/Core
parent7d7e71b03f4b2eb693f5ea69dadbccf491e7403f (diff)
downloadhaskell-wip/typos2.tar.gz
Fix typoswip/typos2
Diffstat (limited to 'compiler/GHC/Core')
-rw-r--r--compiler/GHC/Core/Coercion.hs2
-rw-r--r--compiler/GHC/Core/Lint.hs2
-rw-r--r--compiler/GHC/Core/Make.hs2
-rw-r--r--compiler/GHC/Core/Opt/DmdAnal.hs2
-rw-r--r--compiler/GHC/Core/Opt/LiberateCase.hs2
-rw-r--r--compiler/GHC/Core/Opt/Monad.hs2
-rw-r--r--compiler/GHC/Core/Opt/OccurAnal.hs2
-rw-r--r--compiler/GHC/Core/Opt/Simplify/Iteration.hs2
-rw-r--r--compiler/GHC/Core/Opt/SpecConstr.hs8
-rw-r--r--compiler/GHC/Core/Opt/Specialise.hs2
-rw-r--r--compiler/GHC/Core/Opt/WorkWrap/Utils.hs2
-rw-r--r--compiler/GHC/Core/RoughMap.hs2
-rw-r--r--compiler/GHC/Core/SimpleOpt.hs2
-rw-r--r--compiler/GHC/Core/TyCon.hs4
-rw-r--r--compiler/GHC/Core/Type.hs4
15 files changed, 20 insertions, 20 deletions
diff --git a/compiler/GHC/Core/Coercion.hs b/compiler/GHC/Core/Coercion.hs
index 15ee9369da..917022c78d 100644
--- a/compiler/GHC/Core/Coercion.hs
+++ b/compiler/GHC/Core/Coercion.hs
@@ -874,7 +874,7 @@ Sadly, with heterogeneous equality, this restriction might be able to be violate
Richard's thesis is unable to prove that it isn't. Specifically, the liftCoSubst
function might create an invalid coercion. Because a violation of the
restriction might lead to a program that "goes wrong", it is checked all the time,
-even in a production compiler and without -dcore-list. We *have* proved that the
+even in a production compiler and without -dcore-lint. We *have* proved that the
problem does not occur with homogeneous equality, so this check can be dropped
once ~# is made to be homogeneous.
-}
diff --git a/compiler/GHC/Core/Lint.hs b/compiler/GHC/Core/Lint.hs
index ce0e83669f..a9d01787fd 100644
--- a/compiler/GHC/Core/Lint.hs
+++ b/compiler/GHC/Core/Lint.hs
@@ -732,7 +732,7 @@ Now $cnoteq is not a loop breaker any more, so the INLINE pragma can
take effect -- the warning turned out to be temporary.
To stop excessive warnings, this warning for INLINE loop breakers is
-switched off when linting the the result of the desugarer. See
+switched off when linting the result of the desugarer. See
lf_check_inline_loop_breakers in GHC.Core.Lint.
diff --git a/compiler/GHC/Core/Make.hs b/compiler/GHC/Core/Make.hs
index 8039924051..41757c0d30 100644
--- a/compiler/GHC/Core/Make.hs
+++ b/compiler/GHC/Core/Make.hs
@@ -263,7 +263,7 @@ mkUncheckedIntExpr i = mkCoreConApps intDataCon [Lit (mkLitIntUnchecked i)]
mkIntExprInt :: Platform -> Int -> CoreExpr -- Result = I# i :: Int
mkIntExprInt platform i = mkCoreConApps intDataCon [mkIntLit platform (fromIntegral i)]
--- | Create a 'CoreExpr' which will evaluate to the a @Word@ with the given value
+-- | Create a 'CoreExpr' which will evaluate to a @Word@ with the given value
mkWordExpr :: Platform -> Integer -> CoreExpr
mkWordExpr platform w = mkCoreConApps wordDataCon [mkWordLit platform w]
diff --git a/compiler/GHC/Core/Opt/DmdAnal.hs b/compiler/GHC/Core/Opt/DmdAnal.hs
index 011f02af5f..fe98075487 100644
--- a/compiler/GHC/Core/Opt/DmdAnal.hs
+++ b/compiler/GHC/Core/Opt/DmdAnal.hs
@@ -1376,7 +1376,7 @@ Here is another important case (B):
Again we want `wombat` to pretend to take its Int-typed argument unboxed,
even though it has to pass it boxed to `f`, so that `g` can take its
-arugment unboxed (and rebox it before calling `wombat`).
+argument unboxed (and rebox it before calling `wombat`).
So here's what we do: while summarising `indexError`'s boxity signature in
`finaliseArgBoxities`:
diff --git a/compiler/GHC/Core/Opt/LiberateCase.hs b/compiler/GHC/Core/Opt/LiberateCase.hs
index 863a19d961..0249b23aaf 100644
--- a/compiler/GHC/Core/Opt/LiberateCase.hs
+++ b/compiler/GHC/Core/Opt/LiberateCase.hs
@@ -173,7 +173,7 @@ libCaseBind env (Rec pairs)
{- Note [Not bottoming Ids]
~~~~~~~~~~~~~~~~~~~~~~~~~~~
Do not specialise error-functions (this is unusual, but I once saw it,
-(actually in Data.Typable.Internal)
+(actually in Data.Typeable.Internal)
Note [Only functions!]
~~~~~~~~~~~~~~~~~~~~~~
diff --git a/compiler/GHC/Core/Opt/Monad.hs b/compiler/GHC/Core/Opt/Monad.hs
index 2d3d9822a2..a195f3997e 100644
--- a/compiler/GHC/Core/Opt/Monad.hs
+++ b/compiler/GHC/Core/Opt/Monad.hs
@@ -267,7 +267,7 @@ getUniqMask = read cr_uniq_mask
-- Convenience accessors for useful fields of HscEnv
--- | Adjust the dyn flags passed to the arugment action
+-- | Adjust the dyn flags passed to the argument action
mapDynFlagsCoreM :: (DynFlags -> DynFlags) -> CoreM a -> CoreM a
mapDynFlagsCoreM f m = CoreM $ do
!e <- getEnv
diff --git a/compiler/GHC/Core/Opt/OccurAnal.hs b/compiler/GHC/Core/Opt/OccurAnal.hs
index 4a67b8cdea..59158a0e90 100644
--- a/compiler/GHC/Core/Opt/OccurAnal.hs
+++ b/compiler/GHC/Core/Opt/OccurAnal.hs
@@ -1867,7 +1867,7 @@ occAnalLam env expr = occAnal env expr
{- Note [Occ-anal and cast worker/wrapper]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Consider y = e; x = y |> co
-If we mark y as used-once, we'll inline y into x, and the the Cast
+If we mark y as used-once, we'll inline y into x, and the Cast
worker/wrapper transform will float it straight back out again. See
Note [Cast worker/wrapper] in GHC.Core.Opt.Simplify.
diff --git a/compiler/GHC/Core/Opt/Simplify/Iteration.hs b/compiler/GHC/Core/Opt/Simplify/Iteration.hs
index 9fea132486..cfee2e5e56 100644
--- a/compiler/GHC/Core/Opt/Simplify/Iteration.hs
+++ b/compiler/GHC/Core/Opt/Simplify/Iteration.hs
@@ -2939,7 +2939,7 @@ doCaseToLet scrut case_bndr
-- We can call isUnliftedType here: scrutinees always have a fixed RuntimeRep (see FRRCase).
-- Note however that we must check 'scrut' (which is an 'OutExpr') and not 'case_bndr'
-- (which is an 'InId'): see Note [Dark corner with representation polymorphism].
- -- Using `exprType` is typically cheap becuase `scrut` is typically a variable.
+ -- Using `exprType` is typically cheap because `scrut` is typically a variable.
-- We could instead use mightBeUnliftedType (idType case_bndr), but that hurts
-- the brain more. Consider that if this test ever turns out to be a perf
-- problem (which seems unlikely).
diff --git a/compiler/GHC/Core/Opt/SpecConstr.hs b/compiler/GHC/Core/Opt/SpecConstr.hs
index 538b457ffc..05c7b00116 100644
--- a/compiler/GHC/Core/Opt/SpecConstr.hs
+++ b/compiler/GHC/Core/Opt/SpecConstr.hs
@@ -1280,7 +1280,7 @@ instance Outputable ArgOcc where
evalScrutOcc :: ArgOcc
-- We use evalScrutOcc for
-- - mkVarUsage: applied functions
--- - scApp: dicts that are the arugment of a classop
+-- - scApp: dicts that are the argument of a classop
evalScrutOcc = ScrutOcc emptyUFM
-- Experimentally, this version of combineOcc makes ScrutOcc "win", so
@@ -1904,7 +1904,7 @@ spec_one env fn arg_bndrs body (call_pat, rule_number)
add_void_arg = needsVoidWorkerArg fn arg_bndrs spec_lam_args1
(spec_lam_args, spec_call_args, spec_arity, spec_join_arity)
| add_void_arg
- -- See Note [SpecConst needs to add void args first]
+ -- See Note [SpecConstr needs to add void args first]
, (spec_lam_args, spec_call_args, _) <- addVoidWorkerArg spec_lam_args1 []
-- needsVoidWorkerArg: usual w/w hack to avoid generating
-- a spec_rhs of unlifted type and no args.
@@ -1991,8 +1991,8 @@ mkSeqs seqees res_ty rhs =
= rhs
-{- Note [SpecConst needs to add void args first]
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+{- Note [SpecConstr needs to add void args first]
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Consider a function
f start @t = e
We want to specialize for a partially applied call `f True`.
diff --git a/compiler/GHC/Core/Opt/Specialise.hs b/compiler/GHC/Core/Opt/Specialise.hs
index 1b29a924ef..4578f2681d 100644
--- a/compiler/GHC/Core/Opt/Specialise.hs
+++ b/compiler/GHC/Core/Opt/Specialise.hs
@@ -1832,7 +1832,7 @@ where $fCInt_$cm is the instance method for `m` in `instance C Int`:
$fCInt_$cm :: forall b. Show b => Int -> b -> String
$fCInt_$cm b d x y = show @Int $dShowInt x ++ show @b d y
-We want to specialise this! How? By doing the the method-selection rewrite in
+We want to specialise this! How? By doing the method-selection rewrite in
the Specialiser. Hence
1. In the App case of 'specExpr', try to apply the ClassOp/DFun rule on the
diff --git a/compiler/GHC/Core/Opt/WorkWrap/Utils.hs b/compiler/GHC/Core/Opt/WorkWrap/Utils.hs
index 5b653e751f..6f6e1ea1c3 100644
--- a/compiler/GHC/Core/Opt/WorkWrap/Utils.hs
+++ b/compiler/GHC/Core/Opt/WorkWrap/Utils.hs
@@ -389,7 +389,7 @@ needsVoidWorkerArg fn_id wrap_args work_args
-- | Inserts a `Void#` arg before the first argument.
--
--- Why as the first argument? See Note [SpecConst needs to add void args first]
+-- Why as the first argument? See Note [SpecConstr needs to add void args first]
-- in SpecConstr.
addVoidWorkerArg :: [Var] -> [StrictnessMark]
-> ([Var], -- Lambda bound args
diff --git a/compiler/GHC/Core/RoughMap.hs b/compiler/GHC/Core/RoughMap.hs
index 2dc7f6954d..87fd641e64 100644
--- a/compiler/GHC/Core/RoughMap.hs
+++ b/compiler/GHC/Core/RoughMap.hs
@@ -106,7 +106,7 @@ instance when queried for an instance with template, e.g., `[KnownTc Fam,
KnownTc Int, KnownTc Char]`.
This explains the third clause of the mightMatch specification in Note [Simple Matching Semantics].
-As soon as the the lookup key runs out, the remaining instances might match.
+As soon as the lookup key runs out, the remaining instances might match.
Note [Matching a RoughMap]
~~~~~~~~~~~~~~~~~~~~~~~~~~
diff --git a/compiler/GHC/Core/SimpleOpt.hs b/compiler/GHC/Core/SimpleOpt.hs
index d40136634d..75a5ed27a0 100644
--- a/compiler/GHC/Core/SimpleOpt.hs
+++ b/compiler/GHC/Core/SimpleOpt.hs
@@ -275,7 +275,7 @@ simple_opt_expr env expr
(env', mb_prs) = mapAccumL (simple_out_bind NotTopLevel) env $
zipEqual "simpleOptExpr" bs es
- -- Note [Getting the map/coerce RULE to work]
+ -- See Note [Getting the map/coerce RULE to work]
| isDeadBinder b
, [Alt DEFAULT _ rhs] <- as
, isCoVarType (varType b)
diff --git a/compiler/GHC/Core/TyCon.hs b/compiler/GHC/Core/TyCon.hs
index c8756d3e48..54672ab80d 100644
--- a/compiler/GHC/Core/TyCon.hs
+++ b/compiler/GHC/Core/TyCon.hs
@@ -989,7 +989,7 @@ data TyCon
tyConArity :: Arity, -- ^ Arity
tyConNullaryTy :: Type, -- ^ A pre-allocated @TyConApp tycon []@
- -- NB: the TyConArity of a TcTyCon must match
+ -- NB: the tyConArity of a TcTyCon must match
-- the number of Required (positional, user-specified)
-- arguments to the type constructor; see the use
-- of tyConArity in generaliseTcTyCon
@@ -1012,7 +1012,7 @@ The tcTyConScopedTyVars field records the lexicial-binding connection
between the original, user-specified Name (i.e. thing in scope) and
the TcTyVar that the Name is bound to.
-Order *does* matter; the tcTyConScopedTyvars list consists of
+Order *does* matter; the tcTyConScopedTyVars list consists of
specified_tvs ++ required_tvs
where
diff --git a/compiler/GHC/Core/Type.hs b/compiler/GHC/Core/Type.hs
index 49db2cb4ca..e51fe7e88c 100644
--- a/compiler/GHC/Core/Type.hs
+++ b/compiler/GHC/Core/Type.hs
@@ -1431,7 +1431,7 @@ piResultTys ty orig_args@(arg:args)
pprPanic "piResultTys2" (ppr ty $$ ppr orig_args $$ ppr all_args)
applyTysX :: [TyVar] -> Type -> [Type] -> Type
--- applyTyxX beta-reduces (/\tvs. body_ty) arg_tys
+-- applyTysX beta-reduces (/\tvs. body_ty) arg_tys
-- Assumes that (/\tvs. body_ty) is closed
applyTysX tvs body_ty arg_tys
= assertPpr (tvs `leLength` arg_tys) pp_stuff $
@@ -3079,7 +3079,7 @@ tcTypeKind (FunTy { ft_af = af, ft_res = res })
, tcIsConstraintKind (tcTypeKind res)
= constraintKind -- Eq a => Ord a :: Constraint
| otherwise -- Eq a => a -> a :: TYPE LiftedRep
- = liftedTypeKind -- Eq a => Array# Int :: Type LiftedRep (not TYPE PtrRep)
+ = liftedTypeKind -- Eq a => Array# Int :: TYPE LiftedRep (not TYPE PtrRep)
tcTypeKind (AppTy fun arg)
= go fun [arg]