Copyright	(c) Conal Elliott 2007-2013
License	BSD3
Maintainer	conal@conal.net
Stability	experimental
Portability	see LANGUAGE pragma
Safe Haskell	None
Language	Haskell98

Control.Compose

Contents

Value transformers
Specialized semantic editor combinators
Contravariant functors
Unary/unary composition
Type composition
- Unary/binary
- (->)/unary
Monoid constructors
Flip a binary constructor's type arguments
Type application
Identity
Constructor pairing
- Unary
Binary
Arrow between two constructor applications
Augment other modules

Description

Various type constructor compositions and instances for them. Some come from "Applicative Programming with Effects" http://www.soi.city.ac.uk/~ross/papers/Applicative.html

Synopsis

Value transformers

type Unop a = a -> a #

Unary functions

type Binop a = a -> a -> a #

Binary functions

Specialized semantic editor combinators

result :: Category cat => (b `cat` b') -> (a `cat` b) -> a `cat` b' #

Add post-processing

argument :: Category cat => (a' `cat` a) -> (a `cat` b) -> a' `cat` b #

Add pre-processing argument :: (a' -> a) -> ((a -> b) -> (a' -> b))

(~>) :: Category cat => (a' `cat` a) -> (b `cat` b') -> (a `cat` b) -> a' `cat` b' infixr 1 #

Add pre- and post processing

(~>*) :: (Functor p, Functor q) => (a' -> a) -> (b -> b') -> (p a -> q b) -> p a' -> q b' infixr 1 #

Like '(~>)' but specialized to functors and functions.

(<~) :: Category cat => (b `cat` b') -> (a' `cat` a) -> (a `cat` b) -> a' `cat` b' infixl 1 #

(*<~) :: (Functor p, Functor q) => (b -> b') -> (a' -> a) -> (p a -> q b) -> p a' -> q b' infixl 1 #

Contravariant functors

class ContraFunctor h where #

Contravariant functors. often useful for acceptors (consumers, sinks) of values.

Minimal complete definition

contraFmap

Methods

contraFmap :: (a -> b) -> h b -> h a #

Instances

Arrow arr => ContraFunctor (Flip arr b) #
Methods contraFmap :: (a -> b) -> Flip arr b b -> Flip arr b a #
(Arrow j, Functor f, ContraFunctor g) => ContraFunctor (Arrw j f g) #
Methods contraFmap :: (a -> b) -> Arrw j f g b -> Arrw j f g a #

bicomap :: ContraFunctor f => (a :<->: b) -> f a :<->: f b #

Bijections on contravariant functors

Unary/unary composition

newtype (g :. f) a infixl 9 #

Composition of unary type constructors

There are (at least) two useful Monoid instances, so you'll have to pick one and type-specialize it (filling in all or parts of g and/or f).

    -- standard Monoid instance for Applicative applied to Monoid
    instance (Applicative (g :. f), Monoid a) => Monoid ((g :. f) a) where
      { mempty = pure mempty; mappend = liftA2 mappend }
    -- Especially handy when g is a Monoid_f.
    instance Monoid (g (f a)) => Monoid ((g :. f) a) where
      { mempty = O mempty; mappend = inO2 mappend }

Corresponding to the first and second definitions above,

    instance (Applicative g, Monoid_f f) => Monoid_f (g :. f) where
      { mempty_f = O (pure mempty_f); mappend_f = inO2 (liftA2 mappend_f) }
    instance Monoid_f g => Monoid_f (g :. f) where
      { mempty_f = O mempty_f; mappend_f = inO2 mappend_f }

Similarly, there are two useful Functor instances and two useful ContraFunctor instances.

    instance (      Functor g,       Functor f) => Functor (g :. f) where fmap = fmapFF
    instance (ContraFunctor g, ContraFunctor f) => Functor (g :. f) where fmap = fmapCC

    instance (      Functor g, ContraFunctor f) => ContraFunctor (g :. f) where contraFmap = contraFmapFC
    instance (ContraFunctor g,       Functor f) => ContraFunctor (g :. f) where contraFmap = contraFmapCF

However, it's such a bother to define the Functor instances per composition type, I've left the fmapFF case in. If you want the fmapCC one, you're out of luck for now. I'd love to hear a good solution. Maybe someday Haskell will do Prolog-style search for instances, subgoaling the constraints, rather than just matching instance heads.

Constructors

O (g (f a))

Instances

Applicative f => Lambda f ((:.) (Flip (->) o) f) #
Methods lambda :: LambdaTy f (Flip (->) o :. f) #
Applicative f => Lambda f ((:.) f (Flip (->) o)) #
Methods lambda :: LambdaTy f (f :. Flip (->) o) #
(Functor g, Functor f) => Functor ((:.) g f) #
Methods fmap :: (a -> b) -> (g :. f) a -> (g :. f) b # (<$) :: a -> (g :. f) b -> (g :. f) a #
(Applicative g, Applicative f) => Applicative ((:.) g f) #
Methods pure :: a -> (g :. f) a # (<>) :: (g :. f) (a -> b) -> (g :. f) a -> (g :. f) b # (>) :: (g :. f) a -> (g :. f) b -> (g :. f) b # (<*) :: (g :. f) a -> (g :. f) b -> (g :. f) a #
(Foldable g, Foldable f, Functor g) => Foldable ((:.) g f) #
Methods fold :: Monoid m => (g :. f) m -> m # foldMap :: Monoid m => (a -> m) -> (g :. f) a -> m # foldr :: (a -> b -> b) -> b -> (g :. f) a -> b # foldr' :: (a -> b -> b) -> b -> (g :. f) a -> b # foldl :: (b -> a -> b) -> b -> (g :. f) a -> b # foldl' :: (b -> a -> b) -> b -> (g :. f) a -> b # foldr1 :: (a -> a -> a) -> (g :. f) a -> a # foldl1 :: (a -> a -> a) -> (g :. f) a -> a # toList :: (g :. f) a -> [a] # null :: (g :. f) a -> Bool # length :: (g :. f) a -> Int # elem :: Eq a => a -> (g :. f) a -> Bool # maximum :: Ord a => (g :. f) a -> a # minimum :: Ord a => (g :. f) a -> a # sum :: Num a => (g :. f) a -> a # product :: Num a => (g :. f) a -> a #
(Traversable g, Traversable f) => Traversable ((:.) g f) #
Methods traverse :: Applicative f => (a -> f b) -> (g :. f) a -> f ((g :. f) b) # sequenceA :: Applicative f => (g :. f) (f a) -> f ((g :. f) a) # mapM :: Monad m => (a -> m b) -> (g :. f) a -> m ((g :. f) b) # sequence :: Monad m => (g :. f) (m a) -> m ((g :. f) a) #
Functor g => Generic1 ((:.) g f) #
Associated Types type Rep1 ((:.) g f :: * -> ) :: -> * # Methods from1 :: (g :. f) a -> Rep1 (g :. f) a # to1 :: Rep1 (g :. f) a -> (g :. f) a #
(Functor h, Copair f) => Copair ((:.) h f) #
Methods cofsts :: (h :. f) a -> (h :. f) (a, b) # cosnds :: (h :. f) b -> (h :. f) (a, b) #
Title_f g => Title_f ((:.) g f) #
Methods title_f :: String -> (g :. f) a -> (g :. f) a #
(Functor h, Cozip f) => Cozip ((:.) h f) #
Methods cofsts :: (h :. f) a -> (h :. f) (a, b) # cosnds :: (h :. f) b -> (h :. f) (a, b) #
Eq (g (f a)) => Eq ((:.) g f a) #
Methods (==) :: (g :. f) a -> (g :. f) a -> Bool # (/=) :: (g :. f) a -> (g :. f) a -> Bool #
Ord (g (f a)) => Ord ((:.) g f a) #
Methods compare :: (g :. f) a -> (g :. f) a -> Ordering # (<) :: (g :. f) a -> (g :. f) a -> Bool # (<=) :: (g :. f) a -> (g :. f) a -> Bool # (>) :: (g :. f) a -> (g :. f) a -> Bool # (>=) :: (g :. f) a -> (g :. f) a -> Bool # max :: (g :. f) a -> (g :. f) a -> (g :. f) a # min :: (g :. f) a -> (g :. f) a -> (g :. f) a #
Show (g (f a)) => Show ((:.) g f a) #
Methods showsPrec :: Int -> (g :. f) a -> ShowS # show :: (g :. f) a -> String # showList :: [(g :. f) a] -> ShowS #
Generic ((:.) g f a) #
Associated Types type Rep ((:.) g f a) :: * -> * # Methods from :: (g :. f) a -> Rep ((g :. f) a) x # to :: Rep ((g :. f) a) x -> (g :. f) a #
type Rep1 ((:.) g f) #
type Rep1 ((:.) g f) = D1 (MetaData ":." "Control.Compose" "TypeCompose-0.9.12-8pdvuVL5uEI3bN8tD5X8fm" True) (C1 (MetaCons "O" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) ((:.:) g (Rec1 f))))
type Rep ((:.) g f a) #
type Rep ((:.) g f a) = D1 (MetaData ":." "Control.Compose" "TypeCompose-0.9.12-8pdvuVL5uEI3bN8tD5X8fm" True) (C1 (MetaCons "O" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (g (f a)))))

type O = (:.) #

Compatibility synonym

unO :: (g :. f) a -> g (f a) #

Unwrap a '(:.)'.

biO :: g (f a) :<->: (g :. f) a #

newtype bijection

convO :: Functor g => (b :<->: g c) -> (c :<->: f a) -> b :<->: (g :. f) a #

Compose a bijection, Functor style

coconvO :: ContraFunctor g => (b :<->: g c) -> (c :<->: f a) -> b :<->: (g :. f) a #

Compose a bijection, ContraFunctor style

inO :: (g (f a) -> g' (f' a')) -> (g :. f) a -> (g' :. f') a' #

Apply a unary function within the O constructor.

inO2 :: (g (f a) -> g' (f' a') -> g'' (f'' a'')) -> (g :. f) a -> (g' :. f') a' -> (g'' :. f'') a'' #

Apply a binary function within the O constructor.

inO3 :: (g (f a) -> g' (f' a') -> g'' (f'' a'') -> g''' (f''' a''')) -> (g :. f) a -> (g' :. f') a' -> (g'' :. f'') a'' -> (g''' :. f''') a''' #

Apply a ternary function within the O constructor.

oPure :: Applicative g => f a -> (g :. f) a #

Handy combination of O and pure.

oFmap :: Functor g' => (f a -> f' a') -> (g' :. f) a -> (g' :. f') a' #

Handy combination of inO and fmap.

oLiftA2 :: Applicative g'' => (f a -> f' a' -> f'' a'') -> (g'' :. f) a -> (g'' :. f') a' -> (g'' :. f'') a'' #

Handy combination of inO2 and liftA2.

oLiftA3 :: Applicative g''' => (f a -> f' a' -> f'' a'' -> f''' a''') -> (g''' :. f) a -> (g''' :. f') a' -> (g''' :. f'') a'' -> (g''' :. f''') a''' #

Handy combination of inO3 and liftA3.

fmapFF :: (Functor g, Functor f) => (a -> b) -> (g :. f) a -> (g :. f) b #

Used for the Functor :. Functor instance of Functor

fmapCC :: (ContraFunctor g, ContraFunctor f) => (a -> b) -> (g :. f) a -> (g :. f) b #

Used for the ContraFunctor :. ContraFunctor instance of Functor

contraFmapFC :: (Functor g, ContraFunctor f) => (b -> a) -> (g :. f) a -> (g :. f) b #

Used for the Functor :. ContraFunctor instance of Functor

contraFmapCF :: (ContraFunctor g, Functor f) => (b -> a) -> (g :. f) a -> (g :. f) b #

Used for the ContraFunctor :. Functor instance of Functor

class DistribM m n where #

Monad distributivity.

TODO: what conditions are required so that (m :. n) satisfies the monad laws?

Minimal complete definition

distribM

Methods

distribM :: n (m a) -> m (n a) #

joinDistribM :: (Monad m, Monad n, DistribM m n) => (m :. n) ((m :. n) a) -> (m :. n) a #

A candidate join for (m :. n)

bindDistribM :: (Functor m, Functor n, Monad m, Monad n, DistribM m n) => (m :. n) a -> (a -> (m :. n) b) -> (m :. n) b #

A candidate '(>>=)' for (m :. n)

returnDistribM :: (Monad m, Monad n) => a -> (m :. n) a #

joinMMT :: (Monad m, Monad n, Traversable n, Applicative m) => m (n (m (n a))) -> m (n a) #

join-like function for implicitly composed monads

joinComposeT :: (Monad m, Monad n, Traversable n, Applicative m) => (m :. n) ((m :. n) a) -> (m :. n) a #

join-like function for explicitly composed monads

Type composition

Unary/binary

newtype OO f j a b #

Composition of type constructors: unary with binary. Called StaticArrow in [1].

Constructors

OO
Fields unOO :: f (a `j` b)

Instances

(Applicative f, Category * cat) => Category * (OO f cat) #
Methods id :: cat a a # (.) :: cat b c -> cat a b -> cat a c #
(Applicative f, Arrow arr) => Arrow (OO f arr) #
Methods arr :: (b -> c) -> OO f arr b c # first :: OO f arr b c -> OO f arr (b, d) (c, d) # second :: OO f arr b c -> OO f arr (d, b) (d, c) # (***) :: OO f arr b c -> OO f arr b' c' -> OO f arr (b, b') (c, c') # (&&&) :: OO f arr b c -> OO f arr b c' -> OO f arr b (c, c') #

(->)/unary

newtype FunA h a b #

Common pattern for Arrows.

Constructors

FunA
Fields unFunA :: h a -> h b

Instances

FunAble h => Arrow (FunA h) #
Methods arr :: (b -> c) -> FunA h b c # first :: FunA h b c -> FunA h (b, d) (c, d) # second :: FunA h b c -> FunA h (d, b) (d, c) # (***) :: FunA h b c -> FunA h b' c' -> FunA h (b, b') (c, c') # (&&&) :: FunA h b c -> FunA h b c' -> FunA h b (c, c') #
FunAble h => Category * (FunA h) #
Methods id :: cat a a # (.) :: cat b c -> cat a b -> cat a c #

inFunA :: ((h a -> h b) -> h' a' -> h' b') -> FunA h a b -> FunA h' a' b' #

Apply unary function in side a FunA representation.

inFunA2 :: ((h a -> h b) -> (h' a' -> h' b') -> h'' a'' -> h'' b'') -> FunA h a b -> FunA h' a' b' -> FunA h'' a'' b'' #

Apply binary function in side a FunA representation.

class FunAble h where #

Support needed for a FunA to be an Arrow.

Minimal complete definition

arrFun, firstFun, secondFun

Methods

arrFun :: (a -> b) -> h a -> h b #

firstFun :: (h a -> h a') -> h (a, b) -> h (a', b) #

secondFun :: (h b -> h b') -> h (a, b) -> h (a, b') #

(***%) :: (h a -> h b) -> (h a' -> h b') -> h (a, a') -> h (b, b') #

(&&&%) :: (h a -> h b) -> (h a -> h b') -> h a -> h (b, b') #

Monoid constructors

class Monoid_f m where #

Simulates universal constraint forall a. Monoid (f a).

See Simulating Quantified Class Constraints (http://flint.cs.yale.edu/trifonov/papers/sqcc.pdf) Instantiate this schema wherever necessary:

   instance Monoid_f f where { mempty_f = mempty ; mappend_f = mappend }

Minimal complete definition

mempty_f, mappend_f

Methods

mempty_f :: forall a. m a #

mappend_f :: forall a. m a -> m a -> m a #

Instances

Monoid_f [] #
Methods mempty_f :: [a] # mappend_f :: [a] -> [a] -> [a] #
Monoid_f Endo #
Methods mempty_f :: Endo a # mappend_f :: Endo a -> Endo a -> Endo a #
(Monoid_f f, Monoid_f g) => Monoid_f ((:*:) f g) #
Methods mempty_f :: (f :: g) a # mappend_f :: (f :: g) a -> (f :: g) a -> (f :: g) a #
Monoid o => Monoid_f (Flip (->) o) #
Methods mempty_f :: Flip (->) o a # mappend_f :: Flip (->) o a -> Flip (->) o a -> Flip (->) o a #

Flip a binary constructor's type arguments

newtype Flip j b a #

Flip type arguments

Constructors

Flip
Fields unFlip :: a `j` b

Instances

ToOI OI #
Methods toOI :: OI b -> OI b #
Lambda IO OI #
Methods lambda :: LambdaTy IO OI #
Applicative f => Lambda f ((:.) (Flip (->) o) f) #
Methods lambda :: LambdaTy f (Flip (->) o :. f) #
Applicative f => Lambda f ((:.) f (Flip (->) o)) #
Methods lambda :: LambdaTy f (f :. Flip (->) o) #
Lambda Id (Flip (->) o) #
Methods lambda :: LambdaTy Id (Flip (->) o) #
Monoid o => Monoid_f (Flip (->) o) #
Methods mempty_f :: Flip (->) o a # mappend_f :: Flip (->) o a -> Flip (->) o a -> Flip (->) o a #
Arrow arr => ContraFunctor (Flip arr b) #
Methods contraFmap :: (a -> b) -> Flip arr b b -> Flip arr b a #
Arrow j => Copair (Flip j o) #
Methods cofsts :: Flip j o a -> Flip j o (a, b) # cosnds :: Flip j o b -> Flip j o (a, b) #
(Arrow j, Monoid_f (Flip j o)) => Pair (Flip j o) #
Methods pair :: PairTy (Flip j o) #
Title o => Title_f (Flip (->) o) #
Methods title_f :: String -> Flip (->) o a -> Flip (->) o a #
Arrow j => Cozip (Flip j o) #
Methods cofsts :: Flip j o a -> Flip j o (a, b) # cosnds :: Flip j o b -> Flip j o (a, b) #
(Arrow j, Monoid_f (Flip j o)) => Zip (Flip j o) #
Methods zip :: ZipTy (Flip j o) #
(Applicative (j a), Monoid o) => Monoid (Flip j o a) #
Methods mempty :: Flip j o a # mappend :: Flip j o a -> Flip j o a -> Flip j o a # mconcat :: [Flip j o a] -> Flip j o a #

biFlip :: (a `j` b) :<->: Flip j b a #

newtype bijection

inFlip :: ((a `j` b) -> a' `k` b') -> Flip j b a -> Flip k b' a' #

inFlip2 :: ((a `j` b) -> (a' `k` b') -> a'' `l` b'') -> Flip j b a -> Flip k b' a' -> Flip l b'' a'' #

inFlip3 :: ((a `j` b) -> (a' `k` b') -> (a'' `l` b'') -> a''' `m` b''') -> Flip j b a -> Flip k b' a' -> Flip l b'' a'' -> Flip m b''' a''' #

type OI = Flip (->) (IO ()) #

(-> IO ()) as a Flip. A ContraFunctor.

class ToOI sink where #

Convert to an OI.

Minimal complete definition

toOI

Methods

toOI :: sink b -> OI b #

Instances

ToOI OI #
Methods toOI :: OI b -> OI b #

Type application

newtype f :$ a infixr 0 #

Type application We can also drop the App constructor, but then we overlap with many other instances, like [a]. Here's a template for App-free instances.

   instance (Applicative f, Monoid a) => Monoid (f a) where
     mempty  = pure mempty
     mappend = liftA2 mappend

Constructors

App
Fields unApp :: f a

Instances

(Applicative f, Monoid m) => Monoid (App f m) #
Methods mempty :: App f m # mappend :: App f m -> App f m -> App f m # mconcat :: [App f m] -> App f m #

type App = (:$) #

Compatibility synonym for (:$).

biApp :: f a :<->: App f a #

newtype bijection

inApp :: (f a -> f' a') -> App f a -> App f' a' #

inApp2 :: (f a -> f' a' -> f'' a'') -> App f a -> App f' a' -> App f'' a'' #

Identity

newtype Id a #

Identity type constructor. Until there's a better place to find it. I'd use Control.Monad.Identity, but I don't want to introduce a dependency on mtl just for Id.

Constructors

Id a

Instances

Monad Id #
Methods (>>=) :: Id a -> (a -> Id b) -> Id b # (>>) :: Id a -> Id b -> Id b # return :: a -> Id a # fail :: String -> Id a #
Functor Id #
Methods fmap :: (a -> b) -> Id a -> Id b # (<$) :: a -> Id b -> Id a #
Applicative Id #
Methods pure :: a -> Id a # (<>) :: Id (a -> b) -> Id a -> Id b # (>) :: Id a -> Id b -> Id b # (<*) :: Id a -> Id b -> Id a #
Foldable Id #
Methods fold :: Monoid m => Id m -> m # foldMap :: Monoid m => (a -> m) -> Id a -> m # foldr :: (a -> b -> b) -> b -> Id a -> b # foldr' :: (a -> b -> b) -> b -> Id a -> b # foldl :: (b -> a -> b) -> b -> Id a -> b # foldl' :: (b -> a -> b) -> b -> Id a -> b # foldr1 :: (a -> a -> a) -> Id a -> a # foldl1 :: (a -> a -> a) -> Id a -> a # toList :: Id a -> [a] # null :: Id a -> Bool # length :: Id a -> Int # elem :: Eq a => a -> Id a -> Bool # maximum :: Ord a => Id a -> a # minimum :: Ord a => Id a -> a # sum :: Num a => Id a -> a # product :: Num a => Id a -> a #
Traversable Id #
Methods traverse :: Applicative f => (a -> f b) -> Id a -> f (Id b) # sequenceA :: Applicative f => Id (f a) -> f (Id a) # mapM :: Monad m => (a -> m b) -> Id a -> m (Id b) # sequence :: Monad m => Id (m a) -> m (Id a) #
Generic1 Id #
Associated Types type Rep1 (Id :: * -> ) :: -> * # Methods from1 :: Id a -> Rep1 Id a # to1 :: Rep1 Id a -> Id a #
Unpair Id #
Methods unpair :: UnpairTy Id # fsts :: Id (a, b) -> Id a # snds :: Id (a, b) -> Id b #
Pair Id #
Methods pair :: PairTy Id #
Unzip Id #
Methods unzip :: UnzipTy Id # fsts :: Id (a, b) -> Id a # snds :: Id (a, b) -> Id b #
Zip Id #
Methods zip :: ZipTy Id #
Lambda Id (Flip (->) o) #
Methods lambda :: LambdaTy Id (Flip (->) o) #
Eq a => Eq (Id a) #
Methods (==) :: Id a -> Id a -> Bool # (/=) :: Id a -> Id a -> Bool #
Ord a => Ord (Id a) #
Methods compare :: Id a -> Id a -> Ordering # (<) :: Id a -> Id a -> Bool # (<=) :: Id a -> Id a -> Bool # (>) :: Id a -> Id a -> Bool # (>=) :: Id a -> Id a -> Bool # max :: Id a -> Id a -> Id a # min :: Id a -> Id a -> Id a #
Show a => Show (Id a) #
Methods showsPrec :: Int -> Id a -> ShowS # show :: Id a -> String # showList :: [Id a] -> ShowS #
Generic (Id a) #
Associated Types type Rep (Id a) :: * -> * # Methods from :: Id a -> Rep (Id a) x # to :: Rep (Id a) x -> Id a #
type Rep1 Id #
type Rep1 Id = D1 (MetaData "Id" "Control.Compose" "TypeCompose-0.9.12-8pdvuVL5uEI3bN8tD5X8fm" True) (C1 (MetaCons "Id" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))
type Rep (Id a) #
type Rep (Id a) = D1 (MetaData "Id" "Control.Compose" "TypeCompose-0.9.12-8pdvuVL5uEI3bN8tD5X8fm" True) (C1 (MetaCons "Id" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))

unId :: Id a -> a #

biId :: a :<->: Id a #

newtype bijection

inId :: (a -> b) -> Id a -> Id b #

inId2 :: (a -> b -> c) -> Id a -> Id b -> Id c #

Constructor pairing

Unary

newtype (f :*: g) a infixl 7 #

Pairing of unary type constructors

Constructors

Prod
Fields unProd :: (f a, g a)

Instances

(Functor f, Functor g) => Functor ((:*:) f g) #
Methods fmap :: (a -> b) -> (f :: g) a -> (f :: g) b # (<$) :: a -> (f :: g) b -> (f :: g) a #
(Applicative f, Applicative g) => Applicative ((:*:) f g) #
Methods pure :: a -> (f :: g) a # (<>) :: (f :: g) (a -> b) -> (f :: g) a -> (f :: g) b # (>) :: (f :: g) a -> (f :: g) b -> (f :: g) b # (<) :: (f :: g) a -> (f :: g) b -> (f :*: g) a #
(Monoid_f f, Monoid_f g) => Monoid_f ((:*:) f g) #
Methods mempty_f :: (f :: g) a # mappend_f :: (f :: g) a -> (f :: g) a -> (f :: g) a #
(Copair f, Copair g) => Copair ((:*:) f g) #
Methods cofsts :: (f :: g) a -> (f :: g) (a, b) # cosnds :: (f :: g) b -> (f :: g) (a, b) #
(Pair f, Pair g) => Pair ((:*:) f g) #
Methods pair :: PairTy (f :*: g) #
(Cozip f, Cozip g) => Cozip ((:*:) f g) #
Methods cofsts :: (f :: g) a -> (f :: g) (a, b) # cosnds :: (f :: g) b -> (f :: g) (a, b) #
(Zip f, Zip g) => Zip ((:*:) f g) #
Methods zip :: ZipTy (f :*: g) #
(Lambda src snk, Lambda dom' ran') => Lambda ((::) src dom') ((::) snk ran') #
Methods lambda :: LambdaTy (src :: dom') (snk :: ran') #
Eq (f a, g a) => Eq ((:*:) f g a) #
Methods (==) :: (f :: g) a -> (f :: g) a -> Bool # (/=) :: (f :: g) a -> (f :: g) a -> Bool #
Ord (f a, g a) => Ord ((:*:) f g a) #
Methods compare :: (f :: g) a -> (f :: g) a -> Ordering # (<) :: (f :: g) a -> (f :: g) a -> Bool # (<=) :: (f :: g) a -> (f :: g) a -> Bool # (>) :: (f :: g) a -> (f :: g) a -> Bool # (>=) :: (f :: g) a -> (f :: g) a -> Bool # max :: (f :: g) a -> (f :: g) a -> (f :: g) a # min :: (f :: g) a -> (f :: g) a -> (f :: g) a #
Show (f a, g a) => Show ((:*:) f g a) #
Methods showsPrec :: Int -> (f :: g) a -> ShowS # show :: (f :: g) a -> String # showList :: [(f :*: g) a] -> ShowS #

(*:*) :: f a -> g a -> (f :*: g) a #

Handy infix & curried Prod

biProd :: (f a, g a) :<->: (f :*: g) a #

newtype bijection

convProd :: (b :<->: f a) -> (c :<->: g a) -> (b, c) :<->: (f :*: g) a #

Compose a bijection

(***#) :: (a -> b -> c) -> (a' -> b' -> c') -> (a, a') -> (b, b') -> (c, c') infixr 3 #

Combine two binary functions into a binary function on pairs

($*) :: (a -> b, a' -> b') -> (a, a') -> (b, b') infixl 0 #

A handy combining form. See '(***#)' for an sample use.

inProd :: ((f a, g a) -> (f' a', g' a')) -> (f :*: g) a -> (f' :*: g') a' #

Apply unary function inside of f :*: g representation.

inProd2 :: ((f a, g a) -> (f' a', g' a') -> (f'' a'', g'' a'')) -> (f :*: g) a -> (f' :*: g') a' -> (f'' :*: g'') a'' #

Apply binary function inside of f :*: g representation.

inProd3 :: ((f a, g a) -> (f' a', g' a') -> (f'' a'', g'' a'') -> (f''' a''', g''' a''')) -> (f :*: g) a -> (f' :*: g') a' -> (f'' :*: g'') a'' -> (f''' :*: g''') a''' #

Apply ternary function inside of f :*: g representation.

Binary

newtype (f ::*:: g) a b #

Pairing of binary type constructors

Constructors

Prodd
Fields unProdd :: (f a b, g a b)

Instances

(Category * f, Category * f') => Category * ((::*::) f f') #
Methods id :: cat a a # (.) :: cat b c -> cat a b -> cat a c #
(Arrow f, Arrow f') => Arrow ((::*::) f f') #
Methods arr :: (b -> c) -> (f :::: f') b c # first :: (f :::: f') b c -> (f :::: f') (b, d) (c, d) # second :: (f :::: f') b c -> (f :::: f') (d, b) (d, c) # (*) :: (f :::: f') b c -> (f :::: f') b' c' -> (f :::: f') (b, b') (c, c') # (&&&) :: (f :::: f') b c -> (f :::: f') b c' -> (f ::*:: f') b (c, c') #
(Eq (g a b), Eq (f a b)) => Eq ((::*::) f g a b) #
Methods (==) :: (f :::: g) a b -> (f :::: g) a b -> Bool # (/=) :: (f :::: g) a b -> (f :::: g) a b -> Bool #
(Ord (g a b), Ord (f a b)) => Ord ((::*::) f g a b) #
Methods compare :: (f :::: g) a b -> (f :::: g) a b -> Ordering # (<) :: (f :::: g) a b -> (f :::: g) a b -> Bool # (<=) :: (f :::: g) a b -> (f :::: g) a b -> Bool # (>) :: (f :::: g) a b -> (f :::: g) a b -> Bool # (>=) :: (f :::: g) a b -> (f :::: g) a b -> Bool # max :: (f :::: g) a b -> (f :::: g) a b -> (f :::: g) a b # min :: (f :::: g) a b -> (f :::: g) a b -> (f :::: g) a b #
(Show (g a b), Show (f a b)) => Show ((::*::) f g a b) #
Methods showsPrec :: Int -> (f :::: g) a b -> ShowS # show :: (f :::: g) a b -> String # showList :: [(f ::*:: g) a b] -> ShowS #

(*::*) :: f a b -> g a b -> (f ::*:: g) a b #

Handy infix & curried Prodd

inProdd :: ((f a b, g a b) -> (f' a' b', g' a' b')) -> (f ::*:: g) a b -> (f' ::*:: g') a' b' #

Apply binary function inside of f :*: g representation.

inProdd2 :: ((f a b, g a b) -> (f' a' b', g' a' b') -> (f'' a'' b'', g'' a'' b'')) -> (f ::*:: g) a b -> (f' ::*:: g') a' b' -> (f'' ::*:: g'') a'' b'' #

Apply binary function inside of f :*: g representation.

Arrow between two constructor applications

newtype Arrw j f g a #

Arrow-like type between type constructors (doesn't enforce Arrow (~>) here).

Constructors

Arrw
Fields unArrw :: f a `j` g a

Instances

Applicative f => Lambda f ((:->:) f (Const * o)) #
Methods lambda :: LambdaTy f (f :->: Const * o) #
(Arrow j, ContraFunctor f, Functor g) => Functor (Arrw j f g) #
Methods fmap :: (a -> b) -> Arrw j f g a -> Arrw j f g b # (<$) :: a -> Arrw j f g b -> Arrw j f g a #
(Arrow j, Functor f, ContraFunctor g) => ContraFunctor (Arrw j f g) #
Methods contraFmap :: (a -> b) -> Arrw j f g b -> Arrw j f g a #
(Arrow j, Unpair f, Pair g) => Pair (Arrw j f g) #
Methods pair :: PairTy (Arrw j f g) #
(Arrow j, Unzip f, Zip g) => Zip (Arrw j f g) #
Methods zip :: ZipTy (Arrw j f g) #
(Arrow j, Unlambda f f', Lambda g g') => Lambda (Arrw j f g) (Arrw j f' g') #
Methods lambda :: LambdaTy (Arrw j f g) (Arrw j f' g') #
Monoid (j (f a) (g a)) => Monoid (Arrw j f g a) #
Methods mempty :: Arrw j f g a # mappend :: Arrw j f g a -> Arrw j f g a -> Arrw j f g a # mconcat :: [Arrw j f g a] -> Arrw j f g a #

type (:->:) = Arrw (->) infixr 1 #

biFun :: (f a -> g a) :<->: (f :->: g) a #

newtype bijection

convFun :: (b :<->: f a) -> (c :<->: g a) -> (b -> c) :<->: (f :->: g) a #

Compose a bijection

inArrw :: ((f a `j` g a) -> f' a' `j` g' a') -> Arrw j f g a -> Arrw j f' g' a' #

Apply unary function inside of Arrw representation.

inArrw2 :: ((f a `j` g a) -> (f' a' `j` g' a') -> f'' a'' `j` g'' a'') -> Arrw j f g a -> Arrw j f' g' a' -> Arrw j f'' g'' a'' #

Apply binary function inside of Arrw j f g representation.

inArrw3 :: ((f a `j` g a) -> (f' a' `j` g' a') -> (f'' a'' `j` g'' a'') -> f''' a''' `j` g''' a''') -> Arrw j f g a -> Arrw j f' g' a' -> Arrw j f'' g'' a'' -> Arrw j f''' g''' a''' #

Apply ternary function inside of Arrw j f g representation.

Augment other modules

biConst :: a :<->: Const a b #

newtype bijection

inConst :: (a -> b) -> Const a u -> Const b v #

inConst2 :: (a -> b -> c) -> Const a u -> Const b v -> Const c w #

inConst3 :: (a -> b -> c -> d) -> Const a u -> Const b v -> Const c w -> Const d x #

biEndo :: (a -> a) :<->: Endo a #

newtype bijection

inEndo :: (Unop a -> Unop a') -> Endo a -> Endo a' #

Convenience for partial-manipulating functions