Pandora.Paradigm.Primary.Algebraic.Sum

Documentation

data s :+: a infixr 0

Constructors

Option s

Adoption a

Instances

Monoidal (-->) ((->) :: Type -> Type -> Type) (:*:) (:+:) Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

unit :: Proxy (:*:) -> (Unit (:+:) -> a) --> Maybe a

(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Monoidal (-->) ((->) :: Type -> Type -> Type) (:*:) (:+:) t) => Monoidal (-->) ((->) :: Type -> Type -> Type) (:*:) (:+:) (Comprehension t)

Defined in Pandora.Paradigm.Structure.Modification.Comprehension

Methods

unit :: Proxy (:*:) -> (Unit (:+:) -> a) --> Comprehension t a

Monoidal (-->) ((->) :: Type -> Type -> Type) (:*:) (:*:) ((:+:) e)

Defined in Pandora.Paradigm.Primary.Algebraic

Methods

unit :: Proxy (:*:) -> (Unit (:*:) -> a) --> (e :+: a)

(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) u, Monoidal (-->) ((->) :: Type -> Type -> Type) (:*:) (:+:) t) => Monoidal (-->) ((->) :: Type -> Type -> Type) (:*:) (:+:) (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

unit :: Proxy (:*:) -> (Unit (:+:) -> a) --> (t <:.> u) a

Semimonoidal (-->) (:*:) (:+:) Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

mult :: forall (a :: k) (b :: k). (Maybe a :*: Maybe b) --> Maybe (a :+: b)

Semimonoidal (-->) (:*:) (:+:) ((:+:) e :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Algebraic

Methods

mult :: forall (a :: k) (b :: k). ((e :+: a) :*: (e :+: b)) --> (e :+: (a :+: b))

Semigroup e => Semimonoidal (-->) (:*:) (:+:) (Validation e :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Validation

Methods

mult :: forall (a :: k) (b :: k). (Validation e a :*: Validation e b) --> Validation e (a :+: b)

Semigroup e => Semimonoidal (-->) (:*:) (:+:) (Conclusion e :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

mult :: forall (a :: k) (b :: k). (Conclusion e a :*: Conclusion e b) --> Conclusion e (a :+: b)

Semimonoidal (-->) (:*:) (:*:) ((:+:) e :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Algebraic

Methods

mult :: forall (a :: k) (b :: k). ((e :+: a) :*: (e :+: b)) --> (e :+: (a :*: b))

(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) u, Semimonoidal (-->) (:*:) (:+:) t) => Semimonoidal (-->) (:*:) (:+:) (t <:.> u :: Type -> Type)

Defined in Pandora.Paradigm.Schemes.TU

Methods

mult :: forall (a :: k) (b :: k). ((t <:.> u) a :*: (t <:.> u) b) --> (t <:.> u) (a :+: b)

Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) ((:+:) s)

Defined in Pandora.Paradigm.Primary.Algebraic.Sum

Methods

(<$>) :: (a -> b) -> (s :+: a) -> (s :+: b)

Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (Flip (:+:) a)

Defined in Pandora.Paradigm.Primary.Algebraic.Sum

Methods

(<$>) :: (a0 -> b) -> Flip (:+:) a a0 -> Flip (:+:) a b

Bivariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (:+:)

Defined in Pandora.Paradigm.Primary.Algebraic.Sum

Methods

(<->) :: (a -> b) -> (c -> d) -> (a :+: c) -> (b :+: d)

type Unit (:+:)

Defined in Pandora.Paradigm.Primary.Algebraic

type Unit (:+:) = Zero

sum :: (e -> r) -> (a -> r) -> (e :+: a) -> r