Typeful Programming
暂无分享,去创建一个
[1] Niklaus Wirth,et al. From Modula to Oberon and the programming language Oberon , 1987 .
[2] Robert A. Kowalski,et al. Logic for problem solving , 1982, The computer science library : Artificial intelligence series.
[3] Luca Cardelli,et al. On understanding types, data abstraction, and polymorphism , 1985, CSUR.
[4] David A. Moon,et al. The Lisp Machine manual , 1981, SGAR.
[5] J. Fenstad. Proceedings of the Second Scandinavian Logic Symposium , 1971 .
[6] 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 .
[7] Alan Mycroft,et al. A Polymorphic Type System for Prolog , 1984, Logic Programming Workshop.
[8] John C. Reynolds,et al. Preliminary design of the programming language Forsythe , 1988 .
[9] R. Strom,et al. NIL: An integrated language and system for distributed programming , 1983, SIGPLAN '83.
[10] D. L. Parnas,et al. On the criteria to be used in decomposing systems into modules , 1972, Software Pioneers.
[11] Luca Cardelli,et al. A semantic basis for quest , 1990, Journal of Functional Programming.
[12] Andrew M. Pitts,et al. The theory of constructions: Categorical semantics and topos-theoretic models , 1987 .
[13] Guy L. Steele,et al. C, a reference manual , 1984 .
[14] Butler W. Lampson,et al. A Kernel Language for Abstract Data Types and Modules , 1984, Semantics of Data Types.
[15] Ronald Morrison,et al. An Approach to Persistent Programming , 1989, Comput. J..
[16] Kristen Nygaard,et al. SIMULA: an ALGOL-based simulation language , 1966, CACM.
[17] Luca Cardelli,et al. Types for Data-Oriented Languages , 1988, EDBT.
[18] Gregory R. Andrews,et al. Concepts and Notations for Concurrent Programming , 1983, CSUR.
[19] John C. Reynolds,et al. Towards a theory of type structure , 1974, Symposium on Programming.
[20] L Long. BASIC programming , 1986 .
[21] Robin Milner,et al. A proposal for standard ML , 1984, LFP '84.
[22] V. Stavridou,et al. Abstraction and specification in program development , 1988 .
[23] Thierry Coquand,et al. Constructions: A Higher Order Proof System for Mechanizing Mathematics , 1985, European Conference on Computer Algebra.
[24] Craig Schaffert,et al. Abstraction mechanisms in CLU , 1977, Commun. ACM.
[25] William R. Cook,et al. Canning: inheritance is not subtyping , 1990 .
[26] Bruno Courcelle,et al. Fundamental Properties of Infinite Trees , 1983, Theor. Comput. Sci..
[27] D. A. Turner,et al. Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.
[28] Luca Cardelli,et al. Abstract Types and the Dot Notation , 1990, Programming Concepts and Methods.
[29] Glenn Krasner,et al. Smalltalk-80: bits of history, words of advice , 1983 .
[30] Gordon D. Plotkin,et al. An ideal model for recursive polymorphic types , 1984, Inf. Control..
[31] Peter Buneman,et al. Using Powerdomains to Generalize Relational Databases , 1991, Theor. Comput. Sci..