Inferring LISP programs from examples

Authors:
David E. Shaw;William R. Swartout;C. Cordell Green
Affiliations:
Artificial Intelligence Laboratory, Department of Computer Science, Stanford University, Stanford, California;Artificial Intelligence Laboratory, Department of Computer Science, Stanford University, Stanford, California;Artificial Intelligence Laboratory, Department of Computer Science, Stanford University, Stanford, California
Venue:
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Year:
1975

Citing 2
Cited 1

A study of grammatical inference

A study of grammatical inference
On the Synthesis of Finite-State Machines from Samples of Their Behavior

IEEE Transactions on Computers

Taxonomies of visual programming and program visualization

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A program is described which infers certain recursive LISP programs from single example input-output pairs Synthesized programs may recur in more than one argument, and may involve the synthesis of auxiliary functions An actual user session with the program, called EXAMPLE, is presented, and the operation of the program and its important heuristics are outlined.