[Haskell-cafe] Fair diagonals

[Henning Thielemann]

On Wed, 4 Nov 2009, Sjoerd Visscher wrote:

> 
> On Nov 4, 2009, at 3:21 PM, Twan van Laarhoven wrote:
>
>       I looked on hackage but I was surprised that I couldn't find this simple
>       monad. The package level-monad does look very similar, only it uses a
>       different list type for the representation.
> 
> 
> indeed, level-monad works as well:
> 
> import Control.Monad.Levels
> import Data.FMList (fromList)
> 
> diagN = bfs . mapM fromList

Can someone explain the difference between control-monad-omega and 
level-monad?