Explore a 21-minute video presentation from the POPL 2024 conference on polymorphic type inference for dynamic languages. Delve into a novel type system that combines first-order polymorphism with intersection types, union types, and subtyping. Learn about the safety proofs and the sound, terminating type reconstruction algorithm developed by researchers from CNRS - Université Paris Cité and Université Paris-Saclay. Discover how this system applies Hindley-Milner polymorphism, intersection introduction, and union elimination to deduce expressive types for unannotated functions, making it particularly suitable for typing dynamic languages. Access the full article and supplementary materials, which have been evaluated as reusable artifacts.
Overview
Syllabus
[POPL'24] Polymorphic Type Inference for Dynamic Languages
Taught by
ACM SIGPLAN
Related Courses
-
When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism
-
Getting into the Flow: Towards Better Type Error Messages for Constraint-Based Type Inference
-
Fluent APIs in Functional Languages
-
Mechanizing Refinement Types
-
Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems
-
Type Inference for Application Spines in Higher-Order Languages - WITS'24
