ghc-7.8.20140130: The GHC API

Safe HaskellNone
LanguageHaskell98

TcSMonad

Synopsis

Documentation

data WorkListSource

Constructors

WorkList 

Fields

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

Instances

type Xi = TypeSource

tryTcS :: TcS a -> TcS aSource

recoverTcS :: TcS a -> TcS a -> TcS aSource

data XEvTermSource

Constructors

XEvTerm 

Fields

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

newWantedEvVarNonrec :: CtLoc -> TcPredType -> TcS MaybeNewSource

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

data Deque aSource

Constructors

DQ [a] [a] 

Instances

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

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

findDictsByClass :: DictMap a -> Class -> Bag aSource

addDict :: DictMap a -> Class -> [Type] -> a -> DictMap aSource

addDictsByClass :: DictMap Ct -> Class -> Bag Ct -> DictMap CtSource

delDict :: DictMap a -> Class -> [Type] -> DictMap aSource

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 EqualCtListSource

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

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