Dynamic typing in polymorphic languages
暂无分享,去创建一个
Martín Abadi | Luca Cardelli | Benjamin C. Pierce | Didier Rémy | M. Abadi | B. Pierce | L. Cardelli | Didier Rémy
[1] Fritz Henglein,et al. Dynamic Typing: Syntax and Proof Theory , 1994, Sci. Comput. Program..
[2] John C. Reynolds,et al. Towards a theory of type structure , 1974, Symposium on Programming.
[3] Robin Milner,et al. Commentary on standard ML , 1990 .
[4] Pierre Weis,et al. The CAML reference manual , 1990 .
[5] Niklaus Wirth,et al. From Modula to Oberon and the programming language Oberon , 1987 .
[6] O. J. Dahl,et al. Simula Begin , 1979 .
[7] Gilles Dowek. Third order matching is decidable , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[8] Fritz Henglein. Dynamic Typing , 1992, ESOP.
[9] Robin Milner,et al. Definition of standard ML , 1990 .
[10] Luca Cardelli,et al. An Extension of System F with Subtyping , 1991, TACS.
[11] Paul Rovner. Extending Modula-2 to Build Large, Integrated Systems , 1986, IEEE Software.
[12] Satish R. Thatte. Quasi-static typing , 1989, POPL '90.
[13] Luca Cardelli. Amber. Combinators and Functional Programming Languages , 1985, Lecture Notes in Computer Science.
[14] Craig Schaffert,et al. CLU Reference Manual , 1984, Lecture Notes in Computer Science.
[15] Luca Cardelli,et al. Structural subtyping and the notion of power type , 1988, POPL '88.
[16] John C. Mitchell,et al. Abstract types have existential type , 1988, TOPL.
[17] Martín Abadi,et al. Dynamic typing in a statically-typed language , 1989, POPL '89.
[18] Luca Cardelli,et al. On understanding types, data abstraction, and polymorphism , 1985, CSUR.
[19] Xavier Leroy,et al. Dynamics in ML , 1991, FPCA.
[20] Greg Nelson,et al. Systems programming in modula-3 , 1991 .