Lambda Core – HardCore
summary
Demonstrates that full untyped lambda calculus is encoded in plain Java using a tiny custom library that prints terms, defines pure lambda in Java values for true/false and Church numerals, implements successor, plus, multiply and a predecessor, and uses a Y combinator for recursion to compute factorial (demo prints 6 for 3). Shows multiplication yields computed 42 via multiplication. Notes it runs but equivalence/halting checks are undecidable and typed/lazy issues are omitted.
AI-written summary · about
chapters (12)
- 0:00Who am I
- 1:10Agenda
- 2:07Why I studied Mathematics
- 3:48What is the number
- 5:18Empty set
- 8:03The holy grail
- 9:27The Russell paradox
- 12:11Identity function
- 14:17Lambda
- 16:36Lambda in Java
- 21:27Lambda Identity
- 24:32Lambda Display
