The Inference of Regular LISP Programs from Examples

DOI10.1109/TSMC.1978.4310035zbMath0383.68014MaRDI QIDQ4162631

Alan W. Biermann

Publication date: 1978

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

Mathematics Subject Classification ID

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

Related Items (7)

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

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