jeff p wrote:
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.
I have been unable to see how to bring its crucial "reify" and "reflect" to Haskell. In particular reflect:
reflect :: m a -> a It looks very magical. _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
