Inferring LISP Programs from Examples

Abstract

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.

Cite

Text

Shaw et al. "Inferring LISP Programs from Examples." International Joint Conference on Artificial Intelligence, 1975. doi:10.7916/D89K4K6X

Markdown

[Shaw et al. "Inferring LISP Programs from Examples." International Joint Conference on Artificial Intelligence, 1975.](https://mlanthology.org/ijcai/1975/shaw1975ijcai-inferring/) doi:10.7916/D89K4K6X

BibTeX

@inproceedings{shaw1975ijcai-inferring,
  title     = {{Inferring LISP Programs from Examples}},
  author    = {Shaw, David E. and Swartout, William R. and Green, C. Cordell},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1975},
  pages     = {260-267},
  doi       = {10.7916/D89K4K6X},
  url       = {https://mlanthology.org/ijcai/1975/shaw1975ijcai-inferring/}
}