Manifest Types, Modules, and Separate Compilation

Manifest Types, Modules, and Separate Compilation (1994)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Xavier Leroy

Citations:

216 - 8 self

BibTeX

@MISC{Leroy94manifesttypes,,
    author = {Xavier Leroy},
    title = {Manifest Types, Modules, and Separate Compilation},
    year = {1994}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

This paper presents a variant of the SML module system that introduces a strict distinction between abstract types and manifest types (types whose definitions are part of the module specification), while retaining most of the expressive power of the SML module system. The resulting module system provides much better support for separate compila- tion.

Citations

1535	The definition of Standard ML - Milner, Tofte, et al. - 1990
748	On Understanding Types, Data Abstraction and Polymorphism - Cardelli, Wegner - 1985
349	Principal type-schemes for functional programs - Damas, Milner - 1982
282	Abstract types have existential type - Mitchell, Plotkin - 1988
258	A type-theoretic approach to higher-order modules with sharing - Harper, Lillibridge - 1994
192	Modules for Standard ML - MACQUEEN - 1984
160	M.: Reasoning about programs in continuation-passing style - Sabry, Felleisen - 1992
157	The essence of Algol - Reynolds - 1981
145	Programming in Modula-2 - Wirth - 1983
139	Operations on records - Cardelli, Mitchell - 1994
137	Typeful programming - Cardelli - 1991
132	Higher-order modules and the phase distinction - Harper, Mitchell, et al. - 1990
120	Using dependent types to express modular structure - MacQueen - 1986
99	On the type structure of Standard ML - Harper, Mitchell - 1993
98	Bounded quantification is undecidable - Pierce - 1992
61	Smartest recompilation - Shao, Appel - 1993
57	Structural subtyping and the notion of power type - Cardelli - 1988
54	X.: Abstract types and the dot notation - Cardelli, Leroy - 1990
34	The ML Kit (Version 1 - Birkedal, Rothwell, et al. - 1993
34	On the equivalence of data representations - Mitchell - 1991
34	Extending ML type system with a sorted equational theory - R'emy - 1992
30	Principal signatures for higher-order program modules - Tofte - 1992
24	A type discipline for program modules - Harper, Milner, et al. - 1987
13	Extending record typing to type parametric modules with sharing - Aponte - 1993
2	Bounded quanti is undecidable - Pierce - 1992
1	Separate compilation in SML. Working note - Crégut - 1993
1	Type abbreviations in signatures. Message sent to the sml mailing list - Tofte - 1992
1	Separate compilation in SML. Working note - Cr6gut - 1993
1	Extending ML type system with a sorted equational theory. Research report 1766 - R6my - 1981