The role of programming in a Ph.D. computer science program

ABSTRACT

In this general paper the role of programming in advanced graduate training is discussed. Subject matter related to programming as well as programming per se is considered. The importance and application of formalism are considered and also the need for good empirical experimentation. A brief outline for a sequence of courses is included, and subject headings that have been obtained from an extensive bibliography are given. A bibliography of programming references is included.

REFERENCES

• 1: ABRAHAMS, PAUL W., BARNETT, JEFFREY A., T AL. The LISP2 programming language and system. Proc. AFIPS 1966 Fall Joint Comput. Conf. Vol. 29, Spartan Books, New York, pp. 661-676.
• 2: James P. Anderson, A note on some compiling algorithms, Communications of the ACM, v.7 n.3, p.149-150, March 1964 [doi>10.1145/363958.363976]
• 3: Apt-concept and application. IIT Res. Inst., Chicago, 1961, 32 pp.
• 4: AMBROSm, S. Algebraic Languages. Boringhieri, Turin, Italy, 1965, 170 pp. (in Italian)
• 5: Bruce W. Arden , Bernard A. Galler , Robert M. Graham, An Algorithm for Translating Boolean Expressions, Journal of the ACM (JACM), v.9 n.2, p.222-239, April 1962 [doi>10.1145/321119.321121]
• 6: BACH, E. An Introduction to Transformational Grammars. Holt, Rinehart & Winston, New York, 1964.
• 7: BACKUS, J. W., BAUER, F. L., ET AL. Revised report on the algorithmic language ALGOL 60. Comput. J. 5, 4 (Jan. 1963), 349-368.
• 8: BAR-HILLEL, Y. Language and Information. Addison-Wesley, Reading, Mass., 1964.
• 9: --, AND SHAMIR, E. Finite state languages. Bull. Res. Council Israel, 8F, 1960, pp. 155-166.
• 10: ___, PERLES, M., AND SttAMIR, E. On formal properties of simple phrase structure grammars. Tech. Rept. No. 4, Off. Naval Res., Inform. Sys. Branch, US Gov. 1960. (Also published in Zeitschriff Fur Phonelik, Sprachwissenschaft und Kommunikationsforschung 15, 1961, pp. 143-172.)
• 11: BAUER, F. L. Formal problems of programming languages. automatic programming inf., No 24. Brighton College, Brighton, England, Feb. 1965, pp. 1-11.
• 12: BERKELEY, E. C. The programming language LISP, an introduction and appraisal. Comput. Automat. i3, 9 (Sept. 1964), 16-23.
• 13: BOBROW, 1. G., AND RAPItAEL, B. A comparison of list-processing computer languages. Rm-3842-PR, Rand Corp., Santa Monica, Calif., Oct. 1963, 37 pp.
• 14: Daniel G. Bobrow , Bertram Raphael, A comparison of list-processing computer languages: including a detailed comparison of COMIT, IPL-V, LISP 1.5, and SLIP, Communications of the ACM, v.7 n.4, p.231-240, April 1964 [doi>10.1145/364005.364057]
• 15: BOLLIET, L. The design of compilers-I. Revue Francaise de Traitement de l'Information 9, 1 (1966), 47-73.
• 16: BRAFFORT, P., AND HIRSCHBERG, D. (Eds.) Computer Programmint and Formal Systems. North Holland Pub. Co., Amsterdam, 1963, 161 pp.
• 17: BRASSEUR, M., AND COHEN, J. A description in ALGOL of a simplified ALGOL compiler. No. 27, Imag-Groupe ALGOL, Apr. 1964, 5 pp. (in French)
• 18: BRENNAN, R. D., AND SAND, I-I. PACTOLUS, a digital analog simulation program for the IBM 1620. Proc. AFIPS 1964 Fall Joint Comput. Conf., Vol. 26, Pt. I, Spartan Books, New York, pp. 299-312.
• 19: BRZOZOWSK1, J. A. A survey of regular expressions and their applications. IEEE Trans. EC-II, 3 (June 1962), 324-335.
• 20: BURKS, A. W., AND WRIGHT, J .B . Sequence generators, graphs and formal languages. Inform. Contr. 5, 3 (1963), 204-212.
• 21: CHAPIN, N. What choice of programming languages. Comput. Automat. 14, 2 (Feb. 1965), 12-14.
• 22: CHEATHAM, T. E., JR. The introduction of definitional facilities into higher level programming languages. Proc. AFIPS 1966 Fall Joint Comput. Conf., Vol. 29, Spartan Books, New York, pp. 623-637.
• 23: --, AND SATTLEY, K. Syntax-directed compiling. Proc. AFIPS 1964 Spring Joint Comput. Conf., Vol. 25, Spartan Books, New York, pp. 31-57.
• 24: CHOMSKY, N. On certain formal properties of grammars. Inform. Contr. 2 (1959), 137-167.
• 25: ___A note on phrase structure grammars. Inform. Contr. 2 (1959), 393-395.
• 26: _____Three models for the description of language. IEEE Trans. IT 2 (1956), 113-124.
• 27: -- Context-free grammars and pushdown storage. RLF Quart. Prog. Rep. No. 65, M.I.T., Cambridge, Mass., Mar. 1962.
• 28: ____, AND SCHUTZENBERGER, J. P. The algebraic theory of context-free languages. In Computer Programming and Formal Systems, Studies in Logic Series, Braffort, P. and Hirschberg, D. (Eds.), North Holland Pub. Co., Amsterdam, 1962.
• 29: ____, AND MILLER, G.A. Finite state languages. Inform. Contr., 1 (1958) 91-112.
• 30: Melvin E. Conway, Design of a separable transition-diagram compiler, Communications of the ACM, v.6 n.7, p.396-408, July 1963 [doi>10.1145/366663.366704]
• 31: DAvis, h. Computability and Unsolvability. McGraw-Hill, New York, 1958.
• 32: DI'KSTRA, E.W. On the design of machine independent programming languages. In Annual Review in Automatic Programming, Vol. 3, Pergamon Press, New York, 1963, pp. 27-42.
• 33: DIMSDALE, B., AND MARKOWITZ, H. J. A description of the Simscript language. IBM Syst. J. 8, 1 (1964), 57-67.
• 34: DOUGLAS, A. S., BRAY, N. M., NYGAARD, K., AND STARYNKEVITCH. D. Symposium on programming languages. Proc. IFIP Congress, 1962, North Holland Pub. Co., Amsterdam, pp. 518-523.
• 35: EFRON, R., AND GORDON, G. A general purpose digital simulator and examples of its application, Pt. I: Description of the simulator. IBM Syst. J. 3, 1 (1964) 22-34.
• 36: EICKEL, J., AND PAUL, M. The parsing and ambiguity problem for Chomsky-languages. In Formal Language Description Languages for Computer Programming, North Holland Pub. Co., Amsterdam, 1966, pp. 52-75.
• 37: J. Eickel , M. Paul , F. L. Bauer , K. Samuelson, A syntax controlled generator of formal language processors, Communications of the ACM, v.6 n.8, p.451-455, Aug. 1963 [doi>10.1145/366707.367583]
• 38: A. P. Yershov, ALPHA—An Automatic Programming System of High Efficiency, Journal of the ACM (JACM), v.13 n.1, p.17-24, Jan. 1966 [doi>10.1145/321312.321314]
• 39: ____, KOZHUKHIN, G. I., VOLOStIIN, V. M., AND HOCKNEY, R. W. Input Language for Automatie Programming Systems. Academic Press, New York, 1963, 70 pp.
• 40: FABIAN, V. Structural unainbiguity of formal languages. Czech. Math. J. 14, 3 (1964), 394-430.
• 41: A recursive procedure for compiling expressions. Revue Francaise de Traitement de l'Information 6, 4 (Oct. 1963), 275-281.
• 42: FARBER, D. J ., GRISWOLD, R. E., AND POLONSKY, I. P. The SNOBOL3 programming language. Bell Syst. Tech. J. 5, 6 (July-Aug. 1966), 895-944.
• 43: D. J. Farber , R. E. Griswold , I. P. Polonsky, SNOBOL , A String Manipulation Language, Journal of the ACM (JACM), v.11 n.1, p.21-30, Jan. 1964 [doi>10.1145/321203.321207]
• 44: Jerome A. Feldman, A formal semantics for computer languages and its application in a compiler-compiler, Communications of the ACM, v.9 n.1, p.3-9, Jan. 1966 [doi>10.1145/365153.365156]
• 45: FENVES, S. J ., LOGCHER, R. D ., AND MAUCH, S. P. Stress, a reference manual. M.I.T. Press, Cambridge, Mass., 1965, 388 pp.
• 46: ____, AND REINSCHMIDT, K .F . Stress, a User's Manual. M.I.T. Press, Cambridge, Mass., 1964, 51 pp.
• 47: FITIALOV, S. YA. A language for the recording of nonalgebraic algorithms. Foreign Develop. Mach. Translat. Inf. Proc. No. 142, JPRS, 21764, Nov. 1963, Off. Tech. Serv., Washington, D.C.
• 48: Robert W. Floyd, On the nonexistence of a phrase structure grammar for ALGOL 60, Communications of the ACM, v.5 n.9, p.483-484, Sept. 1962 [doi>10.1145/368834.368898]
• 49: Robert W. Floyd, Bounded context syntactic analysis, Communications of the ACM, v.7 n.2, p.62-67, Feb. 1964 [doi>10.1145/363921.363927]
• 50: Robert W. Floyd, Syntactic Analysis and Operator Precedence, Journal of the ACM (JACM), v.10 n.3, p.316-333, July 1963 [doi>10.1145/321172.321179]
• 51: ____Mathematical induction on phrase structure grammars. Inform. Contr. 4 (1961), 353-358.
• 52: GASKILL, R. A., HARRIS, J. W., AND McKNIGHT, A. L. DAS, a digital analog simulator. Proc. AFIPS 1963 Spring Joint Comput. Conf., Vol. 23, Spartan Books, New York, pp. 83-90.
• 53: C. W. Gear, High speed compilation of efficient object code, Communications of the ACM, v.8 n.8, p.483-488, Aug. 1965 [doi>10.1145/365474.365489]
• 54: Philip Gilbert, On the Syntax of Algorithmic Languages, Journal of the ACM (JACM), v.13 n.1, p.90-107, Jan. 1966 [doi>10.1145/321312.321319]
• 55: GINSBURG, S., AND HARRISON, M. A. Bracketed context-free languages. J. Comput. Sys. Sciences, 1 (1967), 1-23.
• 56: Seymour Ginsburg , H. Gordon Rice, Two Families of Languages Related to ALGOL, Journal of the ACM (JACM), v.9 n.3, p.350-371, July 1962 [doi>10.1145/321127.321132]
• 57: Seymour Ginsburg , Gene F. Rose, Some Recursively Unsolvable Problems in ALGOL-Like Languages, Journal of the ACM (JACM), v.10 n.1, p.29-47, Jan. 1963 [doi>10.1145/321150.321153]
• 58: Seymour Ginsburg , G. F. Rose, Operations Which Preserve Definability in Languages, Journal of the ACM (JACM), v.10 n.2, p.175-195, April 1963 [doi>10.1145/321160.321167]
• 59: Seymour Ginsburg , Edwin H. Spanier, Quotients of Context-Free Languages, Journal of the ACM (JACM), v.10 n.4, p.487-492, Oct. 1963 [doi>10.1145/321186.321191]
• 60: ____, AND --. Bounded ALGOL-like languages. Trans. Amer. Math. Soc. 113, 2 (1964), 333-368.
• 61: --, AND --. Mappings of languages by two tape devices. S-164, Proc. Fifth Ann. Symp. Switching Circuit Theory and Logical Design, 1964, pp. 57-67.
• 62: --, AND ULLIAN, J. Ambiguity in context-free languages. SDC Tech. 5emo. TM-738/055/00, Jan. 1964.
• 63: --, AND '. Some remarks about sequences in context-free languages. SCC Tech. Memo. TM-783/001/00, Jan. 1963.
• 64: GOODMAN, R. (Ed.) Annual Review in Automatic Programming, Vol. 4. Pergamon Press, New York, 1964, 263 pp.
• 65: GORN, S. Language-naming languages in prefix form. In Formal Language Description Languages for Computer Programming, North-Holland Pub. Co., Amsterdam, 1966, pp. 249-265.
• 66: GRAHAM, R.M. Bounded context translation. Proc. AFIPS 1964 Spring Joint Comput. Conf., Vol. 26, Pt. 1, Spartan Books, New York, pp. 17-29"
• 67: Sheila A. Greibach, Formal parsing systems, Communications of the ACM, v.7 n.8, p.499-504, Aug. 1964 [doi>10.1145/355586.364826]
• 68: Sheila A. Greibach, A New Normal-Form Theorem for Context-Free Phrase Structure Grammars, Journal of the ACM (JACM), v.12 n.1, p.42-52, Jan. 1965 [doi>10.1145/321250.321254]
• 69: ____Undecidability of the ambiguity problem for minimal linear grammars. Inform" Contr. (in press)
• 70: T. V. Griffiths , S. R. Petrick, On the relative efficiencies of context-free grammar, Communications of the ACM, v.8 n.5, p.289-300, May 1965 [doi>10.1145/364914.364943]
• 71: GRoss, M. Inherent ambiguity of minimal linear grammars. Inform. Contr. 7, 3 (1964), 366-368.
• 72: ____Mathematical linguistics and programming languages. Revue Francaise de Traitement de l'Information 6, 4 (Oct. 1963), 231-253. (in French)
• 73: HAINES, L. H. Note on the compliment of a (minimal) linear language. Inform" Contr. 7, 3 (1964), 307-314.
• 74: HALPERN, M. I. XPOP, a meta-language without metaphysics. Proc. AFIPS 1964 Fall Joint Comput. Conf., Vol. 26, Pt. 1, Spartan Books, New York, pp. 57-68.
• 75: HARNETT, R. W., SANSOM, F. J., AND WARSHAWSKY, L. h. Midas --an analog approach to digital computation. Simulation 3 (Sept. 1964), 17-43.
• 76: HUMBY, E. An introduction to programming languages. Comput. Bull. 8, 4 (Mar. 1965), 135-138.
• 77: HUSKEY, H" D. A language for simulation. In Symposium on Simulation Models, Methodology and Applications to the Behavioral Sciences, South-Western, Cincinnati, O., 1963, 289 pp.
• 78: H. D. Huskey , Ralph Love , Niklaus Wirth, A syntactic description of BC NELIAC, Communications of the ACM, v.6 n.7, p.367-375, July 1963 [doi>10.1145/366663.366664]
• 79: ILIFFE, J .K . Continuous evaluation. In Introduction to System Programming, Wegner, Peter (Ed.), Academic Press, New York, 1964, pp. 276-282.
• 80: INGERMAN, P.Z. The parameterization of the translation process. In Formal Language Description Languages for Computer Programming, North-Holland Pub. Co., Amsterdam, 1966, pp. 221-230.
• 81: E. T. Irons, An error-correcting parse algorithm, Communications of the ACM, v.6 n.11, p.669-673, Nov. 1963 [doi>10.1145/368310.368385]
• 82: ITURRIAGA, R., STANDISH, T. A., KRU'rAR, R. A., AND EARLEY, J. C. Techniques and advantages of using the formal compiler writing system FSL to implement a formula ALGOL compiler. Proc. AFIPS 1966 Spring Joint Comput. Conf., Vol. 28, Spartan Books, New York, pp. 214--252.
• 83: Kenneth E. Iverson, A method of syntax specification, Communications of the ACM, v.7 n.10, p.588-589, Oct. 1964 [doi>10.1145/364888.364969]
• 84: Kenneth E. Iverson, Formalism in programming languages, Communications of the ACM, v.7 n.2, p.80-88, Feb. 1964 [doi>10.1145/363921.363933]
• 85: _____A programming language. Proc. AFIPS 1962 Spring Joint Comput. Conf., Vol. 21, Spartan Books, New York, pp. 345- 351.
• 86: Kenneth E. Iverson, A Programming Language., John Wiley & Sons, 1962
• 87: JENSEN, J. Generation of machine code in ALGOL compilers. BIT 5, 4 (1965), 235-245.
• 88: JOHANSEN, P. Construction of recognition devices for regular languages from their Backus normal form definition. BIT 6, 4 (1966), 294-309.
• 89: John B. Johnston, A class of unambiguous computer languages, Communications of the ACM, v.8 n.3, p.147-149, March 1965 [doi>10.1145/363791.363796]
• 90: KINDLER, E. Simple algorithm for the programming of arithmetic expression. Sir. Z. Prac. Inf. 8 (1962), 143-154.
• 91: KLEENE, S. C. Representation of events in nerve nets and finite automata. In Automata Studies, Shannon, C. E., and McCarthy, J. (Eds.), Princeton U. Press, Princeton, N. J., 1956, pp. 3-41.
• 92: Donald E. Knuth, backus normal form vs. Backus Naur form, Communications of the ACM, v.7 n.12, p.735-736, Dec. 1964 [doi>10.1145/355588.365140]
• 93: KRASNOW, H. S., AND MERIKALLIO, R.A. The past, present, and future of general simulation languages. Mgmt. Sci. 2, 2 (Nov. 1964), 236-267.
• 94: KURODA, S. Y. Clsses of languages and linear-bounded automata. Inform. Contr. 7, 2 (1964), 207-223.
• 95: LANDIS, P.J. The mechanical evaluation of expressions. Comput. J. 6 (Jan. 1964), 308-320.
• 96: ____A formal description of ALGOL 60. In Formal Language Description Languages for Computer Programming, North- Holland Pub. Co., Amsterdam, 1966.
• 97: LANDWEBER, P.S. Three theorems on phrase structure grammars of Type I. Inform. and Contr. (in press)
• 98: B. M. Leavenworth, FORTRAN IV as a syntax language, Communications of the ACM, v.7 n.2, p.72-80, Feb. 1964 [doi>10.1145/363921.363932]
• 99: LEROY, i . On a method of compiling and executing ALGOL programs. Proc. 3rd AFCALTI Congress of Computing and Information Processing, pp. 191-197. (in French)
• 100: LINEBARGER, R. N., AND BRENNAN, R.D. A survey of digital simulation, digital analog simulator programs. Simulation 8 6 (Dec. 1964), 22-36.
• 101: Ralph L. London, A computer program for discovering and proving recognition rules for Backus Normal Form grammars, Proceedings of the 1964 19th ACM national conference, p.11.301-11.307, January 1964 [doi>10.1145/800257.808887]
• 102: Rosalind B. Marimont, A New Method of Checking the Consistency of Precedence Matrices, Journal of the ACM (JACM), v.6 n.2, p.164-171, April 1959 [doi>10.1145/320964.320973]
• 103: MARKOWITZ, H. M., AND KARR, H.W. Simscript, a Simulation Programming Language. Prentice-Hall, Englewood Cliffs, N. J., 1963, 134 pp.
• 104: MATTHEWS, G.H. Discontinuity and asymmetry in phrase structure grammars. Inform. Contr. (in press)
• 105: McCARTHY, J. A basis for a mathematical theory of computation. Proc. Western Joint Comput. Conf., Vol. 19, May 1961, Spartan Books, New York, pp. 225-238.
• 106: ____A formal description of a subset of ALGOL. In Formal Language Description Languages for Computer Programming, North-Holland Pub. Co., Amsterdam, 1966, pp. 1-12.
• 107: Robert M. McClure, A Programming Language for Simulating Digital Systems, Journal of the ACM (JACM), v.12 n.1, p.14-22, Jan. 1965 [doi>10.1145/321250.321252]
• 108: MCINNES, ALLAN W. Floyd productions for ALGOL-60. Report No. 179, Dept. Comput. Sciences, U. Illinois, Urbana, Ill., May 1965, 50 pp.
• 109: McNAUGHTON, R., AND YAMADA, H. Regular expressions and state graphs for automata. IEEE Trans. EC-9 (Mar. 1960), 39--47.
• 110: METCALFE, H.H. A parameterized compiler based on mechanical linguistics. Ann. Rev. Automat. Programming (1964), 125-165.
• 111: ____A parameterized compiler based on mechanical linguistics. PRC R-311, Planning Res. Corp., Los Angeles, Calif., Mar. 1963.
• 112: Calvin N. Mooers, TRAC, a procedure-describing language for the reactive typewriter, Communications of the ACM, v.9 n.3, p.215-219, March 1966 [doi>10.1145/365230.365270]
• 113: ____, AND DEUTSCH, L.P. TRAC, a text handling language. Proc. ACM 20th Nat. Conf., 1965, pp. 229-246.
• 114: MORRIS, D. The use of syntactic analysis in compilers. In Introduction to System Programming, Wegner, Peter (Ed.), pp. 249- 255.
• 115: Allen Newell, Documentation of IPL-V, Communications of the ACM, v.6 n.3, p.86-89, March 1963 [doi>10.1145/366274.366296]
• 116: ____, SHAW, J. C., AND SIMON, H.A. Report on a general problem-solving program, Inform. Processing Proc. Internat. Conf. Inform. Processing, UNESCO, Paris, June 1959, pp. 256-264.
• 117: OETTINOER, A. Automatic syntactic analysis and the pushdown store. In Structure of Language and Its Mathematical Aspects Proc. 12th Sympos. in Appl. Math., Jakobson, R. (Ed.), Amer. Math. Soc., Providence, R. I., 1961, pp. 104-129.
• 118: PARIKH, R. J. Language generating devices, MITRes. Lab. Electron. Quart. Progr. Rept. 60, Jan. 1961, pp. 199-212.
• 119: POST, E. A variant of a recursively unsolvable problem. Bull. Amer. Math. Soe., 52 (1946), 264-268.
• 120: PRATT, T. W., AND LINDSAY, R.K. A processor-building system for experimental programming languages. Proc. AFIPS 1966 Fall Joint Comput. Conf., Vol. 29, Spartan Books, New York, pp. 613-621.
• 121: Irving N. Rabinowitz, Report on the algorithmic language FORTRAN II, Communications of the ACM, v.5 n.6, p.327-337, June 1962 [doi>10.1145/367766.368151]
• 122: George Radin , H. Paul Rogoway, NPL: highlights of a new programming language, Communications of the ACM, v.8 n.1, p.9-17, Jan. 1965 [doi>10.1145/363707.363708]
• 123: B. Randell , L. J. Russell, Single-Scan Techniques for the Translation of Arithmetic Expressions into ALGOL 60, Journal of the ACM (JACM), v.11 n.2, p.159-167, April 1964 [doi>10.1145/321217.321221]
• 124: E. D. Reilly, Jr. , F. D. Federighi, On reversible subroutines and computers that run backwards, Communications of the ACM, v.8 n.9, p.557-558, Sept. 1965 [doi>10.1145/365559.365593]
• 125: S. Gorn, Report on Input-Output Procedures for ALGOL 60, Communications of the ACM, v.7 n.10, p.628-630, Oct. 1964 [doi>10.1145/364888.876697]
• 126: Report on subset ALGOL 60 (IFIP) ALGOL Bull., No. 16, May 1964, pp. 9-13, F. G. Duncan, Lubeckstraat 71, The Hague.
• 127: ROCHESTER, N. A formalization of two-dimensional syntax description. In Formal Language Description Languages For Computer Programming, North-Holland Pub. Co., Amsterdam, 1966, pp. 124-138.
• 128: Naomi Rotenberg , Ascher Opler, Variable width stacks, Communications of the ACM, v.6 n.10, p.608-611, Oct. 1963 [doi>10.1145/367651.367659]
• 129: SAELSON, K. Programming languages and their processing. Proc. IFIP Cong., Munich 1962, North-Holland Pub. Co., Amsterdam, pp. 487-492.
• 130: Jean E. Sammet, Survey of formula manipulation, Communications of the ACM, v.9 n.8, p.555-569, Aug. 1966 [doi>10.1145/365758.365762]
• 131: SCHEINBERO, S. Note on the Boolean properties of context free languages. Inform. Contr. 3, (1960), 372-375.
• 132: D. V. Schorre, META II a syntax-oriented compiler writing language, Proceedings of the 1964 19th ACM national conference, p.41.301-41.3011, January 1964 [doi>10.1145/800257.808896]
• 133: SCHUTZENBERGER, M. P. Classification of Chomsky languages. In Formal Language Description Languages for Computer Pro- "gramming, North-Holland Pub. Co., Amsterdam, 1966, pp. 100-104.
• 134: ____On the definition of a family of automata. Inform. Contr. 4i (1961), 245--270.
• 135: ____Finite counting automata. Inform. Contr. 5 (1962), 91-107.
• 136: ____On context-free languages and pushdown automata. Inform. Contr. 6 (Sept. 1963) 246-264.
• 137: ____, AND CHOMSKY, N. The algebraic theory of context-free languages. In Computer Programming and Formal Systems, North- Holland Pub. Co., Amsterdam, p. 118-161.
• 138: SCHWARTZ, J. I. Comparing programming languages. Comput. Autom. 14, (Feb. 1965), 15--16, 26.
• 139: SHAMIR, E. A remark on discovery algorithms for grammars. Inform. Contr. 5 (1962), p. 246-251.
• 140: Christopher J. Shaw, On declaring arbitrarily coded alphabets, Communications of the ACM, v.7 n.5, p.288-290, May 1964 [doi>10.1145/364099.364236]
• 141: ____A comparative evaluation of JOVIAL and FORTRAN IV. Automat. Programming Inf., No. 22, College of Technology, Brighton, England, Aug. 1964, 15 pp.
• 142: Christopher J. Shaw, A specification of JOVIAL, Communications of the ACM, v.6 n.12, p.721-736, December 1963 [doi>10.1145/763973.763978]
• 143: ____ JOVIAL, a programming language for real-time command systems. In Annual Review in Automatic Programming, Vol. 8, Pergamon Press, New York, 1963, pp. 53-120.
• 144: Christopher J. Shaw, Jovial and its documentation, Communications of the ACM, v.6 n.3, p.89-91, March 1963 [doi>10.1145/366274.366297]
• 145: R. A. Sibley, Invited papers—3: A new programming language: PL/1, Proceedings of the 1965 20th national conference, p.543-563, August 24-26, 1965, Cleveland, Ohio, United States [doi>10.1145/800197.806074]
• 146: Herbert A. Simon, Experiments with a Heuristic Compiler, Journal of the ACM (JACM), v.10 n.4, p.493-506, Oct. 1963 [doi>10.1145/321186.321192]
• 147: STEEL, T. B., JR. (Ed.) Formal Language Description Languages for Computer Programming. North-Holland Pub. Co., Amsterdam, 1966, 330 pp.
• 148: ____A formalization of semantics for programming language description. In Formal Language Description Languages for Computer Programming, North-Holland Pub. Co, Amsterdam, 1966, pp. 25-36.
• 149: STRCHEY, C. A general purpose maerogenerator. Comput. J. 8 3 (Oct. 1965), 225-241.
• 150: ____Towards a formal semantics. In Formal Language Description Languages for Computer Programming, North-Holland Pub. Co., Amsterdam, 1966, pp. 198-220.
• 151: Howard Bromberg, Survey of programming languages and processors, Communications of the ACM, v.6 n.3, p.93-98, March 1963 [doi>10.1145/366274.964640]
• 152: TOBEY, R. G., BOBROW', R. J., .AND ZILLES, S. N. Automatic simplification in FORMAC. Proc. AFIPS 1965 Fall Joint Comput. Conf., Vol. 27, Pt. 1, Spartan Books, New York, pp. 37-57.
• 153: TURSK, W. Some results of research on automatic programming in Eastern Europe. In Advances in Computers, Vol. , Academic Press, New York, 1964.
• 154: VAN KATWUK, A. A grammar of Dutch number names. Foundations dfLanguage 1, 1 (Jan. 1965), 51-58.
• 155: VAN WIJNGAARDEN, A. Recursive definition of syntax and semantics. In Formal Language Description Languages for Computer Programming, North-Holland Pub. Co., Amsterdam, 1966, pp. 13-24.
• 156: VORONN, V. A. An operational notation for the algorithm of mechanical translation. Tr. In-Ta Toehnoi Mekhan. I Vychisl. Tekhn. An SSSR P (1961), pp. 70-84. (in Russian)
• 157: WalK. I, Entropy and testability of context-free languages. In Formal Language Description Languages for Computer Programming, North-Holland Pub. Co., Amsterdam, 1966, pp. 105--123.
• 158: WaRSHaL, Stephen. A syntax directed generator. Proc. Eastern Joint Comput. Conf., Vol. 20, Dec. 1961, Spartan Books, New York, pp. 295-305.
• 159: WARSHALL, S., AND SHAPIRO, R. M. A general-purpose tabledriven compiler. Proc. AFIPS 1964 Spring Joint Comput. Conf., Vol. 25, Spartan Books, New York, pp. 59-65.
• 160: WEANER, P. An introduction to stack compilation techniques. In Introduction to System Programming, Wegner, Peter (Ed.), Academic Press, New York, 1964, pp. 101-121.
• 161: WEISS, Emc. The PL/I Converter. McGraw-Hill, New York, 1966, 113 pp.
• 162: Joseph Weizenbaum, ELIZA—a computer program for the study of natural language communication between man and machine, Communications of the ACM, v.9 n.1, p.36-45, Jan. 1966 [doi>10.1145/365153.365168]
• 163: WILKES, M.V. An experiment with a self-compiling compiler for a simple list-processing language. Ann. Rev. Automat. Programming 4 (1964), 1-48.
• 164: M. V. Wilkes, Constraint-type statements in programming languages, Communications of the ACM, v.7 n.10, p.587-588, Oct. 1964 [doi>10.1145/364888.364967]
• 165: Niklaus Wirth , Helmut Weber, EULER: a generalization of ALGOL and it formal definition: Part 1, Communications of the ACM, v.9 n.1, p.13-25, Jan. 1966 [doi>10.1145/365153.365162]
• 166: WYNN, P. A comparison technique for the numerical transformation of slowly convergent series based on the use of rational functions. Numer. Math. , 1 (Feb. 1962), 8--14.
• 167: Victor H. Yngve, COMIT, Communications of the ACM, v.6 n.3, p.83-84, March 1963 [doi>10.1145/366274.366291]
• 168: YUSHeHENKO, K. L. Levels and styles of address language and the problem of programming automation. Foreign Develop. Maeh. Translat. Inf. Proc., JPRS 16446, Off. Tech. Serv., Washington, D. C., (Nov. 1962), pp. 11-14.
• 169: ____, AND KOSTIUCHENKO, O .I . An algorithm for the translation of formulas written with the aid of parenthesis to the form of Lukashevich without parenthesis. Zb. Prats. Z Obchisl. Mat. 1 Tekhn. (1961), 84-89. (in Ukranian)

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Curriculum

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING

  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Computer science education

General Terms:
Design, Human Factors, Management, Theory

Keywords:
course content, course sequence, graduate curriculum, graduate programs, graduate-level programming, programming bibliography, programming research topics