summaryrefslogtreecommitdiff
path: root/compiler/GHC/Tc
diff options
context:
space:
mode:
Diffstat (limited to 'compiler/GHC/Tc')
-rw-r--r--compiler/GHC/Tc/Errors.hs2
-rw-r--r--compiler/GHC/Tc/Gen/App.hs6
-rw-r--r--compiler/GHC/Tc/Gen/Foreign.hs2
-rw-r--r--compiler/GHC/Tc/Gen/Sig.hs2
-rw-r--r--compiler/GHC/Tc/Gen/Splice.hs4
-rw-r--r--compiler/GHC/Tc/Solver.hs2
-rw-r--r--compiler/GHC/Tc/Solver/Canonical.hs2
-rw-r--r--compiler/GHC/Tc/TyCl.hs2
-rw-r--r--compiler/GHC/Tc/TyCl/Instance.hs2
-rw-r--r--compiler/GHC/Tc/Types/Evidence.hs4
-rw-r--r--compiler/GHC/Tc/Utils/Env.hs4
-rw-r--r--compiler/GHC/Tc/Utils/Instantiate.hs2
-rw-r--r--compiler/GHC/Tc/Utils/Unify.hs2
-rw-r--r--compiler/GHC/Tc/Validity.hs6
14 files changed, 21 insertions, 21 deletions
diff --git a/compiler/GHC/Tc/Errors.hs b/compiler/GHC/Tc/Errors.hs
index 6d0bf4d117..0eb7706434 100644
--- a/compiler/GHC/Tc/Errors.hs
+++ b/compiler/GHC/Tc/Errors.hs
@@ -1363,7 +1363,7 @@ mkHoleError lcl_name_cache tidy_simples ctxt
, hole_loc = ct_loc })
= do { rel_binds
<- relevant_bindings False lcl_env lcl_name_cache (tyCoVarsOfType hole_ty)
- -- The 'False' means "don't filter the bindings"; see Trac #8191
+ -- The 'False' means "don't filter the bindings"; see #8191
; show_hole_constraints <- goptM Opt_ShowHoleConstraints
; let relevant_cts
diff --git a/compiler/GHC/Tc/Gen/App.hs b/compiler/GHC/Tc/Gen/App.hs
index 7d64f0d1ef..b420cf8c9e 100644
--- a/compiler/GHC/Tc/Gen/App.hs
+++ b/compiler/GHC/Tc/Gen/App.hs
@@ -230,7 +230,7 @@ tcApp works like this:
returning the function in the corner and the arguments
splitHsApps can deal with infix as well as prefix application,
- and returns a Rebuilder to re-assemble the the application after
+ and returns a Rebuilder to re-assemble the application after
typechecking.
The "list of arguments" is [HsExprArg], described in Note [HsExprArg].
@@ -369,7 +369,7 @@ tcApp rn_expr exp_res_ty
-- Even though both app_res_rho and exp_res_ty are rho-types,
-- they may have nested polymorphism, so if deep subsumption
-- is on we must call tcSubType.
- -- Zonk app_res_rho first, becuase QL may have instantiated some
+ -- Zonk app_res_rho first, because QL may have instantiated some
-- delta variables to polytypes, and tcSubType doesn't expect that
do { app_res_rho <- zonkQuickLook do_ql app_res_rho
; tcSubTypeDS rn_expr app_res_rho exp_res_ty }
@@ -509,7 +509,7 @@ type Delta = TcTyVarSet -- Set of instantiation variables,
tcInstFun :: Bool -- True <=> Do quick-look
-> Bool -- False <=> Instantiate only /inferred/ variables at the end
- -- so may return a sigma-typex
+ -- so may return a sigma-type
-- True <=> Instantiate all type variables at the end:
-- return a rho-type
-- The /only/ call site that passes in False is the one
diff --git a/compiler/GHC/Tc/Gen/Foreign.hs b/compiler/GHC/Tc/Gen/Foreign.hs
index 57b30c9548..b8899e2431 100644
--- a/compiler/GHC/Tc/Gen/Foreign.hs
+++ b/compiler/GHC/Tc/Gen/Foreign.hs
@@ -198,7 +198,7 @@ used even though it is not mentioned expclitly in the source, so we don't
want to report it as "defined but not used" or "imported but not used".
eg newtype D = MkD Int
foreign import foo :: D -> IO ()
-Here 'MkD' us used. See #7408.
+Here 'MkD' is used. See #7408.
GHC also expands type functions during this process, so it's not enough
just to look at the free variables of the declaration.
diff --git a/compiler/GHC/Tc/Gen/Sig.hs b/compiler/GHC/Tc/Gen/Sig.hs
index 138e61978c..cfc5454e54 100644
--- a/compiler/GHC/Tc/Gen/Sig.hs
+++ b/compiler/GHC/Tc/Gen/Sig.hs
@@ -455,7 +455,7 @@ tcPatSynSig name sig_ty@(L _ (HsSig{sig_bndrs = hs_outer_bndrs, sig_body = hs_ty
-- Neither argument types nor the return type may be representation polymorphic.
-- This is because, when creating a matcher:
- -- - the argument types become the the binder types (see test RepPolyPatySynArg),
+ -- - the argument types become the binder types (see test RepPolyPatySynArg),
-- - the return type becomes the scrutinee type (see test RepPolyPatSynRes).
; let (arg_tys, res_ty) = tcSplitFunTys body_ty
; mapM_
diff --git a/compiler/GHC/Tc/Gen/Splice.hs b/compiler/GHC/Tc/Gen/Splice.hs
index 47d19c127b..e7a45a5be9 100644
--- a/compiler/GHC/Tc/Gen/Splice.hs
+++ b/compiler/GHC/Tc/Gen/Splice.hs
@@ -2641,8 +2641,8 @@ reifyTypes = mapM reifyType
reifyPatSynType
:: ([InvisTVBinder], ThetaType, [InvisTVBinder], ThetaType, [Scaled Type], Type) -> TcM TH.Type
-- reifies a pattern synonym's type and returns its *complete* type
--- signature; see NOTE [Pattern synonym signatures and Template
--- Haskell]
+-- signature; see Note [Pattern synonym type signatures and Template
+-- Haskell] in GHC.ThToHs
reifyPatSynType (univTyVars, req, exTyVars, prov, argTys, resTy)
= do { univTyVars' <- reifyTyVarBndrs univTyVars
; req' <- reifyCxt req
diff --git a/compiler/GHC/Tc/Solver.hs b/compiler/GHC/Tc/Solver.hs
index 6f783a6182..6811d35ed0 100644
--- a/compiler/GHC/Tc/Solver.hs
+++ b/compiler/GHC/Tc/Solver.hs
@@ -2689,7 +2689,7 @@ code, but:
Moreover, if we simplify this implication more than once
(e.g. because we can't solve it completely on the first iteration
- of simpl_looop), we'll generate all the same bindings AGAIN!
+ of simpl_loop), we'll generate all the same bindings AGAIN!
Easy solution: take advantage of the work we are doing to track dead
(unused) Givens, and use it to prune the Given bindings too. This is
diff --git a/compiler/GHC/Tc/Solver/Canonical.hs b/compiler/GHC/Tc/Solver/Canonical.hs
index 86569a8109..6622c67a4b 100644
--- a/compiler/GHC/Tc/Solver/Canonical.hs
+++ b/compiler/GHC/Tc/Solver/Canonical.hs
@@ -321,7 +321,7 @@ Why do we do this? Two reasons:
* To avoid repeated work, by repeatedly expanding the superclasses of
same constraint,
-* To terminate the above loop, at least in the -XNoRecursiveSuperClasses
+* To terminate the above loop, at least in the -XNoUndecidableSuperClasses
case. If there are recursive superclasses we could, in principle,
expand forever, always encountering new constraints.
diff --git a/compiler/GHC/Tc/TyCl.hs b/compiler/GHC/Tc/TyCl.hs
index 00cfe6d02b..67697eb55e 100644
--- a/compiler/GHC/Tc/TyCl.hs
+++ b/compiler/GHC/Tc/TyCl.hs
@@ -4566,7 +4566,7 @@ checkNewDataCon con
ok_mult _ = False
--- | Reject nullary data constructors where a type variables
+-- | Reject nullary data constructors where a type variable
-- would escape through the result kind
-- See Note [Check for escaping result kind]
checkEscapingKind :: DataCon -> TcM ()
diff --git a/compiler/GHC/Tc/TyCl/Instance.hs b/compiler/GHC/Tc/TyCl/Instance.hs
index 86b8626d50..879280d203 100644
--- a/compiler/GHC/Tc/TyCl/Instance.hs
+++ b/compiler/GHC/Tc/TyCl/Instance.hs
@@ -1132,7 +1132,7 @@ But what about this?
So what kind do 'p' and 'q' have? No clues from the header, but from
the data constructor we can clearly see that (r :: Type->Type). Does
-that mean that the the /entire data instance/ is instantiated at Type,
+that mean that the /entire data instance/ is instantiated at Type,
like this?
data instance T @Type (p :: Type->Type) (q :: Type) where
...
diff --git a/compiler/GHC/Tc/Types/Evidence.hs b/compiler/GHC/Tc/Types/Evidence.hs
index 82e7847b02..87e6bc5b82 100644
--- a/compiler/GHC/Tc/Types/Evidence.hs
+++ b/compiler/GHC/Tc/Types/Evidence.hs
@@ -565,7 +565,7 @@ data EvTerm
type EvExpr = CoreExpr
-- An EvTerm is (usually) constructed by any of the constructors here
--- and those more complicates ones who were moved to module GHC.Tc.Types.EvTerm
+-- and those more complicated ones who were moved to module GHC.Tc.Types.EvTerm
-- | Any sort of evidence Id, including coercions
evId :: EvId -> EvExpr
@@ -671,7 +671,7 @@ evidence
dl :: Typeable [a] = EvTypeable [a]
(EvTypeableTyApp (EvTypeableTyCon []) (EvId d))
where
- d :: Typable a
+ d :: Typeable a
is the lambda-bound dictionary passed into f.
Note [Coercion evidence terms]
diff --git a/compiler/GHC/Tc/Utils/Env.hs b/compiler/GHC/Tc/Utils/Env.hs
index 84b9d8f9a0..5f73a56724 100644
--- a/compiler/GHC/Tc/Utils/Env.hs
+++ b/compiler/GHC/Tc/Utils/Env.hs
@@ -853,7 +853,7 @@ good reasons; a view pattern in the RHS may mention a value binding).
It is entirely reasonable to reject this, but to do so we need A to be
in the kind environment when kind-checking the signature for B.
-Hence tcAddPatSynPlaceholers adds a binding
+Hence tcAddPatSynPlaceholders adds a binding
A -> APromotionErr PatSynPE
to the environment. Then GHC.Tc.Gen.HsType.tcTyVar will find A in the kind
environment, and will give a 'wrongThingErr' as a result. But the
@@ -961,7 +961,7 @@ tcGetDefaultTys
-- User-supplied defaults
Nothing -> do
- -- No use-supplied default
+ -- No user-supplied default
-- Use [Integer, Double], plus modifications
{ integer_ty <- tcMetaTy integerTyConName
; list_ty <- tcMetaTy listTyConName
diff --git a/compiler/GHC/Tc/Utils/Instantiate.hs b/compiler/GHC/Tc/Utils/Instantiate.hs
index 1d47b9610e..6aa02e4788 100644
--- a/compiler/GHC/Tc/Utils/Instantiate.hs
+++ b/compiler/GHC/Tc/Utils/Instantiate.hs
@@ -219,7 +219,7 @@ topInstantiate orig sigma
instantiateSigma :: CtOrigin -> [TyVar] -> TcThetaType -> TcSigmaType
-> TcM ([TcTyVar], HsWrapper, TcSigmaType)
-- (instantiate orig tvs theta ty)
--- instantiates the the type variables tvs, emits the (instantiated)
+-- instantiates the type variables tvs, emits the (instantiated)
-- constraints theta, and returns the (instantiated) type ty
instantiateSigma orig tvs theta body_ty
= do { (subst, inst_tvs) <- mapAccumLM newMetaTyVarX empty_subst tvs
diff --git a/compiler/GHC/Tc/Utils/Unify.hs b/compiler/GHC/Tc/Utils/Unify.hs
index af71c50156..d013753bae 100644
--- a/compiler/GHC/Tc/Utils/Unify.hs
+++ b/compiler/GHC/Tc/Utils/Unify.hs
@@ -1156,7 +1156,7 @@ The DeepSubsumption extension, documented here
https://github.com/ghc-proposals/ghc-proposals/pull/511.
makes a best-efforts attempt implement deep subsumption as it was
-prior to the the Simplify Subsumption proposal:
+prior to the Simplify Subsumption proposal:
https://github.com/ghc-proposals/ghc-proposals/pull/287
diff --git a/compiler/GHC/Tc/Validity.hs b/compiler/GHC/Tc/Validity.hs
index 3fbe32352b..9af0fbdeb5 100644
--- a/compiler/GHC/Tc/Validity.hs
+++ b/compiler/GHC/Tc/Validity.hs
@@ -1091,7 +1091,7 @@ check_pred_help under_syn env dflags ctxt pred
| otherwise -> check_class_pred env dflags ctxt pred cls tys
EqPred _ _ _ -> pprPanic "check_pred_help" (ppr pred)
- -- EqPreds, such as (t1 ~ #t2) or (t1 ~R# t2), don't even have kind Constraint
+ -- EqPreds, such as (t1 ~# t2) or (t1 ~R# t2), don't even have kind Constraint
-- and should never appear before the '=>' of a type. Thus
-- f :: (a ~# b) => blah
-- is wrong. For user written signatures, it'll be rejected by kind-checking
@@ -1742,7 +1742,7 @@ checkValidInstance ctxt hs_type ty
; expand <- initialExpandMode
; check_valid_theta env0 ctxt expand theta
- -- The Termination and Coverate Conditions
+ -- The Termination and Coverage Conditions
-- Check that instance inference will terminate (if we care)
-- For Haskell 98 this will already have been done by checkValidTheta,
-- but as we may be using other extensions we need to check.
@@ -2557,7 +2557,7 @@ In every case, b is a type variable not determined by the LHS pattern. The
first is caught by the renamer, but we catch the last two here. Perhaps one
could argue that the second should be accepted, albeit with a warning, but
consider the fact that in a type family instance, there is no way to interact
-with such a varable. At least with @x :: forall a. Int@ we can use visible
+with such a variable. At least with @x :: forall a. Int@ we can use visible
type application, like @x \@Bool 1@. (Of course it does nothing, but it is
permissible.) In the type family case, the only sensible explanation is that
the user has made a mistake -- thus we throw an error.
View Lorry Controller Status