Programming by Examples
Michael A. Bauer, Department of Computer Science, The University of Western Ontario, London, Ont., Canada
Recommended by S. Amarel; Received June 1978; revised version received December 1978
ABSTRACT
In this paper, examples of how an algorithm behaves on particular input are considered as possible means of describing the algorithm. In particular, a simple language for examples (a Computational Description Language) is presented and an algorithm for the synthesis of a procedure from a set of such example computations is described. The algorithm makes use of knowledge about variables, inputs, instructions and procedures during the synthesis process to guide the formation of a procedure. Several examples of procedures ...
Get Readings in Artificial Intelligence and Software Engineering now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
