~/talk

Lambda Calculus - Foundation of Functional Programming

slides:none on file

JavaScript implementations show lambda calculus constructs: Church numerals implemented as n-fold function application, Church booleans with select-first/select-second functions, successor as one-more application, predecessor via the pair-iteration trick discovered historically while waiting for dental work, and arithmetic built from these. Recursion uses the Z combinator (eager form of Y), enabling factorial and integer division (truncating remainder). Complexity reaches up to O(n^4) for exponentiation-based designs. All code runs from a GitHub repo and tests complete in about 18 ms on Bun/M1.

AI-written summary · about

  1. 0:00Introduction and background
  2. 1:30Books and resources
  3. 2:20Lambda calculus foundations
  4. 12:24Implementing core logic
  5. 22:13Arithmetic and recursion
  6. 39:46Advanced operations and lists
  7. 44:20Testing implementations
  8. 45:09Conclusion and wrap up
~/search
type to search 6,518 conferences, 143,918 speakers and 192,133 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
← →
on a talk: 5 seconds back / forward
0–9
on a talk: jump to 0%–90% of the recording
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.