Lambda Core – HardCore
summary
Java code implements core lambda calculus from scratch using only pure lambda definitions and application, showing Church booleans and numerals, successor, predecessor and arithmetic; recursion works via the Y combinator fixed-point to compute factorial (factorial 3 evaluates to 6 in the demo). A small display library prints lambdas as math notation and a GitHub tool bedlam visualizer maps Java lambdas to Church terms. Claims equivalence with Turing machines and reiterates undecidability of general equivalence; experimental, not production.
AI-written summary · about
chapters (17)
- 0:00Introduction
- 1:18What is this talk about
- 2:14Why did I study mathematics
- 3:46Number
- 7:15Fundaments
- 8:22Set Theory
- 10:23Identity Function
- 13:01Lambda Notation
- 14:41Lambda in Java
- 16:57Lambda from X
- 19:25Display
- 24:27Boolean Algebra
- 30:27Natural Numbers
- 38:46Lambda calculus
- 42:04Proof
- 42:51Summary
- 43:57References








