{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:34:37Z","timestamp":1693866877252},"reference-count":105,"publisher":"Elsevier","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1976]]},"DOI":"10.1016\/s0065-2458(08)60519-7","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T00:56:15Z","timestamp":1295398575000},"page":"1-63","source":"Crossref","is-referenced-by-count":16,"title":["Approaches to Automatic Programming"],"prefix":"10.1016","author":[{"given":"Alan W.","family":"Biermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0065-2458(08)60519-7_bib1","series-title":"Rep. No. 114.","article-title":"\u201cAn APL Machine,\u201d","author":"Abrams","year":"1970"},{"key":"10.1016\/S0065-2458(08)60519-7_bib2","series-title":"GADGET\u2014un programme de g\u00e9n\u00e9ration automatique de programs sur les graphes et les ensembles.","author":"Adam","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib3","series-title":"\u201cSelf-Organizing Systems\u20141962\u201d","first-page":"107","article-title":"On the automatic formation of a computer program which represents a theory","author":"Amarel","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib4","series-title":"Tech. Rep. No. 1.","article-title":"\u201cAutomatic Programming,\u201d","author":"Balzer","year":"1972"},{"key":"10.1016\/S0065-2458(08)60519-7_bib5","first-page":"494","article-title":"A global view of automatic programming","author":"Balzer","year":"1973","journal-title":"Proc. J. Conf. Artif. Intell., 3rd, 1978"},{"key":"10.1016\/S0065-2458(08)60519-7_bib6","article-title":"Imprecise program specification","author":"Balzer","year":"1975","journal-title":"Proc. Consiglio Nazi. Ric. 1st. Elaborazione Inf."},{"issue":"5","key":"10.1016\/S0065-2458(08)60519-7_bib7","first-page":"1224","article-title":"On the prediction of general recursive functions","volume":"13","author":"Barzdin","year":"1972","journal-title":"Sov. Math. (Engl. Transl."},{"key":"10.1016\/S0065-2458(08)60519-7_bib8","unstructured":"Bauer, M. 1975 Ph.D. Thesis, Department of Computer Science, University of Toronto, Toronto (forthcoming)."},{"issue":"3","key":"10.1016\/S0065-2458(08)60519-7_bib9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0004-3702(72)90048-3","article-title":"On the inference of turing machines from sample computations","volume":"3","author":"Biermann","year":"1972","journal-title":"Artif. Intell."},{"key":"10.1016\/S0065-2458(08)60519-7_bib10","series-title":"Tech. Rep. Computer Science Department","article-title":"\u201cAutomatic Indexing in Program Synthesis Processes,\u201d","author":"Biermann","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib11","series-title":"\u201cFrontiers of Pattern Recognition\u201d","first-page":"31","article-title":"A survey of results in grammatical inference","author":"Biermann","year":"1972"},{"key":"10.1016\/S0065-2458(08)60519-7_bib12","series-title":"Tech. Rep. OSU-CISRC-TR-74\u20135.","article-title":"\u201cConstructing Programs from Example Computations,\u201d","author":"Biermann","year":"1974"},{"issue":"2","key":"10.1016\/S0065-2458(08)60519-7_bib13","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/T-C.1975.224180","article-title":"Speeding up the synthesis of programs from traces","volume":"C24","author":"Biermann","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0065-2458(08)60519-7_bib14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Toward a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Inf. Control"},{"key":"10.1016\/S0065-2458(08)60519-7_bib15","series-title":"\u201cSemantic Information Processing\u201d","first-page":"217","article-title":"Natural language input for a computer problem solving system","author":"Bobrow","year":"1968"},{"issue":"3","key":"10.1016\/S0065-2458(08)60519-7_bib16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356631.356632","article-title":"New programming languages for artificial intelligence research","volume":"6","author":"Bobrow","year":"1974","journal-title":"Comput. Surv."},{"key":"10.1016\/S0065-2458(08)60519-7_bib17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/321864.321875","article-title":"Proving theorems about LISP programs","volume":"22","author":"Boyer","year":"1975","journal-title":"J. Assoc. Comput. Mack."},{"key":"10.1016\/S0065-2458(08)60519-7_bib18","series-title":"Tech. Rep. Computer Science Department","article-title":"\u201cA Study in Automatic Programming,\u201d","author":"Buchanan","year":"1974"},{"key":"10.1016\/S0065-2458(08)60519-7_bib19","series-title":"Tech. Rep., Stanford Artificial Intelligence Project","article-title":"\u201cOn Automating the Construction of Programs,\u201d","author":"Buchanan","year":"1974"},{"key":"10.1016\/S0065-2458(08)60519-7_bib20","series-title":"\u201cSymbolic Logic and Mechanical Theorem Proving.\u201d","author":"Chang","year":"1973"},{"key":"10.1016\/S0065-2458(08)60519-7_bib21","first-page":"157","article-title":"An on-line question-answering system with natural language and pictorial input.","volume":"1968","author":"Coles","year":"1968","journal-title":"Proc. Conf. Assoc. Comput. Mach., 23rd"},{"key":"10.1016\/S0065-2458(08)60519-7_bib22","series-title":"\u201cStructured Programming.\u201d","author":"Dahl","year":"1972"},{"key":"10.1016\/S0065-2458(08)60519-7_bib23","article-title":"On automating structured programming.","volume":"1975","author":"Dershowitz","year":"1975","journal-title":"Proc. Int. Symp. Proving Improving Programs"},{"key":"10.1016\/S0065-2458(08)60519-7_bib24","series-title":"Rep. SESLTR-12","article-title":"\u201cA Study of Loop Invariants and Automatic Program Synthesis,\u201d","author":"Duran","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib25","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/800233.807043","article-title":"High level operations in automatic programming.","volume":"1974","author":"Earley","year":"1974","journal-title":"Proc. Symp. Very High Level Lang."},{"issue":"2","key":"10.1016\/S0065-2458(08)60519-7_bib26","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/356599.356602","article-title":"An assessment of techniques for proving program correctness","volume":"4","author":"Elspas","year":"1972","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/S0065-2458(08)60519-7_bib27","series-title":"Rep. CS-255. Department of Computer Science","article-title":"\u201cAutomatic Programming,\u201d","author":"Feldman","year":"1972"},{"issue":"3","key":"10.1016\/S0065-2458(08)60519-7_bib28","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/S0019-9958(72)90424-X","article-title":"Some decidability results on grammatical inference and complexity","volume":"20","author":"Feldman","year":"1972","journal-title":"Inf. Control"},{"issue":"2","key":"10.1016\/S0065-2458(08)60519-7_bib29","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/362896.362902","article-title":"Translator writing systems. Commun","volume":"11","author":"Feldman","year":"1968","journal-title":"ACM"},{"issue":"8","key":"10.1016\/S0065-2458(08)60519-7_bib30","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/363196.363204","article-title":"An Algol-based associative language","volume":"12","author":"Feldman","year":"1969","journal-title":"Commun. ACM"},{"key":"10.1016\/S0065-2458(08)60519-7_bib31","first-page":"1193","article-title":"Recent developments in SAIL\u2014an Algol-based language for artificial intelligence","volume":"1972","author":"Feldman","year":"1972","journal-title":"Proc. Fall Jt. Comput. Conf."},{"issue":"3\/4","key":"10.1016\/S0065-2458(08)60519-7_bib32","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","article-title":"STRIPS: A new approach to the application of theorem proving to problem solving","volume":"2","author":"Fikes","year":"1971","journal-title":"Artif. Intell."},{"key":"10.1016\/S0065-2458(08)60519-7_bib33","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","article-title":"Assigning meanings to programs","volume":"19","author":"Floyd","year":"1967","journal-title":"Proc. Symp. Appl. Math."},{"key":"10.1016\/S0065-2458(08)60519-7_bib34","series-title":"Department of Computer Science","article-title":"Verification of APL programs","author":"Gerhart","year":"1972"},{"key":"10.1016\/S0065-2458(08)60519-7_bib35","series-title":"Tech. Rep., Graduate School of Industrial Administration","article-title":"\u201cAutomatically Generated Programs for Information Retrieval,\u201d","author":"Gerritsen","year":"1973"},{"issue":"5","key":"10.1016\/S0065-2458(08)60519-7_bib36","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inf. Control"},{"key":"10.1016\/S0065-2458(08)60519-7_bib37","first-page":"347","article-title":"Automatic programming","volume":"23","author":"Goldberg","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib38","series-title":"Rep. No. RC-5318.","article-title":"\u201cStructured Programming for Non-Programmers,\u201d","author":"Goldberg","year":"1975"},{"issue":"3","key":"10.1016\/S0065-2458(08)60519-7_bib39","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0004-3702(75)90003-X","article-title":"Summary of MYCROFT: A system for understanding simple picture programs","volume":"6","author":"Goldstein","year":"1975","journal-title":"Artif. Intell."},{"key":"10.1016\/S0065-2458(08)60519-7_bib40","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/TSE.1975.6312820","article-title":"An interactive program verification system","author":"Good","year":"1975","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0065-2458(08)60519-7_bib41","series-title":"\u201cMachine Intelligence 4\u201d","first-page":"183","article-title":"Theorem proving by resolution as a basis for question answering systems","author":"Green","year":"1969"},{"key":"10.1016\/S0065-2458(08)60519-7_bib42","first-page":"219","article-title":"Application of theorem proving to problem solving","volume":"1969","author":"Green","year":"1969","journal-title":"Proc. Int. Jt. Conf. Artif. Intel., 1st"},{"key":"10.1016\/S0065-2458(08)60519-7_bib43","series-title":"Artificial Intelligence Laboratory Rep. STAN-CS-69\u2013138. Computer Science Department","article-title":"The application of theorem proving to question answering systems","author":"Green","year":"1969"},{"key":"10.1016\/S0065-2458(08)60519-7_bib44","series-title":"Rep. AIM-258.","article-title":"\u201cA Hypothetical Dialogue Exhibiting a Knowledge Base for a Program-Understanding System,\u201d","author":"Green","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib45","first-page":"232","article-title":"Some rules for the automatic synthesis of programs","volume":"1975","author":"Green","year":"1975","journal-title":"Proc Int. Jt. Conf. Artif. Intel., 4th"},{"key":"10.1016\/S0065-2458(08)60519-7_bib46","first-page":"169","article-title":"The use of theorem proving techniques in question answering systems","volume":"1968","author":"Green","year":"1968","journal-title":"Proc. ACM Natl. Conf., 83rd"},{"key":"10.1016\/S0065-2458(08)60519-7_bib47","series-title":"Memo AIM-240.","article-title":"\u201cProgress Report on Program-Understanding Systems,\u201d","author":"Green","year":"1974"},{"key":"10.1016\/S0065-2458(08)60519-7_bib48","series-title":"\u201cCompiler Construction for Digital Computers.\u201d","author":"Gries","year":"1971"},{"issue":"4","key":"10.1016\/S0065-2458(08)60519-7_bib49","first-page":"179","article-title":"Notes on transitivity and theme in English","volume":"3","author":"Halliday","year":"1967","journal-title":"J. Ling."},{"key":"10.1016\/S0065-2458(08)60519-7_bib50","first-page":"322","article-title":"Functional diversity in language as seen from a consideration of modality and mood in English","volume":"6","author":"Halliday","year":"1970","journal-title":"Found. Lang."},{"key":"10.1016\/S0065-2458(08)60519-7_bib51","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/800233.807042","article-title":"An interactive business definition system","volume":"1974","author":"Hammer","year":"1974","journal-title":"Proc. Symp. Very High Level Lang."},{"key":"10.1016\/S0065-2458(08)60519-7_bib52","series-title":"Rep. CSM-1.","article-title":"\u201cThe POPCORN Reference Manual,\u201d","author":"Hardy","year":"1973"},{"key":"10.1016\/S0065-2458(08)60519-7_bib53","first-page":"50","article-title":"Automatic induction of LISP functions","volume":"1974","author":"Hardy","year":"1974","journal-title":"AISB Summer Conf."},{"key":"10.1016\/S0065-2458(08)60519-7_bib54","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/800233.807050","article-title":"English as a very high level language for simulation programming","volume":"1974","author":"Heidorn","year":"1974","journal-title":"Proc. Symp. Very High Level Lang."},{"key":"10.1016\/S0065-2458(08)60519-7_bib55","first-page":"94","article-title":"STEREOTYPES as an ACTOR approach towards solving the problem of procedural attachment in FRAME theories","volume":"1975","author":"Hewitt","year":"1975","journal-title":"Proc. Interdiscip. Workshop Com\/put. Linguistics, Psychol., Linguistics, Artif. Intell."},{"key":"10.1016\/S0065-2458(08)60519-7_bib56","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/TSE.1975.6312818","article-title":"Towards a programming apprentice","volume":"1","author":"Hewitt","year":"1975","journal-title":"IEEE Trans. Software Eng. sel"},{"key":"10.1016\/S0065-2458(08)60519-7_bib57","first-page":"235","article-title":"A universal modular ACTOR formalism for artificial intelligence","volume":"1973","author":"Hewitt","year":"1973","journal-title":"Proc. Int. Jt. Conf. Artif. Intel, 3rd"},{"key":"10.1016\/S0065-2458(08)60519-7_bib58","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Commun. ACM"},{"key":"10.1016\/S0065-2458(08)60519-7_bib59","series-title":"\u201cFormal Languages and Their Relation to Automata.\u201d","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0065-2458(08)60519-7_bib60","series-title":"Rep. No. RC 5474 (#23258).","article-title":"\u201cA New Approach for Customizing Business Applications,\u201d","author":"Howe","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib61","series-title":"\u201cA Programming Language.\u201d","author":"Iverson","year":"1972"},{"key":"10.1016\/S0065-2458(08)60519-7_bib62","first-page":"127","article-title":"Semantics of context-free languages","volume":"2","author":"Knuth","year":"1968"},{"key":"10.1016\/S0065-2458(08)60519-7_bib63","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/800233.807040","article-title":"An overview of nonprocedural languages","volume":"1974","author":"Leavenworth","year":"1974","journal-title":"Proc. Symp. Very High Level Lang."},{"issue":"4","key":"10.1016\/S0065-2458(08)60519-7_bib64","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/360924.360967","article-title":"An improved program-synthesizing algorithm and its correctness","volume":"17","author":"Lee","year":"1974","journal-title":"Commun. ACM"},{"key":"10.1016\/S0065-2458(08)60519-7_bib65","first-page":"126","article-title":"BEINGS: Knowledge as interacting experts","volume":"1975","author":"Lenat","year":"1975","journal-title":"Proc. Int. Jt. Conf. Artif. Intel, 4th"},{"key":"10.1016\/S0065-2458(08)60519-7_bib66","first-page":"569","article-title":"Bibliography on proving the correctness of programs","volume":"5","author":"London","year":"1970","journal-title":"\u201cMachine Intelligence\u201d"},{"key":"10.1016\/S0065-2458(08)60519-7_bib67","series-title":"Tech. Rep. No. 1. Department of Computer Science","article-title":"\u201cAutomatic Coding: Choice of Data Structures,\u201d","author":"Low","year":"1974"},{"key":"10.1016\/S0065-2458(08)60519-7_bib68","series-title":"\u201cA Compiler Generator.\u201d","author":"McKeeman","year":"1970"},{"issue":"3","key":"10.1016\/S0065-2458(08)60519-7_bib69","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/362566.362568","article-title":"Toward automatic program synthesis","volume":"14","author":"Manna","year":"1971","journal-title":"Commun. ACM"},{"issue":"2","key":"10.1016\/S0065-2458(08)60519-7_bib70","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0004-3702(75)90008-9","article-title":"Knowledge and reasoning in program synthesis","volume":"6","author":"Manna","year":"1975","journal-title":"Artif. Intell."},{"key":"10.1016\/S0065-2458(08)60519-7_bib71","series-title":"Internal memos. Automatic Programming Group","author":"Martin","year":"1974"},{"key":"10.1016\/S0065-2458(08)60519-7_bib72","series-title":"\u201cConference Record of the Second Symposium on Principles of Programming Languages,\u201d","first-page":"233","article-title":"Computer assisted application definition","author":"Mikelsons","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib73","series-title":"\u201cSemantic Information Processing.\u201d","author":"Minsky","year":"1968"},{"key":"10.1016\/S0065-2458(08)60519-7_bib74","series-title":"\u201cA Framework for Representing Knowledge,\u201d","first-page":"306","author":"Minsky","year":"1974"},{"key":"10.1016\/S0065-2458(08)60519-7_bib75","first-page":"104","article-title":"Frame system theory. Proc","volume":"1976","author":"Minsky","year":"1975","journal-title":"Interdiscip. Workshop Comput. Linguistics, Psychol., Linguistics, Artif. Intel."},{"key":"10.1016\/S0065-2458(08)60519-7_bib76","series-title":"Los Alamos Sci. Lab.","article-title":"\u201cA Comparison of MADCAP and SETL.\u201d","author":"Morris","year":"1973"},{"key":"10.1016\/S0065-2458(08)60519-7_bib77","series-title":"\u201cProblem Solving Methods in Artificial Intelligence.\u201d","author":"Nilsson","year":"1971"},{"key":"10.1016\/S0065-2458(08)60519-7_bib78","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/qam\/99738","article-title":"Automatic programming","volume":"30","author":"Perlis","year":"1972","journal-title":"Q. Appl. Math."},{"key":"10.1016\/S0065-2458(08)60519-7_bib79","series-title":"Tech. Rep. OSU-CISRC-TR-75\u20131.","article-title":"\u201cProgram Inference from Example Computations Represented by Memory Snapshot Traces,\u201d","author":"Petry","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib80","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0065-2458(08)60519-7_bib81","series-title":"Tech. Rep. No. 73.","article-title":"\u201cQA4: A Procedural Calculus for Intuitive Reasoning,\u201d","author":"Rulifson","year":"1972"},{"key":"10.1016\/S0065-2458(08)60519-7_bib82","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1147\/rd.33.0210","article-title":"Some studies in machine learning using the game of checkers","volume":"3","author":"Samuel","year":"1959","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/S0065-2458(08)60519-7_bib83","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1147\/rd.116.0601","article-title":"Some studies in machine learning using the game of checkers. II","volume":"11","author":"Samuel","year":"1967","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/S0065-2458(08)60519-7_bib84","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/800233.807044","article-title":"Automatic and semiautomatic optimization of SETL","volume":"1974","author":"Schwartz","year":"1974","journal-title":"Proc. Symp. Very High Level Lang."},{"issue":"4","key":"10.1016\/S0065-2458(08)60519-7_bib85","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/0010-0285(72)90022-9","article-title":"Conceptual dependency: A theory of natural language understanding","volume":"3","author":"Shank","year":"1972","journal-title":"Cognitive Psychol."},{"key":"10.1016\/S0065-2458(08)60519-7_bib86","first-page":"260","article-title":"Inferring LISP programs from examples","volume":"1975","author":"Shaw","year":"1975","journal-title":"Proc. Int. Jt. Conf. Artif. Intel, 4th"},{"key":"10.1016\/S0065-2458(08)60519-7_bib87","article-title":"The case for, and some experience with, automated consultants","volume":"1973","author":"Sikl\u00f3ssy","year":"1973","journal-title":"Proc. Tex. Conf. Comput. Syst., 2nd"},{"key":"10.1016\/S0065-2458(08)60519-7_bib88","first-page":"21","article-title":"The synthesis of programs from their properties, and the insane heuristic","volume":"1974","author":"Sikl\u00f3ssy","year":"1974","journal-title":"Proc. Tex. Conf. Comput. Syst., 3rd"},{"key":"10.1016\/S0065-2458(08)60519-7_bib89","first-page":"441","article-title":"A computational model of verbal understanding","volume":"1968","author":"Simmons","year":"1968","journal-title":"Proc. Fall Jt. Comput. Conf."},{"key":"10.1016\/S0065-2458(08)60519-7_bib90","series-title":"\u201cRepresentation and Meaning\u201d","first-page":"9","article-title":"The Heuristic compiler","author":"Simon","year":"1972"},{"key":"10.1016\/S0065-2458(08)60519-7_bib91","series-title":"\u201cArtificial Intelligence: The Heuristic Programming Approach.\u201d","author":"Slagle","year":"1971"},{"key":"10.1016\/S0065-2458(08)60519-7_bib92","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A formal theory of inductive inference","author":"Solomonoff","year":"1964","journal-title":"Inf. Control"},{"key":"10.1016\/S0065-2458(08)60519-7_bib93","series-title":"Rep. SOSAP-TM-4.","article-title":"\u201cProgramming Over a Knowledge Base: The Basis for Automatic Programming,\u201d","author":"Srinivasan","year":"1973"},{"key":"10.1016\/S0065-2458(08)60519-7_bib94","series-title":"Program construction from examples","author":"Summers","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib95","first-page":"68","article-title":"A methodology for LISP program construction from examples","volume":"1975","author":"Summers","year":"1975","journal-title":"Proc. ACM Sym. Prin. Prog. Lang., 3rd"},{"key":"10.1016\/S0065-2458(08)60519-7_bib96","series-title":"Rep. AI-TR-297. Artificial Intelligence Laboratory","article-title":"\u201cA Computational Model of Skill Acquisition,\u201d","author":"Sussman","year":"1973"},{"key":"10.1016\/S0065-2458(08)60519-7_bib97","article-title":"From PLANNER to CONNIVER\u2014a genetic approach","volume":"41","author":"Sussman","year":"1972","journal-title":"Proc. Fall Jt. Comput. Conf."},{"key":"10.1016\/S0065-2458(08)60519-7_bib98","series-title":"Artif. Intell. Memo No. 203A.","article-title":"\u201cMicro Planner Reference Manual,\u201d","author":"Sussman","year":"1971"},{"key":"10.1016\/S0065-2458(08)60519-7_bib99","series-title":"Constructing programs automatically using theorem proving","author":"Waldinger","year":"1969"},{"key":"10.1016\/S0065-2458(08)60519-7_bib100","series-title":"Artif. Intell. Cent. Tech. Note No. 107.","article-title":"\u201cAchieving Several Goals Simultaneously,\u201d","author":"Waldinger","year":"1975"},{"key":"10.1016\/S0065-2458(08)60519-7_bib101","first-page":"241","article-title":"PROW: A step towards automatic program writing. Proc","volume":"1969","author":"Waldinger","year":"1969","journal-title":"Int. Jt. Conf. Artif. Intel, 1st"},{"key":"10.1016\/S0065-2458(08)60519-7_bib102","series-title":"\u201cHandbook of APL Programming.\u201d","author":"Wiedmann","year":"1974"},{"key":"10.1016\/S0065-2458(08)60519-7_bib103","series-title":"\u201cUnderstanding Natural Language.\u201d","author":"Winograd","year":"1972"},{"key":"10.1016\/S0065-2458(08)60519-7_bib104","first-page":"13","article-title":"Breaking the complexity barrier again. Proc","volume":"1973","author":"Winograd","year":"1973","journal-title":"ACM SIGPLAN-SIGIR Interface Meet."},{"issue":"10","key":"10.1016\/S0065-2458(08)60519-7_bib105","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/355598.362773","article-title":"Transition network grammars for natural language analysis. Commun","volume":"13","author":"Woods","year":"1970","journal-title":"ACM"}],"container-title":["Advances in Computers","Advances in Computers Volume 15"],"original-title":[],"deposited":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T08:20:09Z","timestamp":1543998009000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0065245808605197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":105,"URL":"https:\/\/doi.org\/10.1016\/s0065-2458(08)60519-7","relation":{},"ISSN":["0065-2458"],"issn-type":[{"value":"0065-2458","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}