David MacQueen
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.
- 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.Google Scholar
- 2.R. M. Burstall, D. B. MacQueen, and D. T. Sannella, Hope: an experimental applicative language, Conf. Record of the 1980 LISP Conference, Stanford, August 1980, pp. 136-143. Google ScholarDigital Library
- 3.L. Cardelli, ML under Unix, Polymorphism, 1.3, December 1983.Google Scholar
- 4.L. Cardelli, Stream Input/Output, Polymorphism, 1.3, December 1983.Google Scholar
- 5.J. A. Goguen, Parameterized programming, Proceedings of Workshop on Reusability in Programming, A. Perlis, ed.Google Scholar
- 6.M. J. Gordon, R. Milner, and C. P. Wadsworth, Edinburgh LCF, LNCS Vol. 78, Springer-Verlag, New York, 1979.Google Scholar
- 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.Google Scholar
- 8.D. B. MacQueen and R. Sethi, A semantic model of types for applicative languages, 1982 ACM Symp. on Lisp and Functional Programming, Pittsburgh, August 1982, pp. 243-252. Google ScholarDigital Library
- 9.D. B. MacQueen, G. Plotkin, and R. Sethi, An ideal model for recursive polymorphic types, 11th Annual ACM Symp. on Principles of Programming Languages, Salt Lake City, January 1984, pp. 165-174. Google ScholarDigital Library
- 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.Google Scholar
- 11.R. Milner, A theory of type polymorphism in programming, JCSS, 17(3), December 1978, pp. 348-375.Google ScholarCross Ref
- 12.R. Milner, A proposal for Standard ML, Polymorphism 1.3, December 1983.Google Scholar
Index Terms
- Modules for standard ML
Recommendations
The history of Standard ML
The ML family of strict functional languages, which includes F#, OCaml, and Standard ML, evolved from the Meta Language of the LCF theorem proving system developed by Robin Milner and his research group at the University of Edinburgh in the 1970s. This ...
An implementation of standard ML modules
LFP '88: Proceedings of the 1988 ACM conference on LISP and functional programmingStandard ML includes a set of module constructs that support programming in the large. These constructs extend ML's basic polymorphic type system by introducing the dependent types of Martin Löf's Intuitionistic Type Theory. This paper discusses the ...
Comments