[Haskell-cafe] traversing a tree using monad.cont

[Sebastian Fischer]

> On Sun, May 3, 2009 at 2:40 PM, Ryan Ingram <ryani.spam at gmail.com>  
> wrote:
>> There's a great exposition of using something much like Cont to get
>> success and failure "for free" here:
>> http://www-ps.informatik.uni-kiel.de/~sebf/haskell/barefaced-pilferage-of-monadic-bind.lhs.html

On May 4, 2009, at 10:32 PM, Anatoly Yakovenko wrote:

> thanks, that looks promising, but will probably take me a week to  
> understand :)

maybe the article version is easier to grasp:

http://www-ps.informatik.uni-kiel.de/~sebf/data/pub/atps09.pdf

-Sebastian