Hacker News Reader

You can define a tree-walking interpreter in an ML just by recursion and pattern matching.

I'm really upset Haskell is so slow/GC'd/etc. Every other language feels like a chore coming from it, particularly for parsers and interpreters.

Having a garbage collector is good in a compiler.