Pandora.Core.Functor

Documentation

data Variant

Constructors

Co

Contra

Instances

Covariant u => Covariant (TU Co Co ((->) e :: Type -> Type) u)

Defined in Pandora.Paradigm.Inventory.Environment

Methods

(<$>) :: (a -> b) -> TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b

comap :: (a -> b) -> TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b

(<$) :: a -> TU Co Co ((->) e) u b -> TU Co Co ((->) e) u a

($>) :: TU Co Co ((->) e) u a -> b -> TU Co Co ((->) e) u b

void :: TU Co Co ((->) e) u a -> TU Co Co ((->) e) u ()

loeb :: TU Co Co ((->) e) u (a <-| TU Co Co ((->) e) u) -> TU Co Co ((->) e) u a

(<&>) :: TU Co Co ((->) e) u a -> (a -> b) -> TU Co Co ((->) e) u b

(<$$>) :: Covariant u0 => (a -> b) -> ((TU Co Co ((->) e) u :. u0) := a) -> (TU Co Co ((->) e) u :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((TU Co Co ((->) e) u :. (u0 :. v)) := a) -> (TU Co Co ((->) e) u :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((TU Co Co ((->) e) u :. (u0 :. (v :. w))) := a) -> (TU Co Co ((->) e) u :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => ((TU Co Co ((->) e) u :. u0) := a) -> (a -> b) -> (TU Co Co ((->) e) u :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => ((TU Co Co ((->) e) u :. (u0 :. v)) := a) -> (a -> b) -> (TU Co Co ((->) e) u :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((TU Co Co ((->) e) u :. (u0 :. (v :. w))) := a) -> (a -> b) -> (TU Co Co ((->) e) u :. (u0 :. (v :. w))) := b

Covariant u => Covariant (UT Co Co ((:*:) e) u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

(<$>) :: (a -> b) -> UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b

comap :: (a -> b) -> UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b

(<$) :: a -> UT Co Co ((:*:) e) u b -> UT Co Co ((:*:) e) u a

($>) :: UT Co Co ((:*:) e) u a -> b -> UT Co Co ((:*:) e) u b

void :: UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u ()

loeb :: UT Co Co ((:*:) e) u (a <-| UT Co Co ((:*:) e) u) -> UT Co Co ((:*:) e) u a

(<&>) :: UT Co Co ((:*:) e) u a -> (a -> b) -> UT Co Co ((:*:) e) u b

(<$$>) :: Covariant u0 => (a -> b) -> ((UT Co Co ((:*:) e) u :. u0) := a) -> (UT Co Co ((:*:) e) u :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((UT Co Co ((:*:) e) u :. (u0 :. v)) := a) -> (UT Co Co ((:*:) e) u :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := a) -> (UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => ((UT Co Co ((:*:) e) u :. u0) := a) -> (a -> b) -> (UT Co Co ((:*:) e) u :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => ((UT Co Co ((:*:) e) u :. (u0 :. v)) := a) -> (a -> b) -> (UT Co Co ((:*:) e) u :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := a) -> (a -> b) -> (UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := b

Covariant u => Covariant (UT Co Co Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(<$>) :: (a -> b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b

comap :: (a -> b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b

(<$) :: a -> UT Co Co Maybe u b -> UT Co Co Maybe u a

($>) :: UT Co Co Maybe u a -> b -> UT Co Co Maybe u b

void :: UT Co Co Maybe u a -> UT Co Co Maybe u ()

loeb :: UT Co Co Maybe u (a <-| UT Co Co Maybe u) -> UT Co Co Maybe u a

(<&>) :: UT Co Co Maybe u a -> (a -> b) -> UT Co Co Maybe u b

(<$$>) :: Covariant u0 => (a -> b) -> ((UT Co Co Maybe u :. u0) := a) -> (UT Co Co Maybe u :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((UT Co Co Maybe u :. (u0 :. v)) := a) -> (UT Co Co Maybe u :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((UT Co Co Maybe u :. (u0 :. (v :. w))) := a) -> (UT Co Co Maybe u :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => ((UT Co Co Maybe u :. u0) := a) -> (a -> b) -> (UT Co Co Maybe u :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => ((UT Co Co Maybe u :. (u0 :. v)) := a) -> (a -> b) -> (UT Co Co Maybe u :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((UT Co Co Maybe u :. (u0 :. (v :. w))) := a) -> (a -> b) -> (UT Co Co Maybe u :. (u0 :. (v :. w))) := b

Covariant u => Covariant (UT Co Co (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(<$>) :: (a -> b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b

comap :: (a -> b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b

(<$) :: a -> UT Co Co (Conclusion e) u b -> UT Co Co (Conclusion e) u a

($>) :: UT Co Co (Conclusion e) u a -> b -> UT Co Co (Conclusion e) u b

void :: UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u ()

loeb :: UT Co Co (Conclusion e) u (a <-| UT Co Co (Conclusion e) u) -> UT Co Co (Conclusion e) u a

(<&>) :: UT Co Co (Conclusion e) u a -> (a -> b) -> UT Co Co (Conclusion e) u b

(<$$>) :: Covariant u0 => (a -> b) -> ((UT Co Co (Conclusion e) u :. u0) := a) -> (UT Co Co (Conclusion e) u :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((UT Co Co (Conclusion e) u :. (u0 :. v)) := a) -> (UT Co Co (Conclusion e) u :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((UT Co Co (Conclusion e) u :. (u0 :. (v :. w))) := a) -> (UT Co Co (Conclusion e) u :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => ((UT Co Co (Conclusion e) u :. u0) := a) -> (a -> b) -> (UT Co Co (Conclusion e) u :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => ((UT Co Co (Conclusion e) u :. (u0 :. v)) := a) -> (a -> b) -> (UT Co Co (Conclusion e) u :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((UT Co Co (Conclusion e) u :. (u0 :. (v :. w))) := a) -> (a -> b) -> (UT Co Co (Conclusion e) u :. (u0 :. (v :. w))) := b

Bindable u => Bindable (TU Co Co ((->) e :: Type -> Type) u)

Defined in Pandora.Paradigm.Inventory.Environment

Methods

(>>=) :: TU Co Co ((->) e) u a -> (a -> TU Co Co ((->) e) u b) -> TU Co Co ((->) e) u b

(=<<) :: (a -> TU Co Co ((->) e) u b) -> TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b

bind :: (a -> TU Co Co ((->) e) u b) -> TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b

join :: ((TU Co Co ((->) e) u :. TU Co Co ((->) e) u) := a) -> TU Co Co ((->) e) u a

(>=>) :: (a -> TU Co Co ((->) e) u b) -> (b -> TU Co Co ((->) e) u c) -> a -> TU Co Co ((->) e) u c

(<=<) :: (b -> TU Co Co ((->) e) u c) -> (a -> TU Co Co ((->) e) u b) -> a -> TU Co Co ((->) e) u c

(Semigroup e, Pointable u, Bindable u) => Bindable (UT Co Co ((:*:) e) u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

(>>=) :: UT Co Co ((:*:) e) u a -> (a -> UT Co Co ((:*:) e) u b) -> UT Co Co ((:*:) e) u b

(=<<) :: (a -> UT Co Co ((:*:) e) u b) -> UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b

bind :: (a -> UT Co Co ((:*:) e) u b) -> UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b

join :: ((UT Co Co ((:*:) e) u :. UT Co Co ((:*:) e) u) := a) -> UT Co Co ((:*:) e) u a

(>=>) :: (a -> UT Co Co ((:*:) e) u b) -> (b -> UT Co Co ((:*:) e) u c) -> a -> UT Co Co ((:*:) e) u c

(<=<) :: (b -> UT Co Co ((:*:) e) u c) -> (a -> UT Co Co ((:*:) e) u b) -> a -> UT Co Co ((:*:) e) u c

(Pointable u, Bindable u) => Bindable (UT Co Co Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(>>=) :: UT Co Co Maybe u a -> (a -> UT Co Co Maybe u b) -> UT Co Co Maybe u b

(=<<) :: (a -> UT Co Co Maybe u b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b

bind :: (a -> UT Co Co Maybe u b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b

join :: ((UT Co Co Maybe u :. UT Co Co Maybe u) := a) -> UT Co Co Maybe u a

(>=>) :: (a -> UT Co Co Maybe u b) -> (b -> UT Co Co Maybe u c) -> a -> UT Co Co Maybe u c

(<=<) :: (b -> UT Co Co Maybe u c) -> (a -> UT Co Co Maybe u b) -> a -> UT Co Co Maybe u c

(Pointable u, Bindable u) => Bindable (UT Co Co (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(>>=) :: UT Co Co (Conclusion e) u a -> (a -> UT Co Co (Conclusion e) u b) -> UT Co Co (Conclusion e) u b

(=<<) :: (a -> UT Co Co (Conclusion e) u b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b

bind :: (a -> UT Co Co (Conclusion e) u b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b

join :: ((UT Co Co (Conclusion e) u :. UT Co Co (Conclusion e) u) := a) -> UT Co Co (Conclusion e) u a

(>=>) :: (a -> UT Co Co (Conclusion e) u b) -> (b -> UT Co Co (Conclusion e) u c) -> a -> UT Co Co (Conclusion e) u c

(<=<) :: (b -> UT Co Co (Conclusion e) u c) -> (a -> UT Co Co (Conclusion e) u b) -> a -> UT Co Co (Conclusion e) u c

Applicative u => Applicative (TU Co Co ((->) e :: Type -> Type) u)

Defined in Pandora.Paradigm.Inventory.Environment

Methods

(<*>) :: TU Co Co ((->) e) u (a -> b) -> TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b

apply :: TU Co Co ((->) e) u (a -> b) -> TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b

(*>) :: TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b -> TU Co Co ((->) e) u b

(<*) :: TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b -> TU Co Co ((->) e) u a

forever :: TU Co Co ((->) e) u a -> TU Co Co ((->) e) u b

(<**>) :: Applicative u0 => ((TU Co Co ((->) e) u :. u0) := (a -> b)) -> ((TU Co Co ((->) e) u :. u0) := a) -> (TU Co Co ((->) e) u :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((TU Co Co ((->) e) u :. (u0 :. v)) := (a -> b)) -> ((TU Co Co ((->) e) u :. (u0 :. v)) := a) -> (TU Co Co ((->) e) u :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((TU Co Co ((->) e) u :. (u0 :. (v :. w))) := (a -> b)) -> ((TU Co Co ((->) e) u :. (u0 :. (v :. w))) := a) -> (TU Co Co ((->) e) u :. (u0 :. (v :. w))) := b

(Semigroup e, Applicative u) => Applicative (UT Co Co ((:*:) e) u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

(<*>) :: UT Co Co ((:*:) e) u (a -> b) -> UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b

apply :: UT Co Co ((:*:) e) u (a -> b) -> UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b

(*>) :: UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b -> UT Co Co ((:*:) e) u b

(<*) :: UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b -> UT Co Co ((:*:) e) u a

forever :: UT Co Co ((:*:) e) u a -> UT Co Co ((:*:) e) u b

(<**>) :: Applicative u0 => ((UT Co Co ((:*:) e) u :. u0) := (a -> b)) -> ((UT Co Co ((:*:) e) u :. u0) := a) -> (UT Co Co ((:*:) e) u :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((UT Co Co ((:*:) e) u :. (u0 :. v)) := (a -> b)) -> ((UT Co Co ((:*:) e) u :. (u0 :. v)) := a) -> (UT Co Co ((:*:) e) u :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := (a -> b)) -> ((UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := a) -> (UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := b

Applicative u => Applicative (UT Co Co Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(<*>) :: UT Co Co Maybe u (a -> b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b

apply :: UT Co Co Maybe u (a -> b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b

(*>) :: UT Co Co Maybe u a -> UT Co Co Maybe u b -> UT Co Co Maybe u b

(<*) :: UT Co Co Maybe u a -> UT Co Co Maybe u b -> UT Co Co Maybe u a

forever :: UT Co Co Maybe u a -> UT Co Co Maybe u b

(<**>) :: Applicative u0 => ((UT Co Co Maybe u :. u0) := (a -> b)) -> ((UT Co Co Maybe u :. u0) := a) -> (UT Co Co Maybe u :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((UT Co Co Maybe u :. (u0 :. v)) := (a -> b)) -> ((UT Co Co Maybe u :. (u0 :. v)) := a) -> (UT Co Co Maybe u :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((UT Co Co Maybe u :. (u0 :. (v :. w))) := (a -> b)) -> ((UT Co Co Maybe u :. (u0 :. (v :. w))) := a) -> (UT Co Co Maybe u :. (u0 :. (v :. w))) := b

Applicative u => Applicative (UT Co Co (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(<*>) :: UT Co Co (Conclusion e) u (a -> b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b

apply :: UT Co Co (Conclusion e) u (a -> b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b

(*>) :: UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b -> UT Co Co (Conclusion e) u b

(<*) :: UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b -> UT Co Co (Conclusion e) u a

forever :: UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b

(<**>) :: Applicative u0 => ((UT Co Co (Conclusion e) u :. u0) := (a -> b)) -> ((UT Co Co (Conclusion e) u :. u0) := a) -> (UT Co Co (Conclusion e) u :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((UT Co Co (Conclusion e) u :. (u0 :. v)) := (a -> b)) -> ((UT Co Co (Conclusion e) u :. (u0 :. v)) := a) -> (UT Co Co (Conclusion e) u :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((UT Co Co (Conclusion e) u :. (u0 :. (v :. w))) := (a -> b)) -> ((UT Co Co (Conclusion e) u :. (u0 :. (v :. w))) := a) -> (UT Co Co (Conclusion e) u :. (u0 :. (v :. w))) := b

(Covariant u, Pointable u) => Pointable (TU Co Co ((->) e :: Type -> Type) u)

Defined in Pandora.Paradigm.Inventory.Environment

Methods

point :: a |-> TU Co Co ((->) e) u

(Pointable u, Monoid e) => Pointable (UT Co Co ((:*:) e) u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

point :: a |-> UT Co Co ((:*:) e) u

Pointable u => Pointable (UT Co Co Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

point :: a |-> UT Co Co Maybe u

Pointable u => Pointable (UT Co Co (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

point :: a |-> UT Co Co (Conclusion e) u

Monad u => Monad (UT Co Co Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Monad u => Monad (UT Co Co (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Covariant u => Covariant (TUV Co Co Co ((->) s :: Type -> Type) u ((:*:) s))

Defined in Pandora.Paradigm.Inventory.State

Methods

(<$>) :: (a -> b) -> TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b

comap :: (a -> b) -> TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b

(<$) :: a -> TUV Co Co Co ((->) s) u ((:*:) s) b -> TUV Co Co Co ((->) s) u ((:*:) s) a

($>) :: TUV Co Co Co ((->) s) u ((:*:) s) a -> b -> TUV Co Co Co ((->) s) u ((:*:) s) b

void :: TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) ()

loeb :: TUV Co Co Co ((->) s) u ((:*:) s) (a <-| TUV Co Co Co ((->) s) u ((:*:) s)) -> TUV Co Co Co ((->) s) u ((:*:) s) a

(<&>) :: TUV Co Co Co ((->) s) u ((:*:) s) a -> (a -> b) -> TUV Co Co Co ((->) s) u ((:*:) s) b

(<$$>) :: Covariant u0 => (a -> b) -> ((TUV Co Co Co ((->) s) u ((:*:) s) :. u0) := a) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. u0) := b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. v)) := a) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. v)) := b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. (v :. w))) := a) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. (v :. w))) := b

(<&&>) :: Covariant u0 => ((TUV Co Co Co ((->) s) u ((:*:) s) :. u0) := a) -> (a -> b) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. u0) := b

(<&&&>) :: (Covariant u0, Covariant v) => ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. v)) := a) -> (a -> b) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. v)) := b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. (v :. w))) := a) -> (a -> b) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. (v :. w))) := b

Bindable u => Bindable (TUV Co Co Co ((->) s :: Type -> Type) u ((:*:) s))

Defined in Pandora.Paradigm.Inventory.State

Methods

(>>=) :: TUV Co Co Co ((->) s) u ((:*:) s) a -> (a -> TUV Co Co Co ((->) s) u ((:*:) s) b) -> TUV Co Co Co ((->) s) u ((:*:) s) b

(=<<) :: (a -> TUV Co Co Co ((->) s) u ((:*:) s) b) -> TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b

bind :: (a -> TUV Co Co Co ((->) s) u ((:*:) s) b) -> TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b

join :: ((TUV Co Co Co ((->) s) u ((:*:) s) :. TUV Co Co Co ((->) s) u ((:*:) s)) := a) -> TUV Co Co Co ((->) s) u ((:*:) s) a

(>=>) :: (a -> TUV Co Co Co ((->) s) u ((:*:) s) b) -> (b -> TUV Co Co Co ((->) s) u ((:*:) s) c) -> a -> TUV Co Co Co ((->) s) u ((:*:) s) c

(<=<) :: (b -> TUV Co Co Co ((->) s) u ((:*:) s) c) -> (a -> TUV Co Co Co ((->) s) u ((:*:) s) b) -> a -> TUV Co Co Co ((->) s) u ((:*:) s) c

Bindable u => Applicative (TUV Co Co Co ((->) s :: Type -> Type) u ((:*:) s))

Defined in Pandora.Paradigm.Inventory.State

Methods

(<*>) :: TUV Co Co Co ((->) s) u ((:*:) s) (a -> b) -> TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b

apply :: TUV Co Co Co ((->) s) u ((:*:) s) (a -> b) -> TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b

(*>) :: TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b -> TUV Co Co Co ((->) s) u ((:*:) s) b

(<*) :: TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b -> TUV Co Co Co ((->) s) u ((:*:) s) a

forever :: TUV Co Co Co ((->) s) u ((:*:) s) a -> TUV Co Co Co ((->) s) u ((:*:) s) b

(<**>) :: Applicative u0 => ((TUV Co Co Co ((->) s) u ((:*:) s) :. u0) := (a -> b)) -> ((TUV Co Co Co ((->) s) u ((:*:) s) :. u0) := a) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. u0) := b

(<***>) :: (Applicative u0, Applicative v) => ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. v)) := (a -> b)) -> ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. v)) := a) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. v)) := b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. (v :. w))) := (a -> b)) -> ((TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. (v :. w))) := a) -> (TUV Co Co Co ((->) s) u ((:*:) s) :. (u0 :. (v :. w))) := b

Pointable u => Pointable (TUV Co Co Co ((->) s :: Type -> Type) u ((:*:) s))

Defined in Pandora.Paradigm.Inventory.State

Methods

point :: a |-> TUV Co Co Co ((->) s) u ((:*:) s)

Monad u => Monad (TUV Co Co Co ((->) s :: Type -> Type) u ((:*:) s))

Defined in Pandora.Paradigm.Inventory.State

type (:=) t a = t a infixr 0

Parameter application

type (:.) t u a = t (u a) infixr 1

Functors composition

type (.:) t u a = u (t a) infixr 1

Flipped functors composition

type (|->) a t = a -> t a infixr 0

Coalgebra's type operator

type (<-|) a t = t a -> a infixr 0

Algebra's type operator

type (::|:.) p a b = p (p a b) b infixr 2

type (::|.:) p a b = p a (p a b) infixr 2

type (::|::) p a b = p (p a b) (p a b) infixr 2