category 0.2.1.0 → 0.2.2.0
raw patch · 5 files changed
+155/−2 lines, 5 filesdep +transformersPVP ok
version bump matches the API change (PVP)
Dependencies added: transformers
API changes (from Hackage documentation)
+ Control.Categorical.Monad: instance forall k1 k2 (s :: k2 -> k2 -> *) (m :: k1 -> k2). Control.Category.Category s => Control.Categorical.Functor.Functor (Control.Category.Dual.Dual s) (Control.Categorical.Functor.NT (->)) (Control.Categorical.Monad.Kleisli s m)
+ Control.Categorical.Monad: instance forall k1 k2 (s :: k2 -> k2 -> *) (t :: k1 -> k1 -> *) (m :: k2 -> k1) (a :: k1). Control.Categorical.Functor.Functor s t m => Control.Categorical.Functor.Functor s (->) (Control.Categorical.Monad.Kleisli t m a)
+ Control.Categorical.Monad: instance forall k1 k2 (s :: k2 -> k2 -> *) (t :: k1 -> k1 -> *) (ɯ :: k2 -> k1). Control.Categorical.Functor.Functor s t ɯ => Control.Categorical.Functor.Functor (Control.Category.Dual.Dual s) (Control.Categorical.Functor.NT (->)) (Control.Categorical.Monad.Cokleisli t ɯ)
+ Control.Categorical.Monad: instance forall k1 k2 (s :: k2 -> k2 -> *) (ɯ :: k1 -> k2) (a :: k1). Control.Category.Category s => Control.Categorical.Functor.Functor s (->) (Control.Categorical.Monad.Cokleisli s ɯ a)
+ Control.Categorical.Monad: instance forall β (s :: β -> β -> *) (m :: β -> β). Control.Categorical.Monad.Monad s m => Control.Categorical.Functor.Functor (Control.Categorical.Monad.Kleisli s m) s m
+ Control.Categorical.Monad: instance forall β (s :: β -> β -> *) (ɯ :: β -> β). Control.Categorical.Monad.Comonad s ɯ => Control.Categorical.Functor.Functor (Control.Categorical.Monad.Cokleisli s ɯ) s ɯ
+ Data.Functor.Trans.Identity: IdentityT :: f a -> IdentityT f a
+ Data.Functor.Trans.Identity: [runIdentityT] :: IdentityT f a -> f a
+ Data.Functor.Trans.Identity: instance Control.Categorical.Functor.Functor (Control.Categorical.Functor.NT (->)) (Control.Categorical.Functor.NT (->)) Data.Functor.Trans.Identity.IdentityT
+ Data.Functor.Trans.Identity: instance Control.Categorical.Monad.Comonad (->) f => Control.Categorical.Monad.Comonad (->) (Data.Functor.Trans.Identity.IdentityT f)
+ Data.Functor.Trans.Identity: instance Control.Categorical.Monad.Comonad (->) ɯ => Control.Categorical.Functor.Functor (Control.Categorical.Functor.NT (Control.Categorical.Monad.Cokleisli (->) ɯ)) (Control.Categorical.Functor.NT (Control.Categorical.Monad.Cokleisli (->) ɯ)) Data.Functor.Trans.Identity.IdentityT
+ Data.Functor.Trans.Identity: instance Control.Categorical.Monad.Comonad (->) ɯ => Control.Categorical.Monad.Comonad (Control.Categorical.Functor.NT (Control.Categorical.Monad.Cokleisli (->) ɯ)) Data.Functor.Trans.Identity.IdentityT
+ Data.Functor.Trans.Identity: instance Control.Categorical.Monad.Comonad (->) ɯ => Control.Categorical.Monad.Monad (Control.Categorical.Functor.NT (Control.Categorical.Monad.Cokleisli (->) ɯ)) Data.Functor.Trans.Identity.IdentityT
+ Data.Functor.Trans.Identity: instance Control.Categorical.Monad.Comonad (Control.Categorical.Functor.NT (->)) Data.Functor.Trans.Identity.IdentityT
+ Data.Functor.Trans.Identity: instance Control.Categorical.Monad.Monad (->) f => Control.Categorical.Monad.Monad (->) (Data.Functor.Trans.Identity.IdentityT f)
+ Data.Functor.Trans.Identity: instance Control.Categorical.Monad.Monad (->) m => Control.Categorical.Functor.Functor (Control.Categorical.Functor.NT (Control.Categorical.Monad.Kleisli (->) m)) (Control.Categorical.Functor.NT (Control.Categorical.Monad.Kleisli (->) m)) Data.Functor.Trans.Identity.IdentityT
+ Data.Functor.Trans.Identity: instance Control.Categorical.Monad.Monad (->) m => Control.Categorical.Monad.Comonad (Control.Categorical.Functor.NT (Control.Categorical.Monad.Kleisli (->) m)) Data.Functor.Trans.Identity.IdentityT
+ Data.Functor.Trans.Identity: instance Control.Categorical.Monad.Monad (->) m => Control.Categorical.Monad.Monad (Control.Categorical.Functor.NT (Control.Categorical.Monad.Kleisli (->) m)) Data.Functor.Trans.Identity.IdentityT
+ Data.Functor.Trans.Identity: instance Control.Categorical.Monad.Monad (Control.Categorical.Functor.NT (->)) Data.Functor.Trans.Identity.IdentityT
+ Data.Functor.Trans.Identity: instance forall k (s :: k -> k -> *) (f :: k -> *). Control.Categorical.Functor.Functor s (->) f => Control.Categorical.Functor.Functor s (->) (Data.Functor.Trans.Identity.IdentityT f)
+ Data.Functor.Trans.Identity: instance forall k (s :: k -> k -> *) (m :: * -> *) (f :: k -> *). (Control.Categorical.Functor.Functor s (Control.Categorical.Monad.Kleisli (->) m) f, Control.Categorical.Functor.Endofunctor (->) m) => Control.Categorical.Functor.Functor s (Control.Categorical.Monad.Kleisli (->) m) (Data.Functor.Trans.Identity.IdentityT f)
+ Data.Functor.Trans.Identity: instance forall k (s :: k -> k -> *) (ɯ :: * -> *) (f :: k -> *). (Control.Categorical.Functor.Functor s (Control.Categorical.Monad.Cokleisli (->) ɯ) f, Control.Categorical.Functor.Endofunctor (->) ɯ) => Control.Categorical.Functor.Functor s (Control.Categorical.Monad.Cokleisli (->) ɯ) (Data.Functor.Trans.Identity.IdentityT f)
+ Data.Functor.Trans.Identity: newtype IdentityT f a
+ Data.Functor.Trans.Reader: ReaderT :: (r `s` f a) -> ReaderT s r f a
+ Data.Functor.Trans.Reader: [runReaderT] :: ReaderT s r f a -> r `s` f a
+ Data.Functor.Trans.Reader: instance Control.Categorical.Monad.Comonad (->) ɯ => Control.Categorical.Monad.Comonad (->) (Data.Functor.Trans.Reader.ReaderT (,) r ɯ)
+ Data.Functor.Trans.Reader: instance Control.Categorical.Monad.Monad (->) f => Control.Categorical.Monad.Monad (->) (Data.Functor.Trans.Reader.ReaderT (->) r f)
+ Data.Functor.Trans.Reader: instance forall k1 k2 (s :: k2 -> * -> *) (r :: k2). Control.Categorical.Monad.Comonad (->) (s r) => Control.Categorical.Monad.Comonad (Control.Categorical.Functor.NT (->)) (Data.Functor.Trans.Reader.ReaderT s r)
+ Data.Functor.Trans.Reader: instance forall k1 k2 (s :: k2 -> * -> *) (r :: k2). Control.Categorical.Monad.Monad (->) (s r) => Control.Categorical.Monad.Monad (Control.Categorical.Functor.NT (->)) (Data.Functor.Trans.Reader.ReaderT s r)
+ Data.Functor.Trans.Reader: instance forall k1 k2 (s :: k2 -> k2 -> *) (t :: k1 -> k1 -> *) (f :: k2 -> k1) (r :: k1). Control.Categorical.Functor.Functor s t f => Control.Categorical.Functor.Functor s (->) (Data.Functor.Trans.Reader.ReaderT t r f)
+ Data.Functor.Trans.Reader: instance forall k1 k2 (t :: k2 -> k2 -> *) (f :: k2 -> *) (s :: k1 -> * -> *) (r :: k1). (Control.Categorical.Functor.Functor t (->) f, Control.Categorical.Functor.Functor (->) (->) (s r)) => Control.Categorical.Functor.Functor t (->) (Data.Functor.Trans.Reader.ReaderT s r f)
+ Data.Functor.Trans.Reader: instance forall k1 k2 k3 (t :: k3 -> k3 -> *) (s :: k2 -> k3 -> *) (r :: k2). Control.Categorical.Functor.Functor t (->) (s r) => Control.Categorical.Functor.Functor (Control.Categorical.Functor.NT t) (Control.Categorical.Functor.NT (->)) (Data.Functor.Trans.Reader.ReaderT s r)
+ Data.Functor.Trans.Reader: instance forall k1 k2 k3 (t :: k3 -> k3 -> *) (s :: k3 -> k2 -> *). Control.Categorical.Functor.Functor t (Control.Categorical.Functor.NT (->)) s => Control.Categorical.Functor.Functor t (Control.Categorical.Functor.NT (Control.Categorical.Functor.NT (->))) (Data.Functor.Trans.Reader.ReaderT s)
+ Data.Functor.Trans.Reader: newtype ReaderT s r f a
+ Data.Functor.Trans.Writer: WriterT :: f (p w a) -> WriterT p w f a
+ Data.Functor.Trans.Writer: [runWriterT] :: WriterT p w f a -> f (p w a)
+ Data.Functor.Trans.Writer: instance (GHC.Base.Monoid w, Control.Categorical.Monad.Monad (->) f) => Control.Categorical.Monad.Monad (->) (Data.Functor.Trans.Writer.WriterT (,) w f)
+ Data.Functor.Trans.Writer: instance Control.Categorical.Monad.Monad (->) f => Control.Categorical.Monad.Monad (->) (Data.Functor.Trans.Writer.WriterT Data.Either.Either w f)
+ Data.Functor.Trans.Writer: instance forall k (p :: k -> * -> *) (w :: k) (f :: * -> *). (Control.Categorical.Monad.Comonad (->) (p w), Control.Categorical.Monad.Comonad (->) f) => Control.Categorical.Monad.Comonad (->) (Data.Functor.Trans.Writer.WriterT p w f)
+ Data.Functor.Trans.Writer: instance forall k1 k2 (f :: * -> *) (s :: k2 -> k2 -> *) (p :: k1 -> k2 -> *) (w :: k1). (Control.Categorical.Functor.Functor (->) (->) f, Control.Categorical.Functor.Functor s (->) (p w)) => Control.Categorical.Functor.Functor s (->) (Data.Functor.Trans.Writer.WriterT p w f)
+ Data.Functor.Trans.Writer: instance forall k1 k2 k3 (p :: k1 -> k2 -> k3) (w :: k1). Control.Categorical.Functor.Functor (Control.Categorical.Functor.NT (->)) (Control.Categorical.Functor.NT (->)) (Data.Functor.Trans.Writer.WriterT p w)
+ Data.Functor.Trans.Writer: newtype WriterT p w f a
Files
- Control/Categorical/Monad.hs +19/−0
- Data/Functor/Trans/Identity.hs +57/−0
- Data/Functor/Trans/Reader.hs +37/−0
- Data/Functor/Trans/Writer.hs +25/−0
- category.cabal +17/−2
Control/Categorical/Monad.hs view
@@ -8,6 +8,7 @@ import Data.Semigroup (Arg (..)) import Control.Categorical.Functor+import Control.Category.Dual infixr 1 >=>, <=<, =>=, =<= @@ -79,3 +80,21 @@ instance Comonad (->) (Arg a) where counit (Arg _ b) = b cut (Arg a b) = Arg a (Arg a b)++instance Functor s t m => Functor s (->) (Kleisli t m a) where+ map f (Kleisli φ) = Kleisli (map f . φ)++instance Category s => Functor s (->) (Cokleisli s ɯ a) where+ map f (Cokleisli φ) = Cokleisli (f . φ)++instance Category s => Functor (Dual s) (NT (->)) (Kleisli s m) where+ map (Dual f) = NT (\ (Kleisli φ) -> Kleisli (φ . f))++instance Functor s t ɯ => Functor (Dual s) (NT (->)) (Cokleisli t ɯ) where+ map (Dual f) = NT (\ (Cokleisli φ) -> Cokleisli (φ . map f))++instance Monad s m => Functor (Kleisli s m) s m where+ map = bind . kleisli++instance Comonad s ɯ => Functor (Cokleisli s ɯ) s ɯ where+ map = cobind . cokleisli
+ Data/Functor/Trans/Identity.hs view
@@ -0,0 +1,57 @@+module Data.Functor.Trans.Identity where++import Control.Categorical.Functor+import Control.Categorical.Monad++newtype IdentityT f a = IdentityT { runIdentityT :: f a }++instance Functor (NT (->)) (NT (->)) IdentityT where+ map f = NT (\ (IdentityT x) -> IdentityT (nt f x))++instance Monad (->) m => Functor (NT (Kleisli (->) m)) (NT (Kleisli (->) m)) IdentityT where+ map f = NT (Kleisli (map IdentityT . kleisli (nt f) . runIdentityT))++instance Comonad (->) ɯ => Functor (NT (Cokleisli (->) ɯ)) (NT (Cokleisli (->) ɯ)) IdentityT where+ map f = NT (Cokleisli (IdentityT . cokleisli (nt f) . map runIdentityT))++instance Monad (NT (->)) IdentityT where+ unit = NT IdentityT+ join = NT runIdentityT++instance Comonad (NT (->)) IdentityT where+ counit = NT runIdentityT+ cut = NT IdentityT++instance Monad (->) m => Monad (NT (Kleisli (->) m)) IdentityT where+ unit = NT (Kleisli (unit . IdentityT))+ join = NT (Kleisli (unit . runIdentityT))++instance Comonad (->) ɯ => Monad (NT (Cokleisli (->) ɯ)) IdentityT where+ unit = NT (Cokleisli (IdentityT . counit))+ join = NT (Cokleisli (runIdentityT . counit))++instance Comonad (->) ɯ => Comonad (NT (Cokleisli (->) ɯ)) IdentityT where+ counit = NT (Cokleisli (runIdentityT . counit))+ cut = NT (Cokleisli (IdentityT . counit))++instance Monad (->) m => Comonad (NT (Kleisli (->) m)) IdentityT where+ counit = NT (Kleisli (unit . runIdentityT))+ cut = NT (Kleisli (unit . IdentityT))++deriving instance Functor s (->) f => Functor s (->) (IdentityT f)++instance Monad (->) f => Monad (->) (IdentityT f) where+ unit = IdentityT . unit+ join = IdentityT . bind runIdentityT . runIdentityT++instance Comonad (->) f => Comonad (->) (IdentityT f) where+ counit = counit . runIdentityT+ cut = runIdentityT . cobind runIdentityT . IdentityT++instance (Functor s (Kleisli (->) m) f, Endofunctor (->) m) =>+ Functor s (Kleisli (->) m) (IdentityT f) where+ map f = Kleisli (map IdentityT . kleisli (map f) . runIdentityT)++instance (Functor s (Cokleisli (->) ɯ) f, Endofunctor (->) ɯ) =>+ Functor s (Cokleisli (->) ɯ) (IdentityT f) where+ map f = Cokleisli (IdentityT . cokleisli (map f) . map runIdentityT)
+ Data/Functor/Trans/Reader.hs view
@@ -0,0 +1,37 @@+{-# LANGUAGE RankNTypes #-}++module Data.Functor.Trans.Reader where++import Control.Categorical.Functor+import Control.Categorical.Monad+import Data.Function (flip)++newtype ReaderT s r f a = ReaderT { runReaderT :: r `s` f a }++instance {-# INCOHERENT #-} Functor s t f => Functor s (->) (ReaderT t r f) where+ map f (ReaderT x) = ReaderT (map f . x)++instance (Functor t (->) f, Functor (->) (->) (s r)) => Functor t (->) (ReaderT s r f) where+ map f (ReaderT x) = ReaderT ((map f :: _ -> _) <$> x)++instance Monad (->) f => Monad (->) (ReaderT (->) r f) where+ unit = ReaderT . unit . unit+ join (ReaderT x) = ReaderT (\ r -> (flip id r >=> flip runReaderT r) x)++instance Comonad (->) ɯ => Comonad (->) (ReaderT (,) r ɯ) where+ counit = counit . counit . runReaderT+ cut (ReaderT (r, x)) = ReaderT (r, cobind (ReaderT . (,) r) x)++instance (Functor t (->) (s r)) => Functor (NT t) (NT (->)) (ReaderT s r) where+ map f = NT (\ (ReaderT x) -> ReaderT (nt f <$> x))++instance Monad (->) (s r) => Monad (NT (->)) (ReaderT s r) where+ unit = NT (ReaderT . unit)+ join = NT (ReaderT . bind runReaderT . runReaderT)++instance Comonad (->) (s r) => Comonad (NT (->)) (ReaderT s r) where+ counit = NT (counit . runReaderT)+ cut = NT (ReaderT . cobind ReaderT . runReaderT)++instance Functor t (NT (->)) s => Functor t (NT (NT (->))) (ReaderT s) where+ map f = NT (NT (\ (ReaderT x) -> ReaderT (nt (map f) x)))
+ Data/Functor/Trans/Writer.hs view
@@ -0,0 +1,25 @@+module Data.Functor.Trans.Writer where++import Control.Categorical.Functor+import Control.Categorical.Monad++newtype WriterT p w f a = WriterT { runWriterT :: f (p w a) }++instance (Functor (->) (->) f, Functor s (->) (p w)) => Functor s (->) (WriterT p w f) where+ map f (WriterT x) = WriterT ((map f :: _ -> _) <$> x)++instance (Monoid w, Monad (->) f) => Monad (->) (WriterT (,) w f) where+ unit = WriterT . unit . unit+ join = WriterT . bind (\ (w, WriterT y) -> map (\ (w', a) -> (w <> w', a)) y) . runWriterT++instance (Comonad (->) (p w), Comonad (->) f) => Comonad (->) (WriterT p w f) where+ counit = counit . counit . runWriterT+ cut = WriterT . cobind (\ x -> (\ _ -> WriterT x) <$> counit x) . runWriterT++instance Monad (->) f => Monad (->) (WriterT Either w f) where+ unit = WriterT . unit . unit+ join = WriterT . bind (\ case Left w -> unit (Left w)+ Right (WriterT x) -> x) . runWriterT++instance Functor (NT (->)) (NT (->)) (WriterT p w) where+ map f = NT (\ (WriterT x) -> WriterT (nt f x))
category.cabal view
@@ -1,5 +1,5 @@ name: category-version: 0.2.1.0+version: 0.2.2.0 synopsis: Categorical types and classes -- description: license: BSD3@@ -19,22 +19,37 @@ , Control.Category.Const2 , Control.Category.Dual , Control.Category.Groupoid+ , Data.Functor.Trans.Identity+ , Data.Functor.Trans.Reader+ , Data.Functor.Trans.Writer , Data.Morphism.Endo , Data.Morphism.Iso other-modules: Prelude build-depends: base >=4.10 && <5 , alg >=0.2 && <0.3+ , transformers >= 0.5 && < 0.6 default-language: Haskell2010 default-extensions: UnicodeSyntax , LambdaCase+ , PartialTypeSignatures , TypeOperators , PolyKinds , ConstraintKinds , MultiParamTypeClasses , FlexibleContexts , FlexibleInstances+ , DerivingStrategies+ , StandaloneDeriving , GeneralizedNewtypeDeriving- ghc-options: -Wall -Wno-name-shadowing+ ghc-options: -Wall -Wcompat -Wredundant-constraints -Wno-name-shadowing+ -Wincomplete-record-updates -Wincomplete-uni-patterns+ -Werror=incomplete-patterns+ -Werror=incomplete-uni-patterns+ -Werror=incomplete-record-updates+ -Werror=missing-fields+ -Werror=missing-methods+ -Wno-partial-type-signatures+ -Wno-simplifiable-class-constraints source-repository head type: git