Introducing Lambda Calculus with Python
summary
Covers concrete implementations rather than theory: untyped lambda calculus encoded with Python lambda showing how to implement abstraction and application, substitution, and basic combinators; encodes datatypes — Church numerals, booleans and logical ops — and implements successor/add/mul, predecessor and predicates; demonstrates recursion via the Y combinator and shows factorial(6)=720 and fibonacci(9)=34 while explaining Python s eager evaluation implications and the practical workarounds used.
AI-written summary · about
chapters (7)
related talks
21mBecome a Better Pythonista by Abusing List Comprehensions and :=
46mOn Being Pythonic
37mSnakes and Ladders: The Ups and Downs of Python Development with AWS Lambda
49mYou Used Python for What?!
01h 14mThe Five Kinds of Python Functions
01h 31mFive Kinds of Python Functions
30mFunctional Programming in Python
29mWriting Functional Code in Python
