Please use this identifier to cite or link to this item: doi:10.22028/D291-26148
Title: Polymorphic type inference for a simple object oriented programming language with state
Author(s): Hense, Andreas V.
Language: English
Year of Publication: 1990
OPUS Source: Saarbrücken, 1990
Free key words: class inheritance
imperative features
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: We show how type inference for object oriented programming languages with state can be performed without type declarations. Our type inference system is based on the works of Remy and Wand which can in turn be traced back directly to Milner's classical type inference algorithm. O'small a simple object oriented language, is translated into mathcal{L}, a language of lambda-calculus with records and imperative features. Type inference rules are given for mathcal{L}. O'small-programs are type checked after being translated into mathcal{L}. We show that for translations of O'small-programs one can have a type system with principal types.
Link to this record: urn:nbn:de:bsz:291-scidok-42219
Series name: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Series volume: 1990/20
Date of registration: 7-Sep-2011
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 
fb14_1990_20.pdf6,94 MBAdobe PDFView/Open

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