formalization of the Dependent Object Types (DOT) calculus
Latest commit 6b36c46 Sep 9, 2016 @namin committed on GitHub change to public link
Failed to load latest commit information.
.gitignore change to public link Sep 8, 2016

Dependent Object Types (DOT)

The DOT calculus proposes a new type-theoretic foundation for languages like Scala. The latest rules (PDF) are for a small-step storeless variant with full subtyping lattice, recursive types including their subtyping, and dependent method types. Here is the corresponding mechanized soundness proof.

From F to DOT in Small-Step:

Historical development: