ghc-7.8.3: The GHC API

Safe HaskellNone
LanguageHaskell98

TcSMonad

Synopsis

Documentation

data WorkList Source

Constructors

WorkList 

Fields

wl_eqs :: [Ct]
 
wl_funeqs :: Deque Ct
 
wl_rest :: [Ct]
 

Instances

type Xi = Type Source

runTcS :: TcS a -> TcM (a, Bag EvBind) Source

tryTcS :: TcS a -> TcS a Source

nestTcS :: TcS a -> TcS a Source

recoverTcS :: TcS a -> TcS a -> TcS a Source

data XEvTerm Source

Constructors

XEvTerm 

Fields

ev_preds :: [PredType]
 
ev_comp :: [EvTerm] -> EvTerm
 
ev_decomp :: EvTerm -> [EvTerm]
 

newWantedEvVarNonrec :: CtLoc -> TcPredType -> TcS MaybeNew Source

Variant of newWantedEvVar that has a lower bound on the depth of the result (see Note [Preventing recursive dictionaries])

data Deque a Source

Constructors

DQ [a] [a] 

Instances

insertDeque :: a -> Deque a -> Deque a Source

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

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

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

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

findFunEqs :: FunEqMap [a] -> TyCon -> [Type] -> [a] Source

addFunEq :: FunEqMap EqualCtList -> TyCon -> [Type] -> Ct -> FunEqMap EqualCtList Source

replaceFunEqs :: FunEqMap EqualCtList -> TyCon -> [Type] -> Ct -> FunEqMap EqualCtList Source

partitionFunEqs :: (Ct -> Bool) -> FunEqMap EqualCtList -> (Bag Ct, FunEqMap EqualCtList) Source