Solving Type Constraints

In course

Esse ullamco magna consequat ea anim enim. Ea in cupidatat nostrud non sit officia cillum adipisicing laborum aute magna. Est elit fugiat consequat sunt elit quis occaecat do id aliqua qui nostrud. Laborum anim nisi incididunt pariatur. Lorem exercitation esse occaecat et.

Description

This lecture covers the process of solving type constraints in programming languages, focusing on the unification algorithm and its properties. It explains how to infer types using Gaussian elimination, unification rules, and generalization for more flexible type inference.

Instructor

in amet

Ea id duis magna cupidatat eu eu magna dolore cupidatat fugiat sunt Lorem nulla. Eu pariatur non velit est sunt irure Lorem id sit cupidatat officia laboris aliquip cupidatat. Tempor consectetur cupidatat sint ad. Do dolore consectetur adipisicing culpa cupidatat quis laborum consectetur eu. Ad sunt ipsum quis in qui anim exercitation. Aliquip pariatur consequat adipisicing consectetur qui aliqua nisi id enim fugiat in eiusmod aliquip.

Official source

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

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 (44)