Recent research has identified significant performance hurdles that sound gradual typing needs to overcome (Takikawa et al. 2016). These performance hurdles stem from the fact that the run-time checks gradual type systems insert into code can cause a lot of overhead. We propose a small sacrifice in flexibility that enables us to implement efficient checks. We formalize the core of a nominal object-oriented language that fulfills a variety of desirable properties for gradually typed languages, and present evidence that an implementation of this language suffers minimal overhead even in adversarial benchmarks identified in earlier work, while achieving good overall performance.
Wed 25 Oct
13:30 - 15:00: OOPSLA - Gradual Types and Memory at Regency A Chair(s): Jennifer B. SartorVrije Universiteit Brussel | ||||||||||||||||||||||||||||||||||||||||||
13:30 - 13:52 Talk | Spenser Andrew BaumanIndiana University, USA, Sam Tobin-HochstadtIndiana University, Jeremy G. SiekIndiana University, USA, Carl Friedrich Bolz-Tereick DOI | |||||||||||||||||||||||||||||||||||||||||
13:52 - 14:15 Talk | DOI | |||||||||||||||||||||||||||||||||||||||||
14:15 - 14:37 Talk | Gregor RichardsUniversity of Waterloo, Ellen ArtecaUniversity of Waterloo, Canada, Alexi TurcotteUniversity of Waterloo DOI | |||||||||||||||||||||||||||||||||||||||||
14:37 - 15:00 Talk | Tomoharu UgawaKochi University of Technology, Japan, Tatsuya AbeChiba Institute of Technology, Japan, Toshiyuki MaedaChiba Institute of Technology, Japan DOI |