Please use this identifier to cite or link to this item: doi:10.22028/D291-25899
Title: Polymorphic type inference for object-oriented programming languages
Author(s): Hense, Andreas V.
Language: English
Year of Publication: 1994
SWD key words: Typinferenzsystem
Objektorientierte Programmiersprache
Free key words: OSMALL
type inference
object-oriented programming
DDC notations: 004 Computer science, internet
Publikation type: Dissertation
Abstract: We present a type inference algoritm and its verification for an object-oriented programming language called OSMALL. OSMALL is a class-based language with imperative features. Classes are not first-class citizens. No type declarations are required. Type inference operates on an extended lambda-calculus into which OSMALL is translated. The system features extensible record types, mu-types, and imperative types. This work belongs to both theoretical and practical computer science. In the theoretical part, the type inference algoritm for our lambda-calculus with records is formalized in order-sorted logic. In the practical part, the algoritm for let-polymorphism and imperative features is based on well-known approaches. These approaches are presented in a new fashion but they are not proven correct.
- nicht vorhanden -
Link to this record: urn:nbn:de:bsz:291-scidok-13290
Advisor: Smolka, Gert
Date of oral examination: 24-May-1994
Date of registration: 9-Nov-2007
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
Dissertation_9585_Hens_Andr_1994.pdf15,79 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.