Efficient Inference of Partial Types

Efficient Inference of Partial Types (1992)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Dexter Kozen , Jens Palsberg , Michael I. Schwartzbach

Venue:	JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Citations:	53 - 23 self

BibTeX

@INPROCEEDINGS{Kozen92efficientinference,
    author = {Dexter Kozen and Jens Palsberg and Michael I. Schwartzbach},
    title = {Efficient Inference of Partial Types},
    booktitle = {JOURNAL OF COMPUTER AND SYSTEM SCIENCES},
    year = {1992},
    pages = {363--371},
    publisher = {}
}

Bookmark

OpenURL

Abstract

Partial types for the -calculus were introduced by Thatte in 1988 [8] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persistent data. In that paper he showed that type inference for partial types was semidecidable. Decidability remained open until quite recently, when O'Keefe and Wand [5] gave an exponential time algorithm for type inference. In this paper we give an O(n³) algorithm. Our algorithm constructs a certain finite automaton that represents a canonical solution to a given set of type constraints. Moreover, the construction works equally well for recursive types; this solves an open problem stated in [5].

Citations

288	Subtyping recursive types - Amadio, Cardelli
44	Efficient recursive subtyping - Kozen, Palsberg, et al. - 1993
38	Type inference with partial types - Thatte - 1988
29	Safety analysis versus type inference for partial types - Palsberg, Schwartzbach - 1992
21	Type inference for partial types is decidable - O'Keefe, Wand - 1992
2	Normal forms have partial types - Palsberg - 1993