Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
Instances
data family HappyFamily t Source #
Instances
GenericK (HappyFamily (Maybe a) :: Type) Source # | |||||
Defined in Generics.Kind.Examples
| |||||
GenericK (HappyFamily [a] :: Type) Source # | |||||
Defined in Generics.Kind.Examples
fromK :: forall (x :: LoT Type). (HappyFamily [a] :@@: x) -> RepK (HappyFamily [a]) x Source # toK :: forall (x :: LoT Type). RepK (HappyFamily [a]) x -> HappyFamily [a] :@@: x Source # | |||||
GenericK HappyFamily Source # | |||||
Defined in Generics.Kind.Examples
fromK :: forall (x :: LoT (Type -> Type)). (HappyFamily :@@: x) -> RepK HappyFamily x Source # toK :: forall (x :: LoT (Type -> Type)). RepK HappyFamily x -> HappyFamily :@@: x Source # | |||||
type RepK (HappyFamily (Maybe a) :: Type) Source # | |||||
type RepK (HappyFamily [a] :: Type) Source # | |||||
Defined in Generics.Kind.Examples | |||||
data HappyFamily (Maybe a) Source # | |||||
Defined in Generics.Kind.Examples | |||||
data HappyFamily [a] Source # | |||||
Defined in Generics.Kind.Examples | |||||
type RepK HappyFamily Source # | |||||
Defined in Generics.Kind.Examples |
data SimpleIndex a b where Source #
MkSimpleIndex :: forall a1 b. [a1] -> SimpleIndex [a1] b |
Instances
GenericK (SimpleIndex a b :: Type) Source # | |||||
Defined in Generics.Kind.Examples
fromK :: forall (x :: LoT Type). (SimpleIndex a b :@@: x) -> RepK (SimpleIndex a b) x Source # toK :: forall (x :: LoT Type). RepK (SimpleIndex a b) x -> SimpleIndex a b :@@: x Source # | |||||
GenericK SimpleIndex Source # | |||||
Defined in Generics.Kind.Examples
| |||||
GenericK (SimpleIndex a :: Type -> Type) Source # | |||||
Defined in Generics.Kind.Examples
fromK :: forall (x :: LoT (Type -> Type)). (SimpleIndex a :@@: x) -> RepK (SimpleIndex a) x Source # toK :: forall (x :: LoT (Type -> Type)). RepK (SimpleIndex a) x -> SimpleIndex a :@@: x Source # | |||||
type RepK (SimpleIndex a b :: Type) Source # | |||||
type RepK SimpleIndex Source # | |||||
type RepK (SimpleIndex a :: Type -> Type) Source # | |||||
data WeirdTree a where Source #
WeirdBranch :: forall a. WeirdTree a -> WeirdTree a -> WeirdTree a | |
WeirdLeaf :: forall a t. Show a => t -> a -> WeirdTree a |
Instances
GenericK WeirdTree Source # | |||||
Defined in Generics.Kind.Examples
| |||||
type RepK WeirdTree Source # | |||||
Defined in Generics.Kind.Examples type RepK WeirdTree = (Field (WeirdTree :$: (Var0 :: Atom (Type -> Type) Type)) :*: Field (WeirdTree :$: (Var0 :: Atom (Type -> Type) Type))) :+: Exists Type ((Show :$: (Var1 :: Atom (Type -> Type -> Type) Type)) :=>: (Field (Var0 :: Atom (Type -> Type -> Type) Type) :*: Field (Var1 :: Atom (Type -> Type -> Type) Type))) |
data WeirdTreeR a where Source #
WeirdBranchR :: forall a. WeirdTreeR a -> WeirdTreeR a -> WeirdTreeR a | |
WeirdLeafR :: forall a t. (Show a, Eq t, Typeable t) => t -> a -> WeirdTreeR a |
Instances
GenericK (WeirdTreeR a :: Type) Source # | |||||
Defined in Generics.Kind.Examples
fromK :: forall (x :: LoT Type). (WeirdTreeR a :@@: x) -> RepK (WeirdTreeR a) x Source # toK :: forall (x :: LoT Type). RepK (WeirdTreeR a) x -> WeirdTreeR a :@@: x Source # | |||||
GenericK WeirdTreeR Source # | |||||
Defined in Generics.Kind.Examples
fromK :: forall (x :: LoT (Type -> Type)). (WeirdTreeR :@@: x) -> RepK WeirdTreeR x Source # toK :: forall (x :: LoT (Type -> Type)). RepK WeirdTreeR x -> WeirdTreeR :@@: x Source # | |||||
type RepK (WeirdTreeR a :: Type) Source # | |||||
Defined in Generics.Kind.Examples type RepK (WeirdTreeR a :: Type) = (Field ('Kon (WeirdTreeR a) :: Atom Type Type) :*: Field ('Kon (WeirdTreeR a) :: Atom Type Type)) :+: Exists Type ((('Kon (Show a) :: Atom (Type -> Type) Constraint) ':&: ((Eq :$: (Var0 :: Atom (Type -> Type) Type)) ':&: ((Typeable :: Type -> Constraint) :$: (Var0 :: Atom (Type -> Type) Type)))) :=>: (Field (Var0 :: Atom (Type -> Type) Type) :*: Field ('Kon a :: Atom (Type -> Type) Type))) | |||||
type RepK WeirdTreeR Source # | |||||
Defined in Generics.Kind.Examples type RepK WeirdTreeR = (Field (WeirdTreeR :$: (Var0 :: Atom (Type -> Type) Type)) :*: Field (WeirdTreeR :$: (Var0 :: Atom (Type -> Type) Type))) :+: Exists Type (((Show :$: (Var1 :: Atom (Type -> Type -> Type) Type)) ':&: ((Eq :$: (Var0 :: Atom (Type -> Type -> Type) Type)) ':&: ((Typeable :: Type -> Constraint) :$: (Var0 :: Atom (Type -> Type -> Type) Type)))) :=>: (Field (Var0 :: Atom (Type -> Type -> Type) Type) :*: Field (Var1 :: Atom (Type -> Type -> Type) Type))) |
data P' j (a :: k) where Source #
Instances
MkRanky (forall a. a -> a) |
MkRanky2 ((forall a. a -> a) -> b) |
newtype Hkd (f :: k -> Exp Type) (a :: k) Source #
Instances
GenericK (Hkd f a :: Type) Source # | |
Defined in Generics.Kind.Examples | |
GenericK (Hkd :: (k -> Exp Type) -> k -> Type) Source # | |
Defined in Generics.Kind.Examples fromK :: forall (x :: LoT ((k -> Exp Type) -> k -> Type)). ((Hkd :: (k -> Exp Type) -> k -> Type) :@@: x) -> RepK (Hkd :: (k -> Exp Type) -> k -> Type) x Source # toK :: forall (x :: LoT ((k -> Exp Type) -> k -> Type)). RepK (Hkd :: (k -> Exp Type) -> k -> Type) x -> (Hkd :: (k -> Exp Type) -> k -> Type) :@@: x Source # | |
GenericK (Hkd f :: k -> Type) Source # | |
Defined in Generics.Kind.Examples | |
type RepK (Hkd f a :: Type) Source # | |
type RepK (Hkd :: (k -> Exp Type) -> k -> Type) Source # | |
type RepK (Hkd f :: k -> Type) Source # | |
Orphan instances
GenericK (Maybe a :: Type) Source # | |
GenericK ([a] :: Type) Source # | |
GenericK (Either a b :: Type) Source # | |
GenericK Either Source # | |
GenericK Maybe Source # | |
GenericK [] Source # | |
GenericK (Either a :: Type -> Type) Source # | |