LSS: LSM roundtable

While reading this I kept seeing parallels to the problem of combining monads in haskell. Simple stacking won't do; the current solution of monad transformers essentially requires each possible combination of monads to be coded up separately. While that's a combinatorial explosion, luckily haskell only has 4 or 5 commonly used monads so it's manageable.

Anyway, that's way out there and advanced mathematics will probably not come to the kernel's rescue the way it often comes to haskell's, but I thought it was an interesting way of looking at this.