N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467--494, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... an induction process can be performed either bottom up (i.e. from an overly speci c rule to a more general) or top down (i.e. from an overly general rule to a more speci c) There are some reasons to prefer the top down or backward reasoning process to the bottom up or forward reasoning process [15]. On the one hand, it eliminates the need for navigating through all possible logical consequences of the program. On the other hand, it integrates inductive reasoning with the deductive process, so that the derived program is guaranteed to be correct. Unfortunately, it is known that the deductive ....

....reasoning with the deductive process, so that the derived program is guaranteed to be correct. Unfortunately, it is known that the deductive process alone (i.e. unfolding) does not generally suce for coming up with the corrected program, and inductive generalization techniques are necessary [15, 34, 35]. In [23, 24, 20] a bottom up framework for synthesizing correct functional logic programs (w.r.t. the ground success set, Herbrand semantics) is presented which induces program rules from sets of equations which are respectively incorrect and correct w.r.t. the pursued program. Their ....

N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467-494, 1993.

....a partial evaluator for the functional language Hope (extended with unification) However, no claim is made in [13] for any sort of completeness of the transformations and, indeed, some restrictions for the application of the rules are necessary. Another closely related approach is that of [15], which formulates a rewrite based technique for the synthesis of functional programs which makes use of the rule of instantiation. Our experiments show that our transformation framework 14 combines in a useful and effective way the systematic instantiation of calls during unfolding (by virtue of ....

N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467--494, 1993.

....optimization technique for computer programs which consists of the specialization of the program w.r.t. parts of its input. PE has been widely This work has been partially supported by CICYT TIC 98 0445 C03 01 and by Acci on Integrada hispano alemana HA1997 0073. applied in term rewriting [Bel95,Bon88,DR93,MS96], functional programming [CD93,JGS93] logic programming [Gal93,LS91] and integrated functional logic languages [AFJV97,AFV98a,AFV98b,AHLV99,LG97] A number of researchers have noticed that certain processes of optimization, transformation, specialization and reuse of code often introduce ....

N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467--494, 1993.

....independence of computed solutions [29] Partial evaluation (PE) is a semantics preserving performance optimization technique for computer programs which consists of the specialization of the program w.r.t. parts of its input. PE has been widely applied in the fields of term rewriting systems [13, 14, 15, 20, 35, 43], functional programming [17, 32] and logic programming [21, 39] Although the objectives are similar, the general methods are often di#erent due to the distinct underlying models and the di#erent perspectives (see [5] for a detailed comparison) This separation has the negative consequence of ....

N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467--494, 1993.

....independency of computed solutions [29] Partial evaluation (PE) is a semantics preserving performance optimization technique for computer programs which consists of the specialization of the program w.r.t. parts of its input. PE has been widely applied in the fields of term rewriting systems [12, 13, 18, 36, 42], functional programming [15, 33] and logic programming [21, 40] Although the objectives are similar, the general methods are often different due to the distinct underlying models and the different perspectives (see [5] for a detailed comparison) This separation has the negative consequence ....

N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467--494, 1993.

....independence of computed solutions [29] Partial evaluation (PE) is a semantics preserving performance optimization technique for computer programs which consists of the specialization of the program w.r.t. parts of its input. PE has been widely applied in the fields of term rewriting systems [13 15, 20, 35, 43], functional programming [17, 32] and logic programming [21, 39] Although the objectives are similar, the general methods are often different due to the distinct underlying models and the different perspectives (see [5] for a detailed comparison) This separation has the negative consequence of ....

N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467--494, 1993.

.... for coming up with complete solutions is the crux of problems attacked by inductive inference research (cf. AS83] KW80] Ang92] Wie92] in general, and inductive program synthesis (cf. Sum75] BBP75] BK76] Sum77] Bau79] Sha81] Sha83] JK83] BK86] DP90] FD93] DR93] e.g. in particular. The approaches referred to vary from purely recursion theoretic to those synthesizing LISP expressions or Prolog programs ( Sum75] Sum77] Sha81] Sha83] e.g. This is the type of work we want to relate to therapy plan generation. However, the type of control problems ....

Nachum Dershowitz and Uday S. Reddy. Deductive and inductive synthesis of equational programs. Journal of Symbolic Computation, 15(5 & 6):467-- 494, 1993.

.... information for coming up with complete solutions is the crux of problems attacked by inductive inference research (cf. AS83] KW80] Ang92] Wie92] in general, and inductive program synthesis (cf. Sum75] BBP75] BK76] Sum77] Bau79] Sha81] Sha83] JK83] BK86] DP90] FD93] DR93] e.g. in particular. The approaches referred to vary from purely recursion theoretic to those synthesizing LISP expressions or Prolog programs ( Sum75] Sum77] Sha81] Sha83] e.g. This is the type of work we want to relate to therapy plan generation. However, the type of control problems ....

Nachum Dershowitz and Uday S. Reddy. Deductive and inductive synthesis of equational programs. Journal of Symbolic Computation, 15(5 & 6):467-- 494, 1993.

....fast; its ratio is about 7. Tempo [8] is a off line, template based specializer for C aimed at operating systems code. It contains sophisticated pointer analyses and other features to make it work on real systems. So far no results are available. Staging transformations [26] ordered rewriting [9], program slicing [23] and metaobject protocols [34] contain related ideas from other parts of the language research community. 7 Conclusion and Future Directions We have described Nitrous, a run time code generation system for interactive graphics. It uses compiler generation of intermediate ....

N Dershowitz, U Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation15:467-494.

....used in automatic reasoning to generate critical pairs (which are equational consequences of a set of rules coming from overlapping lhs s) as a means to derive canonical programs. Termination of the transformation is not guaranteed. Another related approach is that of Dershowitz and Reddy [DR93] which also formulates a completion based technique for the synthesis of functional programs, but requires a kind of heuristic ( eureka rule to be discovered) and thus it is closer to fold unfold transformation than to partial evaluation. Another partial completion procedure is defined by ....

N. Dershowitz and U. Reddy. Deductive and inductive synthesis of equational programs. Journal of Symbolic Computation, 15:467--494, 1993.

.... information for coming up with complete solutions is the crux of problems attacked by inductive inference research (cf. AS83] KW80] Ang92] Wie92] in general, and inductive program synthesis (cf. Sum75] BBP75] BK76] Sum77] Bau79] Sha81] Sha83] JK83] BK86] DP90] FD93] DR93] e.g. in particular. The approaches referred to vary from purely recursion theoretic to those synthesizing LISP expressions or Prolog programs ( Sum75] Sum77] Sha81] Sha83] e.g. This is the type of work we want to relate to therapy plan generation. However, the type of control problems ....

Nachum Dershowitz and Uday S. Reddy. Deductive and inductive synthesis of equational programs. Journal of Symbolic Computation, 15(5 & 6):467--494, 1993.

No context found.

N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467--494, 1993.

No context found.

N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467--494, 1993.

No context found.

N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467--494, 1993.

No context found.

N. Dershowitz and U. Reddy. Deductive and Inductive Synthesis of Equational Programs. Journal of Symbolic Computation, 15:467--494, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC