Since 2014
Efficient Inference of Object Types
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Efficient Inference of Object Types
|
|
| Creator |
Palsberg, Jens
|
|
| Description |
Abadi and Cardelli have recently investigated a calculus of objects[2]. The calculus supports a key feature of object-oriented languages:an object can be emulated by another object that has more refinedmethods. Abadi and Cardelli presented four first-order type systemsfor the calculus. The simplest one is based on finite types and nosubtyping, and the most powerful one has both recursive types andsubtyping. Open until now is the question of type inference, andin the presence of subtyping the absence of minimum typings posespractical problems for type inference [2].In this paper we give an O(n^3) algorithm for each of the four typeinference problems and we prove that all the problems are P-complete.We also indicate how to modify the algorithms to handle functions andrecords.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-06-02
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19935
10.7146/brics.v2i32.19935 |
|
| Source |
BRICS Report Series; No 32 (1995): RS-32 Efficient Inference of Object Types
BRICS Report Series; No 32 (1995): RS-32 Efficient Inference of Object Types 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19935/17588
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|