[Haskell-cafe] Much faster complex monad stack based on CPS state

Thomas Schilling nominolo at googlemail.com
Wed Sep 28 16:28:57 CEST 2011

Well, you can get something close with the help of IORefs, but I
forgot the details.  I believe this is the paper that explains it:

"Value recursion in the continuation monad" by Magnus Carlsson

On 28 September 2011 15:15, Bas van Dijk <v.dijk.bas at gmail.com> wrote:
> On 28 September 2011 14:25, Ertugrul Soeylemez <es at ertes.de> wrote:
>> Bas van Dijk <v.dijk.bas at gmail.com> wrote:
>>> Because of this reason I don't provide a MonadTransControl instance
>>> for ContT in monad-control[2].
>> Is that even possible?
> I once tried and failed so I believe it's not possible.
> Bas
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe

Push the envelope. Watch it bend.

More information about the Haskell-Cafe mailing list