ConceptSystems & CS
Lambda calculus
A formal system in mathematical logic for function definition, application and recursion.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Church encoding2Mutable data in lambda calculus2Church encoding of cons1Denotational semantics1Environment model of evaluation1EXPT recursion procedure1Infinite loops in lambda calculus1Polymorphic lambda calculus1SK combinators1Syntactic specification for indefinite arguments1System FC1Typed lambda calculus1
Lecturers
1Lectures that assume it
9- Metacircular Evaluator, Part 1 (1986)
- Why Functional Programming Matters: Higher-Order Glue & Lazy Evaluation
- Computational Objects
- The Power of Abstraction (ACM A.M. Turing Award Lecture)
- Metacircular Evaluator, Part 2
- Computational Objects
- Escape from the Ivory Tower: The Haskell Journey
- Computer Science and Homotopy Theory
- Why Functional Programming Matters
Connections
17The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Function
- Mathematical logic
- Church encoding
- Mutable data in lambda calculus
- Church encoding of cons
- Denotational semantics