Series: A Quick Taste of Programming Languages
//
The series is tend to discuss some basic concepts in PL theory and their implementation from a beginner’s perspective.
Implementing Primitives with Lambda
Using our interpreter to play with Currying, Nat, condition and recursion.
Implementing the Lambda Calculus
Building an interpreter for the ‘simplest’ programming language.
Introduction: A Simple EVAL and COMPILE Example
We go faster, and we go lower.