Lecture

Type Inference: Hindley-Milner Overview

Description

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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.