In program synthesis, program transformation can be done on the fly, based on information generated and exploited during the program construction process. For instance, some logic program generalization techniques can be pre-compiled at the logic program schema level, yielding transformation schemata that give rise to elimination of the eureka discovery, full automation of the transformation process itself, and even the prediction whether and which optimizations will be achieved.