Infinite Lambda Calculus
summary
Demonstrates that self-reproduction in the pure lambda calculus supplies general recursion where names and self‑reference are forbidden, implements a Y combinator by wrapping a replicated expression, and proves it by running code in Emacs with Racket and checking types in Standard ML. The implementation duplicates definitions to grow the domain, survives thousand+ evaluation steps and prints a working FizzBuzz printed to out: sequence (run over ~2000 lines), so the construction actually terminates when expected.
AI-written summary · about
chapters (23)
- 0:00Intro
- 1:00Lambda Calculus
- 1:50Application
- 2:50Functions
- 3:40Programming
- 4:50Lambda
- 6:10Plus
- 11:40How big is A
- 12:30Open source
- 13:00Nesting
- 14:00Turing completeness
- 15:15Type systems
- 16:00Recursion
- 19:00Self Application
- 20:00Infinite Loop
- 29:35Symmetry
- 30:40RealWorld
- 31:40Print
- 32:50Check
- 33:50Helper functions
- 35:10FBPrime
- 38:15Noise
- 39:05Y Combinator
related talks
01h 00mTheory and Models of Lambda Calculus Untyped and Typed - Part 3 of 5
06mLightning Talk: The Lambda Calculus in C++ Lambdas
01h 02mTheory and Models of Lambda Calculus Untyped and Typed - Part 4 of 5
33mTheory and Models of Lambda Calculus Untyped and Typed - Part 5 of 5
44mSome History of Functional Programming Languages
17mRLM: Recursive Language Models for Large Codebases
10mWhen Does a Program Typecheck?
42mKEYNOTE: Liveness, Literacy, Local First, Lambdas and Llamas