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. (:&:) :: forall d . Atom d Constraint -> Atom d Constraint -> Atom d Constraint

    kind-generics Generics.Kind

    Represents the conjunction of two constraints.

  2. data ((f :: k -> Type) :*: (g :: k -> Type)) (p :: k)

    kind-generics Generics.Kind

    Products: encode multiple arguments to constructors

  3. (:*:) :: f p -> g p -> (:*:) (f :: k -> Type) (g :: k -> Type) (p :: k)

    kind-generics Generics.Kind

    No documentation available.

  4. data ((f :: k -> Type) :+: (g :: k -> Type)) (p :: k)

    kind-generics Generics.Kind

    Sums: encode choice between constructors

  5. data ((c :: Atom d Constraint) :=>: (f :: LoT d -> Type)) (x :: LoT d)

    kind-generics Generics.Kind

    Constraints: used to represent constraints in a constructor. Replaces the (:=>:) type from GHC.Generics.Extra. 

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

instance GenericK Showable (a :&&: LoT0) where
type RepK Showable = (Show :$: a) :=>: (Field Var0)

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

    kind-generics Generics.Kind

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

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

    kind-generics Generics.Kind

    Represents type application.

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

    kind-generics Generics.Kind

    Apply a list of types to a type constructor. 

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

  9. (:=>) :: !tag a -> f a -> DSum (tag :: k -> Type) (f :: k -> Type)

    lambdabot-core Lambdabot.Main

    No documentation available.

  10. (:&&:) :: Formula v -> Formula v -> Formula v

    minisat-solver SAT.MiniSat

    Conjunction.

Page 58 of many | Previous | Next