论文信息 - Weak polymorphism can be sound

Weak polymorphism can be sound

The weak polymorphic type system of Standard ML of New Jersey (SML/NJ) (MacQueen, 1992) has only been presented as part of the implementation of the SML/NJ compiler, not as a formal type system. As a result, it is not well understood. And while numerous versions of the implementation have been shown unsound, the concept has not been proved sound or unsound. We present an explanation of weak polymorphism and show that a formalization of this is sound. We also relate this to the SML/NJ implementation of weak polymorphism through a series of type systems that incorporate elements of the SML/NJ type inference algorithm.

John Greiner | John Greiner

[1] Mads Tofte,et al. Type Inference for Polymorphic References , 1990, Inf. Comput..

[2] Luís Damas,et al. Type assignment in programming languages , 1984 .

[3] Pierre Jouvelot,et al. Polymorphic type, region and effect inference , 1992, Journal of Functional Programming.

[4] Robin Milner,et al. Definition of standard ML , 1990 .

[5] Robin Milner,et al. Principal type-schemes for functional programs , 1982, POPL '82.

[6] M. Tofte. Operational Semantics and Polymorphic Type Inference , 1988 .

[7] Xavier Leroy,et al. Polymorphic type inference and assignment , 1991, POPL '91.

[8] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[9] John C. Reynolds,et al. Syntactic Control of Inference, Part 2 , 1989, ICALP.

[10] J. Roger Hindley,et al. Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[11] Xavier Leroy,et al. Polymorphic typing of an algorithmic language , 1992 .

[12] R. Hindley. The Principal Type-Scheme of an Object in Combinatory Logic , 1969 .

[13] Simon L. Peyton Jones,et al. Imperative functional programming , 1993, POPL '93.