Sciweavers

POPL
1991
ACM

Polymorphic Type Inference and Assignment

13 years 6 months ago
Polymorphic Type Inference and Assignment
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization, and a refined typing of functions. The type system given here leads to a better integration of imperative programming style with the purely applicative kernel of ML. In particular, generic functions that allocate mutable data can safely be given fully polymorphic types. We show the soundness of this type system, and give a type reconstruction algorithm.
Xavier Leroy, Pierre Weis
Added 27 Aug 2010
Updated 27 Aug 2010
Type Conference
Year 1991
Where POPL
Authors Xavier Leroy, Pierre Weis
Comments (0)