Type Systems

When Subtyping Constraints Liberate
TBD
Cite Github Project
A case for DOT: Theoretical Foundations for Objects With Pattern Matching and GADT-style Reasoning
Many programming languages in the OO tradition now support pattern matching in some form. Historical examples include Scala and Ceylon, …
PDF Cite Video DOI Github Project View on conference website
The Simple Essence of Algebraic Subtyping
MLsub extends traditional Hindley-Milner type inference with subtyping while preserving compact principal types, an exciting new …
PDF Cite Video DOI Github Project View on conference website
Unifying Analytic and Statically-Typed Quasiquotes
Metaprograms are programs that manipulate (generate, analyze and evaluate) other programs. These tasks are greatly facilitated by …
PDF Cite Video DOI Github Project