Control.Monad.Free

Documentation

data Free f a

Constructors

Pure a

Free (f (Free f a))

Instances

Functor f => Monad (Free f)

Methods

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

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

return :: a -> Free f a

fail :: String -> Free f a

Functor f => Functor (Free f)

Methods

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

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

Functor f => Applicative (Free f)

Methods

pure :: a -> Free f a

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

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

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

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

Foldable f => Foldable (Free f)

Methods

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

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

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

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

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

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

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

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

toList :: Free f a -> [a]

null :: Free f a -> Bool

length :: Free f a -> Int

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

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

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

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

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

Traversable f => Traversable (Free f)

Methods

traverse :: Applicative f => (a -> f b) -> Free f a -> f (Free f b)

sequenceA :: Applicative f => Free f (f a) -> f (Free f a)

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

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

Eq1 f => Eq1 (Free f)

Methods

liftEq :: (a -> b -> Bool) -> Free f a -> Free f b -> Bool

Ord1 f => Ord1 (Free f)

Methods

liftCompare :: (a -> b -> Ordering) -> Free f a -> Free f b -> Ordering

Read1 f => Read1 (Free f)

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Free f a)

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Free f a]

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Free f a)

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Free f a]

Show1 f => Show1 (Free f)

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Free f a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Free f a] -> ShowS

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

Methods

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

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

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

Methods

compare :: Free f a -> Free f a -> Ordering

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

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

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

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

max :: Free f a -> Free f a -> Free f a

min :: Free f a -> Free f a -> Free f a

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

Methods

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

readList :: ReadS [Free f a]

readPrec :: ReadPrec (Free f a)

readListPrec :: ReadPrec [Free f a]

(Show a, Show1 f) => Show (Free f a)

Methods

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

show :: Free f a -> String

showList :: [Free f a] -> ShowS

lift :: Functor f => f a -> Free f a

map :: Functor g => (forall a. f a -> g a) -> Free f a -> Free g a

fold :: Monad m => (forall a. f a -> m a) -> Free f a -> m a

iter :: Functor f => (f a -> a) -> Free f a -> a

iterA :: (Functor f, Applicative p) => (f (p a) -> p a) -> Free f a -> p a

unfold :: Functor f => (b -> Either a (f b)) -> b -> Free f a

unfoldM :: (Traversable f, Monad m) => (b -> m (Either a (f b))) -> b -> m (Free f a)

unfoldW :: (Cotraversable f, Comonad ɯ) => (ɯ b -> Either a (f b)) -> ɯ b -> Free f a