We present a type theory for higher-order modules that accounts for many current issues in modular programming languages, including translucency, applicativity, generativity, and modules as first-class values. Our theory harmonizes design elements from various previous work, resulting in a simple, economical, and elegant language. This language is useful as a framework for comparing alternative designs, and is the first language to provide all of these features simultaneously and still support a practical type checking algorithm.

57 pages

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

This page maintained by reports@cs.cmu.edu