formalization of the Dependent Object Types (DOT) calculus
Switch branches/tags
Nothing to show
Clone or download
Latest commit 6b36c46 Sep 8, 2016
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.gitignore update gitginore with latex and ocaml junk Jun 30, 2012
README.md change to public link Sep 8, 2016

README.md

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: