Automatic program synthesis in second-order logic

  • Authors:
  • Jared L. Darlington

  • Affiliations:
  • Gesellschaft fur Mathematik und Datenverarbeitung, Bonn, Germany

  • Venue:
  • IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
  • Year:
  • 1973

Quantified Score

Hi-index 0.00

Visualization

Abstract

A resolution-based theorem prover, incorporating a restricted higher-order unification algorithm, has been applied to the automatic synthesis of SNOBOL-4 programs. The set of premisses includes second-order assignment and iteration axioms derived from those of Hoare. Two examples are given of the synthesis of programs that compute elementary functions.