Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
An automatic programming system, THESYS, for constructing recursive LISP programs from examples of what they do is described. The construction methodology is illustrated as a series of transformations from the set of examples to a program satisfying the examples. The transformations consist of (1) deriving the specific computation associated with a specific example, (2) deriving control flow predicates, and (3) deriving an equivalent program specification in the form of recurrence relations. Equivalence between certain recurrence relations and various program schemata is proved. A detailed description of the construction of four programs is presented to illustrate the application of the methodology. © 1977, ACM. All rights reserved.
Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
Dzung Phan, Vinicius Lima
INFORMS 2023
Shuang Chen, Herbert Freeman
International Journal of Pattern Recognition and Artificial Intelligence
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence