Type reconstruction algorithms for object-oriented languages
Abstract
This thesis is a study of the type reconstruction problem as it relates to object-oriented languages. In this thesis, object-oriented languages are modeled with the lambda calculus augmented with record constructs. Typing rules are supplied for this augmented lambda calculus and a type reconstruction algorithm is given and is proven both sound and complete. Since type reconstruction can be performed for the augmented lambda calculus, it follows that type reconstruction can be performed for varieties of object-oriented languages that can be modeled with this augmented lambda calculus. Many varieties of object-oriented languages are modeled and discussed, with primary emphasis on the different forms of inheritance. A new record-based model of objects and classes is presented and is contrasted with the usual modeling of object-oriented languages in the language of records. In addition, it is shown that the techniques used to perform type reconstruction on the language with record constructs can be used to perform type reconstruction when subtype relations on base types are added to the type system.
Degree
Ph.D.
Advisors
Stansifer, Purdue University.
Subject Area
Computer science
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.