Inferring LISP Programs from Examples
David Elliot Shaw, William Swartout, C. Cordell Green · Columbia Academic Commons (Columbia University) · 1975
A program is described which infers certain recursive LiSP programs from single example input-output parts. Synthesized programs may recur in more than one argument, and may involve the synthesis of auxilliary functions. An actual user session with the program, called EXAMPLE, is presented, and the operation of the program and its important heuristics are outlined.