ACM Home Page
Please provide us with feedback. Feedback
Modular typechecking for hierarchically extensible datatypes and functions
Full text PdfPdf (176 KB)
Source International Conference on Functional Programming archive
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming table of contents
Pittsburgh, PA, USA
Pages: 110 - 122  
Year of Publication: 2002
ISBN:1-58113-487-8
Also published in ...
Authors
Todd Millstein  University of Washington
Colin Bleckner  University of Washington
Craig Chambers  University of Washington
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 18,   Citation Count: 11
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/581478.581489
What is a DOI?

ABSTRACT

One promising approach for adding object-oriented (OO) facilities to functional languages like ML is to generalize the existing datatype and function constructs to be hierarchical and extensible, so that datatype variants simulate classes and function cases simulate methods. This approach allows existing datatypes to be easily extended with both new operations and new variants, resolving a long-standing conflict between the functional and OO styles. However, previous designs based on this approach have been forced to give up modular typechecking, requiring whole-program checks to ensure type safety. We describe Extensible ML (eml), an ML-like language that supports hierarchical, extensible datatypes and functions while preserving purely modular typechecking. To achieve this result, eml's type system imposes a few requirements on datatype and function extensibility, but eml is still able to express both traditional functional and OO idioms. We have formalized a core version of eml and proven the associated type system sound, and we have developed a prototype interpreter for the language.


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.

 
1
 
2
D. Bonniot. Type-checking multi-methods in ML (a modular approach). In The Ninth International Workshop on Foundations of Object-Oriented Languages, FOOL 9, Portland, Oregon, USA, January 2002.
3
4
 
5
 
6
 
7
8
 
9
 
10
11
12
 
13
14
 
15
J. Garrigue. Code reuse through polymorphic variants. In Workshop on Foundations of Software Engineering, November 2000.
 
16
17
 
18
 
19
20
 
21
T. Millstein, C. Bleckner, and C. Chambers. Modular typechecking for hierarchically extensible datatypes and functions. Technical Report UW-CSE-02-07-05, Department of Computer Science and Engineering, University of Washington, July 2002. ftp://ftp.cs.washington.edu/tr/2002/07/UW-CSE-02-07-05.pdf.
 
22
 
23
T. Millstein and C. Chambers. Modular statically typed multimethods. Information and Computation, 175(1):76--118, May 2002.
 
24
25
 
26
27
 
28
J. C. Reynolds. User defined types and procedural data structures as complementary approaches to data abstraction. In D. Gries, editor, Programming Methodology, A Collection of Articles by IFIP WG2.3, pages 309--317. Springer-Verlag, New York, NY, 1978.
 
29
30

CITED BY  11

Collaborative Colleagues:
Todd Millstein: colleagues
Colin Bleckner: colleagues
Craig Chambers: colleagues