Simons, A.J.H. (2003) The theory of classification part 7: a class is a type family. Journal of Object Technology, 2 (3). 13 - 22. ISSN 1660-1769
Abstract
The notion of class which defines class as family of types which share minimum common structure is described using the Cook's F-bounded quantification. The languages such as Java and C++ adopt this simple view which is found to challenge the frequent use of type downcasting needed to overcome inadequacies of first-order type systems based on types and subtyping. The systematic modeling of polymorphism is also described which uses type parameters. The relationship between universal quantification which supports definition of generic types and F-bounded quantification which supports definition of classes are also described.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2003 JOT. Reproduced in accordance with the publisher's self-archiving policy. |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 06 Jun 2014 10:35 |
Last Modified: | 29 Mar 2018 02:24 |
Published Version: | http://dx.doi.org/10.5381/jot.2003.2.3.c2 |
Status: | Published |
Refereed: | Yes |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:79272 |