A Production Rule Mechanism for Generating LISP Code
A. Biermann, and D. Smith. IEEE Transactions on Systems, Man, and Cybernetics, 9 (5):
260--276(1979)
Abstract
Production rule schemas are given which hold the basic information necessary for coding recursive loops and branches in LISP. Information from the user concerning the desired program is used to instantiate the schemas to yield production rules, and then these rules generate executable code in a strictly syntactic fashion. Emphasis is placed on decomposing the synthesis problem into a hierarchy of tasks which can each be solved by application of a schema. The method is demonstrated by showing how programs can be synthesized from examples of their input-output behaviors.
Description
Surveyed in Smith, The Synthesis of LISP programs from Examples: A Survey, 1984
%0 Journal Article
%1 BiermannSm79
%A Biermann, Alan W.
%A Smith, Douglas R.
%D 1979
%J IEEE Transactions on Systems, Man, and Cybernetics
%K analytical_ip ifp induction inductive_programming program_synthesis
%N 5
%P 260--276
%T A Production Rule Mechanism for Generating LISP Code
%U http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel5/21/4310191/04310195.pdf?arnumber=4310195
%V 9
%X Production rule schemas are given which hold the basic information necessary for coding recursive loops and branches in LISP. Information from the user concerning the desired program is used to instantiate the schemas to yield production rules, and then these rules generate executable code in a strictly syntactic fashion. Emphasis is placed on decomposing the synthesis problem into a hierarchy of tasks which can each be solved by application of a schema. The method is demonstrated by showing how programs can be synthesized from examples of their input-output behaviors.
@article{BiermannSm79,
abstract = {Production rule schemas are given which hold the basic information necessary for coding recursive loops and branches in LISP. Information from the user concerning the desired program is used to instantiate the schemas to yield production rules, and then these rules generate executable code in a strictly syntactic fashion. Emphasis is placed on decomposing the synthesis problem into a hierarchy of tasks which can each be solved by application of a schema. The method is demonstrated by showing how programs can be synthesized from examples of their input-output behaviors.},
added-at = {2010-04-21T22:03:53.000+0200},
author = {Biermann, Alan W. and Smith, Douglas R.},
biburl = {https://www.bibsonomy.org/bibtex/2a7700855604eb3a006252e963eb298f5/emanuel},
description = {Surveyed in Smith, The Synthesis of LISP programs from Examples: A Survey, 1984},
interhash = {9a5f89178c885360437dbef70bb2c72c},
intrahash = {a7700855604eb3a006252e963eb298f5},
journal = {IEEE Transactions on Systems, Man, and Cybernetics},
keywords = {analytical_ip ifp induction inductive_programming program_synthesis},
number = 5,
pages = {260--276},
timestamp = {2010-04-21T22:03:53.000+0200},
title = {A Production Rule Mechanism for Generating {LISP} Code},
url = {http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel5/21/4310191/04310195.pdf?arnumber=4310195},
volume = 9,
year = 1979
}