Computer Science Department
School of Computer Science, Carnegie Mellon University


Sound and Complete Elimination of Singleton Kinds

Karl Crary

January 2000

Keywords: ML, singleton kinds, translucent types, typed compilation

Singleton kinds provide an elegant device for expressing type equality information resulting from modern module languages, but they can severely complicate the metatheory of languages in which they appear. I present a translation from a language with singleton kinds to one without, and prove that translation to be sound and complete. This translation is useful for type-preserving compilers generating typed target languages. The proof of soundness and completeness is done by normalizing type equivalence derivations using Stone and Harper's type equivalence decision procedure.

26 pages

Return to: SCS Technical Report Collection
School of Computer Science homepage

This page maintained by