GHC.Tc.Solver.Monad

Monadic definitions for the constraint solver

Documentation

data TcS a

Instances

MonadFail TcS

Defined in GHC.Tc.Solver.Monad

Methods

fail :: String -> TcS a

MonadIO TcS

Defined in GHC.Tc.Solver.Monad

Methods

liftIO :: IO a -> TcS a

Applicative TcS

Defined in GHC.Tc.Solver.Monad

Methods

pure :: a -> TcS a

(<*>) :: TcS (a -> b) -> TcS a -> TcS b

liftA2 :: (a -> b -> c) -> TcS a -> TcS b -> TcS c

(*>) :: TcS a -> TcS b -> TcS b

(<*) :: TcS a -> TcS b -> TcS a

Functor TcS

Defined in GHC.Tc.Solver.Monad

Methods

fmap :: (a -> b) -> TcS a -> TcS b

(<$) :: a -> TcS b -> TcS a

Monad TcS

Defined in GHC.Tc.Solver.Monad

Methods

(>>=) :: TcS a -> (a -> TcS b) -> TcS b

(>>) :: TcS a -> TcS b -> TcS b

return :: a -> TcS a

HasDynFlags TcS

Defined in GHC.Tc.Solver.Monad

Methods

getDynFlags :: TcS DynFlags

MonadThings TcS

Defined in GHC.Tc.Solver.Monad

Methods

lookupThing :: Name -> TcS TyThing

lookupId :: Name -> TcS Id

lookupDataCon :: Name -> TcS DataCon

lookupTyCon :: Name -> TcS TyCon

MonadUnique TcS

Defined in GHC.Tc.Solver.Monad

Methods

getUniqueSupplyM :: TcS UniqSupply

getUniqueM :: TcS Unique

getUniquesM :: TcS [Unique]

HasModule TcS

Defined in GHC.Tc.Solver.Monad

Methods

getModule :: TcS Module

runTcS :: TcS a -> TcM (a, EvBindMap)

runTcSEarlyAbort :: TcS a -> TcM a

This variant of runTcS will immediatley fail upon encountering an insoluble ct. See Note [Speeding up valid hole-fits]. Its one usage site does not need the ev_binds, so we do not return them.

runTcSWithEvBinds :: EvBindsVar -> TcS a -> TcM a

runTcSInerts :: InertSet -> TcS a -> TcM (a, InertSet)

A variant of runTcS that takes and returns an InertSet for later resumption of the TcS session.

failTcS :: TcRnMessage -> TcS a

warnTcS :: TcRnMessage -> TcS ()

addErrTcS :: TcRnMessage -> TcS ()

wrapTcS :: TcM a -> TcS a

runTcSEqualities :: TcS a -> TcM a

This can deal only with equality constraints.

nestTcS :: TcS a -> TcS a

nestImplicTcS :: EvBindsVar -> TcLevel -> TcS a -> TcS a

setEvBindsTcS :: EvBindsVar -> TcS a -> TcS a

emitImplicationTcS :: TcLevel -> SkolemInfoAnon -> [TcTyVar] -> [EvVar] -> Cts -> TcS TcEvBinds

emitTvImplicationTcS :: TcLevel -> SkolemInfoAnon -> [TcTyVar] -> Cts -> TcS ()

selectNextWorkItem :: TcS (Maybe Ct)

getWorkList :: TcS WorkList

updWorkListTcS :: (WorkList -> WorkList) -> TcS ()

pushLevelNoWorkList :: SDoc -> TcS a -> TcS (TcLevel, a)

runTcPluginTcS :: TcPluginM a -> TcS a

addUsedGRE :: Bool -> GlobalRdrElt -> TcS ()

addUsedGREs :: [GlobalRdrElt] -> TcS ()

keepAlive :: Name -> TcS ()

matchGlobalInst :: DynFlags -> Bool -> Class -> [Type] -> TcS ClsInstResult

data ClsInstResult

Constructors

NoInstance

OneInst

Fields

• cir_new_theta :: [TcPredType]
• cir_mk_ev :: [EvExpr] -> EvTerm
• cir_what :: InstanceWhat

NotSure

Instances

Outputable ClsInstResult

Defined in GHC.Tc.Instance.Class

Methods

ppr :: ClsInstResult -> SDoc

data QCInst

Constructors

QCI

Fields

• qci_ev :: CtEvidence
• qci_tvs :: [TcTyVar]
• qci_pred :: TcPredType
• qci_pend_sc :: Bool

Instances

Outputable QCInst

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: QCInst -> SDoc

panicTcS :: SDoc -> TcS a

traceTcS :: String -> SDoc -> TcS ()

traceFireTcS :: CtEvidence -> SDoc -> TcS ()

bumpStepCountTcS :: TcS ()

csTraceTcS :: SDoc -> TcS ()

wrapErrTcS :: TcM a -> TcS a

wrapWarnTcS :: TcM a -> TcS a

resetUnificationFlag :: TcS Bool

setUnificationFlag :: TcLevel -> TcS ()

data MaybeNew

Constructors

Fresh CtEvidence

Cached EvExpr

freshGoals :: [MaybeNew] -> [CtEvidence]

isFresh :: MaybeNew -> Bool

getEvExpr :: MaybeNew -> EvExpr

newTcEvBinds :: TcS EvBindsVar

newNoTcEvBinds :: TcS EvBindsVar

newWantedEq :: CtLoc -> RewriterSet -> Role -> TcType -> TcType -> TcS (CtEvidence, Coercion)

Create a new Wanted constraint holding a coercion hole for an equality between the two types at the given Role.

emitNewWantedEq :: CtLoc -> RewriterSet -> Role -> TcType -> TcType -> TcS Coercion

Emit a new Wanted equality into the work-list

newWanted :: CtLoc -> RewriterSet -> PredType -> TcS MaybeNew

Create a new Wanted constraint, potentially looking up non-equality constraints in the cache instead of creating a new one from scratch.

Deals with both equality and non-equality constraints.

newWantedNC :: CtLoc -> RewriterSet -> PredType -> TcS CtEvidence

Create a new Wanted constraint.

Deals with both equality and non-equality constraints.

Does not attempt to re-use non-equality constraints that already exist in the inert set.

newWantedEvVarNC :: CtLoc -> RewriterSet -> TcPredType -> TcS CtEvidence

Create a new Wanted constraint holding an evidence variable.

Don't use this for equality constraints: use newWantedEq instead.

newBoundEvVarId :: TcPredType -> EvTerm -> TcS EvVar

Make a new Id of the given type, bound (in the monad's EvBinds) to the given term

unifyTyVar :: TcTyVar -> TcType -> TcS ()

reportUnifications :: TcS a -> TcS (Int, a)

touchabilityTest :: CtFlavour -> TcTyVar -> TcType -> TcS TouchabilityTestResult

data TouchabilityTestResult

Constructors

TouchableSameLevel

TouchableOuterLevel [TcTyVar] TcLevel

Untouchable

Instances

Outputable TouchabilityTestResult

Defined in GHC.Tc.Solver.Monad

Methods

ppr :: TouchabilityTestResult -> SDoc

setEvBind :: EvBind -> TcS ()

setWantedEq :: HasDebugCallStack => TcEvDest -> Coercion -> TcS ()

Equalities only

setWantedEvTerm :: TcEvDest -> EvTerm -> TcS ()

Good for both equalities and non-equalities

setEvBindIfWanted :: CtEvidence -> EvTerm -> TcS ()

newEvVar :: TcPredType -> TcS EvVar

newGivenEvVar :: CtLoc -> (TcPredType, EvTerm) -> TcS CtEvidence

newGivenEvVars :: CtLoc -> [(TcPredType, EvTerm)] -> TcS [CtEvidence]

checkReductionDepth

Arguments

:: CtLoc

-> TcType

type being reduced

-> TcS ()

Checks if the depth of the given location is too much. Fails if it's too big, with an appropriate error message.

getSolvedDicts :: TcS (DictMap CtEvidence)

setSolvedDicts :: DictMap CtEvidence -> TcS ()

getInstEnvs :: TcS InstEnvs

getFamInstEnvs :: TcS (FamInstEnv, FamInstEnv)

getTopEnv :: TcS HscEnv

getGblEnv :: TcS TcGblEnv

getLclEnv :: TcS TcLclEnv

setLclEnv :: TcLclEnv -> TcS a -> TcS a

getTcEvBindsVar :: TcS EvBindsVar

getTcLevel :: TcS TcLevel

getTcEvTyCoVars :: EvBindsVar -> TcS TyCoVarSet

getTcEvBindsMap :: EvBindsVar -> TcS EvBindMap

setTcEvBindsMap :: EvBindsVar -> EvBindMap -> TcS ()

tcLookupClass :: Name -> TcS Class

tcLookupId :: Name -> TcS Id

updInertTcS :: (InertSet -> InertSet) -> TcS ()

updInertCans :: (InertCans -> InertCans) -> TcS ()

updInertDicts :: (DictMap Ct -> DictMap Ct) -> TcS ()

updInertIrreds :: (Cts -> Cts) -> TcS ()

getHasGivenEqs :: TcLevel -> TcS (HasGivenEqs, Cts)

setInertCans :: InertCans -> TcS ()

getInertEqs :: TcS InertEqs

getInertCans :: TcS InertCans

getInertGivens :: TcS [Ct]

getInertInsols :: TcS Cts

getInnermostGivenEqLevel :: TcS TcLevel

getTcSInerts :: TcS InertSet

setTcSInerts :: InertSet -> TcS ()

getUnsolvedInerts :: TcS (Bag Implication, Cts)

removeInertCts :: [Ct] -> InertCans -> InertCans

Remove inert constraints from the InertCans, for use when a typechecker plugin wishes to discard a given.

getPendingGivenScs :: TcS [Ct]

addInertCan :: Ct -> TcS ()

insertFunEq :: FunEqMap a -> TyCon -> [Type] -> a -> FunEqMap a

addInertForAll :: QCInst -> TcS ()

emitWorkNC :: [CtEvidence] -> TcS ()

emitWork :: [Ct] -> TcS ()

lookupInertDict :: InertCans -> CtLoc -> Class -> [Type] -> Maybe Ct

Look up a dictionary inert.

kickOutAfterUnification :: TcTyVar -> TcS Int

addInertSafehask :: InertCans -> Ct -> InertCans

insertSafeOverlapFailureTcS :: InstanceWhat -> Ct -> TcS ()

updInertSafehask :: (DictMap Ct -> DictMap Ct) -> TcS ()

getSafeOverlapFailures :: TcS Cts

addSolvedDict :: InstanceWhat -> CtEvidence -> Class -> [Type] -> TcS ()

lookupSolvedDict :: InertSet -> CtLoc -> Class -> [Type] -> Maybe CtEvidence

Look up a solved inert.

foldIrreds :: (Ct -> b -> b) -> Cts -> b -> b

lookupFamAppInert :: (CtFlavourRole -> Bool) -> TyCon -> [Type] -> TcS (Maybe (Reduction, CtFlavourRole))

Looks up a family application in the inerts.

lookupFamAppCache :: TyCon -> [Type] -> TcS (Maybe Reduction)

extendFamAppCache :: TyCon -> [Type] -> Reduction -> TcS ()

pprKicked :: Int -> SDoc

instDFunType :: DFunId -> [DFunInstType] -> TcS ([TcType], TcThetaType)

newFlexiTcSTy :: Kind -> TcS TcType

instFlexi :: [TKVar] -> TcS TCvSubst

instFlexiX :: TCvSubst -> [TKVar] -> TcS TCvSubst

cloneMetaTyVar :: TcTyVar -> TcS TcTyVar

tcInstSkolTyVarsX :: SkolemInfo -> TCvSubst -> [TyVar] -> TcS (TCvSubst, [TcTyVar])

data TcLevel

Instances

Outputable TcLevel

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: TcLevel -> SDoc

Eq TcLevel

Defined in GHC.Tc.Utils.TcType

Methods

(==) :: TcLevel -> TcLevel -> Bool

(/=) :: TcLevel -> TcLevel -> Bool

Ord TcLevel

Defined in GHC.Tc.Utils.TcType

Methods

compare :: TcLevel -> TcLevel -> Ordering

(<) :: TcLevel -> TcLevel -> Bool

(<=) :: TcLevel -> TcLevel -> Bool

(>) :: TcLevel -> TcLevel -> Bool

(>=) :: TcLevel -> TcLevel -> Bool

max :: TcLevel -> TcLevel -> TcLevel

min :: TcLevel -> TcLevel -> TcLevel

isFilledMetaTyVar_maybe :: TcTyVar -> TcS (Maybe Type)

isFilledMetaTyVar :: TcTyVar -> TcS Bool

zonkTyCoVarsAndFV :: TcTyCoVarSet -> TcS TcTyCoVarSet

zonkTcType :: TcType -> TcS TcType

zonkTcTypes :: [TcType] -> TcS [TcType]

zonkTcTyVar :: TcTyVar -> TcS TcType

zonkCo :: Coercion -> TcS Coercion

zonkTyCoVarsAndFVList :: [TcTyCoVar] -> TcS [TcTyCoVar]

zonkSimples :: Cts -> TcS Cts

zonkWC :: WantedConstraints -> TcS WantedConstraints

zonkTyCoVarKind :: TcTyCoVar -> TcS TcTyCoVar

newTcRef :: a -> TcS (TcRef a)

readTcRef :: TcRef a -> TcS a

writeTcRef :: TcRef a -> a -> TcS ()

updTcRef :: TcRef a -> (a -> a) -> TcS ()

getDefaultInfo :: TcS ([Type], (Bool, Bool))

getDynFlags :: HasDynFlags m => m DynFlags

getGlobalRdrEnvTcS :: TcS GlobalRdrEnv

matchFam :: TyCon -> [Type] -> TcS (Maybe ReductionN)

matchFamTcM :: TyCon -> [Type] -> TcM (Maybe ReductionN)

checkWellStagedDFun :: CtLoc -> InstanceWhat -> PredType -> TcS ()

pprEq :: TcType -> TcType -> SDoc

breakTyEqCycle_maybe :: CtEvidence -> CheckTyEqResult -> CanEqLHS -> TcType -> TcS (Maybe ReductionN)

Conditionally replace all type family applications in the RHS with fresh variables, emitting givens that relate the type family application to the variable. See Note [Type equality cycles] in GHC.Tc.Solver.Canonical. This only works under conditions as described in the Note; otherwise, returns Nothing.

rewriterView :: TcType -> Maybe TcType