✨ This lightning talk was recorded at Lambda Days 2024. If you're curious about our upcoming event, check https://lambdadays.org ✨ In this session, we'll explore the practical representation of gradual set-theoretic types for Elixir. We'll demonstrate how this implementation shifts a lot of complexity from the type-checker to the type representation itself. Key points include: - Practical applications: Representing disjoint unions of base types and progressive integration of singleton types. - Addressing challenges: Strategies for handling pretty-printing and type simplifications. - Focus on dynamic: Illustrating its elegant representation through set-theoretic types in Elixir, and the distinction between static, dynamic, and gradual types. The presentation showcases a general structure demonstrated through Elixir examples, but which can be used to accommodate other languages. Let's keep in touch! Follow us on: 💥Twitter: https://twitter.com/LambdaDays 💥LinkedIn: https://www.linkedin.com/company/lambda-days 💥Facebook: https://www.facebook.com/lambdadays 💥Mastodon: https://genserver.social/codesync