Commit 9a2a2aef authored by Gabor Greif's avatar Gabor Greif 💬

Spelling only [ci skip]

parent 8a6b8c5f
......@@ -859,7 +859,7 @@ be unleashed. See also [Aggregated demand for cardinality].
Note [Replicating polymorphic demands]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Some demands can be considered as polymorphic. Generally, it is
applicable to such beasts as tops, bottoms as well as Head-Used adn
applicable to such beasts as tops, bottoms as well as Head-Used and
Head-stricts demands. For instance,
S ~ S(L, ..., L)
......
......@@ -1141,7 +1141,7 @@ unsafeCoerceId
------------------------------------------------
nullAddrId :: Id
-- nullAddr# :: Addr#
-- The reason is is here is because we don't provide
-- The reason it is here is because we don't provide
-- a way to write this literal in Haskell.
nullAddrId = pcMiscPrelId nullAddrName addrPrimTy info
where
......
......@@ -693,7 +693,7 @@ cgConApp con stg_args
-- con args are always non-void,
-- see Note [Post-unarisation invariants] in UnariseStg
-- The first "con" says that the name bound to this
-- closure is is "con", which is a bit of a fudge, but
-- closure is "con", which is a bit of a fudge, but
-- it only affects profiling (hence the False)
; emit =<< fcode_init
......
......@@ -1361,7 +1361,7 @@ AND
it is bound to a cheap expression
then we should not inline it (unless there is some other reason,
e.g. is is the sole occurrence). That is what is happening at
e.g. it is the sole occurrence). That is what is happening at
the use of 'lone_variable' in 'interesting_call'.
Why? At least in the case-scrutinee situation, turning
......
......@@ -2118,7 +2118,7 @@ tryEtaReduce bndrs body
{-
Note [Eta reduction of an eval'd function]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In Haskell is is not true that f = \x. f x
In Haskell it is not true that f = \x. f x
because f might be bottom, and 'seq' can distinguish them.
But it *is* true that f = f `seq` \x. f x
......
......@@ -2594,7 +2594,7 @@ outOfLineCmmOp mop res args
where
-- Assume we can call these functions directly, and that they're not in a dynamic library.
-- TODO: Why is this ok? Under linux this code will be in libm.so
-- Is is because they're really implemented as a primitive instruction by the assembler?? -- BL 2009/12/31
-- Is it because they're really implemented as a primitive instruction by the assembler?? -- BL 2009/12/31
lbl = mkForeignLabel fn Nothing ForeignLabelInThisPackage IsFunction
fn = case mop of
......
......@@ -2800,7 +2800,7 @@ clean_pragma prag = canon_ws (map toLower (unprefix prag))
-- | Encapsulated call to addAnnotation, requiring only the SrcSpan of
-- the AST construct the annotation belongs to; together with the
-- AnnKeywordId, this is is the key of the annotation map
-- AnnKeywordId, this is the key of the annotation map.
--
-- This type is useful for places in the parser where it is not yet
-- known what SrcSpan an annotation should be added to. The most
......
......@@ -195,7 +195,7 @@ illegalUntypedBracket =
quotedNameStageErr :: HsBracket RdrName -> SDoc
quotedNameStageErr br
= sep [ text "Stage error: the non-top-level quoted name" <+> ppr br
, text "must be used at the same stage at which is is bound" ]
, text "must be used at the same stage at which it is bound" ]
{-
......
......@@ -992,7 +992,7 @@ Consider
x = 3
data T = MkT $(foo x)
where 'foo' is is imported from somewhere.
where 'foo' is imported from somewhere.
This is really a staging error, because we can't run code involving 'x'.
But in fact the type checker processes types first, so 'x' won't even be
......
......@@ -338,7 +338,7 @@ tuple. The trouble is that this might accept a partially-applied
only going to work when it's fully applied, so it turns into
case x of _ -> (# p,q #)
So it seems more uniform to treat 'seq' as it it was a language
So it seems more uniform to treat 'seq' as if it was a language
construct.
See also Note [seqId magic] in MkId
......
......@@ -1029,7 +1029,7 @@ tcApplicativeStmts ctxt pairs rhs_ty thing_inside
; args' <- mapM goArg (zip3 args pat_tys exp_tys)
-- Bring into scope all the things bound by the args,
-- and typecheck the thign_inside
-- and typecheck the thing_inside
-- See Note [ApplicativeDo and constraints]
; res <- tcExtendIdEnv (concatMap get_arg_bndrs args') $
thing_inside body_ty
......@@ -1076,7 +1076,7 @@ tcApplicativeStmts ctxt pairs rhs_ty thing_inside
{- Note [ApplicativeDo and constraints]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
An applicative-do is supposed to take place in parallel, so
constraints bound in one arm can't possibly be available in aother
constraints bound in one arm can't possibly be available in another
(Trac #13242). Our current rule is this (more details and discussion
on the ticket). Consider
......
......@@ -823,7 +823,7 @@ The list @mut_once_list@ is also adjusted if it is safe to remove @r@ from
\subsubsection{(3) Scavenging CAFs}
When a dynamically loaded CAF is entered, it it first put to the list
When a dynamically loaded CAF is entered, it is first put to the list
@caf_list@ and then overwritten with a static indirection object.
The evaluation result of the CAF is stored in a dynamic object in the heap
and the static indirection object stores a pointer to the dynamic object.
......
......@@ -836,7 +836,7 @@ of ``-W(no-)*``.
Will raise two warnings because ``Zero`` and ``Succ`` are not
written as ``'Zero`` and ``'Succ``.
This warning is is enabled by default in :ghc-flag:`-Wall` mode.
This warning is enabled by default in :ghc-flag:`-Wall` mode.
.. ghc-flag:: -Wunused-binds
......
......@@ -43,7 +43,7 @@ import GHC.IO.Exception
-- A program that fails in any other way is treated as if it had
-- called 'exitFailure'.
-- A program that terminates successfully without calling 'exitWith'
-- explicitly is treated as it it had called 'exitWith' 'ExitSuccess'.
-- explicitly is treated as if it had called 'exitWith' 'ExitSuccess'.
--
-- As an 'ExitCode' is not an 'IOError', 'exitWith' bypasses
-- the error handling in the 'IO' monad and cannot be intercepted by
......
......@@ -482,7 +482,7 @@ check_target:
#endif
case ThreadMigrating:
// if is is ThreadMigrating and tso->cap is ours, then it
// if it is ThreadMigrating and tso->cap is ours, then it
// *must* be migrating *to* this capability. If it were
// migrating away from the capability, then tso->cap would
// point to the destination.
......
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