Paul Johnson wrote:
Yves Parès wrote:
It helps me understand better, but would you have some simple code
that would do that ?
http://www.cs.chalmers.se/~koen/pubs/jfp99-monad.ps
You can also understand coroutines and continuations in terms of
operational semantics. Here is a reimplementation of Koen Claessen's
poor man's concurrency monad based on this approach:
PoorMansConcurrency.hs
http://projects.haskell.org/operational/examples.html
Regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
