RUS  ENG
Full version
JOURNALS // Preprints of the Keldysh Institute of Applied Mathematics // Archive

Keldysh Institute preprints, 2010 081, 28 pp. (Mi ipmp266)

This article is cited in 2 papers

Towards Effective Two-Level Supercompilation

I. G. Klyuchnikov


Abstract: The paper presents a number of improvements to the method of two-level supercompilation: a fast technique of lemma discovering by analyzing the expressions in the partial process tree, an enhancement to the algorithm of checking improvement lemmas based on the normalization of tick annotations, and a few techniques of finding simplified versions of lemmas discovered in the process of two-level supercompilation.

Language: English



© Steklov Math. Inst. of RAS, 2026