The craft of programming

[1]  David Gries,et al.  Assignment and Procedure Call Proof Rules , 1980, TOPL.

[2]  Roland Carl Backhouse,et al.  Syntax of Programming Languages: Theory and Practice , 1979 .

[3]  Robert Sedgewick,et al.  Implementing Quicksort programs , 1978, CACM.

[4]  John V. Guttag,et al.  Abstract data types and the development of data structures , 1977, CACM.

[5]  R. Terras,et al.  A stopping time problem on the positive integers , 1976 .

[6]  Susan L. Graham,et al.  Practical syntactic error recovery , 1975, CACM.

[7]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[8]  Tony Hoare,et al.  Notes on Data Structuring , 1972 .

[9]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[10]  Edsger Wybe Dijkstra,et al.  Ewd 316: a short introduction to the art of programming , 1971 .

[11]  C. Hoare Proof of a program: FIND , 1971, CACM.

[12]  C. A. R. Hoare,et al.  Procedures and parameters: An axiomatic approach , 1971, Symposium on Semantics of Algorithmic Languages.

[13]  黒沢 正彦 フランスの新しい文献処理システムP.A.S.C.A.L. , 1971 .

[14]  Richard W. Hamming,et al.  Introduction to Applied Numerical Analysis. , 1971 .

[15]  C. A. R. Hoare,et al.  Proof of a Recursive Program: Quicksort , 1971, Comput. J..

[16]  David Gries,et al.  Compiler Construction for Digital Computers , 1971 .

[17]  Howard Lee Morgan,et al.  Spelling correction in systems programs , 1970, Commun. ACM.

[18]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[19]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[20]  P. Naur Proof of algorithms by general snapshots , 1966 .

[21]  P. J. Landin,et al.  The next 700 programming languages , 1966, CACM.

[22]  P. J. Landin A λ-CALCULUS APPROACH , 1966 .

[23]  P. J. Landin,et al.  Correspondence between ALGOL 60 and Church's Lambda-notation , 1965, Commun. ACM.

[24]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[25]  John W. Backus,et al.  The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conference , 1959, IFIP Congress.

[26]  G. Gentzen Untersuchungen über das logische Schließen. II , 1935 .