Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. (:-) :: h -> t -> (:-) h t

    invertible-grammar Data.InvertibleGrammar.Base

    No documentation available.

  2. (:.:) :: forall p b1 b a . Grammar p b1 b -> Grammar p a b1 -> Grammar p a b

    invertible-grammar Data.InvertibleGrammar.Base

    Grammar composition.

  3. (:<>:) :: forall p a b . Grammar p a b -> Grammar p a b -> Grammar p a b

    invertible-grammar Data.InvertibleGrammar.Base

    Grammar alternation. Left operand is tried first.

  4. (:&&:) :: forall k1 ks . k1 -> LoT ks -> LoT (k1 -> ks)

    kind-apply Data.PolyKinded

    Cons a type with a list of types.

  5. type family (f :: k) :@@: (tys :: LoT k)

    kind-apply Data.PolyKinded

    Apply a list of types to a type constructor. 

    >>> :kind! Either :@@: (Int :&&: Bool :&&: LoT0)
Either :@@: (Int :&&: Bool :&&: LoT0) :: Type
= Either Int Bool

  6. (:&:) :: forall d . Atom d Constraint -> Atom d Constraint -> Atom d Constraint

    kind-apply Data.PolyKinded.Atom

    Represents the conjunction of two constraints.

  7. (:=>>:) :: forall d . Atom d Constraint -> Atom d Type -> Atom d Type

    kind-apply Data.PolyKinded.Atom

    Represents constraint requirement, the "thick arrow" =>.

  8. (:@:) :: forall d k1 k2 . Atom d (k1 -> k2) -> Atom d k1 -> Atom d k2

    kind-apply Data.PolyKinded.Atom

    Represents type application.

  9. data (c :=>: (f :: k -> Type)) (a :: k)

    kind-apply GHC.Generics.Extra

    Constraints: used to represent constraints in a constructor. 

    data Showable a = Show a => a -> X a

instance Generic (Showable a) where
type Rep (Showable a) = (Show a) :=>: (K1 R a)

  10. (:&&:) :: forall k1 ks . k1 -> LoT ks -> LoT (k1 -> ks)

    kind-generics Generics.Kind

    Cons a type with a list of types.

Page 57 of many | Previous | Next