GHC.Tc.Types.Constraint · ghc-9.10.3

typetype Xi = TcType

A Xi-type is one that has been fully rewritten with respect to the inert set; that is, it has been rewritten by the algorithm in GHC.Tc.Solver.Rewrite. (Historical note: Xi, for years and years, meant that a type was type-family-free. It does *not* mean this any more.)

datadata Ct

#

Instances1Outputable

Outputable CtDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

typetype Cts = Bag Ct

#

valuesingleCt :: Ct -> Cts

#

valuelistToCts :: [Ct] -> Cts

#

valuectsElts :: Cts -> [Ct]

#

valueconsCts :: Ct -> Cts -> Cts

#

valuesnocCts :: Cts -> Ct -> Cts

#

valueextendCtsList :: Cts -> [Ct] -> Cts

#

valueisEmptyCts :: Cts -> Bool

#

valueemptyCts :: Cts

#

valueandCts :: Cts -> Cts -> Cts

#

valuectsPreds :: Cts -> [PredType]

#

valueisPendingScDictCt :: DictCt -> Bool

#

valueisPendingScDict :: Ct -> Bool

#

valuependingScDict_maybe :: Ct -> Maybe Ct

#

valuesuperClassesMightHelp :: WantedConstraints -> Bool

#

True if taking superclasses of givens, or of wanteds (to perhaps expose more equalities or functional dependencies) might help to solve this constraint. See Note [When superclasses help]

valuegetPendingWantedScs :: Cts -> ([Ct], Cts)

#

valueisWantedCt :: Ct -> Bool

#

valueisGivenCt :: Ct -> Bool

#

valueisTopLevelUserTypeError :: PredType -> Bool

#

Is this an user error message type, i.e. either the form TypeError err or Unsatisfiable err?

valuecontainsUserTypeError :: PredType -> Bool

#

Does this constraint contain an user error message?

That is, the type is either of the form Unsatisfiable err, or it contains a type of the form TypeError msg, either at the top level or nested inside the type.

valuegetUserTypeErrorMsg :: PredType -> Maybe ErrorMsgType

#

A constraint is considered to be a custom type error, if it contains custom type errors anywhere in it. See Note [Custom type errors in constraints]

valueisUnsatisfiableCt_maybe :: Type -> Maybe ErrorMsgType

#

Is this type an unsatisfiable constraint? If so, return the error message.

valuectEvidence :: Ct -> CtEvidence

#

valueupdCtEvidence :: (CtEvidence -> CtEvidence) -> Ct -> Ct

#

valuectLoc :: Ct -> CtLoc

#

valuectPred :: Ct -> PredType

#

valuectFlavour :: Ct -> CtFlavour

#

Get the flavour of the given Ct

valuectEqRel :: Ct -> EqRel

#

Get the equality relation for the given Ct

valuectOrigin :: Ct -> CtOrigin

#

valuectRewriters :: Ct -> RewriterSet

#

valuectEvId :: HasDebugCallStack => Ct -> EvVar

#

valuewantedEvId_maybe :: Ct -> Maybe EvVar

#

Returns the evidence Id for the argument Ct when this Ct is a Wanted.

Returns Nothing otherwise.

valuemkTcEqPredLikeEv :: CtEvidence -> TcType -> TcType -> TcType

#

Makes a new equality predicate with the same role as the given evidence.

valuemkNonCanonical :: CtEvidence -> Ct

#

valuemkGivens :: CtLoc -> [EvId] -> [Ct]

#

valuetyCoVarsOfCt :: Ct -> TcTyCoVarSet

#

Returns free variables of constraints as a non-deterministic set

valuetyCoVarsOfCts :: Cts -> TcTyCoVarSet

#

Returns free variables of a bag of constraints as a non-deterministic set. See Note [Deterministic FV] in GHC.Utils.FV.

valuetyCoVarsOfCtList :: Ct -> [TcTyCoVar]

#

Returns free variables of constraints as a deterministically ordered list. See Note [Deterministic FV] in GHC.Utils.FV.

valuetyCoVarsOfCtsList :: Cts -> [TcTyCoVar]

#

Returns free variables of a bag of constraints as a deterministically ordered list. See Note [Deterministic FV] in GHC.Utils.FV.

datadata EqCt

#

Constructors

EqCt
- eq_ev :: CtEvidence
- eq_lhs :: CanEqLHS
- eq_rhs :: Xi
- eq_eq_rel :: EqRel

Instances1Outputable

Outputable EqCtDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valueeqCtEvidence :: EqCt -> CtEvidence

#

valueeqCtLHS :: EqCt -> CanEqLHS

#

datadata DictCt

#

Constructors

DictCt
- di_ev :: CtEvidence
- di_cls :: Class
- di_tys :: [Xi]
- di_pend_sc :: ExpansionFuel

Instances1Outputable

Outputable DictCtDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valuedictCtEvidence :: DictCt -> CtEvidence

#

datadata IrredCt

#

Constructors

IrredCt
- ir_ev :: CtEvidence
- ir_reason :: CtIrredReason

Instances1Outputable

Outputable IrredCtDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valueirredCtEvidence :: IrredCt -> CtEvidence

#

valuemkIrredCt :: CtIrredReason -> CtEvidence -> Ct

#

valuectIrredCt :: CtIrredReason -> Ct -> IrredCt

#

valueirredCtPred :: IrredCt -> PredType

#

datadata QCInst

#

Constructors

QCI
- qci_ev :: CtEvidence
- qci_tvs :: [TcTyVar]
- qci_pred :: TcPredType
- qci_pend_sc :: ExpansionFuel

Instances1Outputable

Outputable QCInstDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valuependingScInst_maybe :: QCInst -> Maybe QCInst

#

typetype ExpansionFuel = Int

#

Says how many layers of superclasses can we expand. Invariant: ExpansionFuel should always be >= 0 see Note [Expanding Recursive Superclasses and ExpansionFuel]

valuedoNotExpand :: ExpansionFuel

#

Do not expand superclasses any further

valueconsumeFuel :: ExpansionFuel -> ExpansionFuel

#

Consumes one unit of fuel. Precondition: fuel > 0

valuependingFuel :: ExpansionFuel -> Bool

#

Returns True if we have any fuel left for superclass expansion

valueassertFuelPrecondition :: ExpansionFuel -> a -> a

#

asserts if fuel is non-negative

valueassertFuelPreconditionStrict :: ExpansionFuel -> a -> a

#

asserts if fuel is strictly greater than 0

datadata CtIrredReason

#

Used to indicate extra information about why a CIrredCan is irreducible

Constructors

IrredShapeReason
This constraint has a non-canonical shape (e.g. c Int, for a variable c)
NonCanonicalReason CheckTyEqResult
An equality where some invariant other than (TyEq:H) of CEqCan is not satisfied; the CheckTyEqResult states exactly why
ReprEqReason
An equality that cannot be decomposed because it is representational. Example: a b ~R# Int. These might still be solved later. INVARIANT: The constraint is a representational equality constraint
ShapeMismatchReason
A nominal equality that relates two wholly different types, like Int ~# Bool or a b ~# 3. INVARIANT: The constraint is a nominal equality constraint
AbstractTyConReason
An equality like T a b c ~ Q d e where either T or Q is an abstract type constructor. See Note [Skolem abstract data] in GHC.Core.TyCon. INVARIANT: The constraint is an equality constraint between two TyConApps
PluginReason
A typechecker plugin returned this in the pluginBadCts field of TcPluginProgress

Instances1Outputable

Outputable CtIrredReasonDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valueisInsolubleReason :: CtIrredReason -> Bool

#

Are we sure that more solving will never solve this constraint?

newtypenewtype CheckTyEqResult

#

A set of problems in checking the validity of a type equality. See checkTypeEq.

Instances3Semigroup, Monoid, Outputable

Semigroup CheckTyEqResultDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Monoid CheckTyEqResultDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Outputable CheckTyEqResultDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

newtypenewtype CheckTyEqProblem

#

An individual problem that might be logged in a CheckTyEqResult

Instances2Eq, Outputable

Eq CheckTyEqProblemDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Outputable CheckTyEqProblemDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valuecteProblem :: CheckTyEqProblem -> CheckTyEqResult

#

valuecterClearOccursCheck :: CheckTyEqResult -> CheckTyEqResult

#

valuecteOK :: CheckTyEqResult

#

No problems in checking the validity of a type equality.

valuecteImpredicative :: CheckTyEqProblem

#

valuecteTypeFamily :: CheckTyEqProblem

#

valuecteCoercionHole :: CheckTyEqProblem

#

valuecteInsolubleOccurs :: CheckTyEqProblem

#

valuecteSolubleOccurs :: CheckTyEqProblem

#

valuecterSetOccursCheckSoluble :: CheckTyEqResult -> CheckTyEqResult

#

Mark a CheckTyEqResult as not having an insoluble occurs-check: any occurs check under a type family or in a representation equality is soluble.

valuecteConcrete :: CheckTyEqProblem

#

valuecteSkolemEscape :: CheckTyEqProblem

#

valueimpredicativeProblem :: CheckTyEqResult

#

valueinsolubleOccursProblem :: CheckTyEqResult

#

valuesolubleOccursProblem :: CheckTyEqResult

#

valuecterHasNoProblem :: CheckTyEqResult -> Bool

#

Check whether a CheckTyEqResult is marked successful.

valuecterHasProblem :: CheckTyEqResult -> CheckTyEqProblem -> Bool

#

Check whether a CheckTyEqResult has a CheckTyEqProblem

valuecterHasOnlyProblem :: CheckTyEqResult -> CheckTyEqProblem -> Bool

#

Check whether a CheckTyEqResult has one CheckTyEqProblem and no other

valuecterHasOnlyProblems :: CheckTyEqResult -> CheckTyEqResult -> Bool

#

valuecterRemoveProblem :: CheckTyEqResult -> CheckTyEqProblem -> CheckTyEqResult

#

valuecterHasOccursCheck :: CheckTyEqResult -> Bool

#

valuecterFromKind :: CheckTyEqResult -> CheckTyEqResult

#

Retain only information about occurs-check failures, because only that matters after recurring into a kind.

datadata CanEqLHS

#

A CanEqLHS is a type that can appear on the left of a canonical equality: a type variable or exactly-saturated type family application.

Constructors

TyVarLHS TcTyVar
TyFamLHS TyCon [Xi]

Instances1Outputable

Outputable CanEqLHSDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valuecanEqLHS_maybe :: Xi -> Maybe CanEqLHS

#

Is a type a canonical LHS? That is, is it a tyvar or an exactly-saturated type family application? Does not look through type synonyms.

valuecanTyFamEqLHS_maybe :: Xi -> Maybe CanEqLHS

#

valuecanEqLHSKind :: CanEqLHS -> TcKind

#

Retrieve the kind of a CanEqLHS

valuecanEqLHSType :: CanEqLHS -> TcType

#

Convert a CanEqLHS back into a Type

valueeqCanEqLHS :: CanEqLHS -> CanEqLHS -> Bool

#

Are two CanEqLHSs equal?

datadata Hole

#

A hole stores the information needed to report diagnostics about holes in terms (unbound identifiers or underscores) or in types (also called wildcards, as used in partial type signatures). See Note [Holes].

Constructors

Hole
- hole_sort :: HoleSort
  What flavour of hole is this?
- hole_occ :: RdrName
  The name of this hole
- hole_ty :: TcType
  Type to be printed to the user For expression holes: type of expr For type holes: the missing type
- hole_loc :: CtLoc
  Where hole was written

Instances1Outputable

Outputable HoleDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

datadata HoleSort

#

Used to indicate which sort of hole we have.

Constructors

ExprHole HoleExprRef
Either an out-of-scope variable or a "true" hole in an expression (TypedHoles). The HoleExprRef says where to write the the erroring expression for -fdefer-type-errors.
TypeHole
A hole in a type (PartialTypeSignatures)
ConstraintHole
A hole in a constraint, like @f :: (_, Eq a) => ... Differentiated from TypeHole because a ConstraintHole is simplified differently. See Note [Do not simplify ConstraintHoles] in GHC.Tc.Solver.

Instances1Outputable

Outputable HoleSortDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valueisOutOfScopeHole :: Hole -> Bool

#

Does this hole represent an "out of scope" error? See Note [Insoluble holes]

datadata DelayedError

#

A delayed error, to be reported after constraint solving, in order to benefit from deferred unifications.

Constructors

DE_Hole Hole
A hole (in a type or in a term).
See Note [Holes].
DE_NotConcrete NotConcreteError
A type could not be ensured to be concrete.
See Note [The Concrete mechanism] in GHC.Tc.Utils.Concrete.

Instances1Outputable

Outputable DelayedErrorDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

datadata NotConcreteError

#

Why did we require that a certain type be concrete?

Constructors

NCE_FRR
Concreteness was required by a representation-polymorphism check.
See Note [The Concrete mechanism] in GHC.Tc.Utils.Concrete.
- nce_loc :: CtLoc
  Where did this check take place?
- nce_frr_origin :: FixedRuntimeRepOrigin
  Which representation-polymorphism check did we perform?
- nce_reasons :: NonEmpty NotConcreteReason
  Why did the check fail?

Instances1Outputable

Outputable NotConcreteErrorDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

datadata NotConcreteReason

#

Why did we decide that a type was not concrete?

Constructors

NonConcreteTyCon TyCon [TcType]
The type contains a TyConApp of a non-concrete TyCon.
See Note [Concrete types] in GHC.Tc.Utils.Concrete.
NonConcretisableTyVar TyVar
The type contains a type variable that could not be made concrete (e.g. a skolem type variable).
ContainsCast TcType TcCoercionN
The type contains a cast.
ContainsForall ForAllTyBinder TcType
The type contains a forall.
ContainsCoercionTy TcCoercion
The type contains a CoercionTy.

datadata WantedConstraints

#

Constructors

WC
- wc_simple :: Cts
- wc_impl :: Bag Implication
- wc_errors :: Bag DelayedError

Instances1Outputable

Outputable WantedConstraintsDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valueinsolubleWC :: WantedConstraints -> Bool

#

valueemptyWC :: WantedConstraints

#

valueisEmptyWC :: WantedConstraints -> Bool

#

valueisSolvedWC :: WantedConstraints -> Bool

#

Checks whether a the given wanted constraints are solved, i.e. that there are no simple constraints left and all the implications are solved.

valueandWC :: WantedConstraints -> WantedConstraints -> WantedConstraints

#

valueunionsWC :: [WantedConstraints] -> WantedConstraints

#

valuemkSimpleWC :: [CtEvidence] -> WantedConstraints

#

valuemkImplicWC :: Bag Implication -> WantedConstraints

#

valueaddInsols :: WantedConstraints -> Bag IrredCt -> WantedConstraints

#

valuedropMisleading :: WantedConstraints -> WantedConstraints

#

valueaddSimples :: WantedConstraints -> Bag Ct -> WantedConstraints

#

valueaddImplics :: WantedConstraints -> Bag Implication -> WantedConstraints

#

valueaddHoles :: WantedConstraints -> Bag Hole -> WantedConstraints

#

valueaddNotConcreteError

:: WantedConstraints
-> NotConcreteError
-> WantedConstraints

#

valueaddDelayedErrors

:: WantedConstraints
-> Bag DelayedError
-> WantedConstraints

#

valuetyCoVarsOfWC :: WantedConstraints -> TyCoVarSet

#

Returns free variables of WantedConstraints as a non-deterministic set. See Note [Deterministic FV] in GHC.Utils.FV.

valuetyCoVarsOfWCList :: WantedConstraints -> [TyCoVar]

#

Returns free variables of WantedConstraints as a deterministically ordered list. See Note [Deterministic FV] in GHC.Utils.FV.

valueinsolubleWantedCt :: Ct -> Bool

#

valueinsolubleCt :: Ct -> Bool

#

Returns True of constraints that are definitely insoluble, as well as TypeError constraints. Can return True for Given constraints, unlike insolubleWantedCt.

The function is tuned for application after constraint solving i.e. assuming canonicalisation has been done That's why it looks only for IrredCt; all insoluble constraints are put into CIrredCan

valueinsolubleIrredCt :: IrredCt -> Bool

#

valueinsolubleImplic :: Implication -> Bool

#

valuenonDefaultableTyVarsOfWC :: WantedConstraints -> TyCoVarSet

#

Gather all the type variables from WantedConstraints that it would be unhelpful to default. For the moment, these are only ConcreteTv metavariables participating in a nominal equality whose other side is not concrete; it's usually better to report those as errors instead of defaulting.

datadata Implication

#

Constructors

Implic
- ic_tclvl :: TcLevel
- ic_info :: SkolemInfoAnon
- ic_skols :: [TcTyVar]
- ic_given :: [EvVar]
- ic_given_eqs :: HasGivenEqs
- ic_warn_inaccessible :: Bool
- ic_env :: !CtLocEnv
- ic_wanted :: WantedConstraints
- ic_binds :: EvBindsVar
- ic_need_inner :: VarSet
- ic_need_outer :: VarSet
- ic_status :: ImplicStatus

Instances1Outputable

Outputable ImplicationDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valueimplicationPrototype :: CtLocEnv -> Implication

#

valuecheckTelescopeSkol :: SkolemInfoAnon -> Bool

#

datadata ImplicStatus

#

Constructors

IC_Solved
- ics_dead :: [EvVar]
IC_Insoluble
IC_BadTelescope
IC_Unsolved

Instances1Outputable

Outputable ImplicStatusDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valueisInsolubleStatus :: ImplicStatus -> Bool

#

valueisSolvedStatus :: ImplicStatus -> Bool

#

typetype UserGiven = Implication

#

valuegetUserGivensFromImplics :: [Implication] -> [UserGiven]

#

datadata HasGivenEqs

#

NoGivenEqs LocalGivenEqs MaybeGivenEqs

Instances4Eq, Semigroup, Monoid, Outputable

Eq HasGivenEqsDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Semigroup HasGivenEqsDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Monoid HasGivenEqsDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Outputable HasGivenEqsDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valuecheckImplicationInvariants

:: (HasCallStack, Applicative m)
=> Implication
-> m ()

#

newtypenewtype SubGoalDepth

#

See Note [SubGoalDepth]

Instances3Eq, Ord, Outputable

Eq SubGoalDepthDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Ord SubGoalDepthDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Outputable SubGoalDepthDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valueinitialSubGoalDepth :: SubGoalDepth

#

valuemaxSubGoalDepth :: SubGoalDepth -> SubGoalDepth -> SubGoalDepth

#

valuebumpSubGoalDepth :: SubGoalDepth -> SubGoalDepth

#

valuesubGoalDepthExceeded :: IntWithInf -> SubGoalDepth -> Bool

#

datadata CtLoc

#

Constructors

CtLoc
- ctl_origin :: CtOrigin
- ctl_env :: CtLocEnv
- ctl_t_or_k :: Maybe TypeOrKind
- ctl_depth :: !SubGoalDepth

valuectLocSpan :: CtLoc -> RealSrcSpan

#

valuectLocEnv :: CtLoc -> CtLocEnv

#

valuectLocLevel :: CtLoc -> TcLevel

#

valuectLocOrigin :: CtLoc -> CtOrigin

#

valuectLocTypeOrKind_maybe :: CtLoc -> Maybe TypeOrKind

#

valuectLocDepth :: CtLoc -> SubGoalDepth

#

valuebumpCtLocDepth :: CtLoc -> CtLoc

#

valueisGivenLoc :: CtLoc -> Bool

#

valuesetCtLocOrigin :: CtLoc -> CtOrigin -> CtLoc

#

valueupdateCtLocOrigin :: CtLoc -> (CtOrigin -> CtOrigin) -> CtLoc

#

valuesetCtLocEnv :: CtLoc -> CtLocEnv -> CtLoc

#

valuesetCtLocSpan :: CtLoc -> RealSrcSpan -> CtLoc

#

valuepprCtLoc :: CtLoc -> SDoc

#

valueadjustCtLoc :: Bool -> Bool -> CtLoc -> CtLoc

#

valueadjustCtLocTyConBinder :: TyConBinder -> CtLoc -> CtLoc

#

datadata CtLocEnv

#

Local typechecker environment for a constraint.

Used to restore the environment of a constraint when reporting errors, see setCtLocM.

Constructors

CtLocEnv
- ctl_ctxt :: ![ErrCtxt]
- ctl_loc :: !RealSrcSpan
- ctl_bndrs :: !TcBinderStack
- ctl_tclvl :: !TcLevel
- ctl_in_gen_code :: !Bool
- ctl_rdr :: !LocalRdrEnv

valuesetCtLocEnvLoc :: CtLocEnv -> SrcSpan -> CtLocEnv

#

valuesetCtLocEnvLvl :: CtLocEnv -> TcLevel -> CtLocEnv

#

valuegetCtLocEnvLoc :: CtLocEnv -> RealSrcSpan

#

valuegetCtLocEnvLvl :: CtLocEnv -> TcLevel

#

valuectLocEnvInGeneratedCode :: CtLocEnv -> Bool

#

datadata CtEvidence

#

Constructors

CtGiven
- ctev_pred :: TcPredType
- ctev_evar :: EvVar
- ctev_loc :: CtLoc
CtWanted
- ctev_pred :: TcPredType
- ctev_dest :: TcEvDest
- ctev_loc :: CtLoc
- ctev_rewriters :: RewriterSet

Instances1Outputable

Outputable CtEvidenceDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

datadata TcEvDest

#

A place for type-checking evidence to go after it is generated.

Wanted equalities use HoleDest,
other Wanteds use EvVarDest.

Constructors

EvVarDest EvVar
bind this var to the evidence EvVarDest is always used for non-type-equalities e.g. class constraints
HoleDest CoercionHole
fill in this hole with the evidence HoleDest is always used for type-equalities See Note [Coercion holes] in GHC.Core.TyCo.Rep

Instances1Outputable

Outputable TcEvDestDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valueisWanted :: CtEvidence -> Bool

#

valueisGiven :: CtEvidence -> Bool

#

valuectEvPred :: CtEvidence -> TcPredType

#

valuectEvLoc :: CtEvidence -> CtLoc

#

valuectEvOrigin :: CtEvidence -> CtOrigin

#

valuectEvEqRel :: CtEvidence -> EqRel

#

Get the equality relation relevant for a CtEvidence

valuectEvExpr :: HasDebugCallStack => CtEvidence -> EvExpr

#

valuectEvTerm :: CtEvidence -> EvTerm

#

valuectEvCoercion :: HasDebugCallStack => CtEvidence -> TcCoercion

#

valuectEvEvId :: CtEvidence -> EvVar

#

valuectEvRewriters :: CtEvidence -> RewriterSet

#

Extract the set of rewriters from a CtEvidence See Note [Wanteds rewrite Wanteds] If the provided CtEvidence is not for a Wanted, just return an empty set.

valuectEvUnique :: CtEvidence -> Unique

#

valuetcEvDestUnique :: TcEvDest -> Unique

#

valuemkKindEqLoc :: TcType -> TcType -> CtLoc -> CtLoc

#

valuetoKindLoc :: CtLoc -> CtLoc

#

Take a CtLoc and moves it to the kind level

valuetoInvisibleLoc :: CtLoc -> CtLoc

#

valuemkGivenLoc :: TcLevel -> SkolemInfoAnon -> CtLocEnv -> CtLoc

#

valuectEvRole :: CtEvidence -> Role

#

Get the role relevant for a CtEvidence

valuesetCtEvPredType :: HasDebugCallStack => CtEvidence -> Type -> CtEvidence

#

Set the type of CtEvidence.

This function ensures that the invariants on CtEvidence hold, by updating the evidence and the ctev_pred in sync with each other. See Note [CtEvidence invariants].

valuesetCtEvLoc :: CtEvidence -> CtLoc -> CtEvidence

#

valuetyCoVarsOfCtEvList :: CtEvidence -> [TcTyCoVar]

#

Returns free variables of constraints as a deterministically ordered list. See Note [Deterministic FV] in GHC.Utils.FV.

valuetyCoVarsOfCtEv :: CtEvidence -> TcTyCoVarSet

#

Returns free variables of constraints as a non-deterministic set

valuetyCoVarsOfCtEvsList :: [CtEvidence] -> [TcTyCoVar]

#

Returns free variables of a bag of constraints as a deterministically ordered list. See Note [Deterministic FV] in GHC.Utils.FV.

newtypenewtype RewriterSet

#

Stores a set of CoercionHoles that have been used to rewrite a constraint. See Note [Wanteds rewrite Wanteds].

Constructors

RewriterSet (UniqSet CoercionHole)

Instances3Semigroup, Monoid, Outputable

Semigroup RewriterSetDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Monoid RewriterSetDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Outputable RewriterSetDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valueemptyRewriterSet :: RewriterSet

#

valueisEmptyRewriterSet :: RewriterSet -> Bool

#

valueaddRewriter :: RewriterSet -> CoercionHole -> RewriterSet

#

valueunitRewriterSet :: CoercionHole -> RewriterSet

#

valueunionRewriterSet :: RewriterSet -> RewriterSet -> RewriterSet

#

valuerewriterSetFromCts :: Bag Ct -> RewriterSet

#

valuewrapType :: Type -> [TyVar] -> [PredType] -> Type

#

datadata CtFlavour

#

Given Wanted

Instances2Eq, Outputable

Eq CtFlavourDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint
Outputable CtFlavourDefined in ghc-9.10.3 · GHC.Tc.Types.Constraint

valuectEvFlavour :: CtEvidence -> CtFlavour

#

typetype CtFlavourRole = (CtFlavour, EqRel)

#

Whether or not one Ct can rewrite another is determined by its flavour and its equality relation. See also Note [Flavours with roles] in GHC.Tc.Solver.InertSet

valuectEvFlavourRole :: CtEvidence -> CtFlavourRole

#

Extract the flavour, role, and boxity from a CtEvidence

valuectFlavourRole :: Ct -> CtFlavourRole

#

Extract the flavour and role from a Ct

valueeqCtFlavourRole :: EqCt -> CtFlavourRole

#

Extract the flavour and role from a Ct