The ML module system stands as a high-water mark of programming language support for data abstraction. Nevertheless, it is not in a fully evolved state. One prominent weakness is that module interdependencies in ML are restricted to be acyclic, which means that mutually recursive functions and data types must be written in the same module even if they belong conceptually in different modules. Existing efforts to remedy this limitation either involve drastic changes to the notion of what a module is, or fail to allow mutually recursive modules to hide type information from one another.
Writing a Thesis/Paper
How to write a great research paper - Microsoft Research
Unfortunately, the Definition of SML is not type-theoretic, making it difficult to analyze and extend. Much work in the last decade has thus been devoted to better understanding the type-theoretic underpinnings of SML, particularly with respect to its module system. In my thesis work I plan to study several extensions to SML that would enhance its support for modular programming even further. My methodology for formalizing these extensions follows the approach advocated by Harper and Stone, who gave an interpretation of SML that involves elaborating SML programs into type theory. This approach allows me to design my extensions at the level of the underlying type theory, which is the ideal setting for language design, but provides the option to fall back on elaboration techniques when type inference or syntactic sugar is key to making a language feature palatable. This proposal describes my work thus far on extending SML with higher-order modules, modules as firstclass. Documents: Advanced Search Include Citations.
Technical Reports Archive
The award is given to the PhD student who has made the most original and influential contribution to the research areas in the scope of the ETAPS conferences, and has graduated in at a European academic institution. A committee of international experts evaluated candidate dissertations with respect to originality,. A committee of international experts evaluated candidate dissertations with respect to originality, relevance, and impact to the field, as well as the quality of writing. The committee found that Dr. Ralf Jung's dissertation is very well-written and makes several highly original contributions in the area of programming language semantics and verification.
See Vanderwaart et al. Moreover, requiring the signature of a recursive module to be transparent stymies the enforcement of any data abstraction between mutually recursive submodules Recursive coercions have also been u Intuitively, one might expect such mechanisms to be useful in interpre