Pandora.Paradigm.Basis.Cofree

Documentation

data Cofree t a

Constructors

a :< ((t :.: Cofree t) a)

Instances

Covariant t => Covariant (Cofree t)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

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

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

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

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

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

Applicative t => Applicative (Cofree t)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

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

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

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

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

forever :: Cofree t a -> Cofree t b

Alternative t => Bindable (Cofree t)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

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

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

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

join :: (Cofree t :.: Cofree t) a -> Cofree t a

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

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

Covariant t => Extendable (Cofree t)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

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

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

extend :: (Cofree t a -> b) -> Cofree t a -> Cofree t b

duplicate :: Cofree t a -> (Cofree t :.: Cofree t) a

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

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

Covariant t => Extractable (Cofree t)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

extract :: Cofree t a -> a

Covariant t => Comonad (Cofree t)

Defined in Pandora.Paradigm.Basis.Cofree

Exclusive t => Pointable (Cofree t)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

point :: a -> Cofree t a

(Exclusive t, Alternative t) => Monad (Cofree t)

Defined in Pandora.Paradigm.Basis.Cofree

Traversable t => Traversable (Cofree t)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

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

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

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

(Semigroup a, forall b. Semigroup b => Semigroup (t b)) => Semigroup (Cofree t a)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

(<>) :: Cofree t a -> Cofree t a -> Cofree t a

(Monoid a, forall b. Semigroup b => Monoid (t b)) => Monoid (Cofree t a)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

unit :: Cofree t a

(Setoid a, forall b. Setoid b => Setoid (t b)) => Setoid (Cofree t a)

Defined in Pandora.Paradigm.Basis.Cofree

Methods

(==) :: Cofree t a -> Cofree t a -> Boolean

(/=) :: Cofree t a -> Cofree t a -> Boolean

unwrap :: Cofree t a -> (t :.: Cofree t) a

coiterate :: Covariant t => (a -> t a) -> a -> Cofree t a

section :: Comonad t => t ~> Cofree t