• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Translucent Sums: A Foundation for Higher-Order Module Systems (1997)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.cs.princeton.edu]
  • [www.research.digital.com]
  • [www.hpl.hp.com]
  • [www.hpl.hp.com]
  • [reports-archive.adm.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [www.hpl.hp.com]
  • [www.hpl.hp.com]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Mark Lillibridge
Citations:53 - 0 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Lillibridge97translucentsums:,
    author = {Mark Lillibridge},
    title = {Translucent Sums: A Foundation for Higher-Order Module Systems},
    institution = {},
    year = {1997}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

The ease of understanding, maintaining, and developing a large program depends crucially on how it is divided up into modules. The possible ways a program can be divided are constrained by the available modular programming facilities ("module system") of the programming language being used. Experience with the Standard-ML module system has shown the usefulness of functions mapping modules to modules and modules with module subcomponents. For example, functions over modules permit abstract data types (ADTs) to be parameterized by other ADTs, and submodules permit modules to be organized hierarchically. Module systems with such facilities are called higher-order, by analogy with higher-order functions. Previous higher-order module systems can be classified as either opaque or transparent. Opaque systems totally obscure information about the identity of type components of modules, often resulting in overly abstract types. This loss of type identities precludes most interesting uses of hi...

Citations

1392 The C++ Programming Language - Stroustrup - 1995
1128 The C Programming Language - Kernighan, Ritchie - 1988
267 G.D.: Abstract types have existential types - Mitchell, Plotkin - 1988
266 The Lambda Calculus: its syntax and semantics, volume 103 of Studies in logic and the foundations of mathematics - Barendregt - 1985
252 Compiling polymorphism using intensional type analysis - Harper, Morrisett - 1995
251 A type-theoretic approach to higher-order modules - Harper, Lillibridge - 1994
221 Principal type schemes for functional programs - Damas, Milner - 1982
221 Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII - Girard - 1972
208 Manifest types, modules, and separate compilation - Leroy - 1994
192 Standard ML of New Jersey - McQueen, Appel - 1991
133 Typeful Programming - Cardelli - 1989
130 Higher-order modules and the phase distinction - Harper, Mitchell, et al. - 1990
118 Using dependent types to express modular structure - MacQueen - 1986
103 A structural view of the cedar programming environment - SWINEHART, ZELLWEGER, et al. - 1986
99 Bounded quantification is undecidable - Pierce - 1992
97 Compiling with Types - Morrisett - 1995
96 Applicative functors and fully transparent higher-order modules - Leroy - 1995
79 Partial polymorphic type inference and higher-order unification - Pfenning - 1988
71 Pascal: User Manual and Report - Jensen, Wirth - 1974
70 The essence of ML - Mitchell, Harper - 1988
65 Explicit polymorphism and CPS conversion - Harper, Lillibridge - 1993
64 Programming with Intersection Types and Bounded Polymorphism - Pierce - 1991
63 Using parameterized signatures to express modular structure - Jones - 1996
57 Structural subtyping and the notion of power type - Cardelli - 1988
57 A kernel language for abstract data types and modules - Burstall, Lampson - 1984
55 An extension of standard ML modules with subtyping and inheritance - Mitchell, Meldal, et al. - 1991
53 A syntactic theory of type generativity and sharing - Leroy - 1996
52 Abstract types and the dot notation - Cardelli, Leroy - 1990
51 A semantics for higher-order functors - MacQueen, Tofte - 1994
42 Signatures for a network protocol stack: A systems application of standard ML - Biagioni, Harper, et al. - 1994
41 A structured TCP in Standard ML - Biagioni - 1994
38 Early experience with mesa - GESCHKE, MORRIS, et al. - 1977
36 Mesa language manual - Mitchell, Maybury, et al. - 1979
27 A Language with Eval and Polymorphism - Pfenning, Lee - 1989
19 The Definition of Standard ML: Version 3 - Harper, Milner, et al. - 1989
16 The Cedar Programming Environment: A Midterm Report and Examination - Teitelman - 1984
14 Incremental recompilation for Standard ML of New Jersey - Harper, Lee, et al. - 1994
11 The Ada Programming Language - Pyle - 1981
11 A type-theoretic account of Standard ML - Harper, Stone - 1997
9 J.Donahue: An informal description of Russell - Boehm - 1980
9 Bounded quanti cation is undecidable - Pierce - 1992
8 Standard ML signatures for a protocol stack - Biagioni, Harper, et al. - 1993
7 A modular module system. Research report 2866 - Leroy - 1996
7 A description of the Cedar language: A Cedar language reference manual - Lampson - 1983
6 The De nition of Standard ML: Version 3 - Harper, Milner, et al. - 1989
4 Experience with the Cedar programming environment for computer graphics research - Beach - 1985
4 Understanding russell: A rst attempt - Hook
2 Minutes of the ML2000 meeting at - Lillibridge, Shao, et al. - 1994
2 Understanding russell: A first attempt - Hook
2 The Ada Programming Language. Prentice-Hall International - Pyle - 1981
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University