Skip Navigation

The Computer Journal 1986 29(6):538-544; doi:10.1093/comjnl/29.6.538
© 1986 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cowling, A. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Type Checking in Polymorphic Languages

A. J. Cowling *

Department of Computer Science, University of Sheffield, Sheffield S10 2TN, UK

The requirements for type checking in polymorphic languages are considered, in the light of recent suggestions by Harland that polymorphism must involve the run-time processing of types, and that this is incompatible with the conventional type equivalence relationships. It is shown that these relationships are, in fact, compatible with run-time type processing, but that only the various forms of structural equivalence are compatible with parametric polymorphism. The relative merits of structural equivalence and the type checking schemes proposed by Harland are considered.

Received April 1985.

* Department of Computer Science, University of Sheffield, Sheffield S10 2TN


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.