His dismissal of haskell is rather misinformed. Haskell has no such problems with cyclic data structures. And this: >Except that abstracting things into func

His dismissal of haskell is rather misinformed. Haskell has no such problems with cyclic data structures. And this: >Except that abstracting things into functions that take the `old' graph as input, and answer the `new' graph as output are not very convenient or easy. Is just crazy. Yes, it is very convenient and easy: http://hackage.haskell.org/package/mtl-2.0.1.0/docs/Control-Monad-State-Lazy.html http://hackage.haskell.org/package/mtl-2.0.1.0/docs/Control-...