We explore how set-theoretic types could address how many statically typed languages do not allow libraries to evolve their public data definitions in a backwards compatible manner. The proposed solution aims to be automatically verified by the compiler and type safe.

Dashbit's platform  covers topics related to Elixir programming language, Phoenix web framework, and functional programming. Through articles, tutorials, and case studies, Dashbit offers insights into building scalable and fault-tolerant applications with Elixir and Erlang OTP. Developers can learn about concurrent programming, distributed systems, and building resilient backend services using Elixir and related technologies.

Dashbit

This post explores how set-theoretic types in Elixir can address issues with data evolution in statically typed languages, focusing on maintaining backwards compatibility in library data definitions. It discusses challenges with breaking changes, illustrates the use of structural subtyping, explains a proposed versioning mechanism called revisions, and emphasizes the importance of type safety and progressive data evolution.

Data evolution with set-theoretic types

Breaking changes: libraries vs applications

Data instantiation with structural subtyping