A syntactic account of singleton types via hereditary substitution

We give a syntactic proof of decidability and consistency of equivalence for the singleton type calculus, which lies at the foundation of modern module systems such as that of ML. Unlike existing proofs, which work by constructing a model, our syntactic proof makes few demands on the un-derlying proof theory and mathematical foundation. Con-sequently, it can be — and has been — entirely formulated in the Twelf meta-logic, and provides an important piece of a Twelf-formalized type-safety proof for Standard ML. The proof works by translation of the singleton type cal-culus into a canonical presentation, adapted from work on logical frameworks, in which equivalent terms are written identically. Canonical forms are not preserved under stan-dard substitution, so we employ an alternative definition of substitution called hereditary substitution, which contracts redices that arise during substitution.