|
 |
|
|||||||||||
|
|
|
|
|||||||||||
|
|
Towards Higher-Level Supercompilation Ilya Klyuchnikov and Sergei A. Romanenko,
We show that the power of supercompilation can be increased by constructing a hierarchy of supercompilers, in which a lower-level supercompiler is used by a higher-level one for proving improvement lemmas. The lemmas thus obtained are used to transform expressions labeling nodes in process trees, in order to avoid premature generalizations. Such kind of supercompilation, based on a combination of several metalevels, is called higher-level supercompilation (to differentiate it from higher-order supercompilation related to transforming higher-order functions). Higher-level supercompilation may be considered as an application of a more general principle of metasystem transition.
|
