Type Inference with Simple Selftypes is NP-complete (1997)
Cached
Download Links
- [www.cis.upenn.edu]
- [www.cs.purdue.edu]
- [www.cs.ucla.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 10 - 1 self |
BibTeX
@MISC{Palsberg97typeinference,
author = {Jens Palsberg and Trevor Jim},
title = {Type Inference with Simple Selftypes is NP-complete},
year = {1997}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. 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 simple type system with selftype, recursive types, and subtyping, and we prove that type inference is NP-complete. With recursive types and subtyping alone, type inference is known to be P-complete. Our example language is the object calculus of Abadi and Cardelli. Both our type inference algorithm and our lower bound are the first such results for a type system with selftype. CR Classification: Categories and Subject Descriptors: D.3.2 [Programming Languages]: Language Classifications---...
