Church Numerals and Conditionals

Related lectures (32)

Page 1 of 4

Provides an overview of lambda calculus, type safety, and type inference in programming languages.

Explores lambda calculus, higher-order functions, and recursive function encoding.

Explores advanced Python programming concepts, focusing on list comprehensions and higher order functions.

Explores Church numerals, Booleans, pairs, recursion, and behavioral equivalence in Lambda Calculus.

Delves into type checking, reconstruction, equations, unification, Hindley/Milner system, polymorphism, and principal types.

Delves into Lambda Calculus proofs, emphasizing structural induction and variable manipulation.

Introduces terms, abstractions, applications, and values in the lambda calculus.

Covers the simply typed lambda calculus, focusing on its syntax, semantics, and type system properties such as progress and preservation.

Covers operational semantics and evaluation strategies in lambda calculus, including redex, alternative evaluation strategies, and Church Booleans.

Covers types in lambda calculus, including defining types, specifying rules, and proving soundness.