Dependent Object Types (DOT) is intended to be a core calculus for modelling Scala. Its distinguishing feature is abstract type members, fields in objects that hold types rather than values. Proving soundness of DOT has been surprisingly challenging, and existing proofs are complicated, and reason about multiple concepts at the same time (e.g. types, values, evaluation). To serve as a core calculus for Scala, DOT should be easy to experiment with and extend, and therefore its soundness proof needs to be easy to modify.
This paper presents a simple and modular proof strategy for reasoning in DOT. The strategy separates reasoning about types from other concerns. It is centred around a theorem that connects the full DOT type system to a restricted variant in which the challenges and paradoxes caused by abstract type members are eliminated. Almost all reasoning in the proof is done in the intuitive world of this restricted type system. Once we have the necessary results about types, we observe that the other aspects of DOT are mostly standard and can be incorporated into a soundness proof using familiar techniques known from other calculi.
Wed 25 Oct Times are displayed in time zone: (GMT-07:00) Tijuana, Baja California change
|10:30 - 10:52|
Izzat El HajjUniversity of Illinois at Urbana-Champaign, USA, Thomas B. JablinUniversity of Illinois at Urbana-Champaign, USA / Multicoreware, USA, Dejan MilojicicHewlett Packard Labs, USA, Wen-mei HwuUniversity of Illinois at Urbana-Champaign, USADOI
|10:52 - 11:15|
Marianna RapoportUniversity of Waterloo, Canada, Ifaz KabirUniversity of Waterloo, Canada, Paul HeUniversity of Waterloo, Canada, Ondřej LhotákUniversity of Waterloo, CanadaDOI
|11:15 - 11:37|
|11:37 - 12:00|
Avik ChaudhuriFacebook, USA, Panagiotis VekrisUniversity of California at San Diego, USA, Sam GoldmanFacebook, USA, Marshall RochFacebook, USA, Gabriel LeviFacebook, USADOI