Type Checking and Reconstruction: Equations and Unification

Related lectures (31)

Page 1 of 4

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

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

Explores maps, type operators, equivalence, first-class types, System Fw, Coq, and the challenges of type checking in programming languages.

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

Covers the foundations of Scala, including modelling recursive types, parameterized types, and variance.

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

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

Explores verified functional programming, formal verification, SMT solvers, type checking, Scala features, automation, and dependent types.

Explores subtyping rules, challenges, and its connection to various forms of polymorphism in programming languages.

Explores the Spec# programming system, focusing on a verifying compiler for C# 2.0.