Safe Haskell	None
Language	Haskell2010

TcSMonad

Synopsis

data WorkList = WL {
- wl_eqs :: [Ct]
- wl_funeqs :: [Ct]
- wl_rest :: [Ct]
- wl_implics :: Bag Implication
}
isEmptyWorkList :: WorkList -> Bool
emptyWorkList :: WorkList
extendWorkListNonEq :: Ct -> WorkList -> WorkList
extendWorkListCt :: Ct -> WorkList -> WorkList
extendWorkListCts :: [Ct] -> WorkList -> WorkList
extendWorkListEq :: Ct -> WorkList -> WorkList
extendWorkListFunEq :: Ct -> WorkList -> WorkList
appendWorkList :: WorkList -> WorkList -> WorkList
extendWorkListImplic :: Bag Implication -> WorkList -> WorkList
selectNextWorkItem :: TcS (Maybe Ct)
workListSize :: WorkList -> Int
workListWantedCount :: WorkList -> Int
getWorkList :: TcS WorkList
updWorkListTcS :: (WorkList -> WorkList) -> TcS ()
data TcS a
runTcS :: TcS a -> TcM (a, EvBindMap)
runTcSDeriveds :: TcS a -> TcM a
runTcSWithEvBinds :: EvBindsVar -> TcS a -> TcM a
failTcS :: SDoc -> TcS a
warnTcS :: WarningFlag -> SDoc -> TcS ()
addErrTcS :: SDoc -> TcS ()
runTcSEqualities :: TcS a -> TcM a
nestTcS :: TcS a -> TcS a
nestImplicTcS :: EvBindsVar -> TcLevel -> TcS a -> TcS a
setEvBindsTcS :: EvBindsVar -> TcS a -> TcS a
checkConstraintsTcS :: SkolemInfo -> [TcTyVar] -> [EvVar] -> TcS (result, Cts) -> TcS (result, TcEvBinds)
checkTvConstraintsTcS :: SkolemInfo -> [TcTyVar] -> TcS (result, Cts) -> TcS result
runTcPluginTcS :: TcPluginM a -> TcS a
addUsedGRE :: Bool -> GlobalRdrElt -> TcS ()
addUsedGREs :: [GlobalRdrElt] -> TcS ()
data QCInst = QCI {
- qci_ev :: CtEvidence
- qci_tvs :: [TcTyVar]
- qci_pred :: TcPredType
- qci_pend_sc :: Bool
}
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
data MaybeNew
- = Fresh CtEvidence
- | Cached EvExpr
freshGoals :: [MaybeNew] -> [CtEvidence]
isFresh :: MaybeNew -> Bool
getEvExpr :: MaybeNew -> EvExpr
newTcEvBinds :: TcS EvBindsVar
newNoTcEvBinds :: TcS EvBindsVar
newWantedEq :: CtLoc -> Role -> TcType -> TcType -> TcS (CtEvidence, Coercion)
emitNewWantedEq :: CtLoc -> Role -> TcType -> TcType -> TcS Coercion
newWanted :: CtLoc -> PredType -> TcS MaybeNew
newWantedEvVar :: CtLoc -> TcPredType -> TcS MaybeNew
newWantedNC :: CtLoc -> PredType -> TcS CtEvidence
newWantedEvVarNC :: CtLoc -> TcPredType -> TcS CtEvidence
newDerivedNC :: CtLoc -> TcPredType -> TcS CtEvidence
newBoundEvVarId :: TcPredType -> EvTerm -> TcS EvVar
unifyTyVar :: TcTyVar -> TcType -> TcS ()
unflattenFmv :: TcTyVar -> TcType -> TcS ()
reportUnifications :: TcS a -> TcS (Int, a)
setEvBind :: EvBind -> TcS ()
setWantedEq :: TcEvDest -> Coercion -> TcS ()
setWantedEvTerm :: TcEvDest -> EvTerm -> TcS ()
setEvBindIfWanted :: CtEvidence -> EvTerm -> TcS ()
newEvVar :: TcPredType -> TcS EvVar
newGivenEvVar :: CtLoc -> (TcPredType, EvTerm) -> TcS CtEvidence
newGivenEvVars :: CtLoc -> [(TcPredType, EvTerm)] -> TcS [CtEvidence]
emitNewDeriveds :: CtLoc -> [TcPredType] -> TcS ()
emitNewDerivedEq :: CtLoc -> Role -> TcType -> TcType -> TcS ()
checkReductionDepth :: CtLoc -> TcType -> TcS ()
getSolvedDicts :: TcS (DictMap CtEvidence)
setSolvedDicts :: DictMap CtEvidence -> TcS ()
getInstEnvs :: TcS InstEnvs
getFamInstEnvs :: TcS (FamInstEnv, FamInstEnv)
getTopEnv :: TcS HscEnv
getGblEnv :: TcS TcGblEnv
getLclEnv :: TcS TcLclEnv
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
data InertSet = IS {
- inert_cans :: InertCans
- inert_fsks :: [(TcTyVar, TcType)]
- inert_flat_cache :: ExactFunEqMap (TcCoercion, TcType, CtFlavour)
- inert_solved_dicts :: DictMap CtEvidence
}
data InertCans = IC {
- inert_eqs :: InertEqs
- inert_funeqs :: FunEqMap Ct
- inert_dicts :: DictMap Ct
- inert_insts :: [QCInst]
- inert_safehask :: DictMap Ct
- inert_irreds :: Cts
- inert_count :: Int
}
updInertTcS :: (InertSet -> InertSet) -> TcS ()
updInertCans :: (InertCans -> InertCans) -> TcS ()
updInertDicts :: (DictMap Ct -> DictMap Ct) -> TcS ()
updInertIrreds :: (Cts -> Cts) -> TcS ()
getNoGivenEqs :: TcLevel -> [TcTyVar] -> TcS (Bool, Cts)
setInertCans :: InertCans -> TcS ()
getInertEqs :: TcS (DTyVarEnv EqualCtList)
getInertCans :: TcS InertCans
getInertGivens :: TcS [Ct]
getInertInsols :: TcS Cts
getTcSInerts :: TcS InertSet
setTcSInerts :: InertSet -> TcS ()
matchableGivens :: CtLoc -> PredType -> InertSet -> Cts
prohibitedSuperClassSolve :: CtLoc -> CtLoc -> Bool
mightMatchLater :: TcPredType -> CtLoc -> TcPredType -> CtLoc -> Bool
getUnsolvedInerts :: TcS (Bag Implication, Cts, Cts, Cts)
removeInertCts :: [Ct] -> InertCans -> InertCans
getPendingGivenScs :: TcS [Ct]
addInertCan :: Ct -> TcS ()
insertFunEq :: FunEqMap a -> TyCon -> [Type] -> a -> FunEqMap a
addInertForAll :: QCInst -> TcS ()
emitWorkNC :: [CtEvidence] -> TcS ()
emitWork :: [Ct] -> TcS ()
isImprovable :: CtEvidence -> Bool
kickOutAfterUnification :: TcTyVar -> TcS Int
addInertSafehask :: InertCans -> Ct -> InertCans
insertSafeOverlapFailureTcS :: Ct -> TcS ()
updInertSafehask :: (DictMap Ct -> DictMap Ct) -> TcS ()
getSafeOverlapFailures :: TcS Cts
type DictMap a = TcAppMap a
emptyDictMap :: DictMap a
lookupInertDict :: InertCans -> CtLoc -> Class -> [Type] -> Maybe CtEvidence
findDictsByClass :: DictMap a -> Class -> Bag a
addDict :: DictMap a -> Class -> [Type] -> a -> DictMap a
addDictsByClass :: DictMap Ct -> Class -> Bag Ct -> DictMap Ct
delDict :: DictMap a -> Class -> [Type] -> DictMap a
foldDicts :: (a -> b -> b) -> DictMap a -> b -> b
filterDicts :: (Ct -> Bool) -> DictMap Ct -> DictMap Ct
findDict :: DictMap a -> CtLoc -> Class -> [Type] -> Maybe a
type EqualCtList = [Ct]
findTyEqs :: InertCans -> TyVar -> EqualCtList
foldTyEqs :: (Ct -> b -> b) -> InertEqs -> b -> b
isInInertEqs :: DTyVarEnv EqualCtList -> TcTyVar -> TcType -> Bool
lookupFlattenTyVar :: InertEqs -> TcTyVar -> TcType
lookupInertTyVar :: InertEqs -> TcTyVar -> Maybe TcType
addSolvedDict :: CtEvidence -> Class -> [Type] -> TcS ()
lookupSolvedDict :: InertSet -> CtLoc -> Class -> [Type] -> Maybe CtEvidence
foldIrreds :: (Ct -> b -> b) -> Cts -> b -> b
lookupFlatCache :: TyCon -> [Type] -> TcS (Maybe (TcCoercion, TcType, CtFlavour))
extendFlatCache :: TyCon -> [Type] -> (TcCoercion, TcType, CtFlavour) -> TcS ()
newFlattenSkolem :: CtFlavour -> CtLoc -> TyCon -> [TcType] -> TcS (CtEvidence, Coercion, TcTyVar)
dischargeFunEq :: CtEvidence -> TcTyVar -> TcCoercion -> TcType -> TcS ()
pprKicked :: Int -> SDoc
updInertFunEqs :: (FunEqMap Ct -> FunEqMap Ct) -> TcS ()
findFunEq :: FunEqMap a -> TyCon -> [Type] -> Maybe a
findFunEqsByTyCon :: FunEqMap a -> TyCon -> [a]
instDFunType :: DFunId -> [DFunInstType] -> TcS ([TcType], TcThetaType)
newFlexiTcSTy :: Kind -> TcS TcType
instFlexi :: [TKVar] -> TcS TCvSubst
instFlexiX :: TCvSubst -> [TKVar] -> TcS TCvSubst
cloneMetaTyVar :: TcTyVar -> TcS TcTyVar
demoteUnfilledFmv :: TcTyVar -> TcS ()
tcInstType :: ([TyVar] -> TcM (TCvSubst, [TcTyVar])) -> Id -> TcS ([(Name, TcTyVar)], TcThetaType, TcType)
tcInstSkolTyVarsX :: TCvSubst -> [TyVar] -> TcS (TCvSubst, [TcTyVar])
data 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
zonkTcTyCoVarBndr :: TcTyCoVar -> TcS TcTyCoVar
newTcRef :: a -> TcS (TcRef a)
readTcRef :: TcRef a -> TcS a
updTcRef :: TcRef a -> (a -> a) -> TcS ()
getDefaultInfo :: TcS ([Type], (Bool, Bool))
getDynFlags :: HasDynFlags m => m DynFlags
getGlobalRdrEnvTcS :: TcS GlobalRdrEnv
matchFam :: TyCon -> [Type] -> TcS (Maybe (Coercion, TcType))
matchFamTcM :: TyCon -> [Type] -> TcM (Maybe (Coercion, TcType))
checkWellStagedDFun :: PredType -> DFunId -> CtLoc -> TcS ()
pprEq :: TcType -> TcType -> SDoc

Documentation

data WorkList Source #

Constructors

WL
Fields wl_eqs :: [Ct] wl_funeqs :: [Ct] wl_rest :: [Ct] wl_implics :: Bag Implication

Instances

Outputable WorkList Source #
Instance details Defined in TcSMonad Methods ppr :: WorkList -> SDoc Source # pprPrec :: Rational -> WorkList -> SDoc Source #

isEmptyWorkList :: WorkList -> Bool Source #

emptyWorkList :: WorkList Source #

extendWorkListNonEq :: Ct -> WorkList -> WorkList Source #

extendWorkListCt :: Ct -> WorkList -> WorkList Source #

extendWorkListCts :: [Ct] -> WorkList -> WorkList Source #

extendWorkListEq :: Ct -> WorkList -> WorkList Source #

extendWorkListFunEq :: Ct -> WorkList -> WorkList Source #

appendWorkList :: WorkList -> WorkList -> WorkList Source #

extendWorkListImplic :: Bag Implication -> WorkList -> WorkList Source #

selectNextWorkItem :: TcS (Maybe Ct) Source #

workListSize :: WorkList -> Int Source #

workListWantedCount :: WorkList -> Int Source #

getWorkList :: TcS WorkList Source #

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

data TcS a Source #

Instances

Monad TcS Source #
Instance details Defined in TcSMonad Methods (>>=) :: TcS a -> (a -> TcS b) -> TcS b # (>>) :: TcS a -> TcS b -> TcS b # return :: a -> TcS a # fail :: String -> TcS a #
Functor TcS Source #
Instance details Defined in TcSMonad Methods fmap :: (a -> b) -> TcS a -> TcS b # (<$) :: a -> TcS b -> TcS a #
MonadFail TcS Source #
Instance details Defined in TcSMonad Methods fail :: String -> TcS a #
Applicative TcS Source #
Instance details Defined in TcSMonad 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 #
MonadUnique TcS Source #
Instance details Defined in TcSMonad Methods getUniqueSupplyM :: TcS UniqSupply Source # getUniqueM :: TcS Unique Source # getUniquesM :: TcS [Unique] Source #
HasModule TcS Source #
Instance details Defined in TcSMonad Methods getModule :: TcS Module Source #
HasDynFlags TcS Source #
Instance details Defined in TcSMonad Methods getDynFlags :: TcS DynFlags Source #
MonadThings TcS Source #
Instance details Defined in TcSMonad Methods lookupThing :: Name -> TcS TyThing Source # lookupId :: Name -> TcS Id Source # lookupDataCon :: Name -> TcS DataCon Source # lookupTyCon :: Name -> TcS TyCon Source #

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

runTcSDeriveds :: TcS a -> TcM a Source #

This variant of runTcS will keep solving, even when only Deriveds are left around. It also doesn't return any evidence, as callers won't need it.

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

failTcS :: SDoc -> TcS a Source #

warnTcS :: WarningFlag -> SDoc -> TcS () Source #

addErrTcS :: SDoc -> TcS () Source #

runTcSEqualities :: TcS a -> TcM a Source #

This can deal only with equality constraints.

nestTcS :: TcS a -> TcS a Source #

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

setEvBindsTcS :: EvBindsVar -> TcS a -> TcS a Source #

checkConstraintsTcS :: SkolemInfo -> [TcTyVar] -> [EvVar] -> TcS (result, Cts) -> TcS (result, TcEvBinds) Source #

checkTvConstraintsTcS :: SkolemInfo -> [TcTyVar] -> TcS (result, Cts) -> TcS result Source #

runTcPluginTcS :: TcPluginM a -> TcS a Source #

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

addUsedGREs :: [GlobalRdrElt] -> TcS () Source #

data QCInst Source #

Constructors

QCI
Fields qci_ev :: CtEvidence qci_tvs :: [TcTyVar] qci_pred :: TcPredType qci_pend_sc :: Bool

Instances

Outputable QCInst Source #
Instance details Defined in TcRnTypes Methods ppr :: QCInst -> SDoc Source # pprPrec :: Rational -> QCInst -> SDoc Source #

panicTcS :: SDoc -> TcS a Source #

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

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

bumpStepCountTcS :: TcS () Source #

csTraceTcS :: SDoc -> TcS () Source #

wrapErrTcS :: TcM a -> TcS a Source #

wrapWarnTcS :: TcM a -> TcS a Source #

data MaybeNew Source #

Constructors

Fresh CtEvidence
Cached EvExpr

freshGoals :: [MaybeNew] -> [CtEvidence] Source #

isFresh :: MaybeNew -> Bool Source #

getEvExpr :: MaybeNew -> EvExpr Source #

newTcEvBinds :: TcS EvBindsVar Source #

newNoTcEvBinds :: TcS EvBindsVar Source #

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

Make a new equality CtEvidence

emitNewWantedEq :: CtLoc -> Role -> TcType -> TcType -> TcS Coercion Source #

Emit a new Wanted equality into the work-list

newWanted :: CtLoc -> PredType -> TcS MaybeNew Source #

newWantedEvVar :: CtLoc -> TcPredType -> TcS MaybeNew Source #

newWantedNC :: CtLoc -> PredType -> TcS CtEvidence Source #

newWantedEvVarNC :: CtLoc -> TcPredType -> TcS CtEvidence Source #

newDerivedNC :: CtLoc -> TcPredType -> TcS CtEvidence Source #

newBoundEvVarId :: TcPredType -> EvTerm -> TcS EvVar Source #

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

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

unflattenFmv :: TcTyVar -> TcType -> TcS () Source #

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

setEvBind :: EvBind -> TcS () Source #

setWantedEq :: TcEvDest -> Coercion -> TcS () Source #

Equalities only

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

Good for both equalities and non-equalities

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

newEvVar :: TcPredType -> TcS EvVar Source #

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

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

emitNewDeriveds :: CtLoc -> [TcPredType] -> TcS () Source #

emitNewDerivedEq :: CtLoc -> Role -> TcType -> TcType -> TcS () Source #

checkReductionDepth Source #

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) Source #

setSolvedDicts :: DictMap CtEvidence -> TcS () Source #

getInstEnvs :: TcS InstEnvs Source #

getFamInstEnvs :: TcS (FamInstEnv, FamInstEnv) Source #

getTopEnv :: TcS HscEnv Source #

getGblEnv :: TcS TcGblEnv Source #

getLclEnv :: TcS TcLclEnv Source #

getTcEvBindsVar :: TcS EvBindsVar Source #

getTcLevel :: TcS TcLevel Source #

getTcEvTyCoVars :: EvBindsVar -> TcS TyCoVarSet Source #

getTcEvBindsMap :: EvBindsVar -> TcS EvBindMap Source #

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

tcLookupClass :: Name -> TcS Class Source #

tcLookupId :: Name -> TcS Id Source #

data InertSet Source #

Constructors

IS
Fields inert_cans :: InertCans inert_fsks :: [(TcTyVar, TcType)] inert_flat_cache :: ExactFunEqMap (TcCoercion, TcType, CtFlavour) inert_solved_dicts :: DictMap CtEvidence

Instances

Outputable InertSet Source #
Instance details Defined in TcSMonad Methods ppr :: InertSet -> SDoc Source # pprPrec :: Rational -> InertSet -> SDoc Source #

data InertCans Source #

Constructors

IC
Fields inert_eqs :: InertEqs inert_funeqs :: FunEqMap Ct inert_dicts :: DictMap Ct inert_insts :: [QCInst] inert_safehask :: DictMap Ct See Note [Safe Haskell Overlapping Instances Implementation] in TcSimplify inert_irreds :: Cts inert_count :: Int

Instances

Outputable InertCans Source #
Instance details Defined in TcSMonad Methods ppr :: InertCans -> SDoc Source # pprPrec :: Rational -> InertCans -> SDoc Source #

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

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

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

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

getNoGivenEqs :: TcLevel -> [TcTyVar] -> TcS (Bool, Cts) Source #

setInertCans :: InertCans -> TcS () Source #

getInertEqs :: TcS (DTyVarEnv EqualCtList) Source #

getInertCans :: TcS InertCans Source #

getInertGivens :: TcS [Ct] Source #

getInertInsols :: TcS Cts Source #

getTcSInerts :: TcS InertSet Source #

setTcSInerts :: InertSet -> TcS () Source #

matchableGivens :: CtLoc -> PredType -> InertSet -> Cts Source #

Returns Given constraints that might, potentially, match the given pred. This is used when checking to see if a Given might overlap with an instance. See Note [Instance and Given overlap] in TcInteract.

prohibitedSuperClassSolve :: CtLoc -> CtLoc -> Bool Source #

mightMatchLater :: TcPredType -> CtLoc -> TcPredType -> CtLoc -> Bool Source #

getUnsolvedInerts :: TcS (Bag Implication, Cts, Cts, Cts) Source #

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

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

getPendingGivenScs :: TcS [Ct] Source #

addInertCan :: Ct -> TcS () Source #

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

addInertForAll :: QCInst -> TcS () Source #

emitWorkNC :: [CtEvidence] -> TcS () Source #

emitWork :: [Ct] -> TcS () Source #

isImprovable :: CtEvidence -> Bool Source #

kickOutAfterUnification :: TcTyVar -> TcS Int Source #

addInertSafehask :: InertCans -> Ct -> InertCans Source #

insertSafeOverlapFailureTcS :: Ct -> TcS () Source #

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

getSafeOverlapFailures :: TcS Cts Source #

type DictMap a = TcAppMap a Source #

emptyDictMap :: DictMap a Source #

lookupInertDict :: InertCans -> CtLoc -> Class -> [Type] -> Maybe CtEvidence Source #

Look up a dictionary inert. NB: the returned CtEvidence might not match the input exactly. Note [Use loose types in inert set].

findDictsByClass :: DictMap a -> Class -> Bag a Source #

addDict :: DictMap a -> Class -> [Type] -> a -> DictMap a Source #

addDictsByClass :: DictMap Ct -> Class -> Bag Ct -> DictMap Ct Source #

delDict :: DictMap a -> Class -> [Type] -> DictMap a Source #

foldDicts :: (a -> b -> b) -> DictMap a -> b -> b Source #

filterDicts :: (Ct -> Bool) -> DictMap Ct -> DictMap Ct Source #

findDict :: DictMap a -> CtLoc -> Class -> [Type] -> Maybe a Source #

type EqualCtList = [Ct] Source #

findTyEqs :: InertCans -> TyVar -> EqualCtList Source #

foldTyEqs :: (Ct -> b -> b) -> InertEqs -> b -> b Source #

isInInertEqs :: DTyVarEnv EqualCtList -> TcTyVar -> TcType -> Bool Source #

lookupFlattenTyVar :: InertEqs -> TcTyVar -> TcType Source #

lookupInertTyVar :: InertEqs -> TcTyVar -> Maybe TcType Source #

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

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

Look up a solved inert. NB: the returned CtEvidence might not match the input exactly. See Note [Use loose types in inert set].

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

lookupFlatCache :: TyCon -> [Type] -> TcS (Maybe (TcCoercion, TcType, CtFlavour)) Source #

extendFlatCache :: TyCon -> [Type] -> (TcCoercion, TcType, CtFlavour) -> TcS () Source #

newFlattenSkolem :: CtFlavour -> CtLoc -> TyCon -> [TcType] -> TcS (CtEvidence, Coercion, TcTyVar) Source #

dischargeFunEq :: CtEvidence -> TcTyVar -> TcCoercion -> TcType -> TcS () Source #

pprKicked :: Int -> SDoc Source #

updInertFunEqs :: (FunEqMap Ct -> FunEqMap Ct) -> TcS () Source #

findFunEq :: FunEqMap a -> TyCon -> [Type] -> Maybe a Source #

findFunEqsByTyCon :: FunEqMap a -> TyCon -> [a] Source #

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

newFlexiTcSTy :: Kind -> TcS TcType Source #

instFlexi :: [TKVar] -> TcS TCvSubst Source #

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

cloneMetaTyVar :: TcTyVar -> TcS TcTyVar Source #

demoteUnfilledFmv :: TcTyVar -> TcS () Source #

tcInstType Source #

Arguments

:: ([TyVar] -> TcM (TCvSubst, [TcTyVar]))	How to instantiate the type variables
-> Id	Type to instantiate
-> TcS ([(Name, TcTyVar)], TcThetaType, TcType)	Result (type vars, preds (incl equalities), rho)

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

data TcLevel Source #

Instances

Eq TcLevel Source #
Instance details Defined in TcType Methods (==) :: TcLevel -> TcLevel -> Bool # (/=) :: TcLevel -> TcLevel -> Bool #
Ord TcLevel Source #
Instance details Defined in 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 #
Outputable TcLevel Source #
Instance details Defined in TcType Methods ppr :: TcLevel -> SDoc Source # pprPrec :: Rational -> TcLevel -> SDoc Source #