4 HN users recommended this talk4 months2013–2019score 5.5
Years with an HN recommendation, 2007–2026
Strongly recommended in lambda calculus and Y-combinator threads as a mind-expanding half hour that clarifies the ideas.
Tom Stuart's Ruby Manor 3 talk builds FizzBuzz using nothing but Ruby lambdas, working through Church encodings of numbers, booleans and data structures. It is a hands-on introduction to lambda calculus.
“An awesome video which changed my perspective towards lambda calculus and programming in general” (HN, 2015)
If you are curious about the topic, I strongly recommend watching these videos: Y Not- Adventures in Functional Programming by Jim Weirich [link] Programming with Nothing by Tom Stuart [this video]
For anyone who finds this interesting, I cannot recommend enough investing a half hour in watching the "Programming With Nothing" talk: [this video] In it, the speaker implements fizzbuzz using only lambda calculus (making significant use of church encoding).
Implements FizzBuzz using only lambda calculus and Church encoding
There's a good elaboration of it in Tom Stuart's "Programming With Nothing" talk[0], in which he does a lambda calculus implementation of FizzBuzz in what's left of Ruby if you leave everything out except the things strictly necessary to do lambda calculus - with the exception of what you could call C-style macros (basically text search-and-replace, so you can call a section of code FOO and just type FOO everywhere you would have typed that section of code). There's also the little matter of output - you need to translate the resulting Church numerals into readable form for those who can't see that you've obviously produced correct FizzBuzz. There's a good enough explanation that what needs to be sort of hand-waved for brevity (things that are shown but not really explained in detail) aren't entirely opaque - you will be able to figure it out. Keep in mind, too, that the lambda calculus is a lot like machine language in one respect - the same little bit of "code" can have more than one meaning to the programmer even if the "machine" is doing exactly the same thing. [0] [this video]
Good explanation of FizzBuzz in lambda calculus using restricted Ruby
The same thing, but in Ruby stabby-proc notation (from 2012) by Tom Stuart: [this video] Well, perhaps not exactly the same thing, but only because Ruby requires the Z-combinator due to applicative order.
Video list and Hacker News comment labels from HackerTube (prompted by @karpathy), released under ODC-By 1.0, built on the open-index/hacker-news archive. Hacker News data is provided by Y Combinator; comments remain the work of their authors. Video titles, channel names and thumbnails belong to their creators and are shown via YouTube. HackerTube Watch is an unofficial edition. Data export of 2026-10-31.
5 Hacker News comments
From the HN archive; up to 20 kept per video, favoring different commenters. Recommendations first.
Read more
Citations, criticism and jokes