We are a coalition of researchers seeking to discover the unifying principles underlying the design of gradual type systems through reproducibility studies, implementations of type systems and tools, plus evaluations covering both the feasibility of gradual typing as well as its long-term value to software engineers.
Justin Pombrio successfully defended his dissertation.
Symbolic Types for Lenient Symbolic Execution by Stephen Chang, Alex Knauth, and Emina Torlak appeared at POPL 2018
Refinement Types for Ruby by Milod Kazerounian, Niki Vazou, Austin Bourgerie, Jeffrey S. Foster, and Emina Torlak appeared at VMCAI 2018
Sound Gradual Typing Only Mostly Dead by Spenser Bauman, Carl-Friedrich Bolz-Tereick, Jeremy Siek, and Sam Tobin-Hochstadt appeared at OOPSLA 2017
Theorems for Free for Free: Parametricity, With and Without Types by Amal Ahmed, Dustin Jamner, Jeremy Siek, and Philip Wadler appeared at ICFP 2017
Automatically Generating the Dynamic Semantics of Gradually Typed Languages by Matteo Cimini and Jeremy Siek appeared at POPL 2017
Big Types in Little Runtime by Michael Vitousek, Cameron Swords, and Jeremy Siek appeared at POPL 2017
Just-in-Time Static Type Checking for Dynamic Languages by Brianna Ren and Jeffrey S. Foster appeared at PLDI 2016
Occurrence Typing Modulo Theories by Andrew Kent, David Kempe II, and Sam Tobin-Hochstadt appeared at PLDI 2016
Asumu Takikawa successfully defended his dissertation.
Joe Gibbs Politz successfully defended his dissertation.
Practical Optional Types for Clojure by Ambrose Bonnaire-Sergeant, Sam Tobin-Hochstadt, and Rowan Davies appeared at ESOP 2016
The Gradualizer: a methodology and algorithm for generating gradual type systems by Matteo Cimini and Jeremy Siek appeared at POPL 2016