GHC.Tc.Utils.TcMType

ghc-9.14.0.20251028: The GHC API

Safe Haskell | None
Language | GHC2021

GHC.Tc.Utils.TcMType

Contents

- Other HsSyn functions

Description

Monadic type operations

This module contains monadic operations over types that contain mutable type variables.

Synopsis

- type TcTyVar = Var
- type TcKind = Kind
- type TcType = Type
- type TcTauType = TcType
- type TcThetaType = ThetaType
- type TcTyVarSet = TyVarSet
- newFlexiTyVar :: Kind -> TcM TcTyVar
- newNamedFlexiTyVar :: FastString -> Kind -> TcM TcTyVar
- newFlexiTyVarTy :: Kind -> TcM TcType
- newFlexiTyVarTys :: Int -> Kind -> TcM [TcType]
- newOpenFlexiTyVar :: TcM TcTyVar
- newOpenFlexiTyVarTy :: TcM TcType
- newOpenTypeKind :: TcM TcKind
- newOpenFlexiFRRTyVar :: FixedRuntimeRepContext -> TcM TcTyVar
- newOpenFlexiFRRTyVarTy :: FixedRuntimeRepContext -> TcM TcType
- newOpenBoxedTypeKind :: TcM TcKind
- newMetaKindVar :: TcM TcKind
- newMetaKindVars :: Int -> TcM [TcKind]
- newMetaTyVarTyAtLevel :: TcLevel -> TcKind -> TcM TcType
- newConcreteTyVarTyAtLevel :: ConcreteTvOrigin -> TcLevel -> TcKind -> TcM TcType
- substConcreteTvOrigin :: Subst -> Type -> ConcreteTvOrigin -> ConcreteTvOrigin
- newAnonMetaTyVar :: MetaInfo -> Kind -> TcM TcTyVar
- newConcreteTyVar :: HasDebugCallStack => ConcreteTvOrigin -> FastString -> TcKind -> TcM TcTyVar
- cloneMetaTyVar :: TcTyVar -> TcM TcTyVar
- cloneMetaTyVarWithInfo :: MetaInfo -> TcLevel -> TcTyVar -> TcM TcTyVar
- newCycleBreakerTyVar :: TcKind -> TcM TcTyVar
- newMultiplicityVar :: TcM TcType
- readMetaTyVar :: MonadIO m => TyVar -> m MetaDetails
- writeMetaTyVar :: HasDebugCallStack => TcTyVar -> TcType -> ZonkM ()
- writeMetaTyVarRef :: HasDebugCallStack => TcTyVar -> TcRef MetaDetails -> TcType -> ZonkM ()
- newTauTvDetailsAtLevel :: TcLevel -> TcM TcTyVarDetails
- newMetaDetails :: MetaInfo -> TcM TcTyVarDetails
- newMetaTyVarName :: FastString -> TcM Name
- isFilledMetaTyVar_maybe :: TcTyVar -> TcM (Maybe Type)
- isFilledMetaTyVar :: TyVar -> TcM Bool
- isUnfilledMetaTyVar :: TyVar -> TcM Bool
- newEvVar :: TcPredType -> TcRnIf gbl lcl EvVar
- newEvVars :: TcThetaType -> TcM [EvVar]
- newDict :: Class -> [TcType] -> TcM DictId
- newWantedWithLoc :: CtLoc -> PredType -> TcM CtEvidence
- newWanted :: CtOrigin -> Maybe TypeOrKind -> PredType -> TcM CtEvidence
- newWanteds :: CtOrigin -> ThetaType -> TcM [CtEvidence]
- cloneWanted :: Ct -> TcM Ct
- cloneWC :: WantedConstraints -> TcM WantedConstraints
- cloneWantedCtEv :: CtEvidence -> TcM CtEvidence
- emitWanted :: CtOrigin -> TcPredType -> TcM EvTerm
- emitWantedEq :: CtOrigin -> TypeOrKind -> Role -> TcType -> TcType -> TcM Coercion
- emitWantedEvVar :: CtOrigin -> TcPredType -> TcM EvVar
- emitWantedEqs :: CtOrigin -> [(TcType, TcType)] -> TcM ()
- newTcEvBinds :: TcM EvBindsVar
- newNoTcEvBinds :: TcM EvBindsVar
- addTcEvBind :: EvBindsVar -> EvBind -> TcM ()
- emitNewExprHole :: RdrName -> Type -> TcM HoleExprRef
- newCoercionHole :: TcPredType -> TcM CoercionHole
- fillCoercionHole :: CoercionHole -> Coercion -> TcM ()
- isFilledCoercionHole :: CoercionHole -> ZonkM Bool
- checkCoercionHole :: CoVar -> Coercion -> ZonkM Coercion
- newImplication :: TcM Implication
- newMetaTyVars :: [TyVar] -> TcM (Subst, [TcTyVar])
- newMetaTyVarX :: Subst -> TyVar -> TcM (Subst, TcTyVar)
- newMetaTyVarsX :: Subst -> [TyVar] -> TcM (Subst, [TcTyVar])
- newMetaTyVarBndrsX :: Subst -> [VarBndr TyVar vis] -> TcM (Subst, [VarBndr TcTyVar vis])
- newMetaTyVarTyVarX :: Subst -> TyVar -> TcM (Subst, TcTyVar)
- newTyVarTyVar :: Name -> Kind -> TcM TcTyVar
- cloneTyVarTyVar :: Name -> Kind -> TcM TcTyVar
- newConcreteTyVarX :: ConcreteTvOrigin -> Subst -> TyVar -> TcM (Subst, TcTyVar)
- newPatTyVar :: Name -> Kind -> TcM TcTyVar
- newSkolemTyVar :: SkolemInfo -> Name -> Kind -> TcM TcTyVar
- newWildCardX :: Subst -> TyVar -> TcM (Subst, TcTyVar)
- data ExpType
  - = Check TcType
  - | Infer !InferResult
- type ExpSigmaType = ExpType
- type ExpRhoType = ExpType
- mkCheckExpType :: TcType -> ExpType
- newInferExpType :: InferInstFlag -> TcM ExpType
- newInferExpTypeFRR :: InferInstFlag -> FixedRuntimeRepContext -> TcM ExpTypeFRR
- runInfer :: InferInstFlag -> InferFRRFlag -> (ExpSigmaType -> TcM a) -> TcM (a, TcSigmaType)
- runInferRho :: (ExpRhoType -> TcM a) -> TcM (a, TcRhoType)
- runInferSigma :: (ExpSigmaType -> TcM a) -> TcM (a, TcSigmaType)
- runInferKind :: (ExpSigmaType -> TcM a) -> TcM (a, TcSigmaType)
- runInferRhoFRR :: FixedRuntimeRepContext -> (ExpRhoTypeFRR -> TcM a) -> TcM (a, TcRhoTypeFRR)
- runInferSigmaFRR :: FixedRuntimeRepContext -> (ExpSigmaTypeFRR -> TcM a) -> TcM (a, TcSigmaTypeFRR)
- readExpType :: MonadIO m => ExpType -> m TcType
- readExpType_maybe :: MonadIO m => ExpType -> m (Maybe TcType)
- readScaledExpType :: MonadIO m => Scaled ExpType -> m (Scaled Type)
- expTypeToType :: ExpType -> TcM TcType
- scaledExpTypeToType :: Scaled ExpType -> TcM (Scaled TcType)
- checkingExpType_maybe :: ExpType -> Maybe TcType
- checkingExpType :: ExpType -> TcType
- inferResultToType :: InferResult -> TcM Type
- ensureMonoType :: TcType -> TcM ()
- promoteTcType :: TcLevel -> TcType -> TcM (TcCoercionN, TcType)
- tcCheckUsage :: Name -> Mult -> TcM a -> TcM a
- defaultTyVar :: DefaultingStrategy -> TcTyVar -> TcM Bool
- promoteMetaTyVarTo :: HasDebugCallStack => TcLevel -> TcTyVar -> TcM Bool
- promoteTyVarSet :: HasDebugCallStack => TcTyVarSet -> TcM Bool
- quantifyTyVars :: SkolemInfo -> NonStandardDefaultingStrategy -> CandidatesQTvs -> TcM [TcTyVar]
- doNotQuantifyTyVars :: CandidatesQTvs -> (TidyEnv -> ZonkM (TidyEnv, UninferrableTyVarCtx)) -> TcM ()
- zonkAndSkolemise :: SkolemInfo -> TcTyCoVar -> ZonkM TcTyCoVar
- skolemiseQuantifiedTyVar :: SkolemInfo -> TcTyVar -> ZonkM TcTyVar
- candidateQTyVarsOfType :: TcType -> TcM CandidatesQTvs
- candidateQTyVarsOfKind :: TcKind -> TcM CandidatesQTvs
- candidateQTyVarsOfTypes :: [Type] -> TcM CandidatesQTvs
- candidateQTyVarsOfKinds :: [TcKind] -> TcM CandidatesQTvs
- candidateQTyVarsWithBinders :: [TyVar] -> Type -> TcM CandidatesQTvs
- weedOutCandidates :: (DTyVarSet -> DTyVarSet) -> CandidatesQTvs -> CandidatesQTvs
- data CandidatesQTvs = DV {
  - dv_kvs :: DTyVarSet
  - dv_tvs :: DTyVarSet
  - dv_cvs :: CoVarSet
  }
- delCandidates :: CandidatesQTvs -> [Var] -> CandidatesQTvs
- candidateKindVars :: CandidatesQTvs -> TyVarSet
- partitionCandidates :: CandidatesQTvs -> (TyVar -> Bool) -> (TyVarSet, CandidatesQTvs)
- checkTypeHasFixedRuntimeRep :: FixedRuntimeRepProvenance -> Type -> TcM ()
- mkHsDictLet :: TcEvBinds -> LHsExpr GhcTc -> LHsExpr GhcTc
- mkHsApp :: forall (id :: Pass). LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)
- mkHsAppTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)
- mkHsCaseAlt :: forall (p :: Pass) body. (Anno (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) ~ EpAnn NoEpAnns, Anno (Match (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpanAnnA) => LPat (GhcPass p) -> LocatedA (body (GhcPass p)) -> LMatch (GhcPass p) (LocatedA (body (GhcPass p)))
- tcShortCutLit :: HsOverLit GhcRn -> ExpRhoType -> TcM (Maybe (HsOverLit GhcTc))
- shortCutLit :: Platform -> OverLitVal -> TcType -> Maybe (HsExpr GhcTc)
- hsOverLitName :: OverLitVal -> Name
- conLikeResTy :: ConLike -> [Type] -> Type

# Documentation

type TcTyVar = Var Source #

Type variable that might be a metavariable

type TcKind = Kind Source #

type TcType = Type Source #

type TcTauType = TcType Source #

type TcThetaType = ThetaType Source #

type TcTyVarSet = TyVarSet Source #

newFlexiTyVar :: Kind -> TcM TcTyVar Source #

newNamedFlexiTyVar :: FastString -> Kind -> TcM TcTyVar Source #

Create a new flexi ty var with a specific name

newFlexiTyVarTy :: Kind -> TcM TcType Source #

newFlexiTyVarTys :: Int -> Kind -> TcM [TcType] Source #

newOpenFlexiTyVar :: TcM TcTyVar Source #

newOpenFlexiTyVarTy :: TcM TcType Source #

Create a tyvar that can be a lifted or unlifted type. Returns `alpha :: TYPE kappa`, where both `alpha` and `kappa` are fresh.

Note: you should use `newOpenFlexiFRRTyVarTy` if you also need to ensure that the representation is concrete, in the sense of Note [Concrete types] in GHC.Tc.Utils.Concrete.

newOpenTypeKind :: TcM TcKind Source #

newOpenFlexiFRRTyVar :: FixedRuntimeRepContext -> TcM TcTyVar Source #

Like `newOpenFlexiTyVar`, but ensures the type variable has a syntactically fixed RuntimeRep in the sense of Note [Fixed RuntimeRep] in GHC.Tc.Utils.Concrete.

newOpenFlexiFRRTyVarTy :: FixedRuntimeRepContext -> TcM TcType Source #

See `newOpenFlexiFRRTyVar`.

newOpenBoxedTypeKind :: TcM TcKind Source #

newMetaKindVar :: TcM TcKind Source #

newMetaKindVars :: Int -> TcM [TcKind] Source #

newMetaTyVarTyAtLevel :: TcLevel -> TcKind -> TcM TcType Source #

newConcreteTyVarTyAtLevel :: ConcreteTvOrigin -> TcLevel -> TcKind -> TcM TcType Source #

substConcreteTvOrigin :: Subst -> Type -> ConcreteTvOrigin -> ConcreteTvOrigin Source #

newAnonMetaTyVar :: MetaInfo -> Kind -> TcM TcTyVar Source #

newConcreteTyVar :: HasDebugCallStack => ConcreteTvOrigin -> FastString -> TcKind -> TcM TcTyVar Source #

Create a new metavariable, of the given kind, which can only be unified with a concrete type.

Invariant: the kind must be concrete, as per Note [ConcreteTv]. This is checked with an assertion.

cloneMetaTyVar :: TcTyVar -> TcM TcTyVar Source #

cloneMetaTyVarWithInfo :: MetaInfo -> TcLevel -> TcTyVar -> TcM TcTyVar Source #

newCycleBreakerTyVar :: TcKind -> TcM TcTyVar Source #

Make a new cycle-breaker type variable. See Note [Type equality cycles] in GHC.Tc.Solver.Equality.

newMultiplicityVar :: TcM TcType Source #

readMetaTyVar :: MonadIO m => TyVar -> m MetaDetails Source #

writeMetaTyVar Source #

Arguments

:: HasDebugCallStack |
=> TcTyVar | the type varfiable to write to
-> TcType | the type to write into the mutable reference
-> ZonkM () |

Write into a currently-empty MetaTyVar.

Works with both type and kind variables.

writeMetaTyVarRef Source #

Arguments

:: HasDebugCallStack |
=> TcTyVar | for debug assertions only;
-> TcRef MetaDetails | ref cell must be for the same tyvar
-> TcType | the type to write to the mutable reference
-> ZonkM () |

Write into the `MetaDetails` mutable references of a `MetaTv`.

newTauTvDetailsAtLevel :: TcLevel -> TcM TcTyVarDetails Source #

newMetaDetails :: MetaInfo -> TcM TcTyVarDetails Source #

newMetaTyVarName :: FastString -> TcM Name Source #

isFilledMetaTyVar_maybe :: TcTyVar -> TcM (Maybe Type) Source #

isFilledMetaTyVar :: TyVar -> TcM Bool Source #

isUnfilledMetaTyVar :: TyVar -> TcM Bool Source #

newEvVar :: TcPredType -> TcRnIf gbl lcl EvVar Source #

newEvVars :: TcThetaType -> TcM [EvVar] Source #

newDict :: Class -> [TcType] -> TcM DictId Source #

newWantedWithLoc :: CtLoc -> PredType -> TcM CtEvidence Source #

Create a new Wanted constraint with the given `CtLoc`.

newWanted :: CtOrigin -> Maybe TypeOrKind -> PredType -> TcM CtEvidence Source #

Create a new Wanted constraint with the given `CtOrigin`, and location information taken from the `TcM` environment.

newWanteds :: CtOrigin -> ThetaType -> TcM [CtEvidence] Source #

Create new Wanted constraints with the given `CtOrigin`, and location information taken from the `TcM` environment.

cloneWanted :: Ct -> TcM Ct Source #

cloneWC :: WantedConstraints -> TcM WantedConstraints Source #

cloneWantedCtEv :: CtEvidence -> TcM CtEvidence Source #

emitWanted :: CtOrigin -> TcPredType -> TcM EvTerm Source #

Emits a new Wanted. Deals with both equalities and non-equalities.

emitWantedEq :: CtOrigin -> TypeOrKind -> Role -> TcType -> TcType -> TcM Coercion Source #

Emits a new equality constraint

emitWantedEvVar :: CtOrigin -> TcPredType -> TcM EvVar Source #

Creates a new EvVar and immediately emits it as a Wanted. No equality predicates here.

emitWantedEqs :: CtOrigin -> [(TcType, TcType)] -> TcM () Source #

newTcEvBinds :: TcM EvBindsVar Source #

newNoTcEvBinds :: TcM EvBindsVar Source #

Creates an EvBindsVar incapable of holding any bindings. It still tracks covar usages (see comments on ebv_tcvs in GHC.Tc.Types.Evidence), thus must be made monadically

addTcEvBind :: EvBindsVar -> EvBind -> TcM () Source #

emitNewExprHole :: RdrName -> Type -> TcM HoleExprRef Source #

Emit a new wanted expression hole

newCoercionHole :: TcPredType -> TcM CoercionHole Source #

fillCoercionHole :: CoercionHole -> Coercion -> TcM () Source #

Put a value in a coercion hole

isFilledCoercionHole :: CoercionHole -> ZonkM Bool Source #

Is a coercion hole filled in?

checkCoercionHole :: CoVar -> Coercion -> ZonkM Coercion Source #

Debugging-only! Check that a coercion is appropriate for filling a hole. (The hole itself is needed only for printing.)

Always returns the checked coercion, but this return value is necessary so that the input coercion is forced only when the output is forced.

newImplication :: TcM Implication Source #

Create a new `Implication` with as many sensible defaults for its fields as possible. Note that the `ic_tclvl`, `ic_binds`, and `ic_info` fields do not have sensible defaults, so they are initialized with lazy thunks that will `panic` if forced, so one should take care to initialize these fields after creation.

This is monadic to look up the `TcLclEnv`, which is used to initialize `ic_env`, and to set the -Winaccessible-code flag. See Note [Avoid -Winaccessible-code when deriving] in GHC.Tc.TyCl.Instance.

newMetaTyVars :: [TyVar] -> TcM (Subst, [TcTyVar]) Source #

newMetaTyVarX :: Subst -> TyVar -> TcM (Subst, TcTyVar) Source #

newMetaTyVarsX :: Subst -> [TyVar] -> TcM (Subst, [TcTyVar]) Source #

newMetaTyVarBndrsX :: Subst -> [VarBndr TyVar vis] -> TcM (Subst, [VarBndr TcTyVar vis]) Source #

newMetaTyVarTyVarX :: Subst -> TyVar -> TcM (Subst, TcTyVar) Source #

newTyVarTyVar :: Name -> Kind -> TcM TcTyVar Source #

cloneTyVarTyVar :: Name -> Kind -> TcM TcTyVar Source #

newConcreteTyVarX :: ConcreteTvOrigin -> Subst -> TyVar -> TcM (Subst, TcTyVar) Source #

Like `newMetaTyVarX`, but for concrete type variables.

newPatTyVar :: Name -> Kind -> TcM TcTyVar Source #

newSkolemTyVar :: SkolemInfo -> Name -> Kind -> TcM TcTyVar Source #

newWildCardX :: Subst -> TyVar -> TcM (Subst, TcTyVar) Source #

data ExpType Source #

An expected type to check against during type-checking. See Note [ExpType] in GHC.Tc.Utils.TcMType, where you'll also find manipulators.

Constructors

Check TcType |
Infer !InferResult |

#### Instances

Instances details

Outputable ExpType Source # |
Instance details Defined in GHC.Tc.Utils.TcType Methods ppr :: ExpType -> SDoc Source #

type ExpSigmaType = ExpType Source #

type ExpRhoType = ExpType Source #

mkCheckExpType :: TcType -> ExpType Source #

Make an `ExpType` suitable for checking.

newInferExpType :: InferInstFlag -> TcM ExpType Source #

newInferExpTypeFRR :: InferInstFlag -> FixedRuntimeRepContext -> TcM ExpTypeFRR Source #

runInfer :: InferInstFlag -> InferFRRFlag -> (ExpSigmaType -> TcM a) -> TcM (a, TcSigmaType) Source #

runInferRho :: (ExpRhoType -> TcM a) -> TcM (a, TcRhoType) Source #

runInferSigma :: (ExpSigmaType -> TcM a) -> TcM (a, TcSigmaType) Source #

Infer a type using a fresh ExpType See also Note [ExpType] in GHC.Tc.Utils.TcMType

Use `runInferFRR` if you require the type to have a fixed runtime representation.

runInferKind :: (ExpSigmaType -> TcM a) -> TcM (a, TcSigmaType) Source #

runInferRhoFRR :: FixedRuntimeRepContext -> (ExpRhoTypeFRR -> TcM a) -> TcM (a, TcRhoTypeFRR) Source #

Like `runInferRho`, except it ensures that the resulting type has a syntactically fixed RuntimeRep as per Note [Fixed RuntimeRep] in GHC.Tc.Utils.Concrete.

runInferSigmaFRR :: FixedRuntimeRepContext -> (ExpSigmaTypeFRR -> TcM a) -> TcM (a, TcSigmaTypeFRR) Source #

readExpType :: MonadIO m => ExpType -> m TcType Source #

Extract a type out of an ExpType. Otherwise, panics.

readExpType_maybe :: MonadIO m => ExpType -> m (Maybe TcType) Source #

Extract a type out of an ExpType, if one exists. But one should always exist. Unless you're quite sure you know what you're doing.

readScaledExpType :: MonadIO m => Scaled ExpType -> m (Scaled Type) Source #

Same as readExpType, but for Scaled ExpTypes

expTypeToType :: ExpType -> TcM TcType Source #

Extracts the expected type if there is one, or generates a new TauTv if there isn't.

scaledExpTypeToType :: Scaled ExpType -> TcM (Scaled TcType) Source #

checkingExpType_maybe :: ExpType -> Maybe TcType Source #

Returns the expected type when in checking mode.

checkingExpType :: ExpType -> TcType Source #

Returns the expected type when in checking mode. Panics if in inference mode.

inferResultToType :: InferResult -> TcM Type Source #

ensureMonoType :: TcType -> TcM () Source #

promoteTcType :: TcLevel -> TcType -> TcM (TcCoercionN, TcType) Source #

tcCheckUsage :: Name -> Mult -> TcM a -> TcM a Source #

`tcCheckUsage name mult thing_inside` runs `thing_inside`, checks that the usage of `name` is a submultiplicity of `mult`, and removes `name` from the usage environment.

defaultTyVar :: DefaultingStrategy -> TcTyVar -> TcM Bool Source #

Default a type variable using the given defaulting strategy.

See Note [Type variable defaulting options] in GHC.Types.Basic.

promoteMetaTyVarTo :: HasDebugCallStack => TcLevel -> TcTyVar -> TcM Bool Source #

promoteTyVarSet :: HasDebugCallStack => TcTyVarSet -> TcM Bool Source #

quantifyTyVars :: SkolemInfo -> NonStandardDefaultingStrategy -> CandidatesQTvs -> TcM [TcTyVar] Source #

doNotQuantifyTyVars Source #

Arguments

:: CandidatesQTvs |
-> (TidyEnv -> ZonkM (TidyEnv, UninferrableTyVarCtx)) | like "the class context (D a b, E foogle)"
-> TcM () |

zonkAndSkolemise :: SkolemInfo -> TcTyCoVar -> ZonkM TcTyCoVar Source #

skolemiseQuantifiedTyVar :: SkolemInfo -> TcTyVar -> ZonkM TcTyVar Source #

candidateQTyVarsOfType :: TcType -> TcM CandidatesQTvs Source #

Gathers free variables to use as quantification candidates (in `quantifyTyVars`). This might output the same var in both sets, if it's used in both a type and a kind. The variables to quantify must have a TcLevel strictly greater than the ambient level. (See Wrinkle in Note [Naughty quantification candidates]) See Note [CandidatesQTvs determinism and order] See Note [Dependent type variables]

candidateQTyVarsOfKind :: TcKind -> TcM CandidatesQTvs Source #

Like `candidateQTyVarsOfType`, but consider every free variable to be dependent. This is appropriate when generalizing a *kind*, instead of a type. (That way, -XNoPolyKinds will default the variables to Type.)

candidateQTyVarsOfTypes :: [Type] -> TcM CandidatesQTvs Source #

Like `candidateQTyVarsOfType`, but over a list of types The variables to quantify must have a TcLevel strictly greater than the ambient level. (See Wrinkle in Note [Naughty quantification candidates])

candidateQTyVarsOfKinds :: [TcKind] -> TcM CandidatesQTvs Source #

candidateQTyVarsWithBinders :: [TyVar] -> Type -> TcM CandidatesQTvs Source #

weedOutCandidates :: (DTyVarSet -> DTyVarSet) -> CandidatesQTvs -> CandidatesQTvs Source #

data CandidatesQTvs Source #

Constructors

DV |
Fields dv_kvs :: DTyVarSet dv_tvs :: DTyVarSet dv_cvs :: CoVarSet

#### Instances

Instances details

Outputable CandidatesQTvs Source # |
Instance details Defined in GHC.Tc.Utils.TcMType Methods ppr :: CandidatesQTvs -> SDoc Source #
Monoid CandidatesQTvs Source # |
Instance details Defined in GHC.Tc.Utils.TcMType Methods mempty :: CandidatesQTvs Source # mappend :: CandidatesQTvs -> CandidatesQTvs -> CandidatesQTvs Source # mconcat :: [CandidatesQTvs] -> CandidatesQTvs Source #
Semigroup CandidatesQTvs Source # |
Instance details Defined in GHC.Tc.Utils.TcMType Methods (<>) :: CandidatesQTvs -> CandidatesQTvs -> CandidatesQTvs Source # sconcat :: NonEmpty CandidatesQTvs -> CandidatesQTvs Source # stimes :: Integral b => b -> CandidatesQTvs -> CandidatesQTvs Source #

delCandidates :: CandidatesQTvs -> [Var] -> CandidatesQTvs Source #

candidateKindVars :: CandidatesQTvs -> TyVarSet Source #

partitionCandidates :: CandidatesQTvs -> (TyVar -> Bool) -> (TyVarSet, CandidatesQTvs) Source #

checkTypeHasFixedRuntimeRep :: FixedRuntimeRepProvenance -> Type -> TcM () Source #

Check that the specified type has a fixed runtime representation.

If it isn't, throw a representation-polymorphism error appropriate for the context (as specified by the `FixedRuntimeRepProvenance`).

Unlike the other representation polymorphism checks, which can emit new Wanted constraints to be solved by the constraint solver, this function does not emit any constraints: it has enough information to immediately make a decision.

See (1) in Note [Representation polymorphism checking] in GHC.Tc.Utils.Concrete

# Other HsSyn functions

mkHsDictLet :: TcEvBinds -> LHsExpr GhcTc -> LHsExpr GhcTc Source #

mkHsApp :: forall (id :: Pass). LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) Source #

mkHsAppTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p) Source #

mkHsCaseAlt :: forall (p :: Pass) body. (Anno (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) ~ EpAnn NoEpAnns, Anno (Match (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpanAnnA) => LPat (GhcPass p) -> LocatedA (body (GhcPass p)) -> LMatch (GhcPass p) (LocatedA (body (GhcPass p))) Source #

A simple case alternative with a single pattern, no binds, no guards; pre-typechecking

tcShortCutLit :: HsOverLit GhcRn -> ExpRhoType -> TcM (Maybe (HsOverLit GhcTc)) Source #

shortCutLit :: Platform -> OverLitVal -> TcType -> Maybe (HsExpr GhcTc) Source #

hsOverLitName :: OverLitVal -> Name Source #

conLikeResTy :: ConLike -> [Type] -> Type Source #

Returns the type of the whole pattern