Induction and Synthesis for Automatic Program Transformation

e is a mechanism for suggesting strategies which is accomplished by automatically introducing new functions, called eurekas in the fold-unfold methodology [2] (previously these new functions had to be introduced through the insight of a clever user). Consider, for example, that the transformation step P i to P i+1 performs deforestation of a term t in P i . The transformation consists in looking for a set of rewrite rules S that reduce t to a term t 0 free of intermediary data structures. The mechanism for suggesting strategies is able to propose a left-hand side s of a rule in S which encompasses t and which contains no useless data structures. The right-hand side is built with a new functional symbol h which has as arguments all the variabl