[1] |
A. van Wijngaarden, ed., ?Report on the algorithmic language ALGOL 68,?Num. Math. 14:79?218 (1969). · Zbl 0191.46101 · doi:10.1007/BF02163002 |
[2] |
?PL/I Language Specifications,? IBM Order Number GY33-6003-2. |
[3] |
P. Naur, ed., ?Report on the algorithmic language ALGOL 60,?Num. Math. 1960:106?136. |
[4] |
N. Wirth and C. A. R. Hoare, ?A contribution to the development of ALGOL,?Comm. ACM 9 (June):6 (1966). · Zbl 0143.18603 |
[5] |
N. Wirth, ?The programming language PASCAL,?Acta Informatica 1(1):35?63 (1971). · Zbl 0205.18603 · doi:10.1007/BF00264291 |
[6] |
D. E. Knuth, ?A review of structured programming,? CS-73-371, Department of Computer Science, Stanford University (June 1973). |
[7] |
J. McCarthy, ?A basis for a mathematical theory of computation,? in Braffort and Hirschberg, eds.,Computer Programming and Formal Systems (North-Holland, Amsterdam, 1963). · Zbl 0203.16402 |
[8] |
F. V. McBride, D. J. T. Morrison, and R. M. Pengelby, ?A symbol manipulation system,? inMachine Intelligence 5 (Edinburgh University Press, 1970). |
[9] |
D. B. Anderson, Private Communication. |
[10] |
J. McCarthy, ?Recursive functions of symbolic expressions and their computation by machine,?Comm. ACM 3(4):184?195 (1960). · Zbl 0101.10413 · doi:10.1145/367177.367199 |
[11] |
D. T. Ross, ?A generalized technique for symbol manipulation and numerical calculation,?Comm. ACM (March 1961). · Zbl 0097.12505 |
[12] |
C. A. R. Hoare, ?Proof of correctness of data representations,?Acta Informatica 1:271?281 (1972). · Zbl 0244.68009 · doi:10.1007/BF00289507 |
[13] |
D. Michie, ?Memo functions: a language feature with rote learning properties,? DMIP Memorandum MIP-R-29 (November 1967). |
[14] |
R. Waldinger and K. N. Levitt, ?Reasoning about programs,? inProceedings of ACM Sigact/Sigplan Symposium on Principles of Programming Language Design (Boston, 1973). · Zbl 0309.68019 |
[15] |
J. Darlington and R. M. Burstall, ?A system which automatically improves programs,? inProceedings of Third International Conference on Artificial Intelligence (Stanford, California, 1973), pp. 479?485. |
[16] |
E. W. Dijkstra, ?Notes on structured programming,? inStructured Programming (Academic Press, New York, 1972), pp. 1?82. |
[17] |
G. M. Birthwhistle, O. J. Dahl, B. Myhrhang, and K. Nygaard, SIMULABEGIN (Student Literatur, Auerbach, 1973). |
[18] |
S. C. Kleene,Introduction to Metamathematics (Van Nostrand, 1952). · Zbl 0047.00703 |
[19] |
C. A. R. Hoare, A Note on Indirect Addressing, ALGOL Bulletin (June 1966). |
[20] |
P. M. Cohn,Universal Algebra (Harper and Row, New York, 1965). |
[21] |
R. M. Burstall, ?Proving programs by structural induction,?Comp. J. 12(1):41?48 (1969). · Zbl 0164.46202 · doi:10.1093/comjnl/12.1.41 |
[22] |
D. S. Scott, ?The lattice of flow diagrams,? in E. Engeler, ed.,Symposium on Semantics of Algorithmic Languages (Springer Verlag, 1971). · Zbl 0228.68016 |
[23] |
C. A. R. Hoare, ?Record handling,? in F. Genuys, ed.,Programming Languages (Academic Press, New York, 1968), pp. 291?347. · Zbl 0274.68010 |