Constraint Typing with Boolean Algebra - Scala Days Seattle

This course demonstrates how Scala 3 features can express composable constraints on data types without introducing separate types. It covers runtime and compile-time verification, including Boolean combinations of constraints.

Syllabus

Intro
Programming without constraints
Compile time enforced constraints?
Refinement example: underconstrained
"Traditional" Refinement System Insight
Singleton Constraint Typing: Test
First Implement the Computation
Implement Compile Time Verification
Black Box to White Box Paradigm Shift
Embracing Literal Types
Data Type with Internal Structure (w/ error)
Summarizing the Key Ideas