Lambda (λ) Calculus Primer

A primer on the lambda calculus with the aim of giving a basic understanding of the theoretical underpinnings of functional programming. Contents: 1. What is the lambda calculus? 2. Defining a function as a lambda abstraction 3. The simple untyped lambda calculus 4. Evaluation rules 5. Normal form and reduction orders ------------------------------------------------------- This video is part of the Introduction to Functional Programming with Haskell video course (    • Intro to Functional Programming with ...   ). Code shown in the course is available on Github here: https://github.com/LigerLearn/intro-to-fp-with-haskell-course

• #education
• #lambda_calculus
• #
• #calculus
• #functional_programming
• #delta_rules
• #rules
• #reduction
• #beta_reduction
• #alpha_reduction
• #alpha_conversion
• #reduction
• #conversion
• #conversion
• #eta_conversion
• #reduction
• #eta_reduction
• #lambda_abstraction
• #abstraction
• #reduction_orders
• #normal_order
• #church_rosser
• #church
• #rosser
• #church_rosser_theorems