packages feed

categories 0.54.1 → 0.55.0

raw patch · 2 files changed

+7/−22 lines, 2 filesdep +voidPVP ok

version bump matches the API change (PVP)

Dependencies added: void

API changes (from Hackage documentation)

- Control.Categorical.Functor: instance (Functor f (->) (->)) => Functor (LoweredFunctor f)
- Control.Categorical.Functor: instance (Functor f (~>) (~>)) => EndoFunctor f (~>)
- Control.Categorical.Functor: instance (Functor f) => Functor (LiftedFunctor f) (->) (->)
- Control.Categorical.Functor: instance (Read (f a)) => Read (LiftedFunctor f a)
- Control.Categorical.Functor: instance (Read (f a)) => Read (LoweredFunctor f a)
- Control.Categorical.Functor: instance (Show (f a)) => Show (LiftedFunctor f a)
- Control.Categorical.Functor: instance (Show (f a)) => Show (LoweredFunctor f a)
- Control.Categorical.Functor: instance (Typeable1 f) => Typeable1 (LiftedFunctor f)
- Control.Categorical.Functor: instance (Typeable1 f) => Typeable1 (LoweredFunctor f)
- Control.Category.Dual: instance (Category k) => Category (Dual k)
- Control.Category.Dual: instance (Typeable2 (~>)) => Typeable2 (Dual (~>))
- Data.Void: data Void
- Data.Void: void :: Void -> a
+ Control.Categorical.Functor: instance Functor f (->) (->) => Functor (LoweredFunctor f)
+ Control.Categorical.Functor: instance Functor f (~>) (~>) => EndoFunctor f (~>)
+ Control.Categorical.Functor: instance Functor f => Functor (LiftedFunctor f) (->) (->)
+ Control.Categorical.Functor: instance Read (f a) => Read (LiftedFunctor f a)
+ Control.Categorical.Functor: instance Read (f a) => Read (LoweredFunctor f a)
+ Control.Categorical.Functor: instance Show (f a) => Show (LiftedFunctor f a)
+ Control.Categorical.Functor: instance Show (f a) => Show (LoweredFunctor f a)
+ Control.Categorical.Functor: instance Typeable1 f => Typeable1 (LiftedFunctor f)
+ Control.Categorical.Functor: instance Typeable1 f => Typeable1 (LoweredFunctor f)
+ Control.Category.Dual: instance Category k => Category (Dual k)
+ Control.Category.Dual: instance Typeable2 (~>) => Typeable2 (Dual (~>))
- Control.Categorical.Bifunctor: bimap :: (Bifunctor p r s t) => r a b -> s c d -> t (p a c) (p b d)
+ Control.Categorical.Bifunctor: bimap :: Bifunctor p r s t => r a b -> s c d -> t (p a c) (p b d)
- Control.Categorical.Bifunctor: difirst :: (PFunctor f (Dual s) t) => s b a -> t (f a c) (f b c)
+ Control.Categorical.Bifunctor: difirst :: PFunctor f (Dual s) t => s b a -> t (f a c) (f b c)
- Control.Categorical.Bifunctor: dimap :: (Bifunctor f (Dual s) t u) => s b a -> t c d -> u (f a c) (f b d)
+ Control.Categorical.Bifunctor: dimap :: Bifunctor f (Dual s) t u => s b a -> t c d -> u (f a c) (f b d)
- Control.Categorical.Bifunctor: first :: (PFunctor p r t) => r a b -> t (p a c) (p b c)
+ Control.Categorical.Bifunctor: first :: PFunctor p r t => r a b -> t (p a c) (p b c)
- Control.Categorical.Bifunctor: firstDefault :: (Bifunctor p r s t) => r a b -> t (p a c) (p b c)
+ Control.Categorical.Bifunctor: firstDefault :: Bifunctor p r s t => r a b -> t (p a c) (p b c)
- Control.Categorical.Bifunctor: second :: (QFunctor q s t) => s a b -> t (q c a) (q c b)
+ Control.Categorical.Bifunctor: second :: QFunctor q s t => s a b -> t (q c a) (q c b)
- Control.Categorical.Bifunctor: secondDefault :: (Bifunctor p r s t) => s a b -> t (p c a) (p c b)
+ Control.Categorical.Bifunctor: secondDefault :: Bifunctor p r s t => s a b -> t (p c a) (p c b)
- Control.Categorical.Functor: class (Functor f ~> ~>) => EndoFunctor f ~>
+ Control.Categorical.Functor: class Functor f ~> ~> => EndoFunctor f ~>
- Control.Categorical.Functor: fmap :: (Functor f r t) => r a b -> t (f a) (f b)
+ Control.Categorical.Functor: fmap :: Functor f r t => r a b -> t (f a) (f b)
- Control.Categorical.Object: class (Category ~>) => HasInitialObject ~> where { type family Initial ~> :: *; }
+ Control.Categorical.Object: class Category ~> => HasInitialObject ~> where { type family Initial ~> :: *; }
- Control.Categorical.Object: class (Category ~>) => HasTerminalObject ~> where { type family Terminal ~> :: *; }
+ Control.Categorical.Object: class Category ~> => HasTerminalObject ~> where { type family Terminal ~> :: *; }
- Control.Categorical.Object: initiate :: (HasInitialObject ~>) => Initial ~> ~> a
+ Control.Categorical.Object: initiate :: HasInitialObject ~> => Initial ~> ~> a
- Control.Categorical.Object: terminate :: (HasTerminalObject ~>) => a ~> Terminal ~>
+ Control.Categorical.Object: terminate :: HasTerminalObject ~> => a ~> Terminal ~>
- Control.Category.Associative: associate :: (Associative k p) => k (p (p a b) c) (p a (p b c))
+ Control.Category.Associative: associate :: Associative k p => k (p (p a b) c) (p a (p b c))
- Control.Category.Associative: class (Bifunctor p k k k) => Associative k p
+ Control.Category.Associative: class Bifunctor p k k k => Associative k p
- Control.Category.Associative: class (Bifunctor s k k k) => Disassociative k s
+ Control.Category.Associative: class Bifunctor s k k k => Disassociative k s
- Control.Category.Associative: disassociate :: (Disassociative k s) => k (s a (s b c)) (s (s a b) c)
+ Control.Category.Associative: disassociate :: Disassociative k s => k (s a (s b c)) (s (s a b) c)
- Control.Category.Braided: braid :: (Braided k p) => k (p a b) (p b a)
+ Control.Category.Braided: braid :: Braided k p => k (p a b) (p b a)
- Control.Category.Braided: class (Braided k p) => Symmetric k p
+ Control.Category.Braided: class Braided k p => Symmetric k p
- Control.Category.Braided: swap :: (Symmetric k p) => k (p a b) (p b a)
+ Control.Category.Braided: swap :: Symmetric k p => k (p a b) (p b a)
- Control.Category.Cartesian: (&&&) :: (PreCartesian k) => (a k b) -> (a k c) -> a k Product k b c
+ Control.Category.Cartesian: (&&&) :: PreCartesian k => (a k b) -> (a k c) -> a k Product k b c
- Control.Category.Cartesian: (|||) :: (PreCoCartesian k) => (a k c) -> (b k c) -> Sum k a b k c
+ Control.Category.Cartesian: (|||) :: PreCoCartesian k => (a k c) -> (b k c) -> Sum k a b k c
- Control.Category.Cartesian: associateProduct :: (PreCartesian k) => Product k (Product k a b) c k Product k a (Product k b c)
+ Control.Category.Cartesian: associateProduct :: PreCartesian k => Product k (Product k a b) c k Product k a (Product k b c)
- Control.Category.Cartesian: associateSum :: (PreCoCartesian k) => Sum k (Sum k a b) c k Sum k a (Sum k b c)
+ Control.Category.Cartesian: associateSum :: PreCoCartesian k => Sum k (Sum k a b) c k Sum k a (Sum k b c)
- Control.Category.Cartesian: braidProduct :: (PreCartesian k) => Product k a b k Product k b a
+ Control.Category.Cartesian: braidProduct :: PreCartesian k => Product k a b k Product k b a
- Control.Category.Cartesian: class (Associative k (Product k), Disassociative k (Product k), Symmetric k (Product k), Braided k (Product k)) => PreCartesian k where { type family Product k :: * -> * -> *; { f &&& g = bimap f g . diag diag = id &&& id } }
+ Control.Category.Cartesian: class (Associative k (Product k), Disassociative k (Product k), Symmetric k (Product k), Braided k (Product k)) => PreCartesian k where { type family Product k :: * -> * -> *; { diag = id &&& id f &&& g = bimap f g . diag } }
- Control.Category.Cartesian: class (Associative k (Sum k), Disassociative k (Sum k), Symmetric k (Product k), Braided k (Sum k)) => PreCoCartesian k where { type family Sum k :: * -> * -> *; { f ||| g = codiag . bimap f g codiag = id ||| id } }
+ Control.Category.Cartesian: class (Associative k (Sum k), Disassociative k (Sum k), Symmetric k (Product k), Braided k (Sum k)) => PreCoCartesian k where { type family Sum k :: * -> * -> *; { codiag = id ||| id f ||| g = codiag . bimap f g } }
- Control.Category.Cartesian: codiag :: (PreCoCartesian k) => Sum k a a k a
+ Control.Category.Cartesian: codiag :: PreCoCartesian k => Sum k a a k a
- Control.Category.Cartesian: diag :: (PreCartesian k) => a k Product k a a
+ Control.Category.Cartesian: diag :: PreCartesian k => a k Product k a a
- Control.Category.Cartesian: disassociateProduct :: (PreCartesian k) => Product k a (Product k b c) k Product k (Product k a b) c
+ Control.Category.Cartesian: disassociateProduct :: PreCartesian k => Product k a (Product k b c) k Product k (Product k a b) c
- Control.Category.Cartesian: disassociateSum :: (PreCoCartesian k) => Sum k a (Sum k b c) k Sum k (Sum k a b) c
+ Control.Category.Cartesian: disassociateSum :: PreCoCartesian k => Sum k a (Sum k b c) k Sum k (Sum k a b) c
- Control.Category.Cartesian: fst :: (PreCartesian k) => Product k a b k a
+ Control.Category.Cartesian: fst :: PreCartesian k => Product k a b k a
- Control.Category.Cartesian: inl :: (PreCoCartesian k) => a k Sum k a b
+ Control.Category.Cartesian: inl :: PreCoCartesian k => a k Sum k a b
- Control.Category.Cartesian: inr :: (PreCoCartesian k) => b k Sum k a b
+ Control.Category.Cartesian: inr :: PreCoCartesian k => b k Sum k a b
- Control.Category.Cartesian: snd :: (PreCartesian k) => Product k a b k b
+ Control.Category.Cartesian: snd :: PreCartesian k => Product k a b k b
- Control.Category.Cartesian.Closed: apply :: (CCC <=) => (Product <= (Exp <= a b) a) <= b
+ Control.Category.Cartesian.Closed: apply :: CCC <= => (Product <= (Exp <= a b) a) <= b
- Control.Category.Cartesian.Closed: coapply :: (CoCCC <=) => b <= Sum <= (Coexp <= a b) a
+ Control.Category.Cartesian.Closed: coapply :: CoCCC <= => b <= Sum <= (Coexp <= a b) a
- Control.Category.Cartesian.Closed: cocurry :: (CoCCC <=) => (c <= Sum <= a b) -> (Coexp <= b c <= a)
+ Control.Category.Cartesian.Closed: cocurry :: CoCCC <= => (c <= Sum <= a b) -> (Coexp <= b c <= a)
- Control.Category.Cartesian.Closed: counitCCC :: (CCC <=) => (Product <= b (Exp <= b a)) <= a
+ Control.Category.Cartesian.Closed: counitCCC :: CCC <= => (Product <= b (Exp <= b a)) <= a
- Control.Category.Cartesian.Closed: curry :: (CCC <=) => ((Product <= a b) <= c) -> a <= Exp <= b c
+ Control.Category.Cartesian.Closed: curry :: CCC <= => ((Product <= a b) <= c) -> a <= Exp <= b c
- Control.Category.Cartesian.Closed: uncocurry :: (CoCCC <=) => (Coexp <= b c <= a) -> (c <= Sum <= a b)
+ Control.Category.Cartesian.Closed: uncocurry :: CoCCC <= => (Coexp <= b c <= a) -> (c <= Sum <= a b)
- Control.Category.Cartesian.Closed: uncurry :: (CCC <=) => (a <= (Exp <= b c)) -> (Product <=> a b <= c)
+ Control.Category.Cartesian.Closed: uncurry :: CCC <= => (a <= (Exp <= b c)) -> (Product <=> a b <= c)
- Control.Category.Cartesian.Closed: unitCCC :: (CCC <=) => a <= Exp <= b (Product <= b a)
+ Control.Category.Cartesian.Closed: unitCCC :: CCC <= => a <= Exp <= b (Product <= b a)
- Control.Category.Cartesian.Closed: unitCoCCC :: (CoCCC <=) => a <= Sum <= b (Coexp <= b a)
+ Control.Category.Cartesian.Closed: unitCoCCC :: CoCCC <= => a <= Sum <= b (Coexp <= b a)
- Control.Category.Discrete: cast :: (Category k) => Discrete a b -> k a b
+ Control.Category.Discrete: cast :: Category k => Discrete a b -> k a b
- Control.Category.Distributive: distribute :: (Distributive k) => Product k a (Sum k b c) k Sum k (Product k a b) (Product k a c)
+ Control.Category.Distributive: distribute :: Distributive k => Product k a (Sum k b c) k Sum k (Product k a b) (Product k a c)
- Control.Category.Monoidal: class (Bifunctor p k k k) => HasIdentity k p where { type family Id k p :: *; }
+ Control.Category.Monoidal: class Bifunctor p k k k => HasIdentity k p where { type family Id k p :: *; }
- Control.Category.Monoidal: coidl :: (Comonoidal k p) => k a (p (Id k p) a)
+ Control.Category.Monoidal: coidl :: Comonoidal k p => k a (p (Id k p) a)
- Control.Category.Monoidal: coidr :: (Comonoidal k p) => k a (p a (Id k p))
+ Control.Category.Monoidal: coidr :: Comonoidal k p => k a (p a (Id k p))
- Control.Category.Monoidal: idl :: (Monoidal k p) => k (p (Id k p) a) a
+ Control.Category.Monoidal: idl :: Monoidal k p => k (p (Id k p) a) a
- Control.Category.Monoidal: idr :: (Monoidal k p) => k (p a (Id k p)) a
+ Control.Category.Monoidal: idr :: Monoidal k p => k (p a (Id k p)) a

Files

− Data/Void.hs 
@@ -1,18 +0,0 @@-{-# OPTIONS_GHC -fglasgow-exts #-}--------------------------------------------------------------------------------- |--- Module      :  Data.Void--- Copyright   :  (C) 2008 Edward Kmett--- License     :  BSD-style (see the file LICENSE)------ Maintainer  :  Edward Kmett <ekmett@gmail.com>--- Stability   :  experimental--- Portability :  non-portable (empty data declaration)---------------------------------------------------------------------------------module Data.Void where--data Void--void :: Void -> a-void = undefined
categories.cabal view
@@ -1,6 +1,6 @@ name:          categories category:      Control-version:       0.54.1+version:       0.55.0 license:       BSD3 cabal-version: >= 1.2 license-file:  LICENSE@@ -29,9 +29,12 @@     Control.Category.Braided,     Control.Category.Discrete,     Control.Category.Distributive,-    Control.Category.Dual,-    Data.Void-  build-depends: base >= 4 && < 5+    Control.Category.Dual++  build-depends: +    base >= 4 && < 5,+    void >= 0.4 && < 0.5+       ghc-options: -Wall    if flag(Optimize)     ghc-options: -funbox-strict-fields -O2