TypeInfo

Documentation

data Name

An abstract type representing names in the syntax tree.

Names can be constructed in several ways, which come with different name-capture guarantees (see Language.Haskell.TH.Syntax for an explanation of name capture):

• the built-in syntax 'f and ''T can be used to construct names, The expression 'f gives a Name which refers to the value f currently in scope, and ''T gives a Name which refers to the type T currently in scope. These names can never be captured.
• lookupValueName and lookupTypeName are similar to 'f and ''T respectively, but the Names are looked up at the point where the current splice is being run. These names can never be captured.
• newName monadically generates a new name, which can never be captured.
• mkName generates a capturable name.

Names constructed using newName and mkName may be used in bindings (such as let x = ... or x -> ...), but names constructed using lookupValueName, lookupTypeName, 'f, ''T may not.

Instances

Eq Name

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Name -> Name -> Bool

(/=) :: Name -> Name -> Bool

Data Name

Defined in Language.Haskell.TH.Syntax

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Name -> c Name

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Name

toConstr :: Name -> Constr

dataTypeOf :: Name -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Name)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Name)

gmapT :: (forall b. Data b => b -> b) -> Name -> Name

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Name -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Name -> r

gmapQ :: (forall d. Data d => d -> u) -> Name -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Name -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Name -> m Name

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Name -> m Name

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Name -> m Name

Ord Name

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Name -> Name -> Ordering

(<) :: Name -> Name -> Bool

(<=) :: Name -> Name -> Bool

(>) :: Name -> Name -> Bool

(>=) :: Name -> Name -> Bool

max :: Name -> Name -> Name

min :: Name -> Name -> Name

Show Name

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Name -> ShowS

show :: Name -> String

showList :: [Name] -> ShowS

Generic Name

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Name :: * -> *

Methods

from :: Name -> Rep Name x

to :: Rep Name x -> Name

Ppr Name

Defined in Language.Haskell.TH.Ppr

Methods

ppr :: Name -> Doc

ppr_list :: [Name] -> Doc

type Rep Name

Defined in Language.Haskell.TH.Syntax

type Rep Name = D1 (MetaData "Name" "Language.Haskell.TH.Syntax" "template-haskell" False) (C1 (MetaCons "Name" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 OccName) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 NameFlavour)))

type TypeEnv = [TypeDef]

data Type

Constructors

Base Name

A base type name (e.g. Int, Maybe, Either)

Var Name

A type variable (e.g. a, b)

App Type Type

A type application (e.g. T U)

Instances

Eq Type

Defined in TypeInfo

Methods

(==) :: Type -> Type -> Bool

(/=) :: Type -> Type -> Bool

Ord Type

Defined in TypeInfo

Methods

compare :: Type -> Type -> Ordering

(<) :: Type -> Type -> Bool

(<=) :: Type -> Type -> Bool

(>) :: Type -> Type -> Bool

(>=) :: Type -> Type -> Bool

max :: Type -> Type -> Type

min :: Type -> Type -> Type

Show Type

Defined in TypeInfo

Methods

showsPrec :: Int -> Type -> ShowS

show :: Type -> String

showList :: [Type] -> ShowS

data Con

Constructors

Con

Fields

• cname :: Name

  Constructor name

• cargs :: [Type]

  Constructor args

• rec :: Bool

  Is this constructor recursive?

Instances

Show Con

Defined in TypeInfo

Methods

showsPrec :: Int -> Con -> ShowS

show :: Con -> String

showList :: [Con] -> ShowS

data TypeDef

Constructors

TypeDef

Fields

• tsig :: Type

  Left hand side of the type definition.

• tcons :: [Con]

  Type constructors

• prim :: Bool

  Is this data type primitive? (e.g. Int, Bool)

Instances

Eq TypeDef

Defined in TypeInfo

Methods

(==) :: TypeDef -> TypeDef -> Bool

(/=) :: TypeDef -> TypeDef -> Bool

Show TypeDef

Defined in TypeInfo

Methods

showsPrec :: Int -> TypeDef -> ShowS

show :: TypeDef -> String

showList :: [TypeDef] -> ShowS

apply :: Name -> [Type] -> Type

unapply :: Type -> (Name, [Type])

typeName :: TypeDef -> Name

typeArgs :: TypeDef -> [Type]

flatten :: Type -> [Name]

subtype :: Type -> Type -> Bool

occurrences :: Type -> Con -> Int

countSat :: (a -> Bool) -> [a] -> Int

typeSigs :: TypeEnv -> [Type]

consList :: TypeEnv -> [Name]

involvedWith :: TypeDef -> [Type]

getCon :: Name -> TypeDef -> Con

conType :: TypeEnv -> Name -> TypeDef

getSiblings :: Name -> TypeEnv -> [Con]

isSibling :: TypeEnv -> Name -> Name -> Bool

splitCons :: TypeEnv -> ([Con], [Con])

getRecursives :: TypeEnv -> [Con]

getTerminals :: TypeEnv -> [Con]

isTerminal :: TypeEnv -> Name -> Bool