Decidable Subtyping of Existential Types for Julia

Explore a 19-minute conference talk from PLDI 2024 that delves into the subtyping system of the Julia programming language. Learn about the challenges of Julia's undecidable subtyping and discover a proposed solution to recover decidability through stratification of types. Understand how this approach restricts bounded existential types to method signatures while limiting value types to use-site variance. Gain insights from a corpus analysis suggesting that most existing Julia programs already conform to these restrictions. Examine the implications for generic library implementation and multiple dispatch in scientific computing applications. Access supplementary materials and related research through provided links to deepen your understanding of type systems in modern programming languages.