A Simple Soundness Proof for Dependent Object Types

by   Marianna Rapoport, et al.

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. Our paper comes with a machine-verified version of the proof in Coq.



There are no comments yet.


page 1

page 2

page 3

page 4


Object-Level Reasoning with Logics Encoded in HOL Light

We present a generic framework that facilitates object level reasoning w...

A Path To DOT: Formalizing Fully-Path-Dependent Types

The Dependent Object Types (DOT) calculus aims to formalize the Scala pr...

A sequent calculus with dependent types for classical arithmetic

In a recent paper, Herbelin developed dPA^ω, a calculus in which constru...

A constructive proof of dependent choice in classical arithmetic via memoization

In a recent paper, Herbelin developed dPA^ω, a calculus in which constru...

Interpreted Formalisms for Configurations

Imprecise and incomplete specification of system configurations threaten...

Simple Type Theory is not too Simple: Grothendieck's Schemes without Dependent Types

We report on a formalization of schemes in the proof assistant Isabelle/...

Efficient lambda encodings for Mendler-style coinductive types in Cedille

In the calculus of dependent lambda eliminations (CDLE), it is possible ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.