Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

POPL
1991
ACM

favoriteEmaildiscussreport

130views Programming Languages» more POPL 1991»

Polymorphic Type Inference and Assignment

13 years 8 months ago

Polymorphic Type Inference and Assignment

Download gallium.inria.fr

We present a new approach to the polymorphic typing of data accepting in-place modiﬁcation in ML-like languages. This approach is based on restrictions over type generalization, and a reﬁned 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

Real-time Traffic

Polymorphic Typing | POPL 1991 | Programming Languages | Type Generalization | Type System |

claim paper

Related Content

» Type Inference in the Polymorphic Relational Algebra

» Polymorphic Type Inference for the JNI

» Type Inference with Inequalities

» ObjectOriented Type Inference

» Type Inference with Rank 1 Polymorphism for TypeDirected Compilation of ML

» Strictness Logic and Polymorphic Invariance

» Firstclass Polymorphism with Type Inference

» Flexible types robust type inference for firstclass polymorphism

» Precise ConstraintBased Type Inference for Java

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	POPL
Authors	Xavier Leroy, Pierre Weis

Comments (0)