DMCA
Higher-Order Modules and the Phase Distinction (1990)
Cached
Download Links
| Venue: | In Seventeenth ACM Symposium on Principles of Programming Languages |
| Citations: | 136 - 25 self |
BibTeX
@INPROCEEDINGS{Harper90higher-ordermodules,
author = {Robert Harper and John C. Mitchell and Eugenio Moggi},
title = {Higher-Order Modules and the Phase Distinction},
booktitle = {In Seventeenth ACM Symposium on Principles of Programming Languages},
year = {1990},
pages = {341--354},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Typed λ-calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their relation to each other. In earlier work we introduced a predicative function calculus, XML, for modeling several aspects of the Standard ML type system. Following MacQueen, our study focused on the use of dependent types to represent the modularity constructs of Standard ML. In addition to shedding some light on the trade-offs between language features, our analysis suggested that the first-order modules system of ML could be naturally extended to higher orders. However, whereas ML maintains a clear distinction between compile-time and run-time in both its implementation and formal semantics, the XML calculus blurs this distinction. Since static type checking is, in our view, essential to the practical utility of ML, we introduce a refinement of the XML calculus for which type checking is decidable at compile time....
Keyphrases
phase distinction higher-order module language feature dependent type static type checking xml calculus standard ml type system clear distinction modularity construct practical utility formal semantics standard ml type checking compile time language research important tool first-order module system several aspect extensible framework predicative function calculus typed lambda xml calculus blur
