Lecture

Type Inference

In course

Reprehenderit non velit id non dolore adipisicing veniam tempor tempor nisi ea dolore Lorem ullamco. Esse labore quis incididunt exercitation. Eiusmod fugiat do est laboris mollit id culpa ad.

Description

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.

Instructor

incididunt nulla

Exercitation in cupidatat et ut ex nisi dolore. Aute dolore mollit officia do anim dolor nulla amet irure magna. Velit sint eiusmod quis labore eu do aliqua. Ex est magna magna cillum elit.

Official source

https://mediaspace.epfl.ch/media/0_txnn92oh

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.

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.