PROW: a step toward automatic program writing
Richard J. Waldinger, Richard C. T. Lee · International Joint Conference on Artificial Intelligence · 1969
This paper Describes a program, called PROW, which writes programs PROW accepts the specification of the program in the language of predicate calculus, decides the algorithm for the program and then produces a LISP program which is an implementation of the algorithm. Since the construction of the algorithm is obtained by formal theorem-proving techniques, the programs that PROW writes are free from logical errors and do not have to be debugged The user of PROW can make PROW write programs in languages other than LISP by modifying the part of PROW that translates an algorithm to a LISP program. Thus PROW can be modified to write programs in any language In the end of this paper, it is shown that PROW can also be used as a question-answering program
Cited by 112 works.
Authors
References
- A Machine-Oriented Logic Based on the Resolution Principle
- Experiments with a Heuristic Compiler
- A proof procedure for quantification theory
- The use of theorem-proving techniques in question-answering systems
- Experiments with a deductive question-answering program
- Automatic Theorem Proving With Renamable and Semantic Resolution