[Haskell-cafe] monad subexpressions
simonpj at microsoft.com
Fri Aug 3 11:14:01 EDT 2007
| Couldn't this be best done with McBride and Patterson's Applicative
| idiom notation?
| So the above would become
| [[l m (pure x) n (pure y)]] (or something like that)
| It would have the advantage of being usable with any Applicative, not
| just Monads.
Does anyone have a pointer to a stand-alone description of "full-scale idiom notation".
More information about the Haskell-Cafe