Safe Haskell	None

DsMonad

Synopsis

Documentation

type DsM result = TcRnIf DsGblEnv DsLclEnv resultSource

mapM :: Monad m => (a -> m b) -> [a] -> m [b]Source

mapM f is equivalent to sequence . map f.

mapAndUnzipM :: Monad m => (a -> m (b, c)) -> [a] -> m ([b], [c])Source

The mapAndUnzipM function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state-transforming monad.

initDs :: HscEnv -> Module -> GlobalRdrEnv -> TypeEnv -> DsM a -> IO (Messages, Maybe a)Source

initDsTc :: DsM a -> TcM aSource

fixDs :: (a -> DsM a) -> DsM aSource

foldlM :: Monad m => (a -> b -> m a) -> a -> [b] -> m aSource

Monadic version of foldl

foldrM :: Monad m => (b -> a -> m a) -> a -> [b] -> m aSource

Monadic version of foldr

whenGOptM :: GeneralFlag -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()Source

unsetGOptM :: GeneralFlag -> TcRnIf gbl lcl a -> TcRnIf gbl lcl aSource

unsetWOptM :: WarningFlag -> TcRnIf gbl lcl a -> TcRnIf gbl lcl aSource

class Functor f => Applicative f whereSource

A functor with application, providing operations to

embed pure expressions (pure), and
sequence computations and combine their results (<*>).

A minimal complete definition must include implementations of these functions satisfying the following laws:

identity: pure id <*> v = v
composition: pure (.) <*> u <*> v <*> w = u <*> (v <*> w)
homomorphism: pure f <*> pure x = pure (f x)
interchange: u <*> pure y = pure ($ y) <*> u

The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:

      u *> v = pure (const id) <*> u <*> v
      u <* v = pure const <*> u <*> v

As a consequence of these laws, the Functor instance for f will satisfy

      fmap f x = pure f <*> x

If f is also a Monad, it should satisfy pure = return and (<*>) = ap (which implies that pure and <*> satisfy the applicative functor laws).

Methods

pure :: a -> f aSource

Lift a value.

(<*>) :: f (a -> b) -> f a -> f bSource

Sequential application.

(*>) :: f a -> f b -> f bSource

Sequence actions, discarding the value of the first argument.

(<*) :: f a -> f b -> f aSource

Sequence actions, discarding the value of the second argument.

Instances

Applicative []
Applicative IO
Applicative Q
Applicative Maybe
Applicative Id
Applicative ZipList
Applicative STM
Applicative ReadPrec
Applicative ReadP
Applicative Id
Applicative Pair
Applicative UniqSM
Applicative Ghc
Applicative CoreM
Applicative VM
Applicative ((->) a)
Applicative (Either e)
Monoid a => Applicative ((,) a)
Applicative (ST s)
Applicative (StateL s)
Applicative (StateR s)
Monoid m => Applicative (Const m)
Monad m => Applicative (WrappedMonad m)
Applicative (ST s)
Arrow a => Applicative (ArrowMonad a)
Applicative (Proxy *)
Applicative (State s)
Applicative (State s)
Applicative (IOEnv m)
Applicative m => Applicative (GhcT m)
Arrow a => Applicative (WrappedArrow a b)
(Functor m, Monad m) => Applicative (StateT s m)

(<$>) :: Functor f => (a -> b) -> f a -> f bSource

An infix synonym for fmap.

newLocalName :: Name -> TcM Name Source

duplicateLocalDs :: Id -> DsM Id Source

newSysLocalDs :: Type -> DsM Id Source

newSysLocalsDs :: [Type] -> DsM [Id]Source

newUniqueId :: Id -> Type -> DsM Id Source

newFailLocalDs :: Type -> DsM Id Source

newPredVarDs :: PredType -> DsM Var Source

getSrcSpanDs :: DsM SrcSpan Source

putSrcSpanDs :: SrcSpan -> DsM a -> DsM aSource

mkPrintUnqualifiedDs :: DsM PrintUnqualified Source

newUnique :: TcRnIf gbl lcl Unique Source

data UniqSupply Source

A value of type UniqSupply is unique, and it can supply one distinct Unique. Also, from the supply, one can also manufacture an arbitrary number of further UniqueSupply values, which will be distinct from the first and from all others.

newUniqueSupply :: TcRnIf gbl lcl UniqSupply Source

getGhcModeDs :: DsM GhcMode Source

dsLookupGlobal :: Name -> DsM TyThing Source

dsLookupGlobalId :: Name -> DsM Id Source

dsDPHBuiltin :: (PArrBuiltin -> a) -> DsM aSource

Get a name from Data.Array.Parallel for the desugarer, from the ds_parr_bi component of the global desugerar environment.

dsLookupTyCon :: Name -> DsM TyCon Source

dsLookupDataCon :: Name -> DsM DataCon Source

data PArrBuiltin Source

Constructors

PArrBuiltin
Fields lengthPVar :: Var lengthP replicatePVar :: Var replicateP singletonPVar :: Var singletonP mapPVar :: Var mapP filterPVar :: Var filterP zipPVar :: Var zipP crossMapPVar :: Var crossMapP indexPVar :: Var (!:) emptyPVar :: Var emptyP appPVar :: Var (+:+) enumFromToPVar :: Var enumFromToP enumFromThenToPVar :: Var enumFromThenToP

dsLookupDPHRdrEnv :: OccName -> DsM Name Source

Lookup a name exported by Prim or Prim. Panic if there isn't one, or if it is defined multiple times.

dsLookupDPHRdrEnv_maybe :: OccName -> DsM (Maybe Name)Source

Lookup a name exported by Prim or Prim, returning Nothing if it's not defined. Panic if it's defined multiple times.

dsInitPArrBuiltin :: DsM a -> DsM aSource

type DsMetaEnv = NameEnv DsMetaVal Source

data DsMetaVal Source

Constructors

Bound Id
Splice (HsExpr Id)

dsGetMetaEnv :: DsM (NameEnv DsMetaVal)Source

dsLookupMetaEnv :: Name -> DsM (Maybe DsMetaVal)Source

dsExtendMetaEnv :: DsMetaEnv -> DsM a -> DsM aSource

type DsWarning = (SrcSpan, SDoc)Source

warnDs :: SDoc -> DsM ()Source

failWithDs :: SDoc -> DsM aSource

data DsMatchContext Source

Constructors

DsMatchContext (HsMatchContext Name) SrcSpan

data EquationInfo Source

Constructors

EqnInfo
Fields eqn_pats :: [Pat Id] eqn_rhs :: MatchResult

Instances

Outputable EquationInfo

data MatchResult Source

Constructors

MatchResult CanItFail (CoreExpr -> DsM CoreExpr)

type DsWrapper = CoreExpr -> CoreExpr Source

idDsWrapper :: DsWrapper Source

data CanItFail Source

Constructors

CanFail
CantFail

orFail :: CanItFail -> CanItFail -> CanItFail Source