| Автор | Moggi, Eugenio |
| Дата выпуска | 1991 |
| dc.description | The type-theoretic explanation of modules proposed to date (for programming languages like ML) is unsatisfactory, because it does not capture that the evaluation of type-expressions is independent from the evaluation of program expressions. We propose a new explanation based on ‘programming languages as indexed categories’ and illustrate how ML can be extended to support higher order modules, by developing a category-theoretic semantics for a calculus of modules with dependent types. The paper also outlines a methodology, which may lead to a modular approach in the study of programming languages. |
| Формат | application.pdf |
| Издатель | Cambridge University Press |
| Копирайт | Copyright © Cambridge University Press 1991 |
| Название | A category-theoretic account of program modules |
| Тип | research-article |
| DOI | 10.1017/S0960129500000074 |
| Electronic ISSN | 1469-8072 |
| Print ISSN | 0960-1295 |
| Журнал | Mathematical Structures in Computer Science |
| Том | 1 |
| Первая страница | 103 |
| Последняя страница | 139 |
| Аффилиация | Moggi Eugenio; University of Edinburgh |
| Выпуск | 1 |
