Introduction to Lambda Calculus
summary
Explains how Church numerals encode numbers as functions and demonstrates converting 50 to a Church numeral and back, showing the REPL yields 50; defines a successor→plus→mul→exp chain where successor turns 50 into 51, plus computes 5+6=11, multiplication gives 2×3→6, and exponentiation gives 2^3→8 and 4^0→1; builds pairs as data structures and booleans, implements predecessor/monus so 5−2→3 and 2−5→0, and links code to a GitHub repo.
AI-written summary · about
chapters (14)
- 0:00Intro
- 1:13Origins
- 1:47Why are we here?
- 2:28Syntax - terms
- 6:08Church numerals
- 7:08Examples
- 11:19Building on successor
- 13:01Building on addition
- 15:48Building on exponentiation
- 16:57What's next?
- 18:55Ordered pairs
- 19:29Logic
- 21:07Mathematical predicates
- 27:53Related topics
