(Enter summary)
Abstract: The functional programming language ML has been undergoing a thorough redesign during the past year, and the module
facility described here has been proposed as part of the revised language, now called Standard ML. The design has three
main goals: (1) to facilitate the structuring of large ML programs; (2) to support separate compilation and generic library
units; and (3) to employ new ideas in the semantics of data types to extend the power of ML's polymorphic type system. It
is based on... (Update)
Cited by: More
Typed Closure Conversion - Yasuhiko Minamide Greg
(Correct)
A Modular Implementation of Partial Evaluation - Christopher Colby Peter (1992)
(Correct)
Ist-2001-33234 - Peer-To-Peer Implementation And
(Correct)
Active bibliography (related documents): More All
0.5: Program Specification and Data Refinement in Type Theory - Luo (1991)
(Correct)
0.1: Tree Pattern Matching for ML (Extended Abstract) - Baudinet, MacQueen (1985)
(Correct)
0.1: A Runtime System - Appel (1990)
(Correct)
Similar documents based on text: More All
0.2: A Standard ML Compiler - Appel, MacQueen (1987)
(Correct)
0.2: A Direct Algorithm for Type Inference in the Rank 2 Fragment.. - Kfoury, Wells (1994)
(Correct)
0.2: Separate Compilation for Standard ML - Appel, MacQueen (1994)
(Correct)
Related documents from co-citation: More All
45: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
27: A type theoretic approach to higher-order modules with sharing
- Harper, Lillibridge - 1994
22: and separate compilation (context) - Leroy, modules
BibTeX entry: (Update)
MacQueen, D. Modules for Standard ML. In Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming (1984), pp. 198--207. http://citeseer.ist.psu.edu/macqueen84modules.html More
@inproceedings{ macqueen84modules,
author = "David B. MacQueen",
title = "Modules for {S}tandard {ML}",
booktitle = "Proceedings of the 1984 {ACM} Conference on {LISP} and Functional Programming",
publisher = "ACM Press",
address = "New York",
pages = "198--207",
year = "1984",
url = "citeseer.ist.psu.edu/macqueen84modules.html" }
Citations (may not include all citations):
809
A theory of type polymorphism in programming (context) - Milner - 1978
109
Putting theories together to make specifications (context) - Burstall, Goguen - 1977
95
Hope: an experimental applicative language
- Burstall, MacQueen et al.
81
A proposal for Standard ML (context) - Milner - 1983
39
Springer-Verlag (context) - Gordon, Milner et al. - 1979
14
Parameterized programming (context) - Goguen
10
A semantic model of types for applicative languages (context) - MacQueen, Sethi
6
ML under Unix (context) - Cardelli - 1983
6
An intuitionistic theory of types: predicative part (context) - Martin-L - 1975
2
Structure and parameterization in a typed functional languag.. (context) - MacQueen - 1981
1
Stream InputOutput (context) - Stream, Polym et al. - 1983
1
An ideal model for recurslye polymorphic types (context) - MacQueen, Plotkin et al. - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-2.cs.cmu.edu/~rwh/courses/modules/index.htm): More
Mixin Modules - Duggan, Sourelis (1996)
(Correct)
Type-Safe Linking and Modular Assembly Language - Glew, Morrisett (1999)
(Correct)
An extension of Standard ML modules with subtyping and.. - Mitchell, Meldal (1991)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC