Since 2014
Type Inference with Selftype
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Type Inference with Selftype
|
|
| Creator |
Palsberg, Jens
|
|
| Description |
The metavariable self is fundamental in object-oriented languages.Typing self in the presence of inheritance has been studied by Abadiand Cardelli, Bruce, and others. A key concept in these developmentsis the notion of selftype, which enables flexible type annotations thatare impossible with recursive types and subtyping. Bruce et al. demonstratedthat, 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 typesystem with selftype, recursive types, and subtyping. The examplelanguage is the object calculus of Abadi and Cardelli, and the typeinference algorithm runs in nondeterministic polynomial time.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-06-04
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19937
10.7146/brics.v2i34.19937 |
|
| Source |
BRICS Report Series; No 34 (1995): RS-34 Type Inference with Selftype
BRICS Report Series; No 34 (1995): RS-34 Type Inference with Selftype 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19937/17590
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|