Type Dispatch for Named Hierarchical Types (1999)
Cached
Download Links
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In 1999 ACM SIGPLAN International Conference on Functional Programming |
| Citations: | 32 - 1 self |
BibTeX
@INPROCEEDINGS{Glew99typedispatch,
author = {Neal Glew},
title = {Type Dispatch for Named Hierarchical Types},
booktitle = {In 1999 ACM SIGPLAN International Conference on Functional Programming},
year = {1999},
pages = {172--182},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Type dispatch constructs are an important feature of many programming languages. Scheme has predicates for testing the runtime type of a value. Java has a class cast expression and a try statement for switching on an exception's class. Crucial to these mechanisms, in typed languages, is type refinement: The static type system will use type dispatch to refine types in successful dispatch branches. Existing work in functional languages has addressed certain kinds of type dispatch, namely, intensional type analysis. However, this work does not extend to languages with subtyping nor to named types. This paper describes a number of type dispatch constructs that share a common theme: class cast and class case constructs in object oriented languages, ML style exceptions, hierarchical extensible sums, and multimethods. I describe a unifying mechanism, tagging, that abstracts the operation of these constructs, and formalise a small tagging language. After discussing how to implement the tagging...
