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 assigning types to program expressions. It explores algorithms like bottom-up propagation types and Hindley-Milner constraint-based type inference. The process involves generating constraints, unifying type variables, and solving equations to infer types accurately.