Pandora.Paradigm.Basis.Free

Documentation

data Free t a

Constructors

Pure a

Impure ((t :. Free t) := a)

Instances

Liftable Free

Defined in Pandora.Paradigm.Basis.Free

Methods

lift :: Covariant u => u ~> Free u

Covariant t => Covariant (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

(<$>) :: (a -> b) -> Free t a -> Free t b

comap :: (a -> b) -> Free t a -> Free t b

(<$) :: a -> Free t b -> Free t a

($>) :: Free t a -> b -> Free t b

void :: Free t a -> Free t ()

loeb :: Free t (a <-| Free t) -> Free t a

(<&>) :: Free t a -> (a -> b) -> Free t b

(<$$>) :: Covariant u => (a -> b) -> ((Free t :. u) := a) -> (Free t :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Free t :. (u :. v)) := a) -> (Free t :. (u :. v)) := b

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

(<&&>) :: Covariant u => ((Free t :. u) := a) -> (a -> b) -> (Free t :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Free t :. (u :. v)) := a) -> (a -> b) -> (Free t :. (u :. v)) := b

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

Covariant t => Bindable (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

(>>=) :: Free t a -> (a -> Free t b) -> Free t b

(=<<) :: (a -> Free t b) -> Free t a -> Free t b

bind :: (a -> Free t b) -> Free t a -> Free t b

join :: ((Free t :. Free t) := a) -> Free t a

(>=>) :: (a -> Free t b) -> (b -> Free t c) -> a -> Free t c

(<=<) :: (b -> Free t c) -> (a -> Free t b) -> a -> Free t c

Covariant t => Applicative (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

(<*>) :: Free t (a -> b) -> Free t a -> Free t b

apply :: Free t (a -> b) -> Free t a -> Free t b

(*>) :: Free t a -> Free t b -> Free t b

(<*) :: Free t a -> Free t b -> Free t a

forever :: Free t a -> Free t b

(<**>) :: Applicative u => ((Free t :. u) := (a -> b)) -> ((Free t :. u) := a) -> (Free t :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Free t :. (u :. v)) := (a -> b)) -> ((Free t :. (u :. v)) := a) -> (Free t :. (u :. v)) := b

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

Alternative t => Alternative (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

(<+>) :: Free t a -> Free t a -> Free t a

alter :: Free t a -> Free t a -> Free t a

Avoidable t => Avoidable (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

empty :: Free t a

Covariant t => Pointable (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

point :: a |-> Free t

Traversable t => Traversable (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

(->>) :: (Pointable u, Applicative u) => Free t a -> (a -> u b) -> (u :. Free t) := b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Free t a -> (u :. Free t) := b

sequence :: (Pointable u, Applicative u) => ((Free t :. u) := a) -> (u :. Free t) := a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Free t) := a) -> (a -> u b) -> (u :. (v :. Free t)) := b

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

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