Mark P. Jones  Home/Search
Context Related
| cmu.edu/~rwh/courses/module...paper.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~rwh/courses/modu...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular programming have been based on existential, dependent, or manifest types. These approaches can be distinguished by their use of different quantifiers to package the operations that a module exports together with appropriate implementation types. In each case, the underlying type theory is simple and elegant, but significant... (Update)
Context of citations to this paper: More
.... based on interpreting some, but not all, of the features of Standard ML Modules directly in an extension of the Core language, see Jones [26]. The companion paper by Nicklish and Peyton Jones [47] o#ers an informal comparison of the two approaches. One characteristic feature...
Cited by: More
Modular Type Classes - Derek Dreyer Toyota (2006) (Correct)
Modular Formal Frameworks for Module Systems - Ancona (1998) (Correct)
Confluent Equational Reasoning for Linking with First-Class .. - Wells, Vestergaard (1999) (Correct)
Similar documents (at the sentence level):
45.2%: Using Parameterized Signatures to Express Modular Structure - Jones (1996) (Correct)
Active bibliography (related documents): More All
0.4: Types for Modules - Russo (1998) (Correct)
0.3: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
0.3: A Syntactic Approach to Structure Generativity - Grosch (1996) (Correct)
Similar documents based on text: More All
0.3: Manifest Types, Modules, and Separate Compilation - Leroy (1994) (Correct)
0.3: First-class Polymorphism with Type Inference - Jones (Correct)
0.3: An Exploration of Modular Programs - Nicklisch, Jones (1996) (Correct)
Related documents from co-citation: More All
22: A type theoretic approach to higher-order modules with sharing - Harper, Lillibridge - 1994
16: Applicative functors and fully transparent higher-order modules - Leroy - 1995
16: The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
BibTeX entry: (Update)
M. P. Jones. Using parameterized signatures to express modular structure. In Proc. 23rd ACM Symp. on Principles of Programming Languages, pages 68--78, St. Petersburg Beach, Florida, Jan 1996. ACM Press. http://citeseer.ist.psu.edu/jones96using.html More
@inproceedings{ jones96using,
author = "Mark P. Jones",
title = "Using Parameterized Signatures to Express Modular Structure",
booktitle = "Conference Record of the 23rd {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages ({POPL}'96)",
month = "21--24,",
publisher = "ACM Press",
address = "St.\ Petersburg, Florida",
year = "1996",
url = "citeseer.ist.psu.edu/jones96using.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978
311 Abstract types have existential type (context) - Mitchell, Plotkin - 1988
293 The essence of functional programming - Wadler - 1992
215 A type-theoretic approach to higher-order modules with shari.. - Harper, Lillibridge - 1994
129 A system of constructor classes: overloading and implicit hi.. - Jones - 1995
128 On understanding types (context) - Cardelli, Wegner - 1985
121 Higher-order modules and the phase distinction - Harper, Mitchell et al. - 1990
98 Using dependent types to express modular structure - MacQueen - 1986
84 Lambda lifting: transforming programs to recursire equations - Johnsson - 1985
75 Applicative functors and fully transparent higher-order modu.. - Leroy - 1995
65 A semantics for higher-order functors - MacQueen, Torre - 1994
59 An extension of Standard ML modules with subtyping and inher.. - Mitchell, Meldal et al. - 1991
59 Smartest recompilation - Shao, Appel - 1993
43 A syntactic theory of type generativity and sharing - Leroy - 1994
40 modules and separate compilation (context) - Leroy - 1994
38 Constructive mathematics and computer programming (context) - Martin-LSf - 1982
35 The essence of ML (context) - Mitchell, Harper - 1988
34 Separate compilation for Standard ML - Appel, MacQueen - 1994
31 Principal signatures for higher-order program modules - Tofte - 1992
29 A category-theoretic account of program modules - Moggi - 1989
24 Programming Research Group (context) - Jones, Theory et al. - 1992
17 Higher-order functors with transparent signatures - Biswas - 1995
8 First-class polymorphism for ML (context) - Kahrs - 1994
5 Extending record typing to type parametric modules with shar.. - Aponte - 1993
4 Technical Report report (context) - Cardelli, Leroy et al. - 1990
1 The mplementation of functional programming languages (context) - Jones - 1987
1 An exten- sion of ML with first-class abstract types (context) - onstantin, Martin - 1992
1 The defiitwn of Standard ML (context) - Milner, Robert - 1990
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