Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Solving Type Constraints
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.
Official source
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.