A Methodology for LISP Program Construction from Examples

  • Authors:
  • Phillip D. Summers

  • Affiliations:
  • IBM Thomas J Watson Research Center, Yorktown Heights, NY

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.