[Haskell-cafe] Can every monad can be implemented with Cont?
(was: New slogan for haskell.org)
mutjida at gmail.com
Sat Oct 13 11:03:26 EDT 2007
> >> Didn't someone already prove all monads can be implemented in terms
> >> of Cont?
> > Cont and StateT, wasn't it?
> > And the schemers have no choice about running in StateT :)
> You sure? I want to see the proof :)
I think this is referring to Andrzej Filinski's paper "Representing
Layered Monads" in which it shown that stacks of monads can be
implemented directly (no layering) by using call/cc and mutable state.
More information about the Haskell-Cafe