Approaches to Automatic Programming

Advances in Computers

Volumn 15, Issue C, 1976, Pages 1-63

  Biermann, Alan W ^a  

^a DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745218437     PISSN: 00652458     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0065-2458(08)60519-7     Document Type: Article

References (105)

1. Abrams, P., “An APL Machine,”. Rep. No. 114., 1970, Stanford Linear Accelerator, Stanford, California.
2. Adam, A., GADGET—un programme de génération automatique de programs sur les graphes et les ensembles., 1975, University of Paris VI, Paris.
3. Amarel, S., On the automatic formation of a computer program which represents a theory. Yovits, M., Jacobi, G.T., Goldstein, A.D., (eds.) “Self-Organizing Systems—1962”, 1975, Spartan Books, Washington, D.C., 107–175.
4. Balzer, R.M., “Automatic Programming,”. Tech. Rep. No. 1., 1972, Information Sciences Institute, University of Southern California, Marina Del Rey.
5. Balzer, R.M., A global view of automatic programming. Proc. J. Conf. Artif. Intell., 3rd, 1978, 1973, 494.
6. Balzer, R.M., Imprecise program specification. Proc. Consiglio Nazi. Ric. 1st. Elaborazione Inf., 1975 1975.
7. Barzdin, J., Freivald, R.V., On the prediction of general recursive functions. Sov. Math. (Engl. Transl. 13:5 (1972), 1224–1228.
8. Bauer, M. 1975 Ph.D. Thesis, Department of Computer Science, University of Toronto, Toronto (forthcoming).
9. Biermann, A.W., On the inference of turing machines from sample computations. Artif. Intell. 3:3 (1972), 181–198.
10. Biermann, A.W., “Automatic Indexing in Program Synthesis Processes,”. Tech. Rep. Computer Science Department, 1975, Duke University, Durham, North Carolina.
11. Biermann, A.W., Feldman, J.A., A survey of results in grammatical inference. Watanabe, S., (eds.) “Frontiers of Pattern Recognition”, 1972, Academic Press, New York, 31.
12. Biermann, A.W., Krishnaswamy, R., “Constructing Programs from Example Computations,”. Tech. Rep. OSU-CISRC-TR-74-5., 1974, Ohio State University Computer and Information Science Research Center, Columbus to appear in IEEE Trans. Software Eng.).
13. Biermann, A.W., Baum, R.I., Petty, F.E., Speeding up the synthesis of programs from traces. IEEE Trans. Comput. C24:2 (1975), 122–136.
14. Blum, L., Blum, M., Toward a mathematical theory of inductive inference. Inf. Control 28 (1975), 125–155.
15. Bobrow, D.G., Natural language input for a computer problem solving system. Minsky, M., (eds.) “Semantic Information Processing”, 1968, MIT Press, Cambridge, Massachusetts, 217–252.
16. Bobrow, D.G., Raphael, B., New programming languages for artificial intelligence research. Comput. Surv. 6:3 (1974), 153–174.
17. Boyer, R.S., Moore, J.S., Proving theorems about LISP programs. J. Assoc. Comput. Mack. 22 (1975), 129–144.
18. Buchanan, J.R., “A Study in Automatic Programming,”. Tech. Rep. Computer Science Department, 1974, Carnegie-Mellon University, Pittsburgh, Pennsylvania.
19. Buchanan, J.R., Luckham, D.C., “On Automating the Construction of Programs,”. Tech. Rep., Stanford Artificial Intelligence Project, 1974, Stanford, California.
20. Chang, C.-L., Lee, T.R.C., “Symbolic Logic and Mechanical Theorem Proving.”, 1973, Academic Press, New York.
21. Coles, L.S., An on-line question-answering system with natural language and pictorial input. Proc. Conf. Assoc. Comput. Mach., 23rd 1968 (1968), 157–167.
22. Dahl, O.-J., Dijkstra, E.W., Hoare, C.A.R., “Structured Programming.”, 1972, Academic Press, New York.
23. Dershowitz, N., Manna, Z., On automating structured programming. Proc. Int. Symp. Proving Improving Programs, 1975, 1975.
24. Duran, J.W., “A Study of Loop Invariants and Automatic Program Synthesis,”. Rep. SESLTR-12, 1975, Department of Computer Science, University of Texas, Austin.
25. Earley, J., High level operations in automatic programming. Proc. Symp. Very High Level Lang. 1974 (1974), 34–42.
26. Elspas, B., Levitt, K.N., Waldinger, R.J., Waksman, A., An assessment of techniques for proving program correctness. ACM Comput. Surv. 4:2 (1972), 97–147.
27. Feldman, J.A., “Automatic Programming,”. Rep. CS-255. Department of Computer Science, 1972, Stanford University, Stanford.
28. Feldman, J.A., Some decidability results on grammatical inference and complexity. Inf. Control 20:3 (1972), 244–262.
29. Feldman, J.A., Gries, D., Translator writing systems. Commun. ACM 11:2 (1968), 77–113.
30. Feldman, J.A., Royner, P., An Algol-based associative language. Commun. ACM 12:8 (1969), 439–449.
31. Feldman, J.A., Low, J., Swinehart, D., Taylor, R., Recent developments in SAIL—an Algol-based language for artificial intelligence. Proc. Fall Jt. Comput. Conf. 1972 (1972), 1193–1202.
32. Fikes, R.E., Nilsson, N.J., STRIPS: A new approach to the application of theorem proving to problem solving. Artif. Intell. 2:3-4 (1971), 189–208.
33. Floyd, R.W., Assigning meanings to programs. Proc. Symp. Appl. Math. 19 (1967), 19–32.
34. Gerhart, S.L., Verification of APL programs. Department of Computer Science, 1972, Carnegie-Mellon University, Pittsburgh, Pennsylvania Ph.D. Thesis.
35. Gerritsen, R., “Automatically Generated Programs for Information Retrieval,”. Tech. Rep., Graduate School of Industrial Administration, 1973, Carnegie-Mellon University, Pittsburgh, Pennsylvania.
36. Gold, M., Language identification in the limit. Inf. Control 10:5 (1967), 447–474.
37. Goldberg, P.C., Automatic programming. Goos, G., Hartmanis, J., (eds.) “Programming Methodology”, 23, 1975, Springer-Verlag, Berlin and New York, 347 Lect. Notes Comput. Sci.
38. Goldberg, P.C., “Structured Programming for Non-Programmers,”. Rep. No. RC-5318., 1975, IBM Research, Yorktown Heights, New York.
39. Goldstein, I.P., Summary of MYCROFT: A system for understanding simple picture programs. Artif. Intell. 6:3 (1975), 249–288.
40. Good, D.I., London, R.L., Bledsoe, W.W., An interactive program verification system. IEEE Trans. Software Eng., 1975, 59–67 sel No. 1.
41. Green, C.C., Theorem proving by resolution as a basis for question answering systems. Meltzer, B., Michie, D., (eds.) “Machine Intelligence 4”, 1969, Edinburgh Univ. Press, Edinburgh, 183–205.
42. Green, C.C., Application of theorem proving to problem solving. Proc. Int. Jt. Conf. Artif. Intel., 1st 1969 (1969), 219–239.
43. Green, C.C., The application of theorem proving to question answering systems. Artificial Intelligence Laboratory Rep. STAN-CS-69-138. Computer Science Department, 1969, Stanford University, Stanford, California Ph.D. Thesis.
44. Green, C., Barstow, D., “A Hypothetical Dialogue Exhibiting a Knowledge Base for a Program-Understanding System,”. Rep. AIM-258., 1975, Stanford Artificial Intelligence Laboratory, Stanford, California.
45. Green, C., Barstow, D., Some rules for the automatic synthesis of programs. Proc Int. Jt. Conf. Artif. Intel., 4th 1975 (1975), 232–239.
46. Green, C.C., Raphael, B., The use of theorem proving techniques in question answering systems. Proc. ACM Natl. Conf., 83rd 1968 (1968), 169–181.
47. Green, C.C., Waldinger, R.J., Barstow, D.R., Elschlager, R., Lenat, D.B., McCune, B.P., Shaw, D.E., Steinberg, L.I., “Progress Report on Program-Understanding Systems,”. Memo AIM-240., 1974, Stanford Artificial Intelligence Laboratory, Stanford, California.
48. Gries, D., “Compiler Construction for Digital Computers.”, 1971, Wiley, New York.
49. Halliday, M.A.K., Notes on transitivity and theme in English. J. Ling. 3:4 (1967), 179–215 37–81.
50. Halliday, M.A.K., Functional diversity in language as seen from a consideration of modality and mood in English. Found. Lang. 6 (1970), 322–361.
51. Hammer, M.M., Howe, W.G., Wladawsky, I., An interactive business definition system. Proc. Symp. Very High Level Lang. 1974 (1974), 25–33.
52. Hardy, S., “The POPCORN Reference Manual,”. Rep. CSM-1., 1973, Essex University.
53. Hardy, S., Automatic induction of LISP functions. AISB Summer Conf. 1974 (1974), 50–62.
54. Heidorn, G.E., English as a very high level language for simulation programming. Proc. Symp. Very High Level Lang., 1974, 1974, 91.
55. Hewitt, C.E., STEREOTYPES as an ACTOR approach towards solving the problem of procedural attachment in FRAME theories. Proc. Interdiscip. Workshop Com/put. Linguistics, Psychol., Linguistics, Artif. Intell. 1975 (1975), 94–103.
56. Hewitt, C.E., Smith, B., Towards a programming apprentice. IEEE Trans. Software Eng. sel 1 (1975), 26–45.
57. Hewitt, C.E., Bishop, P., Steiger, R., A universal modular ACTOR formalism for artificial intelligence. Proc. Int. Jt. Conf. Artif. Intel, 3rd 1973 (1973), 235–245.
58. Hoare, C.A.R., An axiomatic basis for computer programming. Commun. ACM 12 (1969), 576–583.
59. Hopcroft, J.E., Ullman, J.D., “Formal Languages and Their Relation to Automata.”, 1969, Addison-Wesley, Reading, Massachusetts.
60. Howe, G.W., Kruskal, V.J., Wladawsky, I., “A New Approach for Customizing Business Applications,”. Rep. No. RC 5474 (#23258)., 1975, IBM Research, Yorktown Heights, New York.
61. Iverson, K.E., “A Programming Language.”, 1972, Wiley, New York.
62. Knuth, D.E., Semantics of context-free languages. “Mathematical Systems Theory 2,”, 2, 1968, Springer-Verlag, Berlin and New York, 127–145.
63. Leavenworth, B.M., Sammet, J.E., An overview of nonprocedural languages. Proc. Symp. Very High Level Lang. 1974 (1974), 1–12.
64. Lee, R.C.T., Chang, C.L., Waldinger, R.J., An improved program-synthesizing algorithm and its correctness. Commun. ACM 17:4 (1974), 211–217.
65. Lenat, D.B., BEINGS: Knowledge as interacting experts. Proc. Int. Jt. Conf. Artif. Intel, 4th, 1975, 1975, 126.
66. London, R.L., Bibliography on proving the correctness of programs. Meltzer, B., Michie, D., (eds.) “Machine Intelligence”, 5, 1970, 569–580 New York.
67. Low, J.R., “Automatic Coding: Choice of Data Structures,”. Tech. Rep. No. 1. Department of Computer Science, 1974, University of Rochester, Rochester, New York.
68. McKeeman, W.M., Horning, J.J., Wortman, D.B., “A Compiler Generator.”, 1970, Prentice-Hall, Englewood Cliffs, New Jersey.
69. Manna, Z., Waldinger, R.J., Toward automatic program synthesis. Commun. ACM 14:3 (1971), 151–164.
70. Manna, Z., Waldinger, R.J., Knowledge and reasoning in program synthesis. Artif. Intell. 6:2 (1975), 175–208.
71. Martin, W.A., Ginzberg, M.J., Krumland, R., Mark, B., Morgenstern, M., Niamir, B., Sunguroff, A., Internal memos. Automatic Programming Group, 1974, Massachusetts Institute of Technology, Cambridge.
72. Mikelsons, M., Computer assisted application definition. “Conference Record of the Second Symposium on Principles of Programming Languages,”, 1975, Palo Alto, California, 233–242.
73. Minsky, M., “Semantic Information Processing.”, 1968, MIT Press, Cambridge, Massachusetts.
74. Minsky, M., “A Framework for Representing Knowledge,”, 1974, AI ReMassachusetts Institute of Technology, Cambridge, 306.
75. Minsky, M., Frame system theory. Proc. Interdiscip. Workshop Comput. Linguistics, Psychol., Linguistics, Artif. Intel. 1976 (1975), 104–115.
76. Morris, J.B., “A Comparison of MADCAP and SETL.”. Los Alamos Sci. Lab., 1973, University of California, Los Alamos, New Mexico.
77. Nilsson, N.J., “Problem Solving Methods in Artificial Intelligence.”, 1971, McGraw-Hill, New York.
78. Perlis, A.J., Automatic programming. Q. Appl. Math. 30 (1972), 85–90.
79. Petry, F.E., “Program Inference from Example Computations Represented by Memory Snapshot Traces,”. Tech. Rep. OSU-CISRC-TR-75-1., 1975, Ohio State University Computer and Information Science Research Center, Columbus.
80. Robinson, J., A machine oriented logic based on the resolution principle. J. Assoc. Comput. Mach. 12 (1965), 23–41.
81. Rulifson, J.F., Derksen, J.A., Waldinger, R.J., “QA4: A Procedural Calculus for Intuitive Reasoning,”. Tech. Rep. No. 73., 1972, Stanford Research Institute, Menlo Park, California.
82. Samuel, A., Some studies in machine learning using the game of checkers. IBM J. Res. Dev. 3 (1959), 210–229.
83. Samuel, A., Some studies in machine learning using the game of checkers. II. IBM J. Res. Dev. 11 (1967), 601–617.
84. Schwartz, J.T., Automatic and semiautomatic optimization of SETL. Proc. Symp. Very High Level Lang. 1974 (1974), 43–49.
85. Shank, R., Conceptual dependency: A theory of natural language understanding. Cognitive Psychol. 3:4 (1972), 552–631.
86. Shaw, D.E., Swartout, W.R., Green, C.C., Inferring LISP programs from examples. Proc. Int. Jt. Conf. Artif. Intel, 4th 1975 (1975), 260–267.
87. Siklóssy, L., The case for, and some experience with, automated consultants. Proc. Tex. Conf. Comput. Syst., 2nd, 1973, 1973.
88. Siklóssy, L., The synthesis of programs from their properties, and the insane heuristic. Proc. Tex. Conf. Comput. Syst., 3rd 1974 (1974), 21–23.
89. Simmons, R.F., Burger, J.F., Schwarcz, R.A., A computational model of verbal understanding. Proc. Fall Jt. Comput. Conf. 1968 (1968), 441–456.
90. Simon, H.A., The Heuristic compiler. Simon, H., Siklossy, L., (eds.) “Representation and Meaning”, 1972, Prentice-Hall, Englewood Cliffs, New Jersey, 9–43.
91. Slagle, J.R., “Artificial Intelligence: The Heuristic Programming Approach.”, 1971, McGraw-Hill, New York.
92. Solomonoff, R., A formal theory of inductive inference. Inf. Control, 1964, 224–254 1–22.
93. Srinivasan, C.V., “Programming Over a Knowledge Base: The Basis for Automatic Programming,”. Rep. SOSAP-TM-4., 1973, Dept. of Computer Science, Rutgers University, New Brunswick, New Jersey.
94. Summers, P., Program construction from examples, 1975, Yale University, New Haven, Connecticut Ph.D. Thesis.
95. Summers, P.D., A methodology for LISP program construction from examples. Proc. ACM Sym. Prin. Prog. Lang., 3rd, 1975, 1975, 68.
96. Sussman, G.J., “A Computational Model of Skill Acquisition,”. Rep. AI-TR-297. Artificial Intelligence Laboratory, 1973, Massachusetts Institute of Technology, Cambridge.
97. Sussman, G.J., McDermott, D.V., From PLANNER to CONNIVER—a genetic approach. Proc. Fall Jt. Comput. Conf., 41, 1972 1972.
98. Sussman, G.J., Winograd, T., Charniak, E., “Micro Planner Reference Manual,”. Artif. Intell. Memo No. 203A., 1971, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge.
99. Waldinger, R.J., Constructing programs automatically using theorem proving, 1969, Carnegie-Mellon University, Pittsburgh, Pennsylvania Doctoral Thesis.
100. Waldinger, R.J., “Achieving Several Goals Simultaneously,”. Artif. Intell. Cent. Tech. Note No. 107., 1975, Stanford Research Institute, Menlo Park, California.
101. Waldinger, R.J., Lee, R.C.T., PROW: A step towards automatic program writing. Proc. Int. Jt. Conf. Artif. Intel, 1st 1969 (1969), 241–252.
102. Wiedmann, C., “Handbook of APL Programming.”, 1974, Petrocelli Books, New York.
103. Winograd, T., “Understanding Natural Language.”, 1972, Academic Press, New York.
104. Winograd, T., Breaking the complexity barrier again. Proc. ACM SIGPLAN-SIGIR Interface Meet. 1973 (1973), 13–22.
105. Woods, W.A., Transition network grammars for natural language analysis. Commun. ACM 13:10 (1970), 591–606.