Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. ArithSeqE :: Range -> Exp

   ghc-lib-parser	GHC.Internal.TH.Syntax

   { [ 1 ,2 .. 10 ] }
   

2. BndrReq :: BndrVis

   ghc-lib-parser	GHC.Internal.TH.Syntax

   a
   

3. NameQ :: ModName -> NameFlavour

   ghc-lib-parser	GHC.Internal.TH.Syntax

   A qualified name; dynamically bound

4. data TySynEqn

   ghc-lib-parser	GHC.Internal.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)
   

5. TySynEqn :: Maybe [TyVarBndr ()] -> Type -> Type -> TySynEqn

   ghc-lib-parser	GHC.Internal.TH.Syntax

   No documentation available.

6. cmpEq :: Ordering -> Bool

   ghc-lib-parser	GHC.Internal.TH.Syntax

   Internal helper function.

7. mkNameQ :: String -> String -> Name

   ghc-lib-parser	GHC.Internal.TH.Syntax

   Only used internally

8. sequenceQ :: Monad m => forall a . () => [m a] -> m [a]

   ghc-lib-parser	GHC.Internal.TH.Syntax

   This function is only used in Quote when desugaring brackets. This is not necessary for the user, who can use the ordinary return and (>>=) operations.

9. unTypeQ :: forall a m . Quote m => m (TExp a) -> m Exp

   ghc-lib-parser	GHC.Internal.TH.Syntax

   Discard the type annotation and produce a plain Template Haskell expression Representation-polymorphic since template-haskell-2.16.0.0.

10. NeqOp :: Op

    ghc-lib-parser	GHC.JS.JStg.Syntax

    InEquality: !=

Page 408 of many | Previous | Next