Efficient inference of partial types

Authors:
D. Kozen;J. Palsberg;M. I. Schwartzbach
Affiliations:
Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA;-;-
Venue:
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Year:
1992

Citing 0
Cited 2

Efficient inference of partial types

Journal of Computer and System Sciences
An error-tolerant type system for variational lambda calculus

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Partial types for the lambda -calculus were introduced by Thatte (1988) as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persistent data. He showed that type inference for partial types was semidecidable. Decidability remained open until O'Keefe and Wand gave an exponential time algorithm for type inference. The authors give an O(n/sup 3/) algorithm. The 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.