Pandora.Paradigm.Primary.Functor.Conclusion

Documentation

data Conclusion e a

Constructors

Failure e

Success a

Instances

Bivariant Conclusion

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(<->) :: (forall i. Covariant (Conclusion i)) => (a -> b) -> (c -> d) -> Conclusion a c -> Conclusion b d

bimap :: (forall i. Covariant (Conclusion i)) => (a -> b) -> (c -> d) -> Conclusion a c -> Conclusion b d

Covariant (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(<$>) :: (a -> b) -> Conclusion e a -> Conclusion e b

comap :: (a -> b) -> Conclusion e a -> Conclusion e b

(<$) :: a -> Conclusion e b -> Conclusion e a

($>) :: Conclusion e a -> b -> Conclusion e b

void :: Conclusion e a -> Conclusion e ()

loeb :: Conclusion e (a <:= Conclusion e) -> Conclusion e a

(<&>) :: Conclusion e a -> (a -> b) -> Conclusion e b

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

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

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

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

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

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

(.#..) :: (Conclusion e ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: (Conclusion e ~ v a, Conclusion e ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e0 -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e0

(.#....) :: (Conclusion e ~ v a, Conclusion e ~ v b, Conclusion e ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e0 f -> ((v a :. (v b :. (v c :. v d))) := e0) -> (v a :. (v b :. (v c :. v d))) := f

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

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

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

($$>) :: Covariant u => ((Conclusion e :. u) := a) -> b -> (Conclusion e :. u) := b

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

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

Bindable (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(>>=) :: Conclusion e a -> (a -> Conclusion e b) -> Conclusion e b

(=<<) :: (a -> Conclusion e b) -> Conclusion e a -> Conclusion e b

bind :: (a -> Conclusion e b) -> Conclusion e a -> Conclusion e b

join :: ((Conclusion e :. Conclusion e) := a) -> Conclusion e a

(>=>) :: (a -> Conclusion e b) -> (b -> Conclusion e c) -> a -> Conclusion e c

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

($>>=) :: Covariant u => ((u :. Conclusion e) := a) -> (a -> Conclusion e b) -> (u :. Conclusion e) := b

Applicative (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(<*>) :: Conclusion e (a -> b) -> Conclusion e a -> Conclusion e b

apply :: Conclusion e (a -> b) -> Conclusion e a -> Conclusion e b

(*>) :: Conclusion e a -> Conclusion e b -> Conclusion e b

(<*) :: Conclusion e a -> Conclusion e b -> Conclusion e a

forever :: Conclusion e a -> Conclusion e b

(<%>) :: Conclusion e a -> Conclusion e (a -> b) -> Conclusion e b

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

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

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

Alternative (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(<+>) :: Conclusion e a -> Conclusion e a -> Conclusion e a

alter :: Conclusion e a -> Conclusion e a -> Conclusion e a

Pointable (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

point :: a :=> Conclusion e

pass :: Conclusion e ()

Monad (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(>>=-) :: Conclusion e a -> Conclusion e b -> Conclusion e a

(->>=) :: Conclusion e a -> Conclusion e b -> Conclusion e b

(-=<<) :: Conclusion e a -> Conclusion e b -> Conclusion e b

(=<<-) :: Conclusion e a -> Conclusion e b -> Conclusion e a

Traversable (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(->>) :: (Pointable u, Applicative u) => Conclusion e a -> (a -> u b) -> (u :. Conclusion e) := b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Conclusion e a -> (u :. Conclusion e) := b

sequence :: (Pointable u, Applicative u) => ((Conclusion e :. u) := a) -> (u :. Conclusion e) := a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Conclusion e) := a) -> (a -> u b) -> (u :. (v :. Conclusion e)) := b

(->>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w) => ((w :. (v :. Conclusion e)) := a) -> (a -> u b) -> (u :. (w :. (v :. Conclusion e))) := b

(->>>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w, Traversable j) => ((j :. (w :. (v :. Conclusion e))) := a) -> (a -> u b) -> (u :. (j :. (w :. (v :. Conclusion e)))) := b

Interpreted (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Associated Types

type Primary (Conclusion e) a

Methods

run :: Conclusion e a -> Primary (Conclusion e) a

unite :: Primary (Conclusion e) a -> Conclusion e a

(||=) :: Interpreted u => (Primary (Conclusion e) a -> Primary u b) -> Conclusion e a -> u b

(=||) :: Interpreted u => (Conclusion e a -> u b) -> Primary (Conclusion e) a -> Primary u b

(<$||=) :: (Covariant j, Interpreted u) => (Primary (Conclusion e) a -> Primary u b) -> (j := Conclusion e a) -> j := u b

(<$$||=) :: (Covariant j, Covariant k, Interpreted u) => (Primary (Conclusion e) a -> Primary u b) -> ((j :. k) := Conclusion e a) -> (j :. k) := u b

(<$$$||=) :: (Covariant j, Covariant k, Covariant l, Interpreted u) => (Primary (Conclusion e) a -> Primary u b) -> ((j :. (k :. l)) := Conclusion e a) -> (j :. (k :. l)) := u b

(<$$$$||=) :: (Covariant j, Covariant k, Covariant l, Covariant m, Interpreted u) => (Primary (Conclusion e) a -> Primary u b) -> ((j :. (k :. (l :. m))) := Conclusion e a) -> (j :. (k :. (l :. m))) := u b

(=||$>) :: (Covariant j, Interpreted u) => (Conclusion e a -> u b) -> (j := Primary (Conclusion e) a) -> j := Primary u b

(=||$$>) :: (Covariant j, Covariant k, Interpreted u) => (Conclusion e a -> u b) -> ((j :. k) := Primary (Conclusion e) a) -> (j :. k) := Primary u b

(=||$$$>) :: (Covariant j, Covariant k, Covariant l, Interpreted u) => (Conclusion e a -> u b) -> ((j :. (k :. l)) := Primary (Conclusion e) a) -> (j :. (k :. l)) := Primary u b

(=||$$$$>) :: (Covariant j, Covariant k, Covariant l, Covariant m, Interpreted u) => (Conclusion e a -> u b) -> ((j :. (k :. (l :. m))) := Primary (Conclusion e) a) -> (j :. (k :. (l :. m))) := Primary u b

Monadic (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

wrap :: forall (u :: Type -> Type). Pointable u => Conclusion e ~> (Conclusion e :> u)

Catchable e (Conclusion e :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

catch :: forall (a :: k). Conclusion e a -> (e -> Conclusion e a) -> Conclusion e a

Monad u => Catchable e (Conclusion e <.:> u :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

catch :: forall (a :: k). (Conclusion e <.:> u) a -> (e -> (Conclusion e <.:> u) a) -> (Conclusion e <.:> u) a

Morphable ('Into (Flip Conclusion e) :: Morph (Type -> Type)) Maybe

Defined in Pandora.Paradigm.Primary

Associated Types

type Morphing ('Into (Flip Conclusion e)) Maybe :: Type -> Type

Methods

morphing :: (Tagged ('Into (Flip Conclusion e)) <:.> Maybe) ~> Morphing ('Into (Flip Conclusion e)) Maybe

Morphable ('Into (Conclusion e) :: Morph (Type -> Type)) Maybe

Defined in Pandora.Paradigm.Primary

Associated Types

type Morphing ('Into (Conclusion e)) Maybe :: Type -> Type

Methods

morphing :: (Tagged ('Into (Conclusion e)) <:.> Maybe) ~> Morphing ('Into (Conclusion e)) Maybe

Morphable ('Into Maybe) (Conclusion e)

Defined in Pandora.Paradigm.Primary

Associated Types

type Morphing ('Into Maybe) (Conclusion e) :: Type -> Type

Methods

morphing :: (Tagged ('Into Maybe) <:.> Conclusion e) ~> Morphing ('Into Maybe) (Conclusion e)

(Semigroup e, Semigroup a) => Semigroup (Conclusion e a)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(+) :: Conclusion e a -> Conclusion e a -> Conclusion e a

(Setoid e, Setoid a) => Setoid (Conclusion e a)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(==) :: Conclusion e a -> Conclusion e a -> Boolean

(!=) :: Conclusion e a -> Conclusion e a -> Boolean

(Chain e, Chain a) => Chain (Conclusion e a)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

(<=>) :: Conclusion e a -> Conclusion e a -> Ordering

(<) :: Conclusion e a -> Conclusion e a -> Boolean

(<=) :: Conclusion e a -> Conclusion e a -> Boolean

(>) :: Conclusion e a -> Conclusion e a -> Boolean

(>=) :: Conclusion e a -> Conclusion e a -> Boolean

type Schematic Monad (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

type Schematic Monad (Conclusion e) = (<.:>) (Conclusion e)

type Primary (Conclusion e) a

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

type Primary (Conclusion e) a = Conclusion e a

type Morphing ('Into (Flip Conclusion e) :: Morph (Type -> Type)) Maybe

Defined in Pandora.Paradigm.Primary

type Morphing ('Into (Flip Conclusion e) :: Morph (Type -> Type)) Maybe = ((->) e :: Type -> Type) <:.> Flip Conclusion e

type Morphing ('Into (Conclusion e) :: Morph (Type -> Type)) Maybe

Defined in Pandora.Paradigm.Primary

type Morphing ('Into (Conclusion e) :: Morph (Type -> Type)) Maybe = ((->) e :: Type -> Type) <:.> Conclusion e

type Morphing ('Into Maybe) (Conclusion e)

Defined in Pandora.Paradigm.Primary

type Morphing ('Into Maybe) (Conclusion e) = Maybe

conclusion :: (e -> r) -> (a -> r) -> Conclusion e a -> r

fail :: (e -> r) -> Conclusion e ~> Conclusion r

type Failable e = Adaptable (Conclusion e)

failure :: Failable e t => e -> t a

class Catchable e t where

Methods

catch :: t a -> (e -> t a) -> t a

Instances

Catchable e (Conclusion e :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

catch :: forall (a :: k). Conclusion e a -> (e -> Conclusion e a) -> Conclusion e a

Monad u => Catchable e (Conclusion e <.:> u :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

catch :: forall (a :: k). (Conclusion e <.:> u) a -> (e -> (Conclusion e <.:> u) a) -> (Conclusion e <.:> u) a