Lecture

Type Checking and Reconstruction: Equations and Unification

In course

Cillum aliqua pariatur in incididunt sunt exercitation. Nulla in aliquip magna laborum. Nisi cillum sit sunt quis proident.

Description

This lecture covers the concepts of type checking and type reconstruction in lambda calculus, focusing on transforming judgements into equations and using unification to find type solutions. It also explores soundness and completeness of type systems, the Hindley/Milner system, polymorphism, and the translation of programs into System F. The instructor explains the limitations of Hindley/Milner, the essence of let expressions, and the importance of principal types in type schemes.

Instructor

duis fugiat

Adipisicing pariatur nisi ad ut tempor incididunt proident aliqua anim eu tempor excepteur. Ipsum culpa laboris fugiat ea laboris. Qui do ullamco officia consequat. Incididunt sint mollit voluptate ad cillum.

Official source

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

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, Type theory

Related lectures (37)

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.