Modular typechecking for hierarchically extensible datatypes and functions (2002)
Cached
Download Links
- [www.cs.ucla.edu]
- [ftp.cs.washington.edu]
- [cs.williams.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the International Conference on Functional Programming |
| Citations: | 30 - 5 self |
BibTeX
@INPROCEEDINGS{Millstein02modulartypechecking,
author = {Todd Millstein and Colin Bleckner and Craig Chambers},
title = {Modular typechecking for hierarchically extensible datatypes and functions},
booktitle = {In Proceedings of the International Conference on Functional Programming},
year = {2002},
pages = {110--122},
publisher = {ACM Press}
}
Years of Citing Articles
OpenURL
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 longstanding 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







