The Inference of Regular LISP Programs from Examples

DOI10.1109/TSMC.1978.4310035MaRDI QIDQ4162631zbMATH OpenFDO

Authors Alan W. Biermann

Publication date 1978

Published in IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSMC.1978.4310035

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Artificial intelligence (68T99)

Cited in

(8)

• Automatic programming: A tutorial on formal methodologies
• Schema induction for logic program synthesis
• A knowledge-based approach to program synthesis from examples
• A class of functions synthesized from a finite number of examples and a lisp program scheme
• Inductive synthesis of term rewriting systems
• Programming by example and proving by example using higher-order unification
• Synthesis of rewrite programs by higher-order and semantic unification
• Synthetic programming

This page was built for publication: The Inference of Regular LISP Programs from Examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162631)