Combinatory logic

Related lectures (13)

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

Explores Church numerals and encoding conditionals in lambda calculus.

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

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

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

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

Covers high-order functions, parser, and type checker concepts.

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

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

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

Covers the semantics of programming languages, focusing on the Add language and the role of rewriting rules and CK machines in understanding meaning.

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

Explores elements from Ergodic Theory, transformations, invariant sets, and Lyapunov Exponents for 1-dimensional maps.

Page 1 of 1