论文信息 - A Type Soundness Proof for Variables in LCF ML

A Type Soundness Proof for Variables in LCF ML

We prove the soundness of a polymorphic type system for a language with variables, assignments, and first-class functions. As a corollary, this proves the soundness of the Edinburgh LCF ML rules for typing variables and assignments, thereby settling a long-standing open problem.

Geoffrey Smith | Dennis M. Volpano

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

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

[3] Robert Harper,et al. A Simplified Account of Polymorphic References , 1994, Inf. Process. Lett..

[4] Geoffrey Smith,et al. Polymorphic typing of variables and references , 1996, TOPL.