YoVDO

Solving Constraints During Type Inference - WITS'24

Offered By: ACM SIGPLAN via YouTube

Tags

Type Inference Courses Haskell Courses Functional Programming Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the intricacies of type inference in GHC through this 33-minute conference talk from ACM SIGPLAN's WITS'24. Delve into Simon Peyton Jones' comprehensive overview of GHC's unique approach to type inference, which employs Pottier and Rémy's method of generating and solving constraints separately. Gain insights into key concepts such as bidirectional type inference, implication constraints, level numbers and promotion, evidence generation, and quantified constraints. Learn how these elements work together to create a robust type inference engine, and understand the challenges and solutions encountered during its implementation. Discover how GHC's approach supports advanced features like type abstraction and GADTs, and explore the interplay between type-level and term-level evidence generation.

Syllabus

[WITS'24] Solving constraints during type inference


Taught by

ACM SIGPLAN

Related Courses

Functional Programming Principles in Scala
École Polytechnique Fédérale de Lausanne via Coursera
Functional Program Design in Scala
École Polytechnique Fédérale de Lausanne via Coursera
Paradigms of Computer Programming
Université catholique de Louvain via edX
Introduction to Functional Programming
Delft University of Technology via edX
Paradigms of Computer Programming – Fundamentals
Université catholique de Louvain via edX