Commit 0aafe519 authored by Gabor Greif's avatar Gabor Greif 💬

Typos in manual, tests and comments

parent dae50032
......@@ -273,7 +273,7 @@ b) The top-level binding is marked NoCafRefs. This really happens
$fApplicativeSTM [NoCafRefs] = D:Alternative sat ...blah...
So, gruesomely, we must set the NoCafRefs flag on the sat bindings,
*and* substutite the modified 'sat' into the old RHS.
*and* substitute the modified 'sat' into the old RHS.
It should be the case that 'sat' is itself [NoCafRefs] (a value, no
cafs) else the original top-level binding would not itself have been
......
......@@ -1076,7 +1076,7 @@ has two major consequences
instance Eq T where ....
The instance (Eq T) is incorprated as part of T's fingerprint.
In constrast, orphans are all fingerprinted together in the
In contrast, orphans are all fingerprinted together in the
mi_orph_hash field of the ModIface.
See MkIface.addFingerprints.
......
......@@ -160,7 +160,7 @@ tcCheckPatSynDecl psb@PSB{ psb_id = lname@(L _ name), psb_args = details
; traceTc "tcpatsyn2" (vcat [ ppr v <+> dcolon <+> ppr (tyVarKind v) | v <- ex_tvs'])
; let prov_theta' = substTheta subst prov_theta
-- Add univ_tvs to the in_scope set to
-- satisfy the substition invariant. There's no need to
-- satisfy the substitution invariant. There's no need to
-- add 'ex_tvs' as they are already in the domain of the
-- substitution.
-- See also Note [The substitution invariant] in TyCoRep.
......
......@@ -212,7 +212,7 @@ example.
So we arrange to put these particular class constraints in the wl_eqs.
NB: since we do not currently apply the substition to the
NB: since we do not currently apply the substitution to the
inert_solved_dicts, the knot-tying still seems a bit fragile.
But this makes it better.
-}
......@@ -795,7 +795,7 @@ Theorem [Stability under extension]
a not in s, OR
the path from the top of s to a includes at least one non-newtype
then the extended substition T = S+(a -fw-> t)
then the extended substitution T = S+(a -fw-> t)
is an inert generalised substitution.
Conditions (T1-T3) are established by the canonicaliser
......
......@@ -1959,7 +1959,7 @@ mkGADTVars tmpl_tvs dc_tvs subst
choose :: [TyVar] -- accumulator of univ tvs, reversed
-> [EqSpec] -- accumulator of GADT equalities, reversed
-> TCvSubst -- template substutition
-> TCvSubst -- template substitution
-> TCvSubst -- res. substitution
-> [TyVar] -- template tvs (the univ tvs passed in)
-> ( [TyVar] -- the univ_tvs
......
......@@ -1479,7 +1479,7 @@ tcRepSplitTyConApp_maybe _ = Nothing
-- currently don't even enough information to fully determine its RuntimeRep
-- variables. For instance, @FunTy (a :: k) Int@.
--
-- By constrast 'tcRepSplitTyConApp_maybe' panics in the second case.
-- By contrast 'tcRepSplitTyConApp_maybe' panics in the second case.
--
-- The behavior here is needed during canonicalization; see Note [FunTy and
-- decomposing tycon applications] in TcCanonical for details.
......
......@@ -1732,7 +1732,7 @@ isInjectiveTyCon tc@(TcTyCon {}) _
isGenerativeTyCon :: TyCon -> Role -> Bool
isGenerativeTyCon (FamilyTyCon { famTcFlav = DataFamilyTyCon _ }) Nominal = True
isGenerativeTyCon (FamilyTyCon {}) _ = False
-- in all other cases, injectivity implies generativitiy
-- in all other cases, injectivity implies generativity
isGenerativeTyCon tc r = isInjectiveTyCon tc r
-- | Is this an 'AlgTyConRhs' of a 'TyCon' that is generative and injective
......
......@@ -504,7 +504,7 @@ To make it idempotent we don't want to get just
We also want to substitute inside f's kind, to get
[ k -> *
, g -> H k (f:*) ]
If we don't do this, we may apply the substitition to something,
If we don't do this, we may apply the substitution to something,
and get an ill-formed type, i.e. one where typeKind will fail.
This happened, for example, in Trac #9106.
......
......@@ -2153,7 +2153,7 @@ commonly used commands.
If omitted, n and m default to the first or last available
completion candidate respectively. If there are less candidates than
requested via the range argument, n and m are implicitly capped
to the number of available completition candidates.
to the number of available completion candidates.
The output of :ghci-cmd:`:complete` begins with a header line containing
three space-delimited fields:
......
......@@ -48,7 +48,7 @@ data FooBar = FooBar
instance {-# OVERLAPPING #-} EmbedAsChild (IdentityT IO) FooBar where
asChild b = asChild $ (genElement "foo")
-- asChild :: FooBar -> XMLGenT (XMLGenT (IdentityT IO) [Child (IdentitiyT IO)])
-- asChild :: FooBar -> XMLGenT (XMLGenT (IdentityT IO) [Child (IdentityT IO)])
{- ---------- Deriving the constraints ----------
asChild :: EmbedAsChild m c => c -> XMLGenT m [Child m]
......
......@@ -7153,7 +7153,7 @@ $$\showboard$$
18 & \ldots & N*g2??\\
\end{tabular}}|
\end{center}
Throws away a piece for a very temp. inititive.
Throws away a piece for a very temp. initiative.
|18\ldots~Rb8; 19.~d4, e*d4; 20.~c*d4, Ne6; 21.~N*e6, Q*e6|
and white is starting to push home his advantage.
\begin{center}|
......
......@@ -1307,7 +1307,7 @@ Qd6 15. h3 Be6 16. Ng5 Bxb3 17. axb3 Nf4 18. Nf3 {<sab>}) 15. Nxc5 Qc8 (
16. b4 {White is just a pawn up.}) 16... Rd8 17. Qd2 Rd6 (17... Bxf3 {!}
18. Rxf3 Qg4 19. Rxf4 exf4 20. h3 Qh4 21. d4 {and black has equalised!})
18. Bd1 {} 18... Nxg2 {?? Throws away a piece for a very temp.
inititive.} (18... Rb8 19. d4 exd4 20. cxd4 Ne6 21. Nxe6 Qxe6 {and white
initiative.} (18... Rb8 19. d4 exd4 20. cxd4 Ne6 21. Nxe6 Qxe6 {and white
is starting to push home his advantage.}) 19. Kxg2 Bh3+ 20. Kh1 Qg4 (
20... Rg6 {is another idea, but the whole plan is conceptually flawed.})
21. Ne1 Qg5 22. Qe2 Be6 23. Rg3 Qf6 24. Nxe6 {} (24. Nf3 Ne7 25. Nxe6
......
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