论文信息 - A Type Inference System for FP Programs - 字舞流文

A Type Inference System for FP Programs

T. Katayama | Junhui Luo

[1] Gordon D. Plotkin,et al. An ideal model for recursive polymorphic types , 1984, Inf. Control..

[2] Robert M. Keller,et al. Static inference of properties of applicative programs , 1984, POPL.

[3] Mitchell Wand,et al. A types-as-sets semantics for milner-style polymorphism , 1984, POPL.

[4] John C. Mitchell,et al. Coercion and type inference , 1984, POPL.

[5] Alberto Martelli,et al. An Efficient Unification Algorithm , 1982, TOPL.

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

[7] James J. Horning,et al. FP with data abstraction and strong typing , 1981, FPCA '81.

[8] Norihisa Suzuki,et al. Inferring types in Smalltalk , 1981, POPL '81.

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

[10] J. Backus. Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[11] GERARD P. HUET,et al. The Undecidability of Unification in Third Order Logic , 1973, Inf. Control..

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

[13] John C. Reynolds,et al. Automatic computation of data set definitions , 1968, IFIP Congress.

[14] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.