Control.Monad.Free.Improve

Naive Free monads suffer from a quadratic complexity, as explained in

• Janis Voigtlander, Asymptotic Improvement of Computations over Free Monads, MPC'08

The solution is to redefine the Free datatype in CPS, similar to what is done in difference lists to solve the problem on quadratic append for lists.

Documentation

newtype C mu a

Constructors

C (forall b. (a -> mu b) -> mu b)

Instances

MonadTrans C

(Monad m, Functor f) => MonadFree f (C (FreeT f m))

Functor f => MonadFree f (C (Free f))

Monad (C mu)

Functor (C mu)

MonadPlus mu => MonadPlus (C mu)

Applicative (C mu)

rep :: Monad mu => mu a -> C mu a

improve :: Monad mu => C mu a -> mu a