Donald E. Knuth
- 1 ASHCROFT, EDWARD, AND MANNA, ZOHAR. "The translation of 'go to' programs to 'while' programs," Proc. IFIP Congress 1971 Vol. 1, North-Holland Publ. Co., Amsterdam, The Netherlands, 1972, 250-255.Google Scholar
- 2 BAKER, CHARLES L. "Review of D. D. Me- Craeken, Digital corc puter programming," Math. Comput. ll (19M), 298-305.Google Scholar
- 3 BAKER, F. TERRY, ANY MILLs, H~A~ D. "Chief programmer teams," Datamation 19, 12 (December 1973), 58-61.Google Scholar
- 4 BARRON, D. W. Recursive techniques in programming, American Elsevier, New York, 1968, 64 pp.Google Scholar
- 5 BAUER, F. L. "A philosophy of programming," University of London Special Lectures in Computer Science (October 1973): Lecture notes published by Math. Inst., Tech. Univ. of Munich, Germany. Google Scholar
- 6 BERRY, D~NIELM. "Loops with normal and abnormal exits," Modeling and Measurement Note ~$, Computer Science.Department, Univ. California, Los Angeh.s, Calif. 1974, 39 pp.Google Scholar
- 7 BOCHMar~, G. V. "Multiple exits from a loop without the GOTO," Comm. ACM 16, 7 (July 1973), 443-444. Google Scholar
- 8 B(~HM, CORRADO AND JACOPINI, GUISEPPE. "Flow-diagrams, Turing machines, and languages with only two formation rules," Comm. ACM 9, 5 (May 1966), 366--371. Google Scholar
- 9 BROWN, Jells R. "In memoriam..", unpublished note, January 1974.Google Scholar
- 10 }3nuNo J., .~ND STIEGLITZ, K. "The expression of algorithms by charts," J. ACM 19, 3 (July 1972), 517-525. Google Scholar
- 11 BURKHA~D, W. A. "Nonrecursive tree traversal algorithms," in Prec. 7th Annual Princeton Conf. on Information ~ciences and Systems, Princeton Univ. Press, Princeton, N.J., 1973, 403-405.Google Scholar
- 12 CHEATHXM, T. E., J~., AND WwGBR~IT, BEN. "A laboratory,,.for the study of automating programming, m Prec. AFIPS 1972 Spring Joint Computer Conf., Vol. 40, AFIPS Press, Montvale, N.J., 1972, 1t-21.Google Scholar
- 13 CL~_~K, R. L2,WR~NCE. "A linguistic contribution to GOTO-less programming," Datamagon 19, 12 (December 1973), 62-63.Google Scholar
- 14 CLINT, M., .~ND HEAVE, C. A. R. "Program proving: jumps and functions," Acta Informatica 1, 3 (1972), 214-224.Google Scholar
- 15 CooP~n, D. C. "The equivalence of certain computations," Computer J. 9, 1 (May 1966), 45-52.Google Scholar
- 16 CooP~i~, D. C. "BShm and Jaeopini's reduction of flow charts," Comm. A CM 10, 8 (August 1967), 463, 473. Google Scholar
- 17 DAaL, O.-J., DIJXSTnA, E. W., A~v HOARE, C. A. R. Structured programming, Academic Press, London, England, 1972, 220 pp.Google Scholar
- 18 DAELINGTOh', J., AND BUaS~ALL, R. M. "A system which automatically improves programs," in Prec. 8rd Interntl. Conf. on Artificial Intelligence, Stanford Univ., Stanford, Calif., 1973, 479-485.Google Scholar
- 19 I)~ MARNEFFE, PIERRE-ARNoVL. "Helen programming: A survey," Universite de Liege, ~ervice Informatique, Liege, Belgium, 1973, 135 pp.Google Scholar
- 20 DIJI~STRA, E. W. "Recursive programming," Numerische Mathematik 2, 5 (1960), 312-318.Google Scholar
- 21 DIJKSTn~, E. W. "Programming considered as a huma~ activity," in Prec. IFIP Congress 1985, North-Holland Publ. Co., Amsterdam, The Netherlands, 1965, 213-217.Google Scholar
- 22 DIJKSTRA, E. W. "A constructive approach to the problem of program correctness," BIT 8, 3 (1968), 174-186.Google Scholar
- 23 ~DIJKSTRA, E. W. "Go to statement, considered harmful," Comm. ACM 11, 3 (March 1968), 147-148, 538, 541. {There are two instances of pages 147-148 in this volume; the second 147-148 is relevant here.} Google Scholar
- 24 DIJKSTRA, E. W. "Solution of a problem in concurrent programming control," Comm. A CM 9, 9 (September 1968), 569. Google Scholar
- 25 DIJKSTRA, E. W. "Structured programruing," in Software engineering techniques, J. N. Buxton and B. Randell {Eds.} I~tATO Scientific Affairs Division, Brussels, Belgium, 1970, 84-88.Google Scholar
- 26 DIJXSTRA, E. W. "EWD316- A short introduction to the art of programming," Technical University Eindhoven, The Netherlands, August 1971, 97 pp.Google Scholar
- 27 DIJKSTRA, E. W. "The hum_ble programmer," Comm. ACM 15, 10 (October 1972), 859-866. Google Scholar
- 28 DIJKSTRA, E. W. "Prospects for a better progrtmaming language," in High level lauguages, C. Boon {Ed}., ~nfo.tech State of the Art Report ,, 1972, 217-282.Google Scholar
- 29 DI~ST~A, E. W. persbnal communication, January 3, 1973.Google Scholar
- 30 DIJKSTRA, E. W. personal communication, November 19, 1973.Google Scholar
- 31 D}~KST~, E. W. personal communication, * January 30, 1974.Google Scholar
- 32 Do~x~vso~, J~ES R. ~'Structured programming," Datamation 19, 12 (December 1973), 52-54.Google Scholar
- 33 DYLAN, Bo~. Blonde ou blonde, record album produced by Bob Johqston, Columbia Records, New York, March 1966, Columbia C2S 841.Google Scholar
- 34 G~L~, STANLEY. "Automatic computing: Its problems and prizes," Computer J. 3, 3 (October 1965), 177-189. -Google Scholar
- 35 HENDERSON, P. AND SNOWDON, R. "An expe riment in structured programming," T 12, 1 (1972), ~8--5~. ,,Google Scholar
- 36 HOXR~, C. A. R. "Quiekso~t, Computer j. 5, 1 (1962), 10-15.Google Scholar
- 37 HO~RE, C. A. R. "An' axiomatic approach to computer programming," Comm. A CM 12, 10 (October 1969)~ 576-580, 583. Google Scholar
- 38 Ho.~a~, C. A. R. 'Proof of a p~:ogram: FIND," Comm. ACM !4, 1 (January 1971), 39-45. Google Scholar
- 39 HOARE, C. A. R. "A note on the for statement," BIT 12, 3 (1972), ~4-341.Google Scholar
- 40 HO~R~, C. A. R. "Pr~speets for a better programming language," in High le~e! languages, C. Boon {Ed.}, Infotech State of the Art Report 7, 1972, 327-343.Google Scholar
- 41 HOARE, C. A. R., ~ W~RTH, N. "An axiomatic definition of thi~ p~ogrammiag language PASCAL," Ae~ l~tic~a 2, 4 (1973), 335-355.Google Scholar
- 42 HO~R~, C. A. R. "Hi~ts for programming language design," COmputer Science rel~ort STAN-CS-74-403, Stanford Univ., ~tanford, Calif., January 1974, 29 pp.Google Scholar
- 43 HoPKInS, M~TIN E:. "Computer aided software design," in ~oflware enqineerin~ techniques, J. N. Buxton and B. Randell {Eds.} NATO Scientific Affairs Division, Brussels, Belgium, 1970, 99-101.Google Scholar
- 44 I-IOPKINS, MaaTt~ E. '~A ease for the GOTO," Prec. ACM Annual Conference Boston, Mass., Augus~ 1972, 787-790. Google Scholar
- 45 HULL, T. E. "Would you believe structured FORTRAN?" 8IGNUM NewsleUer 8, 4 (October 1973), 13-16.~ Google Scholar
- 46 IN~aLLS, DAN. "The execution time profile as a programming tool," in Compiler optimization, 2d Cou~ant Computer Science Symposium, R a~da!l Rustin {Ed.}, Prentice-Hall, Englewood Cliffs, N. J., 1972, 107-128.Google Scholar
- 47 KELLEY, ROBERT A., AND WAL~'ERS, JOHN R. "APLGOL-2, a strtmtured programm!ng system for APL," IBM Pale Alto Scientific Center report 320-3318 :~(August 1973), 29 pp.Google Scholar
- 48 KLE~.SE, S. C. "Representation of events in nerve nets," in AufOma~a Studies, C. E. Shannon and J. McCarthy {Eds.}, Princeton University Press, PHn~eton, N.J., 1956, 3- 40.Google Scholar
- 49 KNUTH, }DONALD E. "RUNCIBLE--Algebraic translation on a limited computer," Comm. ACM 2, 11 (November, 1959), 18-21. {There is a bug in the flowchart. The are labeled "2" from the box labeled "0:" in the upper left corner should go to the box labeledRm ffi 8003.} Google Scholar
- 50 KNu~H, DONALD E. Fundamental al#orithms, The art of computer programming, Vol. 1, Addison-Wesley, Reading, Mass. 1968 2d ed., 1973, 684 pp _ Google Scholar
- 51 K~vTn, DONALD E. "'An empirical study of FORTRAN programs,:' 3oftware---Practice and Experience l, 2 (April-June 1971), 105- 133.Google Scholar
- 52 KNUTH, DO,ALe E., AND FLOYD, P~OB:~RT W. "Notes on avoiding 'go to' statements," Information Processing Letters 1, 1 (February 1971), 23--31, 177.Google Scholar
- 53 KNUTH, DONALD E. "George Forsythe and the development of Computer Science," Comm. ACM 15, 8 (August 1972), 721-726. Google Scholar
- 54 KNUTt4, DO, ALe E. Sorting and searching, The art of computer programming, Vol Addison-Wesley, Reading, Ma~s., 1973,'722 Google Scholar
- 55 ~NUTH, DONALD E. "A review of 'structured programming'," Stanford Computer Science Department report STAN-CS-73- 371, Stanford Univ., Stanford, Calif., June 1973, 25 pp. Google Scholar
- 56 K~UTH, DONALD }~., .~.ND SZWARCFITER, JA Ms L. A structured program to generate all topological sorting arrangements," Information Processing Letters 2, 6 (April 1974) 153-157.Google Scholar
- 57 KOSARaJU, S. RAo. "Analysis of structured ~ rograxns," Proc. Fifth Annual ACM Syrup. heory of Computing, (May 1973), 240-252; also in J. Computer and System Sciences, 9, 3 (December 1974). Google Scholar
- 58 LANmN, P. J. "A correspondence between AL(~oL 60 and Church's lambda-notation: part I," Comm. ACM 8, 2 (February 1965), 89-101. Google Scholar
- 59 LAsD{N, P. J. "The next 700 programming languages," Comm. ACM 9, 3 (March 1966), 157-166. Google Scholar
- 60 LEAVENWORTH, B. M. "Programming with(out) the GOTO," Proc. ACM Annual Conference, Boston, Mass., August 1972, 782-- 786. Google Scholar
- 61 MANNA, ZOHAR, AND WALDINGER, RICHARD J. "Towards automatic program synthesis," in Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics 1118, E. Engeler lEd.l, Springer-Verlag, New York, 1971, 270-310.Google Scholar
- 62 McCARTHY, JohN. "Reeursive functions of symbolic expressions and their computation by machine, part I," Comm. ACM 3, 4 (April 1960), 184-195. Google Scholar
- 63 McCaRTHY, JOHN. "Towards a mathematical science of computation," in Proe. IFIP Congress 1962, Munich, Germany, North- Holland Publ. Co., Amsterdam, The Netherlands, 1963, 21-28.Google Scholar
- 64 ~cCRACKEN, DANIEL D. "Revolution in ~rogramming," Datamation 19, 12 (Decemer 1973), 50-52.Google Scholar
- 65 McKEEMAN, W. M.; HORNING, J. J.; ANY W O~a'MXN, D. B. A compiler generator, Prentice-Hall, Englewood Cliffs, N. J., 1970, 527 pp.Google Scholar
- 66 MILLAY, EDSIA ST. VINCENT. "Elaine"; el. Bartlett's Familiar Quotations.Google Scholar
- 67 MILLER, EDWARD F., JR., AND LINDAMOOD, GEOa6E E. "Structured programming: topdown approach," Datamation 19, 12 (December 1973)i 55-57.Google Scholar
- 68 MILLs, H. D~ "Top-down programming in large systemS," in Debugffino techniques in large systems, Randall Rustin {Ed.}, Prentice-Hall, Englewood Cliffs, N. J., 1971, 41- 55.Google Scholar
- 69 MIL~s, H. D. "Mathematical foundations for structured programming," report FSC 72-6012, IBM Federal Systems Division, Gaithersburg, Md. (February 1972), 62 pp.Google Scholar
- 70 MILLS, H. D:. "How to write correct programs and know it," report FSC 73-5008, IBM Federal Systems Division, Gaithersburg, Md. (1973), 26 pp.Google Scholar
- 71 NAssI, I. R., .~N}) AKKOYUNLU, E. A. "Verification techniques for a hierarchy of control structures," Tech. report 26, Dept. of Computer Science, State Univ. of New York, Stony Brook, New York (January 1974), 48 pp.Google Scholar
- 72 N.,vR, PETER {Ed.} "Report on the algorithmic lapguage ALGOL 60," Comm. ACM 3, 5 (May 1960), 299-314. Google Scholar
- 73 NAUR, PETER. "Go to statements and good Algol style," BIT 3, 3 (1963), 204-208.Google Scholar
- 74 NAUR, PETER. "Program translation viewed as a general data processing problem," Comm. ACM 9, 3 (March 1966), 176-179. Google Scholar
- 75 NAUR, PETER. "An experiment on program development," BIT 12, 3 (1972), 347-365.Google Scholar
- 76 PXGER, D. "Some notes on speeding up certain loops by software, firmware, and hardware means," in Computer~ and automata, Jerome Fox lEd.l, john Wiley & Sons, New York 1972, 207-213; also in IEEE Trans. Computers, C-21, 1 (January 1972), 97-100.Google Scholar
- 77 PETERSON, W. W.; KASAMI, T.; Ar~v TOK- URn, N. "On the capabilities of while, repeat, and exit statements," Comm. ACM 16, 8 (August 1973), 503-512. Google Scholar
- 78 PF~T~.RSON, W. WESLEY. personal communication, April 2, 1974.Google Scholar
- 79 Rxxt~, MARx ANY HOr~AG~I~, PER. "The present most recent final word about labels }n MARY, Machzne Oriented Languages Bul. letin 1, Trondheim, Norway (October 1972), 18-26.Google Scholar
- 80 REH), CONSTANCE. Hilbert, Springer-Verlag, New York, 1970, 290 pp.Google Scholar
- 81 R~YNOLDS, JOHN. "Fundamentals of structured programming," Systems and Info. Sei. 555 course notes, Syracuse Univ., Syracuse, N.Y., Spring 1973.Google Scholar
- 82 S~TT~RTrtW~T~, E. H. "Debugging tools for high level languages," 8oftware--Practice and Experience 2, 3 (july-September 1972), 197-217.Google Scholar
- 83 SCHSECX, P. B., ~SD ANeE~, }~LLINOR. "A FORTRAN to FORTRAN optimizing compiler," Computer J. 16, 4 (1973), 322-330.Google Scholar
- 84 SCHOaaE, D. V. "M~T~-II--a syntax-directed compiler writing language," Proc. A CM National Conference, Philadelphia, Pa., 1964, paper DI.3. Google Scholar
- 85 SCtIOR~E, D. V. "Improved organization for procedural languages," Tech. memo TM 3086/002/00, Systems Development Corp., Santa Moniea, Calif., September 8, 1966, 8 p(~.Google Scholar
- 86 SmGo, ; SttIMOMUnA, T.; FUJIDAYASHI S.; AND MA~JIMA, T. "SPOT: an experimental system for structured programming" (in Japanese), Conference Record, Information Processing Society of Japan, 1973. {Translation available from the authors, Nippon Electric Company Ltd., Kawasaki, Japan.}Google Scholar
- 87 ST~ACHV.Y, C. "Varieties of programming language," in High level tanfuages, C. Boon tEd.l, Infotech State of the Art Report 7, 1972, 345-362.Google Scholar
- 88 STRONG, H. R. Ja. "Translating recursion equations into fie charts, J. Computer and System Sciences 5, 3 (June 1971), 254-285.Google Scholar
- 89 TEtT~LMAN, W. "Toward a programming laboratory," in Software Engineering Techniques, J. N. Buxton and B. Randall {Eds.}, NATO Scientific Affairs Division, Brussels, Belgium, 1970, 137-149.Google Scholar
- 90 TEITELMAN, W. et al. "INTERI, ISP reference manual," Xerox Pale Alto Research Center, Pale Alto, Calif., and Bolt Beranek and Newman, Inc., 1974.Google Scholar
- 91 WALKER, S. A., aND STRONG I-~. R. "Characterizations of flowchartab~e reeursions," J. Computer and System Sciences 7, 4 (August 1973), 404-447.Google Scholar
- 92 W~.GNER, EBERH.~RD. "Tree-structured programs," Comm. ACM 16, 11 (November 1973), 704-705. Google Scholar
- 93 W~.~B~G, G~ALI) M. "The psychology of improved prograr~i~: petfe~msnce," Datamation 1T, 11 (Noveinbvr :1972 ), 82-85.Google Scholar
- 94 WIa~n, N. "On eertiain basic concepts of programming languages," Stanford Computer Science Report ~ 65, Stanford, Calif. (May 1967), 30pp.Google Scholar
- 95 W{~H, N. "PL 360,i a programming language for the 360 computers," J. ACM 15, 1 (January 19f~), 37'-~,74. Google Scholar
- 96 WIRTH, N. "Program~ development by stepwise refinement," Comm. A(~M 14, 4 (April 1971), 221-227. Google Scholar
- 97 WIRTH, ~, "The programming language Pascal," Acta Info~zmu$iea 1, t (1971), 35- 63.Google Scholar
- 98 WOLF, W. A.; RVSSWLL, D. B.; ~x) H~BER- MX~N, A. N. "BLms:: A language for systems programming," ,Comm. ACM 14, 12 (December 1971), 7~#90. Google Scholar
- 99 WOLF, W. A. "Pro ~ghzmmia$ Without the goto," Information 'Proec~M,n# 71, Prec. IFIP Congress, Yol. 1, North-Holland Publ. Co., Amsterdam, The Netherlands, 1971, 408-413. :Google Scholar
- 100 Wu~F, W. A. "h ~as, against the GOTO," Prec. ACM 197~ Annual Conference, Boston, Mass. (August 1972), 791-797. Google Scholar
- 101 WOLF, W. A,; Joy,soU, Rxcm~D K.; W~IN- STOCK, CHARLES P,,,~ .~ND HeRBs, S~EV~N O. "The design of an 6ptimizing compiler," Computer Science !Department report, Carnegie-Mellon U~v., Pittsburgh, Pa., (December 1973),, 10~ ~Pl~.Google Scholar
- 102 ZAHN, CHARLES ~. "A ~ontrolstatement for natural top-down structured programming," presented ati Symposium on Programming Languages~ Paris, 1974. Google Scholar
Recommendations
Structured assembly language programming
SIGCSE '82: Proceedings of the thirteenth SIGCSE technical symposium on Computer science educationFor those of us who are essentially high level programmers, the intricacies and lack of structure in assembly language programs are often an insurmountable barrier to effective assembly language programming. This paper attempts to show a way to overcome ...
Comments