Numbers and Functions in the Untyped λ-Calculus — II (1.3.2):
Channel: Theo Reto
Date: 2021-11-18

CONTENT

This video is part of the playlist "Lambda Cube Unboxed", a series of 13 videos that explores and exposes the basics of (un-)typed λ-calculus including higher-order parametric polymorphism and dependent types. The resources, from which this video series extracts the offered material, are listed in the description of the playlist.

This video (1.3.2): 
Continuing where we left off in the last video, we discuss recursion in the lambda calculus and take a look at the famous Y-combinator. We then present an example that ties together all the concepts that we have seen so far, by giving a definition for a lambda calculus term to calculate the factorial function.

AUTHORS / OWNERS

The slides and script of the videos were made by Michelle Döring, Felix Moebius and Falk Schimweg. The video was narrated and edited by Douglas Rouse. (Under supervision of Prof. Uwe Nestmann at the Technical University of Berlin.)

© 2021 (CC-BY-NC-ND)
Michelle Döring
Felix Moebius
Falk Schimweg
Douglas Rouse