4 ms·You can define a tree-walking interpreter in an ML just by recursion and pattern matching.by vmchale 3y agoYou can define a tree-walking interpreter in an ML just by recursion and pattern matching.xcdzvyn 3y agoI'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.vmchale 3y agoHaving a garbage collector is good in a compiler.