packages feed

kind-generics 0.4.0.0 → 0.4.1.0

raw patch · 2 files changed

+2/−2 lines, 2 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Generics.Kind: data U1 (p :: k) :: forall k. () => k -> Type
- Generics.Kind: instance forall d (k :: GHC.Types.Constraint) (t :: Data.PolyKinded.Atom.Atom d GHC.Types.Constraint) (tys :: Data.PolyKinded.LoT d) (f :: * -> *) (f' :: Data.PolyKinded.LoT d -> *). (k Data.Type.Equality.~ Data.PolyKinded.Atom.Interpret t tys, Generics.Kind.Conv f f' tys) => Generics.Kind.Conv (k GHC.Generics.Extra.:=>: f) (t Generics.Kind.:=>: f') tys
- Generics.Kind: instance forall d k (t :: Data.PolyKinded.Atom.Atom d *) (tys :: Data.PolyKinded.LoT d) p. (k Data.Type.Equality.~ Data.PolyKinded.Atom.Interpret t tys) => Generics.Kind.Conv (GHC.Generics.K1 p k) (Generics.Kind.Field t) tys
- Generics.Kind: instance forall k t (x :: t) (xs :: Data.PolyKinded.LoT k). Generics.Kind.SubstRep' GHC.Generics.U1 x xs
- Generics.Kind: instance forall t1 k (t2 :: Data.PolyKinded.Atom.Atom (t1 -> k) *) (x :: t1) (xs :: Data.PolyKinded.LoT k). (Data.PolyKinded.Atom.Interpret (Generics.Kind.SubstAtom t2 x) xs Data.Type.Equality.~ Data.PolyKinded.Atom.Interpret t2 (x 'Data.PolyKinded.:&&: xs)) => Generics.Kind.SubstRep' (Generics.Kind.Field t2) x xs
- Generics.Kind: newtype M1 i (c :: Meta) (f :: k -> Type) (p :: k) :: forall k. () => Type -> Meta -> k -> Type -> k -> Type
+ Generics.Kind: data U1 (p :: k)
+ Generics.Kind: data V1 (p :: k)
+ Generics.Kind: instance forall d (k :: GHC.Types.Constraint) (t :: Data.PolyKinded.Atom.Atom d GHC.Types.Constraint) (tys :: Data.PolyKinded.LoT d) (f :: * -> *) (f' :: Data.PolyKinded.LoT d -> *). (k GHC.Types.~ Data.PolyKinded.Atom.Interpret t tys, Generics.Kind.Conv f f' tys) => Generics.Kind.Conv (k GHC.Generics.Extra.:=>: f) (t Generics.Kind.:=>: f') tys
+ Generics.Kind: instance forall d k (t :: Data.PolyKinded.Atom.Atom d *) (tys :: Data.PolyKinded.LoT d) p. (k GHC.Types.~ Data.PolyKinded.Atom.Interpret t tys) => Generics.Kind.Conv (GHC.Generics.K1 p k) (Generics.Kind.Field t) tys
+ Generics.Kind: instance forall t k (x :: t) (xs :: Data.PolyKinded.LoT k). Generics.Kind.SubstRep' GHC.Generics.U1 x xs
+ Generics.Kind: instance forall t1 k (t2 :: Data.PolyKinded.Atom.Atom (t1 -> k) *) (x :: t1) (xs :: Data.PolyKinded.LoT k). (Data.PolyKinded.Atom.Interpret (Generics.Kind.SubstAtom t2 x) xs GHC.Types.~ Data.PolyKinded.Atom.Interpret t2 (x 'Data.PolyKinded.:&&: xs)) => Generics.Kind.SubstRep' (Generics.Kind.Field t2) x xs
+ Generics.Kind: newtype M1 i (c :: Meta) (f :: k -> Type) (p :: k)
- Generics.Kind: (:*:) :: f p -> g p -> (:*:)
+ Generics.Kind: (:*:) :: f p -> g p -> (:*:) (f :: k -> Type) (g :: k -> Type) (p :: k)
- Generics.Kind: L1 :: f p -> (:+:)
+ Generics.Kind: L1 :: f p -> (:+:) (f :: k -> Type) (g :: k -> Type) (p :: k)
- Generics.Kind: M1 :: f p -> M1 i
+ Generics.Kind: M1 :: f p -> M1 i (c :: Meta) (f :: k -> Type) (p :: k)
- Generics.Kind: R1 :: g p -> (:+:)
+ Generics.Kind: R1 :: g p -> (:+:) (f :: k -> Type) (g :: k -> Type) (p :: k)
- Generics.Kind: U1 :: U1
+ Generics.Kind: U1 :: U1 (p :: k)
- Generics.Kind: [Exists] :: forall (t :: k) d (f :: LoT (k -> d) -> *) (x :: LoT d). {unExists :: f (t :&&: x)} -> Exists k f x
+ Generics.Kind: [Exists] :: forall k (t :: k) d (f :: LoT (k -> d) -> *) (x :: LoT d). {unExists :: f (t :&&: x)} -> Exists k f x
- Generics.Kind: [unM1] :: M1 i -> f p
+ Generics.Kind: [unM1] :: M1 i (c :: Meta) (f :: k -> Type) (p :: k) -> f p
- Generics.Kind: type GenericN n t f x = (GenericK f, 'TyEnv f x ~ (SplitN n t), t ~ (f :@@: x))
+ Generics.Kind: type GenericN n t f x = (GenericK f, 'TyEnv f x ~ (SplitN n t), t ~ (f :@@: x))

Files

kind-generics.cabal view
@@ -1,6 +1,6 @@ cabal-version:       >=1.10 name:                kind-generics-version:             0.4.0.0+version:             0.4.1.0 synopsis:            Generic programming in GHC style for arbitrary kinds and GADTs. description:         This package provides functionality to extend the data type generic programming functionality in GHC to classes of arbitrary kind, and constructors featuring constraints and existentials, as usually found in GADTs. -- bug-reports:
src/Generics/Kind.hs view
@@ -75,7 +75,7 @@ -- > instance GenericK E LoT0 where -- >   type RepK E = Exists (*) (Field Var0) data Exists k (f :: LoT (k -> d) -> *) (x :: LoT d) where-  Exists :: forall (t :: k) d (f :: LoT (k -> d) -> *) (x :: LoT d)+  Exists :: forall k (t :: k) d (f :: LoT (k -> d) -> *) (x :: LoT d)           .{ unExists :: f (t ':&&: x) } -> Exists k f x deriving instance (forall t. Show (f (t ':&&: x))) => Show (Exists k f x)