Lambda Calculus: Operational Semantics and Evaluation Strategies

Related lectures (32)

Page 1 of 4

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

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

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

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

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

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

Explores Church numerals and encoding conditionals in lambda calculus.

Introduces Coq, an interactive theorem assistant based on the Curry-Howard isomorphism.

Covers Hoare Logic, its foundations, applications, and significance in program verification.

Covers the basics of programming, including types, variables, methods, functions, conditions, loops, and boolean logic.