On Fri, Jul 15, 2005 at 11:51:59PM +0200, Magnus Carlsson wrote: > A while ago, I attempted to marry value recursion a la Levent Erkök with > the continuation-monad transformer. It seems possible if the underlying > monad has value recursion and references. Interestingly, all mfix > properties except left shrinking appear to be valid. > > There are slides about this (including implementation) at > > http://www.cse.ogi.edu/~magnus/mdo-callcc-slides.pdf > > There is also a draft paper at > > http://www.cse.ogi.edu/~magnus/mdo-callcc.pdf
I've already found your paper and played with the implementation :-) I was stupid to think that with MonadCont+MonadFix+getCC it would be possible to do forward jumps, but of course it doesn't work because of the strictness law. Best regards Tomasz _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
