Commit 2ef973e8 authored by Gabor Greif's avatar Gabor Greif 💬

A bunch of typofixes

parent 4fdc5234
......@@ -902,7 +902,7 @@ dataConExTyVars (MkData { dcExTyVars = tvbs }) = binderVars tvbs
dataConExTyVarBinders :: DataCon -> [TyVarBinder]
dataConExTyVarBinders = dcExTyVars
-- | Both the universal and existentiatial type variables of the constructor
-- | Both the universal and existential type variables of the constructor
dataConAllTyVars :: DataCon -> [TyVar]
dataConAllTyVars (MkData { dcUnivTyVars = univ_tvs, dcExTyVars = ex_tvs })
= binderVars (univ_tvs ++ ex_tvs)
......
......@@ -177,7 +177,7 @@ P's universal tyvars. You have to /match/
the type of the pattern, (T [ty] Bool)
against
the psResultTy for the pattern synonym, T [a] Bool
to get the insantiation a := ty.
to get the instantiation a := ty.
This is very unlike DataCons, where univ tyvars match 1-1 the
arguments of the TyCon.
......
......@@ -62,7 +62,7 @@ sinkReg fm r
-- | Slurp out mov instructions that only serve to join live ranges.
--
-- During a mov, if the source reg dies and the destiation reg is
-- During a mov, if the source reg dies and the destination reg is
-- born then we can rename the two regs to the same thing and
-- eliminate the move.
slurpJoinMovs
......
......@@ -1517,7 +1517,7 @@ into
0# -> e1
1# -> e1
This rule elimiantes a lot of boilerplate. For
This rule eliminates a lot of boilerplate. For
if (x>y) then e1 else e2
we generate
case tagToEnum (x ># y) of
......
......@@ -350,7 +350,7 @@ Note [Thunks in recursive groups]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
We never eta-expand a thunk in a recursive group, on the grounds that if it is
part of a recursive group, then it will be called multipe times.
part of a recursive group, then it will be called multiple times.
This is not necessarily true, e.g. it would be safe to eta-expand t2 (but not
t1) in the following code:
......
......@@ -1785,7 +1785,7 @@ prepareAlts scrut case_bndr' alts
mkCase tries these things
* Note [Nerge nested cases]
* Note [Elimiante identity case]
* Note [Eliminate identity case]
* Note [Scrutinee constant folding]
Note [Merge Nested Cases]
......
......@@ -16,7 +16,7 @@ note [Case 2: CSEing case binders] below.
Note [Case 1: CSEing allocated closures]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The fist kind of CSE opportunity we aim for is generated by this Haskell code:
The first kind of CSE opportunity we aim for is generated by this Haskell code:
bar :: a -> (Either Int a, Either Bool a)
bar x = (Right x, Right x)
......
......@@ -1254,7 +1254,7 @@ Help functions for type applications
addTypeCtxt :: LHsType GhcRn -> TcM a -> TcM a
-- Wrap a context around only if we want to show that contexts.
-- Omit invisble ones and ones user's won't grok
-- Omit invisible ones and ones user's won't grok
addTypeCtxt (L _ ty) thing
= addErrCtxt doc thing
where
......
......@@ -389,7 +389,7 @@ matchExpectedTyConApp tc orig_ty
-- kind-compatible with T. For example, suppose we have
-- matchExpectedTyConApp T (f Maybe)
-- where data T a = MkT a
-- Then we don't want to instantate T's data constructors with
-- Then we don't want to instantiate T's data constructors with
-- (a::*) ~ Maybe
-- because that'll make types that are utterly ill-kinded.
-- This happened in Trac #7368
......
......@@ -1200,7 +1200,7 @@ It checks for three things
might be applications thus (f (g x)).
Note that tys only includes the visible arguments of the class type
constructor. Including the non-vivisble arguments can cause the following,
constructor. Including the non-visible arguments can cause the following,
perfectly valid instance to be rejected:
class Category (cat :: k -> k -> *) where ...
newtype T (c :: * -> * -> *) a b = MkT (c a b)
......
......@@ -477,7 +477,7 @@ Note [TyVarBndrs, TyVarBinders, TyConBinders, and visiblity]
This table summarises the visiblity rules:
---------------------------------------------------------------------------------------
| Occurrences look like this
| GHC displays type as in Haskell souce code
| GHC displays type as in Haskell source code
|-----------------------------------------------------------------------
| TvBndr a tvis :: TyVarBinder, in the binder of ForAllTy for a term
| tvis :: ArgFlag
......
......@@ -485,7 +485,7 @@ That is, its TyVarBinders should be
, TvBndr (a:k->*) Specified
, TvBndr (b:k) Specified ]
So tyConTyVarBinders conversts TyCon's TyConBinders into TyVarBinders:
So tyConTyVarBinders converts TyCon's TyConBinders into TyVarBinders:
- variable names from the TyConBinders
- but changing Anon/Required to Specified
......
......@@ -318,7 +318,7 @@ terminals :: 'terminals_' ::=
| no_duplicates :: :: no_duplicates {{ tex \textsf{no\_duplicates } }}
| vars_of :: :: vars_of {{ tex \textsf{vars\_of } }}
| not :: :: not {{ tex \neg }}
| isUnLiftedTyCon :: :: isUnLiftenTyCon {{ tex \textsf{isUnLiftedTyCon} }}
| isUnLiftedTyCon :: :: isUnLiftedTyCon {{ tex \textsf{isUnLiftedTyCon} }}
| compatibleUnBoxedTys :: :: compatibleUnBoxedTys {{ tex \textsf{compatibleUnBoxedTys} }}
| false :: :: false {{ tex \textsf{false} }}
| true :: :: true {{ tex \textsf{true} }}
......
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