Eingang zum Volltext in SciDok
Lizenz
Report (Bericht) zugänglich unter
Principal types for object-oriented languages
URN: urn:nbn:de:bsz:291-scidok-41991
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/4199/
Quelle:
(1993) Kaiserslautern ; Saarbrücken : DFKI, 1993
pdf-Format:
Dokument 1.pdf (4.800 KB)
![]()
![]()
![]()
![]()
![]()
Institut:
DDC-Sachgruppe:
Informatik
Dokumentart:
Report (Bericht)
Schriftenreihe:
Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Bandnummer:
1993/02
Sprache:
Englisch
Erstellungsjahr:
1993
Publikationsdatum:
06.09.2011
Kurzfassung auf Englisch:
Object-oriented languages can he translated into a lambda-calculus with records. Therefore, type inference for record languages is one aspect of the yet unsolved problem of inferring types for object-oriented languages. In order to obtain the necessary flexibility for such a type system, we can either introduce a general subtyping notion or use extensible record types. Subtyping, especially in combination with imperative features, poses many hard problems. Therefore, the second approach is promising. The problem is that, in previous type inference systems that used extensible record types, principal types could not be inferred. We have found that, for an object-oriented language where classes are not first-class citizens, we could greatly simplify the underlying record language. We show that, for our simple record language, there exists a type inference algorithm that infers principal types.
Lizenz:
Standard-Veröffentlichungsvertrag