Skip to Main content Skip to Navigation
Conference papers

Polymorphic type inference and assignment

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Xavier Leroy Connect in order to contact the contributor
Submitted on : Saturday, April 1, 2017 - 8:08:42 PM
Last modification on : Wednesday, November 17, 2021 - 12:31:51 PM
Long-term archiving on: : Sunday, July 2, 2017 - 12:59:58 PM


Files produced by the author(s)




Xavier Leroy, Pierre Weis. Polymorphic type inference and assignment. POPL 1991: 18th symposium Principles of Programming Languages, ACM, Jan 1991, Orlando, United States. pp.291-302, ⟨10.1145/99583.99622⟩. ⟨hal-01499974⟩



Les métriques sont temporairement indisponibles