The Inference of Regular LISP Programs from Examples
- 1 January 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 8 (8) , 585-600
- https://doi.org/10.1109/tsmc.1978.4310035
Abstract
A class of LISP programs that is analogous to the finite-state automata is defined, and an algorithm is given for constructing such programs from examples of their input-output behavior. It is shown that the algorithm has robust performance for a wide variety of inputs and that it converges to a solution on the basis of minimum input information.Keywords
This publication has 9 references indexed in Scilit:
- A Methodology for LISP Program Construction from ExamplesJournal of the ACM, 1977
- Constructing Programs from Example ComputationsIEEE Transactions on Software Engineering, 1976
- Approaches to Automatic ProgrammingPublished by Elsevier ,1976
- Toward a mathematical theory of inductive inferenceInformation and Control, 1975
- Speeding up the Synthesis of Programs from TracesIEEE Transactions on Computers, 1975
- Program-Understanding SystemsPublished by Defense Technical Information Center (DTIC) ,1974
- Some decidability results on grammatical inference and complexityInformation and Control, 1972
- Language identification in the limitInformation and Control, 1967
- LISP 1.5 PROGRAMMER'S MANUALPublished by Defense Technical Information Center (DTIC) ,1962