Haskell Hierarchical Libraries (template-haskell package) Contents Index

Language.Haskell.TH

Synopsis

data Q a runQ :: Quasi m => Q a -> m a report :: Bool -> String -> Q () recover :: Q a -> Q a -> Q a reify :: Name -> Q Info currentModule :: Q String runIO :: IO a -> Q a data Name mkName :: String -> Name newName :: String -> Q Name nameBase :: Name -> String tupleTypeName :: Int -> Name tupleDataName :: Int -> Name data Dec = FunD Name [Clause] | ValD Pat Body [Dec] | DataD Cxt Name [Name] [Con] [Name] | NewtypeD Cxt Name [Name] Con [Name] | TySynD Name [Name] Type | ClassD Cxt Name [Name] [Dec] | InstanceD Cxt Type [Dec] | SigD Name Type | ForeignD Foreign data Exp = VarE Name | ConE Name | LitE Lit | AppE Exp Exp | InfixE (Maybe Exp) Exp (Maybe Exp) | LamE [Pat] Exp | TupE [Exp] | CondE Exp Exp Exp | LetE [Dec] Exp | CaseE Exp [Match] | DoE [Stmt] | CompE [Stmt] | ArithSeqE Range | ListE [Exp] | SigE Exp Type | RecConE Name [FieldExp] | RecUpdE Exp [FieldExp] data Con = NormalC Name [StrictType] | RecC Name [VarStrictType] | InfixC StrictType Name StrictType data Type = ForallT [Name] Cxt Type | VarT Name | ConT Name | TupleT Int | ArrowT | ListT | AppT Type Type type Cxt = [Type] data Match = Match Pat Body [Dec] data Clause = Clause [Pat] Body [Dec] data Body = GuardedB [(Guard, Exp)] | NormalB Exp data Guard = NormalG Exp | PatG [Stmt] data Stmt = BindS Pat Exp | LetS [Dec] | NoBindS Exp | ParS [[Stmt]] data Range = FromR Exp | FromThenR Exp Exp | FromToR Exp Exp | FromThenToR Exp Exp Exp data Lit = CharL Char | StringL String | IntegerL Integer | RationalL Rational | IntPrimL Integer | FloatPrimL Rational | DoublePrimL Rational data Pat = LitP Lit | VarP Name | TupP [Pat] | ConP Name [Pat] | InfixP Pat Name Pat | TildeP Pat | AsP Name Pat | WildP | RecP Name [FieldPat] | ListP [Pat] | SigP Pat Type type FieldExp = (Name, Exp) type FieldPat = (Name, Pat) data Strict = IsStrict | NotStrict data Foreign = ImportF Callconv Safety String Name Type | ExportF Callconv String Name Type data Callconv = CCall | StdCall data Safety = Unsafe | Safe | Threadsafe data Info = ClassI Dec | ClassOpI Name Type Name Fixity | TyConI Dec | DataConI Name Type Name Fixity | VarI Name Type (Maybe Dec) Fixity | TyVarI Name Type data Fixity = Fixity Int FixityDirection data FixityDirection = InfixL | InfixR | InfixN type InfoQ = Q Info type ExpQ = Q Exp type DecQ = Q Dec type ConQ = Q Con type TypeQ = Q Type type CxtQ = Q Cxt type MatchQ = Q Match type ClauseQ = Q Clause type BodyQ = Q Body type GuardQ = Q Guard type StmtQ = Q Stmt type RangeQ = Q Range type StrictTypeQ = Q StrictType type VarStrictTypeQ = Q VarStrictType type PatQ = Q Pat type FieldPatQ = Q FieldPat intPrimL :: Integer -> Lit floatPrimL :: Rational -> Lit doublePrimL :: Rational -> Lit integerL :: Integer -> Lit charL :: Char -> Lit stringL :: String -> Lit rationalL :: Rational -> Lit litP :: Lit -> PatQ varP :: Name -> PatQ tupP :: [PatQ] -> PatQ conP :: Name -> [PatQ] -> PatQ infixP :: PatQ -> Name -> PatQ -> PatQ tildeP :: PatQ -> PatQ asP :: Name -> PatQ -> PatQ wildP :: PatQ recP :: Name -> [FieldPatQ] -> PatQ listP :: [PatQ] -> PatQ sigP :: PatQ -> TypeQ -> PatQ fieldPat :: Name -> PatQ -> FieldPatQ bindS :: PatQ -> ExpQ -> StmtQ letS :: [DecQ] -> StmtQ noBindS :: ExpQ -> StmtQ parS :: [[StmtQ]] -> StmtQ fromR :: ExpQ -> RangeQ fromThenR :: ExpQ -> ExpQ -> RangeQ fromToR :: ExpQ -> ExpQ -> RangeQ fromThenToR :: ExpQ -> ExpQ -> ExpQ -> RangeQ normalB :: ExpQ -> BodyQ guardedB :: [Q (Guard, Exp)] -> BodyQ normalG :: ExpQ -> GuardQ normalGE :: ExpQ -> ExpQ -> Q (Guard, Exp) patG :: [StmtQ] -> GuardQ patGE :: [StmtQ] -> Q (Guard, Exp) match :: PatQ -> BodyQ -> [DecQ] -> MatchQ clause :: [PatQ] -> BodyQ -> [DecQ] -> ClauseQ dyn :: String -> Q Exp global :: Name -> ExpQ varE :: Name -> ExpQ conE :: Name -> ExpQ litE :: Lit -> ExpQ appE :: ExpQ -> ExpQ -> ExpQ infixE :: Maybe ExpQ -> ExpQ -> Maybe ExpQ -> ExpQ infixApp :: ExpQ -> ExpQ -> ExpQ -> ExpQ sectionL :: ExpQ -> ExpQ -> ExpQ sectionR :: ExpQ -> ExpQ -> ExpQ lamE :: [PatQ] -> ExpQ -> ExpQ lam1E :: PatQ -> ExpQ -> ExpQ tupE :: [ExpQ] -> ExpQ condE :: ExpQ -> ExpQ -> ExpQ -> ExpQ letE :: [DecQ] -> ExpQ -> ExpQ caseE :: ExpQ -> [MatchQ] -> ExpQ doE :: [StmtQ] -> ExpQ compE :: [StmtQ] -> ExpQ arithSeqE :: RangeQ -> ExpQ fromE :: ExpQ -> ExpQ fromThenE :: ExpQ -> ExpQ -> ExpQ fromToE :: ExpQ -> ExpQ -> ExpQ fromThenToE :: ExpQ -> ExpQ -> ExpQ -> ExpQ listE :: [ExpQ] -> ExpQ sigE :: ExpQ -> TypeQ -> ExpQ recConE :: Name -> [Q (Name, Exp)] -> ExpQ recUpdE :: ExpQ -> [Q (Name, Exp)] -> ExpQ stringE :: String -> ExpQ fieldExp :: Name -> ExpQ -> Q (Name, Exp) valD :: PatQ -> BodyQ -> [DecQ] -> DecQ funD :: Name -> [ClauseQ] -> DecQ tySynD :: Name -> [Name] -> TypeQ -> DecQ dataD :: CxtQ -> Name -> [Name] -> [ConQ] -> [Name] -> DecQ newtypeD :: CxtQ -> Name -> [Name] -> ConQ -> [Name] -> DecQ classD :: CxtQ -> Name -> [Name] -> [DecQ] -> DecQ instanceD :: CxtQ -> TypeQ -> [DecQ] -> DecQ sigD :: Name -> TypeQ -> DecQ forImpD :: Callconv -> Safety -> String -> Name -> TypeQ -> DecQ cxt :: [TypeQ] -> CxtQ normalC :: Name -> [StrictTypeQ] -> ConQ recC :: Name -> [VarStrictTypeQ] -> ConQ infixC :: Q (Strict, Type) -> Name -> Q (Strict, Type) -> ConQ forallT :: [Name] -> CxtQ -> TypeQ -> TypeQ varT :: Name -> TypeQ conT :: Name -> TypeQ appT :: TypeQ -> TypeQ -> TypeQ arrowT :: TypeQ listT :: TypeQ tupleT :: Int -> TypeQ isStrict :: Q Strict notStrict :: Q Strict strictType :: Q Strict -> TypeQ -> StrictTypeQ varStrictType :: Name -> StrictTypeQ -> VarStrictTypeQ cCall :: Callconv stdCall :: Callconv unsafe :: Safety safe :: Safety threadsafe :: Safety class Ppr a where ppr :: a -> Doc ppr_list :: [a] -> Doc pprint :: Ppr a => a -> String pprExp :: Precedence -> Exp -> Doc pprLit :: Precedence -> Lit -> Doc pprPat :: Precedence -> Pat -> Doc pprParendType :: Type -> Doc

Produced by Haddock version 0.6