TcSMonad

ghc-8.0.1: The GHC API

Safe Haskell | None
Language | Haskell2010

TcSMonad

Synopsis

- data WorkList = WL {
  - wl_eqs :: [Ct]
  - wl_funeqs :: [Ct]
  - wl_rest :: [Ct]
  - wl_deriv :: [CtEvidence]
  - wl_implics :: Bag Implication
  }
- isEmptyWorkList :: WorkList -> Bool
- emptyWorkList :: WorkList
- extendWorkListNonEq :: Ct -> WorkList -> WorkList
- extendWorkListCt :: Ct -> WorkList -> WorkList
- extendWorkListDerived :: CtLoc -> CtEvidence -> WorkList -> WorkList
- extendWorkListCts :: [Ct] -> WorkList -> WorkList
- extendWorkListEq :: Ct -> WorkList -> WorkList
- extendWorkListFunEq :: Ct -> WorkList -> WorkList
- appendWorkList :: WorkList -> WorkList -> WorkList
- selectNextWorkItem :: TcS (Maybe Ct)
- workListSize :: WorkList -> Int
- workListWantedCount :: WorkList -> Int
- updWorkListTcS :: (WorkList -> WorkList) -> TcS ()
- data TcS a
- runTcS :: TcS a -> TcM (a, EvBindMap)
- runTcSDeriveds :: TcS a -> TcM a
- runTcSWithEvBinds :: Bool -> Maybe 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 :: Maybe EvBindsVar -> TyCoVarSet -> TcLevel -> TcS a -> TcS (a, TyCoVarSet)
- runTcPluginTcS :: TcPluginM a -> TcS a
- addUsedDataCons :: GlobalRdrEnv -> TyCon -> TcS ()
- deferTcSForAllEq :: Role -> CtLoc -> [Coercion] -> ([TyBinder], TcType) -> ([TyBinder], TcType) -> TcS Coercion
- 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 EvTerm
- freshGoals :: [MaybeNew] -> [CtEvidence]
- isFresh :: MaybeNew -> Bool
- getEvTerm :: MaybeNew -> EvTerm
- newTcEvBinds :: TcS EvBindsVar
- newWantedEq :: CtLoc -> Role -> TcType -> TcType -> TcS (CtEvidence, Coercion)
- newWanted :: CtLoc -> PredType -> TcS MaybeNew
- newWantedEvVar :: CtLoc -> TcPredType -> TcS MaybeNew
- 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 ()
- setEqIfWanted :: CtEvidence -> Coercion -> TcS ()
- setWantedEvTerm :: TcEvDest -> EvTerm -> TcS ()
- setWantedEvBind :: EvVar -> EvTerm -> TcS ()
- setEvBindIfWanted :: CtEvidence -> EvTerm -> TcS ()
- newEvVar :: TcPredType -> TcS EvVar
- newGivenEvVar :: CtLoc -> (TcPredType, EvTerm) -> TcS CtEvidence
- newGivenEvVars :: CtLoc -> [(TcPredType, EvTerm)] -> TcS [CtEvidence]
- emitNewDerived :: CtLoc -> TcPredType -> TcS ()
- emitNewDeriveds :: CtLoc -> [TcPredType] -> TcS ()
- emitNewDerivedEq :: CtLoc -> Role -> TcType -> TcType -> TcS ()
- checkReductionDepth :: CtLoc -> TcType -> TcS ()
- getInstEnvs :: TcS InstEnvs
- getFamInstEnvs :: TcS (FamInstEnv, FamInstEnv)
- getTopEnv :: TcS HscEnv
- getGblEnv :: TcS TcGblEnv
- getLclEnv :: TcS TcLclEnv
- getTcEvBinds :: TcS (Maybe EvBindsVar)
- getTcEvBindsFromVar :: EvBindsVar -> TcS (Bag EvBind)
- getTcLevel :: TcS TcLevel
- getTcEvBindsMap :: TcS EvBindMap
- tcLookupClass :: Name -> TcS Class
- data InertSet = IS {
  - inert_cans :: InertCans
  - inert_flat_cache :: ExactFunEqMap (TcCoercion, TcType, CtFlavour)
  - inert_solved_dicts :: DictMap CtEvidence
  }
- data InertCans = IC {
  - inert_model :: InertModel
  - inert_eqs :: TyVarEnv EqualCtList
  - inert_funeqs :: FunEqMap Ct
  - inert_dicts :: DictMap Ct
  - inert_safehask :: DictMap Ct
  - inert_irreds :: Cts
  - inert_insols :: 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
- setInertCans :: InertCans -> TcS ()
- getInertEqs :: TcS (TyVarEnv EqualCtList)
- getInertCans :: TcS InertCans
- getInertModel :: TcS InertModel
- getInertGivens :: TcS [Ct]
- emptyInert :: InertSet
- getTcSInerts :: TcS InertSet
- setTcSInerts :: InertSet -> TcS ()
- takeGivenInsolubles :: TcS Cts
- matchableGivens :: CtLoc -> PredType -> InertSet -> Cts
- prohibitedSuperClassSolve :: CtLoc -> CtLoc -> Bool
- getUnsolvedInerts :: TcS (Bag Implication, Cts, Cts, Cts, Cts)
- removeInertCts :: [Ct] -> InertCans -> InertCans
- getPendingScDicts :: TcS [Ct]
- addInertCan :: Ct -> TcS ()
- addInertEq :: Ct -> TcS ()
- insertFunEq :: FunEqMap a -> TyCon -> [Type] -> a -> FunEqMap a
- emitInsoluble :: Ct -> TcS ()
- emitWorkNC :: [CtEvidence] -> TcS ()
- type InertModel = TyVarEnv Ct
- kickOutAfterUnification :: TcTyVar -> TcS Int
- addInertSafehask :: InertCans -> Ct -> InertCans
- insertSafeOverlapFailureTcS :: Ct -> TcS ()
- updInertSafehask :: (DictMap Ct -> DictMap Ct) -> TcS ()
- getSafeOverlapFailures :: TcS Cts
- lookupInertDict :: InertCans -> 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
- partitionDicts :: (Ct -> Bool) -> DictMap Ct -> (Bag Ct, DictMap Ct)
- foldDicts :: (a -> b -> b) -> DictMap a -> b -> b
- filterDicts :: (Ct -> Bool) -> DictMap Ct -> DictMap Ct
- type EqualCtList = [Ct]
- findTyEqs :: InertCans -> TyVar -> EqualCtList
- foldTyEqs :: (Ct -> b -> b) -> TyVarEnv EqualCtList -> b -> b
- isInInertEqs :: TyVarEnv EqualCtList -> TcTyVar -> TcType -> Bool
- addSolvedDict :: CtEvidence -> Class -> [Type] -> TcS ()
- lookupSolvedDict :: InertSet -> 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 -> TcType -> TcS (CtEvidence, Coercion, TcTyVar)
- updInertFunEqs :: (FunEqMap Ct -> FunEqMap Ct) -> TcS ()
- findFunEq :: FunEqMap a -> TyCon -> [Type] -> Maybe a
- sizeFunEqMap :: FunEqMap a -> Int
- filterFunEqs :: (Ct -> Bool) -> FunEqMap Ct -> FunEqMap Ct
- findFunEqsByTyCon :: FunEqMap a -> TyCon -> [a]
- partitionFunEqs :: (Ct -> Bool) -> FunEqMap Ct -> ([Ct], FunEqMap Ct)
- foldFunEqs :: (a -> b -> b) -> FunEqMap a -> b -> b
- instDFunType :: DFunId -> [DFunInstType] -> TcS ([TcType], TcThetaType)
- newFlexiTcSTy :: Kind -> TcS TcType
- instFlexiTcS :: [TKVar] -> TcS (TCvSubst, [TcType])
- cloneMetaTyVar :: TcTyVar -> TcS TcTyVar
- demoteUnfilledFmv :: TcTyVar -> TcS ()
- data TcLevel
- isTouchableMetaTyVarTcS :: TcTyVar -> TcS Bool
- 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
- zonkSimples :: Cts -> TcS Cts
- zonkWC :: WantedConstraints -> TcS WantedConstraints
- 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_deriv :: [CtEvidence] wl_implics :: Bag Implication

Instances

Outputable WorkList # |
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 #

extendWorkListDerived :: CtLoc -> CtEvidence -> WorkList -> WorkList Source #

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

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

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

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

selectNextWorkItem :: TcS (Maybe Ct) Source #

workListSize :: WorkList -> Int Source #

workListWantedCount :: WorkList -> Int Source #

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

data TcS a Source #

Instances

Monad TcS # |
Methods (>>=) :: TcS a -> (a -> TcS b) -> TcS b Source # (>>) :: TcS a -> TcS b -> TcS b Source # return :: a -> TcS a Source # fail :: String -> TcS a Source #
Functor TcS # |
Methods fmap :: (a -> b) -> TcS a -> TcS b Source # (<$) :: a -> TcS b -> TcS a Source #
MonadFail TcS # |
Methods fail :: String -> TcS a Source #
Applicative TcS # |
Methods pure :: a -> TcS a Source # (<*>) :: TcS (a -> b) -> TcS a -> TcS b Source # (*>) :: TcS a -> TcS b -> TcS b Source # (<*) :: TcS a -> TcS b -> TcS a Source #
MonadUnique TcS # |
Methods getUniqueSupplyM :: TcS UniqSupply Source # getUniqueM :: TcS Unique Source # getUniquesM :: TcS [Unique] Source #
HasDynFlags TcS # |
Methods getDynFlags :: TcS DynFlags 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 Source #

Arguments

:: Bool | keep running even if only Deriveds are left?
-> Maybe EvBindsVar |
-> TcS a |
-> TcM a |

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 :: Maybe EvBindsVar -> TyCoVarSet -> TcLevel -> TcS a -> TcS (a, TyCoVarSet) Source #

runTcPluginTcS :: TcPluginM a -> TcS a Source #

addUsedDataCons :: GlobalRdrEnv -> TyCon -> TcS () Source #

deferTcSForAllEq :: Role -> CtLoc -> [Coercion] -> ([TyBinder], TcType) -> ([TyBinder], TcType) -> TcS Coercion 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 EvTerm |

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

isFresh :: MaybeNew -> Bool Source #

getEvTerm :: MaybeNew -> EvTerm Source #

newTcEvBinds :: TcS EvBindsVar Source #

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

Make a new equality CtEvidence

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

newWantedEvVar :: CtLoc -> TcPredType -> TcS MaybeNew 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

setEqIfWanted :: CtEvidence -> Coercion -> TcS () Source #

Equalities only

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

Good for equalities and non-equalities

setWantedEvBind :: EvVar -> EvTerm -> TcS () Source #

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

newEvVar :: TcPredType -> TcS EvVar Source #

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

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

emitNewDerived :: CtLoc -> TcPredType -> TcS () 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.

getInstEnvs :: TcS InstEnvs Source #

getFamInstEnvs :: TcS (FamInstEnv, FamInstEnv) Source #

getTopEnv :: TcS HscEnv Source #

getGblEnv :: TcS TcGblEnv Source #

getLclEnv :: TcS TcLclEnv Source #

getTcEvBinds :: TcS (Maybe EvBindsVar) Source #

getTcEvBindsFromVar :: EvBindsVar -> TcS (Bag EvBind) Source #

getTcLevel :: TcS TcLevel Source #

getTcEvBindsMap :: TcS EvBindMap Source #

tcLookupClass :: Name -> TcS Class Source #

data InertSet Source #

Constructors

IS |
Fields inert_cans :: InertCans inert_flat_cache :: ExactFunEqMap (TcCoercion, TcType, CtFlavour) inert_solved_dicts :: DictMap CtEvidence

Instances

Outputable InertSet # |
Methods ppr :: InertSet -> SDoc Source # pprPrec :: Rational -> InertSet -> SDoc Source #

data InertCans Source #

Constructors

IC |
Fields inert_model :: InertModel inert_eqs :: TyVarEnv EqualCtList inert_funeqs :: FunEqMap Ct inert_dicts :: DictMap Ct inert_safehask :: DictMap Ct See Note [Safe Haskell Overlapping Instances Implementation] in TcSimplify inert_irreds :: Cts inert_insols :: Cts inert_count :: Int

Instances

Outputable InertCans # |
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 Source #

setInertCans :: InertCans -> TcS () Source #

getInertEqs :: TcS (TyVarEnv EqualCtList) Source #

getInertCans :: TcS InertCans Source #

getInertModel :: TcS InertModel Source #

getInertGivens :: TcS [Ct] Source #

emptyInert :: InertSet Source #

getTcSInerts :: TcS InertSet Source #

setTcSInerts :: InertSet -> TcS () Source #

takeGivenInsolubles :: TcS Cts 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 #

getUnsolvedInerts :: TcS (Bag Implication, Cts, 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.

getPendingScDicts :: TcS [Ct] Source #

addInertCan :: Ct -> TcS () Source #

addInertEq :: Ct -> TcS () Source #

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

emitInsoluble :: Ct -> TcS () Source #

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

type InertModel = TyVarEnv Ct 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 #

lookupInertDict :: InertCans -> 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 #

partitionDicts :: (Ct -> Bool) -> DictMap Ct -> (Bag Ct, DictMap Ct) Source #

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

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

type EqualCtList = [Ct] Source #

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

foldTyEqs :: (Ct -> b -> b) -> TyVarEnv EqualCtList -> b -> b Source #

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

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

lookupSolvedDict :: InertSet -> 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 -> TcType -> TcS (CtEvidence, Coercion, TcTyVar) Source #

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

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

sizeFunEqMap :: FunEqMap a -> Int Source #

filterFunEqs :: (Ct -> Bool) -> FunEqMap Ct -> FunEqMap Ct Source #

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

partitionFunEqs :: (Ct -> Bool) -> FunEqMap Ct -> ([Ct], FunEqMap Ct) Source #

foldFunEqs :: (a -> b -> b) -> FunEqMap a -> b -> b Source #

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

newFlexiTcSTy :: Kind -> TcS TcType Source #

instFlexiTcS :: [TKVar] -> TcS (TCvSubst, [TcType]) Source #

cloneMetaTyVar :: TcTyVar -> TcS TcTyVar Source #

demoteUnfilledFmv :: TcTyVar -> TcS () Source #

data TcLevel Source #

Instances

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

isTouchableMetaTyVarTcS :: TcTyVar -> TcS Bool Source #

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

isFilledMetaTyVar :: TcTyVar -> TcS Bool Source #

zonkTyCoVarsAndFV :: TcTyCoVarSet -> TcS TcTyCoVarSet Source #

zonkTcType :: TcType -> TcS TcType Source #

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

zonkTcTyVar :: TcTyVar -> TcS TcType Source #

zonkCo :: Coercion -> TcS Coercion Source #

zonkSimples :: Cts -> TcS Cts Source #

zonkWC :: WantedConstraints -> TcS WantedConstraints Source #

newTcRef :: a -> TcS (TcRef a) Source #

readTcRef :: TcRef a -> TcS a Source #

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

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

getDynFlags :: HasDynFlags m => m DynFlags Source #

getGlobalRdrEnvTcS :: TcS GlobalRdrEnv Source #

matchFam :: TyCon -> [Type] -> TcS (Maybe (Coercion, TcType)) Source #

matchFamTcM :: TyCon -> [Type] -> TcM (Maybe (Coercion, TcType)) Source #

checkWellStagedDFun :: PredType -> DFunId -> CtLoc -> TcS () Source #

pprEq :: TcType -> TcType -> SDoc Source #