Live Lambda Calculus
summary
Implements a lambda‑calculus interpreter from scratch in F# and fparsec, parsing into an AST, writing an unparser, and reducing via a substitution-based evaluator (no environment lookups). Builds a simple REPL and stepper that prints each reduction step, and encodes numbers as Church numerals to implement addition; live demo shows the addition producing five applications (five f’s). Includes a hosted Suave web demo for trying expressions.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 4:50Syntax
- 12:20Parsing
- 14:05Parsec
- 17:03Expressions
- 25:27Parse
- 36:52Evaluation
- 40:52Reduce
- 46:02Test
- 51:01Turing completeness
related talks
42mPractical Lambda Calculus
37mLearn You Some Lambda Calculus
21mλ-Calculus: A Brief History of Functional Programming
51mGreek Classics: Lambda Calculus For Beginners
48mIt’s birds all the way down: Fun Introduction to Lambda Calculus
34mAn introduction to Lambda Calculus
01h 21mLearning F# by Designing Your Own Language
01h 02mThe Book of F#
