Type Inference: Hindley-Milner Overview

Related lectures (32)

Page 1 of 4

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

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

Explores type inference in statically typed languages, using algorithms to assign types to program expressions accurately.

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

Covers the Compiler Extension Lab, focusing on adding new functionality to a simple functional language compiler.

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

Covers type rules, program type checking, soundness, and proof techniques.

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

Introduces the CS411 Class Project, where students design and test a lesson using learning theories.

Explores the rigorous bounds on effective properties of isotropic phases and laminated plates.