论文信息 - Basic Polymorphic Typechecking - 字舞流文

Basic Polymorphic Typechecking

Luca Cardelli | L. Cardelli

[1] Luca Cardelli,et al. On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[2] Robin Milner,et al. A proposal for standard ML , 1984, LFP '84.

[3] Kim B. Bruce,et al. The Semantics of Second Order Polymorphic Lambda Calculus , 1984, Semantics of Data Types.

[4] Nancy McCracken,et al. The Typechecking of Programs with Implicit Type Structure , 1984, Semantics of Data Types.

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

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

[7] Mario Coppo,et al. An Extended Polymorphic Type System for Applicative Languages , 1980, MFCS.

[8] Rod M. Burstall,et al. HOPE: An experimental applicative language , 1980, LISP Conference.

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

[10] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..

[11] J. Fenstad. Proceedings of the Second Scandinavian Logic Symposium , 1971 .

[12] J. Girard. Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types , 1971 .

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

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