Presents an environment-based interpreter for recursive functions, optimizing evaluation through parameter bindings and eliminating the need for explicit substitutions.
Explores parsing text into trees using parser combinators in Scala, covering filtering, transforming, sequencing, alternatives, recursion, spaces handling, lexing, monadic nature, and for-notation.
