Gradualizing Languages with Set-Theoretic Types in Elixir

Explore a 44-minute conference talk from Lambda Days 2024 that delves into the practical implementation of gradual set-theoretic types in Elixir, demonstrating how complexity can be shifted from type-checking to type representation. Learn about representing disjoint unions of base types, integrating singleton types, and handling challenges like pretty-printing and type simplifications. Discover the elegant representation of dynamic typing through set-theoretic types in Elixir, understanding the distinctions between static, dynamic, and gradual types. While the examples focus on Elixir, gain insights into a general structure that can be applied to other programming languages. Master practical applications and implementation strategies that bridge the gap between theoretical type systems and real-world programming challenges.