论文信息 - Typechecking Dependent Types and Subtypes - 字舞流文

Typechecking Dependent Types and Subtypes

Luca Cardelli | L. Cardelli

[1] L. Cardelli. A Polymorphic λ-calculus with Type:Type , 1986 .

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

[3] Thierry Coquand,et al. Constructions: A Higher Order Proof System for Mechanizing Mathematics , 1985, European Conference on Computer Algebra.

[4] John C. Reynolds,et al. Three Approaches to Type Structure , 1985, TAPSOFT, Vol.1.

[5] John C. Mitchell,et al. Abstract types have existential types , 1985, POPL.

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

[7] Butler W. Lampson,et al. A Kernel Language for Abstract Data Types and Modules , 1984, Semantics of Data Types.

[8] Gordon Plotkin,et al. Semantics of Data Types , 1984, Lecture Notes in Computer Science.

[9] Luigia Carlucci Aiello,et al. An Efficient Interpreter for the Lambda-Calculus , 1981, J. Comput. Syst. Sci..

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

[11] P. Martin-Löf. An Intuitionistic Theory of Types: Predicative Part , 1975 .

[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 .