TY - JOUR
T1 - Deductive and inductive synthesis of equational programs
AU - Dershowitz, Nachum
AU - Reddy, Uday S.
PY - 1993
Y1 - 1993
N2 - An equational approach to the synthesis of functional and logic program is taken. In this context, the synthesis task involves finding executable equations such that the given specification holds in their standard model. Hence, to synthesize such programs, induction is necessary. We formulate procedures for inductive proof, as well as for program synthesis, using the framework of “ordered rewriting”. We also propose heuristics for generalizing from a sequence of equational consequences. These heuristics handle cases where the deductive process alone is inadequate for coming up with a program.
AB - An equational approach to the synthesis of functional and logic program is taken. In this context, the synthesis task involves finding executable equations such that the given specification holds in their standard model. Hence, to synthesize such programs, induction is necessary. We formulate procedures for inductive proof, as well as for program synthesis, using the framework of “ordered rewriting”. We also propose heuristics for generalizing from a sequence of equational consequences. These heuristics handle cases where the deductive process alone is inadequate for coming up with a program.
UR - http://www.scopus.com/inward/record.url?scp=84998801182&partnerID=8YFLogxK
U2 - 10.1016/S0747-7171(06)80002-7
DO - 10.1016/S0747-7171(06)80002-7
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84998801182
SN - 0747-7171
VL - 15
SP - 467
EP - 494
JO - Journal of Symbolic Computation
JF - Journal of Symbolic Computation
IS - 5-6
ER -