ACM Home Page
Please provide us with feedback. Feedback
Static dependent types for first class modules
Full text PdfPdf (1.07 MB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1990 ACM conference on LISP and functional programming table of contents
Nice, France
Pages: 20 - 29  
Year of Publication: 1990
ISBN:0-89791-368-X
Authors
Mark A. Sheldon  Laboratory for Computer Science, Massachusetts Institute of Technology
David K. Gifford  Laboratory for Computer Science, Massachusetts Institute of Technology
Sponsors
INRIA : Institut Natl de Recherche en Info et en Automatique
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
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 13,   Citation Count: 2
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/91556.91577
What is a DOI?

ABSTRACT

Static dependent types are the basis of a new type system that permits types and values to be packaged together into first class modules. Unlike other approaches to modules, static dependent types permit unrestricted access to the types and values in first class modules without sacrificing static type checking or data abstraction. Static dependent types are type safe in the presence of side effects because they rely on an effect system that can make deductions conventional type systems cannot. Experience with an implementation, built as an extension to the FX-87 programming language, shows that static dependent types can be used for building large systems.


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.

Boehm & Demers 86
 
Boehm et al. 80
 
Burstall & Lampson 84
 
Cardelli 89
Luca Cardelli. Typeful programming. In IFIP Advanced Seminar on Formal Description of Programming Concepts, 1989.
 
Gifford et al. 87
David K. Clifford, Pierre Jouvelot, John M. Lucassen, &rid Mark A. Sheldon. FX.87 Reference Manual. Technical Report MIT/LCS/TR-407, M.I.T. Laboratory for Computer Science, September 1987.
 
Hook & Howe 86
 
Jouvelot & Giffozd 88
Pierre Jouvelot and David K. Gifford. The FX-87 interpreter, in Proceedings of the ~nd Int q. Conf. on Comp. Lang., Miami,Florida, October 1988.
 
Liskov et al. 81
Lucassen & Gifford 88
MacQueen 84
 
McCracken 79
Nancy Jean McCracken. An Investigation of a Programming Language with a Polffmorphic Type Structure. Ph.D. thesis, Syrcuse University, 1979.
Mitchell & Plotkin 88
 
Sheldon 90
Mark A. Sheldon. Static Dependent Types lor First. Class Modules. Technical Report MIT/LCS/TR-472, M.I.T. Laboratory for (3omputer Science, 1990.


Collaborative Colleagues:
Mark A. Sheldon: colleagues
David K. Gifford: colleagues