Formal Objects in Type Theory Using Very Dependent Types (1996)
| Venue: | In Foundations of Object Oriented Languages 3 |
| Citations: | 27 - 8 self |
BibTeX
@INPROCEEDINGS{Hickey96formalobjects,
author = {Jason J. Hickey},
title = {Formal Objects in Type Theory Using Very Dependent Types},
booktitle = {In Foundations of Object Oriented Languages 3},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present an extension to basic type theory to allow a uniform construction of abstract data types (ADTs) having many of the properties of objects, including abstraction, subtyping, and inheritance. The extension relies on allowing type dependencies for function types to range over a well-founded domain. Using the propositions--as--types correspondence, abstract data types can be identified with logical theories, and proofs of the theories are the objects that inhabit the corresponding ADT. 1 Introduction In the past decade, there has been considerable progress in developing formal account of a theory of objects. One property of object oriented languages that make them popular is that they attack the problem of scale: all object oriented languages provide mechanisms for providing software modularity and reuse. In addition, the mechanisms are intuitive enough to be followed easily by novice programmers. During the same decade, the body of formal mathematics has be...
