HORIZON HASKELLDocslts/ghc-9.10.x248f8f02026-10-05Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · 248f8f0 · 2026-10-05

Modulecontrol-monad-free-0.6.2Haskell2010

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.

  • 1 type
  • 2 values
newtypenewtype C (mu :: Type -> Type) a
#

Constructors

  • C (forall b. (a -> mu b) -> mu b)
Instances8MonadTrans, MonadFree, Monad, Functor, Applicative, Alternative, …
  • MonadTrans CDefined in control-monad-free-0.6.2 · Control.Monad.Free.Improve
  • Functor f => MonadFree f (C (Free f))Defined in control-monad-free-0.6.2 · Control.Monad.Free.Improve
  • (Monad m, Functor f) => MonadFree f (C (FreeT f m))Defined in control-monad-free-0.6.2 · Control.Monad.Free.Improve
  • Monad (C mu)Defined in control-monad-free-0.6.2 · Control.Monad.Free.Improve
  • Functor (C mu)Defined in control-monad-free-0.6.2 · Control.Monad.Free.Improve
  • Applicative (C mu)Defined in control-monad-free-0.6.2 · Control.Monad.Free.Improve
  • MonadPlus mu => Alternative (C mu)Defined in control-monad-free-0.6.2 · Control.Monad.Free.Improve
  • MonadPlus mu => MonadPlus (C mu)Defined in control-monad-free-0.6.2 · Control.Monad.Free.Improve