Pandora.Paradigm.Basis.Free

Documentation

data Free t a

Constructors

Pure a

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

Instances

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 (Free t a -> a) -> Free t a

(<$$>) :: 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)))

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

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

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

idle :: Free t a

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 => Pointable (Free t)

Defined in Pandora.Paradigm.Basis.Free

Methods

point :: a -> Free t a

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