Исследовательская группа

Лаборатория языковых инструментов

Program Transformation in a Labelled Transition Systems Framework

September 12

In this talk, I give definitions of two program transformation algorithms (positive supercompilation and distillation) in a labelled transition system framework, and show how distillation builds on and extends positive supercompilation. I then go on to consider the relative efficiency of the programs resulting from the transformations, and find that the main distinguishing characteristic between the two algorithms is that in distillation, generalization and folding are performed with respect to recursive terms, while in positive supercompilation they are not; this allows a number of super-linear improvements to be obtained using distillation which cannot be obtained using positive supercompilation.

Presenter: Geoff Hamilton, School of Computing, Dublin City University, Dublin, Ireland.