Poll, Erik (1997) Subtyping and Inheritance for Inductive Types. In: Proceedings of TYPES'97 Workshop on Subtyping, inheritance and modular development of proofs, Durham, UK.
| Other (ZIP) | ||
|
Download (55Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/other.png) |
|
|
Download (170Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Postscript | ||
|
Download (138Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
Abstract
Inheritance and subtyping are key features of object-oriented languages. We show that there are corresponding (or, more precisely, dual) notions for inductive or algebraic datatypes: there is a natural notion of subtyping for these types and an associated form of code reuse (inheritance) for programs on these types. Inheritance and subtyping for inductive types not only suggest possible extensions of functional programming languages, but also provide a new perspective on inheritance as we know it from object-oriented languages, which may help in getting a better understanding of this notion.
| Item Type: | Conference or workshop item (Paper) |
|---|---|
| Uncontrolled keywords: | subtyping |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 01 Aug 2009 17:01 |
| Last Modified: | 06 Sep 2011 03:54 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21456 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
