| |
| | [No title] (Site not responding. Last check: 2007-11-06) |
 | | We propose an abstract strategy which is parametrized by three mathematical functions called definition-folding, selection, and replacement. |
 | | Once these three functions are supplied, our abstract strategy becomes a concrete one which can be used during program development for driving the application of the Definition, Folding, Unfolding, and Goal Replacement Rules. |
 | | We also show through some examples that many program derivation strategies described in the literature, such as the methodology for eliminating unnecessary variables, the tupling strategy, the partial deduction techniques, and the promotion strategy, can be viewed as particular instances of our abstract strategy. |
| www.iasi.rm.cnr.it /iasi/Publications/abstract/345.html (214 words) |
|