GHC.Core.Predicate · ghc-9.10.3

datadata Pred

#

A predicate in the solver. The solver tries to prove Wanted predicates from Given ones.

Constructors

ClassPred Class [Type]
A typeclass predicate.
EqPred EqRel Type Type
A type equality predicate.
IrredPred PredType
An irreducible predicate.
ForAllPred [TyVar] [PredType] PredType
A quantified predicate.
See Note [Quantified constraints] in GHC.Tc.Solver.Solve

valueclassifyPredType :: PredType -> Pred

#

valueisPredTy :: HasDebugCallStack => Type -> Bool

#

valueisEvVarType :: Type -> Bool

#

datadata EqRel

#

A choice of equality relation. This is separate from the type Role because Phantom does not define a (non-trivial) equality relation.

NomEq ReprEq

Instances3Eq, Ord, Outputable

Eq EqRelDefined in ghc-9.10.3 · GHC.Core.Predicate
Ord EqRelDefined in ghc-9.10.3 · GHC.Core.Predicate
Outputable EqRelDefined in ghc-9.10.3 · GHC.Core.Predicate

valueeqRelRole :: EqRel -> Role

#

valueisEqPrimPred :: PredType -> Bool

#

valueisEqPred :: PredType -> Bool

#

valuegetEqPredTys :: PredType -> (Type, Type)

#

valuegetEqPredTys_maybe :: PredType -> Maybe (Role, Type, Type)

#

valuegetEqPredRole :: PredType -> Role

#

valuepredTypeEqRel :: PredType -> EqRel

#

Get the equality relation relevant for a pred type.

valuemkPrimEqPred :: Type -> Type -> Type

#

Creates a primitive nominal type equality predicate. t1 ~# t2 Invariant: the types are not Coercions

valuemkReprPrimEqPred :: Type -> Type -> Type

#

Creates a primitive representational type equality predicate. t1 ~R# t2 Invariant: the types are not Coercions

valuemkPrimEqPredRole :: Role -> Type -> Type -> PredType

#

Makes a lifted equality predicate at the given role

valuemkNomPrimEqPred :: Kind -> Type -> Type -> Type

#

Creates a primitive nominal type equality predicate with an explicit (but homogeneous) kind: (~#) k k ty1 ty2

valuemkClassPred :: Class -> [Type] -> PredType

#

valueisDictTy :: Type -> Bool

#

valuetypeDeterminesValue :: Type -> Bool

#

valueisClassPred :: PredType -> Bool

#

valueisEqualityClass :: Class -> Bool

#

valueisCTupleClass :: Class -> Bool

#

valuegetClassPredTys :: HasDebugCallStack => PredType -> (Class, [Type])

#

valuegetClassPredTys_maybe :: PredType -> Maybe (Class, [Type])

#

valueclassMethodTy :: Id -> Type

#

valueclassMethodInstTy :: Id -> [Type] -> Type

#

valueisIPLikePred :: Type -> Bool

#

valuementionsIP

:: (Type -> Bool)
predicate on the string
-> (Type -> Bool)
predicate on the type
-> Class
-> [Type]
-> Bool

#

mentionsIP str_cond ty_cond cls tys returns True if:

cls tys is of the form IP str ty, where str_cond str and ty_cond ty are both True,
or any superclass of cls tys has this property.

See Note [Local implicit parameters]

valueisIPTyCon :: TyCon -> Bool

#

valueisIPClass :: Class -> Bool

#

valueisCallStackTy :: Type -> Bool

#

Is a type a CallStack?

valueisCallStackPred :: Class -> [Type] -> Maybe FastString

#

Is a PredType a CallStack implicit parameter?

If so, return the name of the parameter.

valueisCallStackPredTy :: Type -> Bool

#

valueisExceptionContextPred :: Class -> [Type] -> Maybe FastString

#

Is a PredType an ExceptionContext implicit parameter?

If so, return the name of the parameter.

valueisExceptionContextTy :: Type -> Bool

#

Is a type an ExceptionContext?

valueisIPPred_maybe :: Class -> [Type] -> Maybe (Type, Type)

#

Decomposes a predicate if it is an implicit parameter. Does not look in superclasses. See also [Local implicit parameters].

typetype DictId = EvId

#

Dictionary Identifier

valueisEvVar :: Var -> Bool

#

valueisDictId :: Id -> Bool

#