Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers type inference in statically typed languages, focusing on algorithms like bottom-up propagation and Hindley-Milner constraint-based inference. It explains how to assign types to program expressions and introduces type rules for variables, constants, pairs, and functions. The lecture also delves into Hindley-Milner type inference, supporting generic structured types and showcasing examples of type inference in programs without annotations.