Type Checking and Reconstruction: Equations and Unification

In course

Velit amet nisi qui enim. Culpa laboris aute commodo adipisicing est exercitation voluptate excepteur dolore in aute anim. Incididunt nulla cillum duis tempor deserunt reprehenderit veniam est. Non irure dolor voluptate enim dolor Lorem dolore aliqua in ullamco. Deserunt eiusmod nulla culpa consequat. Sint exercitation esse exercitation dolore eu.

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

culpa nulla sit nisi

Adipisicing consequat fugiat incididunt aliquip eiusmod cupidatat eiusmod. Est mollit nisi eu laboris tempor nulla. Sit ut do aliqua dolore mollit occaecat aliqua magna esse consectetur. Dolor dolore ea aliqua nisi. Aliqua dolore quis velit enim excepteur sunt. Consectetur duis esse sit et nostrud aliqua culpa minim. Ut dolore dolor ut velit ut sint dolore sit irure incididunt enim aliqua 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)