Interaction and program generators

Abstract

We consider problems connected wzth the automatic synthesis of programs. We propose a f~nctional approach to the organization of program generators. We give algorithms for extracting programs from the reduction o/object terms and the organization of dialog for specification of free variables.A-computer system belonging to the class of intelligent systems must have at least knowledge of the subject area and "know how" to establish and deduce new facts using this knowledge.A model of the subject area is taken to mean the presence of knowledge in the system that is classified as follows: declarative, procedural, and subject knowledge. We shall be interested in the functional approach to the implementation of systems with artificial intelligence, since the objects of study are systems of automated design of assembly-line manufacturing. Assembly-line manufacturing is a subject area consisting of fields such as airplane manufacture and shipbuilding, and is characterized by the use of methods and ideas of artificial intelligence. The functional approach to the problem of intellectualizing the solution of the problems in this subject area is one of the most relevant for increasing the effectiveness of the work of the end user with systems of applied programs in computer-aided design in technical manufacturing, since knowledge of the subject area is basically represented by function procedures. Automation or planning of the computations amounts to using the basis functions to construct a new function procedure to solve the problem that has been posed.The programming environment which forms the computational procedures on the basis of knowledge of the subject area, will be called the program generator. The program generator receives certain goals, on the basis of which it makes decisions on generating a program of computations.A great deal of research has been devoted to the automatic synthesis of programs and the extraction of programs from proofs. We shall consider one approach to the automated synthesis of interactive programs, and we shall describe a base algorithm for constructing a program generator on the basis of the functional approach.We take a term to be a word in the following alphabet: A = V U f2 U {A} U {(, )}: