ACM Home Page
Please provide us with feedback. Feedback
Modules for standard ML
Full text PdfPdf (708 KB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1984 ACM Symposium on LISP and functional programming table of contents
Austin, Texas, United States
Pages: 198 - 207  
Year of Publication: 1984
ISBN:0-89791-142-3
Author
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 43,   Citation Count: 45
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800055.802036
What is a DOI?

Warning: The download time has expired please click on the item to try again.


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 concepts inherent in the structure of ML, primarily the notions of a declaration, its type signature, and the environment that it denotes.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. M. Burstall and J. A. Goguen, Putting theories together to make specifications, Proc. 5th Int. Joint Conf on Artificial Intelligence, Cambridge, Mass., August, 1977, pp. 1045-1058.
2
 
3
L. Cardelli, ML under Unix, Polymorphism, 1.3, December 1983.
 
4
L. Cardelli, Stream Input/Output, Polymorphism, 1.3, December 1983.
 
5
J. A. Goguen, Parameterized programming, Proceedings of Workshop on Reusability in Programming, A. Perlis, ed.
 
6
M. J. Gordon, R. Milner, and C. P. Wadsworth, Edinburgh LCF, LNCS Vol. 78, Springer-Verlag, New York, 1979.
 
7
D. B. MacQueen, Structure and parameterization in a typed functional language, Symp. on Functional Languages and Computer Architecture, Gothenburg, Sweden, June, 1981, pp. 525-537.
8
9
 
10
P. Martin-Löf, An intuitionistic theory of types: predicative part, Logic Colloquium 73, ed. H. E. Rose and J. C. Shepherdson, North-Holland, Amsterdam, 1975, pp. 73-118.
 
11
R. Milner, A theory of type polymorphism in programming, JCSS, 17(3), December 1978, pp. 348-375.
 
12
R. Milner, A proposal for Standard ML, Polymorphism 1.3, December 1983.

CITED BY  45