Lambda Core - Hardcore

on YouTube ↗41m

" summary

Scala code reconstructs Church encodings from scratch using only the compiler and the small presentation library badlang to render lambdas. It builds Church numerals (0,1,2...), defines successor, plus, multiply (67 = 42) and a complex predecessor, then uses the Y combinator* to produce recursion and compute factorial(6) = 720. The demo works live, shows how booleans and conditionals emerge from lambdas, and reiterates undecidability of a general truth test.

AI-written summary · about

" chapters (13)

1. 0:00Introduction
2. 1:46Lambda calculus origins
3. 3:12Lambda for math survival
4. 7:04Lambda in Scala
5. 10:20Boolean logic from scratch
6. 17:22Natural numbers & arithmetic
7. 23:46Predecessor function
8. 27:03Y combinator & recursion
9. 31:22Turing-complete lambda
10. 32:46Lambda theorems & limits
11. 37:01Lambda history
12. 39:08Resources
13. 40:55Q&A

" related talks

• 46mLambda Core – HardCoreJarek Ratajski · Voxxed Days Ticino 2017
• 30mLAMBDA CORE – HARDCOREJarosław Ratajski · Scalar Conference 2017
• 52mLambda Core – HardCoreJarek Ratajski · Voxxed Days Vienna 2017
• 42mPractical Lambda CalculusEinar W. Høst, Jonas Winje · Code Mesh 2015
• 37mLearn You Some Lambda CalculusBernardo Amorim · Code Mesh LDN 2020
• 34mAn introduction to Lambda CalculusLucas F da Costa · CityJS Conference São Paulo 2022
• 01h 01mLambda? You Keep Using that LetterKevlin Henney · NDC London 2020
• 48mIt’s birds all the way down: Fun Introduction to Lambda CalculusLucas Fernandes Da Costa · Armada JS 2019