Type Inference with Selftype
DOI:
https://doi.org/10.7146/brics.v2i34.19937Resumé
The metavariable self is fundamental in object-oriented languages.Typing self in the presence of inheritance has been studied by Abadi
and Cardelli, Bruce, and others. A key concept in these developments
is the notion of selftype, which enables flexible type annotations that
are impossible with recursive types and subtyping. Bruce et al. demonstrated
that, for the language TOOPLE, type checking is decidable.
Open until now is the problem of type inference with selftype.
In this paper we present a type inference algorithm for a type
system with selftype, recursive types, and subtyping. The example
language is the object calculus of Abadi and Cardelli, and the type
inference algorithm runs in nondeterministic polynomial time.
Downloads
Publiceret
1995-06-04
Citation/Eksport
Palsberg, J. (1995). Type Inference with Selftype. BRICS Report Series, 2(34). https://doi.org/10.7146/brics.v2i34.19937
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).