Fun with Lambdas!
summary
Starts with only two lambdas (the identity and the K combinator) and Vim and the CLI, uses Ruby code and live tests to build booleans, an if/not operator, a pair/list cons and head/tail implementation, and simple assert/refute harnesses. The claim is that everything — booleans, pairs, lists — is encoded from those two lambdas; code is exercised interactively and the tests show the constructions working as described.
AI-written summary · about
chapters (11)
- 0:00Introduction
- 1:05Ruby lambdas
- 4:18Identity and constant functions
- 8:11Assert and refute functions
- 15:44Refactoring assert/refute with if
- 19:34Not and Boolean logic
- 21:03Wishful thinking with lists
- 26:48Pairs for list structure
- 31:36List operations head/tail
- 35:14Combinators and lambdas
- 36:38Summary
related talks
48mIt’s birds all the way down: Fun Introduction to Lambda Calculus
47mThere is a bluebird in my talk that wants to get out
53mExplaining Lambda Calculus through Plain JavaScript
34mThe universe in a single arrow: A live dive into the lambda calculus
01h 03mLambda Calculus For People Who Can't Be Bothered to Learn It - part 2 of 2
59mLambda Calculus For People Who Can't Be Bothered to Learn It - part 1 of 2
01h 06mLambdas - uses and abuses
30mThe Universe in a Single Arrow: A Live Dive into the Lambda Calculus