Hoogle Search
Within LTS Haskell 24.18 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
:=>>: ) :: forall d . Atom d Constraint -> Atom d Type -> Atom d Typekind-apply Data.PolyKinded.Atom Represents constraint requirement, the "thick arrow" =>.
(
:@: ) :: forall d k1 k2 . Atom d (k1 -> k2) -> Atom d k1 -> Atom d k2kind-apply Data.PolyKinded.Atom Represents type application.
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)
(
:&&: ) :: forall k1 ks . k1 -> LoT ks -> LoT (k1 -> ks)kind-generics Generics.Kind Cons a type with a list of types.
(
:&: ) :: forall d . Atom d Constraint -> Atom d Constraint -> Atom d Constraintkind-generics Generics.Kind Represents the conjunction of two constraints.
data ((f :: k -> Type)
:*: (g :: k -> Type)) (p :: k)kind-generics Generics.Kind Products: encode multiple arguments to constructors
(
:*: ) :: f p -> g p -> (:*:) (f :: k -> Type) (g :: k -> Type) (p :: k)kind-generics Generics.Kind No documentation available.
data ((f :: k -> Type)
:+: (g :: k -> Type)) (p :: k)kind-generics Generics.Kind Sums: encode choice between constructors
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)
(
:=>>: ) :: forall d . Atom d Constraint -> Atom d Type -> Atom d Typekind-generics Generics.Kind Represents constraint requirement, the "thick arrow" =>.