A Self Applicable Sup ercompiler
Andrei P Nemytykh
Victoria A Pinchuk
Programming Systems Institute Pereslavl Zalesski Russia
Valentin F Turchin
The City Col lege of New York
Abstract
A supercompiler is a program which can p erform a deep transforma
tion of programs using a principle which is similar to partial evaluation
and can b e referred to as metacomputation Sup ercompilers that have
b een in existence up to now see were not self applicable this
is a more di cult problem than self application of a partial evaluator
b ecause of the more intricate logic of sup ercompilation In the present
pap er we describ e the rst self applicable mo del of a sup ercompiler
and present some tests Three features distinguish it from the previ
ous mo dels and make self application p ossible The input language
is a subset of Refal whichwe refer to as at Refal The pro cess of
driving is p erformed as a transformation of pattern matching graphs