Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
template-haskell Language.Haskell.TH.PprLib No documentation available.
-
template-haskell Language.Haskell.TH.Syntax { [ 1 ,2 .. 10 ] }
-
template-haskell Language.Haskell.TH.Syntax a
NameQ :: ModName -> NameFlavourtemplate-haskell Language.Haskell.TH.Syntax A qualified name; dynamically bound
-
template-haskell Language.Haskell.TH.Syntax One equation of a type family instance or closed type family. The arguments are the left-hand-side type and the right-hand-side result. For instance, if you had the following type family:
type family Foo (a :: k) :: k where forall k (a :: k). Foo @k a = a
The Foo @k a = a equation would be represented as follows:TySynEqn (Just [PlainTV k, KindedTV a (VarT k)]) (AppT (AppKindT (ConT ''Foo) (VarT k)) (VarT a)) (VarT a)
TySynEqn :: Maybe [TyVarBndr ()] -> Type -> Type -> TySynEqntemplate-haskell Language.Haskell.TH.Syntax No documentation available.
-
template-haskell Language.Haskell.TH.Syntax No documentation available.
mkNameQ :: String -> String -> Nametemplate-haskell Language.Haskell.TH.Syntax Only used internally
sequenceQ :: Monad m => forall a . () => [m a] -> m [a]template-haskell Language.Haskell.TH.Syntax No documentation available.
unTypeQ :: forall a m . Quote m => m (TExp a) -> m Exptemplate-haskell Language.Haskell.TH.Syntax Discard the type annotation and produce a plain Template Haskell expression Representation-polymorphic since template-haskell-2.16.0.0.