Lambda Calculus - Foundation of Functional Programming - Mark Volkmann - NDC Oslo 2026

Value of the Information & Strength of the Argument

VALUE: The talk offers a clear and practical introduction to a fundamental topic that many programmers encounter only as a vague concept. By providing JavaScript equivalents for each lambda calculus expression, Volkmann bridges the gap between abstract theory and concrete coding, making the material accessible and actionable. The progression from booleans to numbers and arithmetic demonstrates how complex operations can emerge from simple function applications, which is intellectually valuable and helps deepen understanding of functional programming paradigms.

ARGUMENTATION: The reasoning is solid and logically sequenced. Each step builds on the previous one, and the speaker anticipates potential confusion by explicitly explaining why certain function choices are made (e.g., representing true as the first-argument selector). The worked examples for beta reduction and for the predecessor algorithm illustrate the correctness of the definitions. The argumentation is convincing because it not only states the rules but also shows how they are applied in concrete computations.

Scientific Rigor, Source Quality, Title Accuracy

RIGUEUR: The scientific rigor is high. The content is based on well-established concepts in lambda calculus, and the speaker accurately names historical figures (Alonzo Church, Stephen Kleene) and relates the topic to Peano numbers. The formal rules (alpha, beta, delta, eta) are correctly explained, and the JavaScript implementations are faithful to the lambda calculus semantics. No references are cited within the talk itself, but the field is classical and the explanations are consistent with standard literature.

SOURCES: The only external sources are the conference website links in the description (ndcconferences.com, ndcoslo.com), which are not content-specific. The talk does not provide a bibliography, but the audience is expected to know that this topic is widely documented. The absence of explicit citations does not undermine the correctness, given the canonical nature of the material.

TITRE: The title is accurate and descriptive. It clearly states the subject (lambda calculus) and its relevance to functional programming, along with the speaker and event. It sets proper expectations for the content.

The title precisely matches the content: it is entirely about lambda calculus and how it underpins functional programming concepts.

8/10

The talk is presented by an experienced software engineer and covers established theoretical concepts accurately. The explanations are clear and logically structured, though no external citations are given directly.

Markers derived by PSI from the transcript: the creator did not define chapters.

• 00:00Introduction and personal anecdote about the band Conradson
• 05:00Definition of lambda calculus and its core principles (pure functions, anonymous functions, etc.)
• 10:00Historical context: Alonzo Church, Stephen Kleene, and relation to Turing
• 15:00JavaScript syntax for functions and currying, preparing for lambda calculus implementation
• 20:00Formal evaluation rules: alpha conversion, beta reduction, delta rules, eta conversion
• 25:00Implementing booleans (true/false) as functions and logical operations NOT, AND, OR
• 30:00Church numerals: representing numbers as functions that apply a function n times
• 35:00Successor function and addition using iterated successors
• 40:00Predecessor function and Kleene's pair-based solution

• NDC Conferences — Conference organizer website providing information about NDC events.
• NDC Oslo — Specific conference page for NDC Oslo where this talk was recorded.

• Lambda calculus - Wikipedia — Standard reference confirming the definitions and rules described in the talk.
• Church encoding - Wikipedia — Explains the representation of numbers and booleans as functions, consistent with the talk.

• ndcoslo.com