Control.Monad.Freer.Tree

A tree-structured encoded Freer monad.

Documentation

newtype FreerTree f a

A tree-structured encoded Freer monad.

Constructors

FreerTree

Fields

• unFreerTree :: Free (Coyoneda f) a

Instances

Freer Monad FreerTree

Defined in Control.Monad.Freer.Tree

Methods

liftIns :: e a -> FreerTree e a

interpretFreer :: forall m (e :: Type -> Type) a. Monad m => (e ~> m) -> FreerTree e a -> m a

retractFreer :: Monad m => FreerTree m a -> m a

transformFreer :: forall (e :: Type -> Type) (e' :: Type -> Type) a. (e ~> e') -> FreerTree e a -> FreerTree e' a

reinterpretFreer :: forall (e :: Type -> Type) a. (e ~> FreerTree e) -> FreerTree e a -> FreerTree e a

MonadFreer Monad FreerTree

Defined in Control.Monad.Freer.Tree

Methods

interpretFreerK :: forall (e :: Type -> Type) r. (e ~> Cont r) -> FreerTree e ~> Cont r

Foldable f => Foldable (FreerTree f)

Defined in Control.Monad.Freer.Tree

Methods

fold :: Monoid m => FreerTree f m -> m

foldMap :: Monoid m => (a -> m) -> FreerTree f a -> m

foldMap' :: Monoid m => (a -> m) -> FreerTree f a -> m

foldr :: (a -> b -> b) -> b -> FreerTree f a -> b

foldr' :: (a -> b -> b) -> b -> FreerTree f a -> b

foldl :: (b -> a -> b) -> b -> FreerTree f a -> b

foldl' :: (b -> a -> b) -> b -> FreerTree f a -> b

foldr1 :: (a -> a -> a) -> FreerTree f a -> a

foldl1 :: (a -> a -> a) -> FreerTree f a -> a

toList :: FreerTree f a -> [a]

null :: FreerTree f a -> Bool

length :: FreerTree f a -> Int

elem :: Eq a => a -> FreerTree f a -> Bool

maximum :: Ord a => FreerTree f a -> a

minimum :: Ord a => FreerTree f a -> a

sum :: Num a => FreerTree f a -> a

product :: Num a => FreerTree f a -> a

Traversable f => Traversable (FreerTree f)

Defined in Control.Monad.Freer.Tree

Methods

traverse :: Applicative f0 => (a -> f0 b) -> FreerTree f a -> f0 (FreerTree f b)

sequenceA :: Applicative f0 => FreerTree f (f0 a) -> f0 (FreerTree f a)

mapM :: Monad m => (a -> m b) -> FreerTree f a -> m (FreerTree f b)

sequence :: Monad m => FreerTree f (m a) -> m (FreerTree f a)

Alternative f => Alternative (FreerTree f)

Defined in Control.Monad.Freer.Tree

Methods

empty :: FreerTree f a

(<|>) :: FreerTree f a -> FreerTree f a -> FreerTree f a

some :: FreerTree f a -> FreerTree f [a]

many :: FreerTree f a -> FreerTree f [a]

Applicative (FreerTree f)

Defined in Control.Monad.Freer.Tree

Methods

pure :: a -> FreerTree f a

(<*>) :: FreerTree f (a -> b) -> FreerTree f a -> FreerTree f b

liftA2 :: (a -> b -> c) -> FreerTree f a -> FreerTree f b -> FreerTree f c

(*>) :: FreerTree f a -> FreerTree f b -> FreerTree f b

(<*) :: FreerTree f a -> FreerTree f b -> FreerTree f a

Functor (FreerTree f)

Defined in Control.Monad.Freer.Tree

Methods

fmap :: (a -> b) -> FreerTree f a -> FreerTree f b

(<$) :: a -> FreerTree f b -> FreerTree f a

Monad (FreerTree f)

Defined in Control.Monad.Freer.Tree

Methods

(>>=) :: FreerTree f a -> (a -> FreerTree f b) -> FreerTree f b

(>>) :: FreerTree f a -> FreerTree f b -> FreerTree f b

return :: a -> FreerTree f a

MonadPlus f => MonadPlus (FreerTree f)

Defined in Control.Monad.Freer.Tree

Methods

mzero :: FreerTree f a

mplus :: FreerTree f a -> FreerTree f a -> FreerTree f a

(Read1 f, Read a) => Read (FreerTree f a)

Defined in Control.Monad.Freer.Tree

Methods

readsPrec :: Int -> ReadS (FreerTree f a)

readList :: ReadS [FreerTree f a]

readPrec :: ReadPrec (FreerTree f a)

readListPrec :: ReadPrec [FreerTree f a]

(Functor f, Show1 f, Show a) => Show (FreerTree f a)

Defined in Control.Monad.Freer.Tree

Methods

showsPrec :: Int -> FreerTree f a -> ShowS

show :: FreerTree f a -> String

showList :: [FreerTree f a] -> ShowS

(Eq1 f, Eq a) => Eq (FreerTree f a)

Defined in Control.Monad.Freer.Tree

Methods

(==) :: FreerTree f a -> FreerTree f a -> Bool

(/=) :: FreerTree f a -> FreerTree f a -> Bool

(Ord1 f, Ord a) => Ord (FreerTree f a)

Defined in Control.Monad.Freer.Tree

Methods

compare :: FreerTree f a -> FreerTree f a -> Ordering

(<) :: FreerTree f a -> FreerTree f a -> Bool

(<=) :: FreerTree f a -> FreerTree f a -> Bool

(>) :: FreerTree f a -> FreerTree f a -> Bool

(>=) :: FreerTree f a -> FreerTree f a -> Bool

max :: FreerTree f a -> FreerTree f a -> FreerTree f a

min :: FreerTree f a -> FreerTree f a -> FreerTree f a

liftInsTree :: ins a -> FreerTree ins a

interpretTree :: Monad m => (ins ~> m) -> FreerTree ins a -> m a

interpretTreeK :: (e ~> Cont r) -> FreerTree e ~> Cont r