Multi-result Supercompilation as Branching Growth of the Penultimate Level in Metasystem Transitions

Klyuchnikov, I G; Romanenko, Sergei A.

doi:10.1007/978-3-642-29709-0_19

Cited by 6 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Our implementation of multi-result supercompilation mostly follows the same generic framework used in [2,12]. It offers some important simplifications compared to the original work of Klyuchnikov et al [8,10]:…”

Section: Summary Of Multi-results Supercompilationmentioning

confidence: 99%

See 1 more Smart Citation

Optimizing Program Size Using Multi-result Supercompilation

Krustev¹

2020

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Supercompilation is a powerful program transformation technique with numerous interesting applications. Existing methods of supercompilation, however, are often very unpredictable with respect to the size of the resulting programs. We consider an approach for controlling result size, based on a combination of multi-result supercompilation and a specific generalization strategy, which avoids code duplication. The current early experiments with this method show promising results -we can keep the size of the result small, while still performing powerful optimizations.

show abstract

Section: Summary Of Multi-results Supercompilationmentioning

confidence: 99%

“…• use multi-result supercompilation 1 [8,10,2] to systematically explore a large set of different generalizations during the transformation process, leading to different trade-offs between performed optimizations and code explosion;…”

Section: Introductionmentioning

confidence: 99%

Optimizing Program Size Using Multi-result Supercompilation

Krustev¹

2020

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…This leads to the idea of multi result supercompilation, which was put forward by Klyuch nikov and Romanenko [21]. Since there are many points of decision making during the process of super compilation (mainly when and how to generalize), a single result supercompiler may be transformed into a multi result one quite easily by taking multiple paths in each such point.…”

Section: Related Workmentioning

confidence: 98%

Proving properties of functional programs by equality saturation

Grechanik

2015

Program Comput Soft

View full text Add to dashboard Cite

The present paper shows how the idea of equality saturation can be used to prove algebraic prop erties of programs written in a non total non strict first order functional language. We adapt equality satura tion approach to a functional language by using transformations borrowed mainly from supercompilation. Proof by induction is performed via a special transformation called merging by bisimilarity. We compare our experimental prover based on this method with a supercompiler HOSC and inductive provers HipSpec and Zeno.

show abstract

“…Методы метавычислений, которые требуют и могут использовать современную (супер)компьютерную мощность, уже появляются. К примеру, метод насыщения равенствами [5], где строится большое пространство термов; многорезультатная суперкомпиляция [11], в которой вместо принятия эвристических решений рассматривается несколько вариантов остаточных программ и выбирается лучший по некоторому критерию; поливариантный анализ времен связывания переменных в частичных вычислениях [7], в котором генерируется много версий аннотаций.…”

Section: что делать дальшеunclassified

Supercompilation and partial evaluation are still not widely used in practice. Why and what to do?

Klimov¹

2022

Proceedings of 24th Scientific Conference “Scientific Services &Amp; Internet – 2022”

View full text Add to dashboard Cite

Such methods of metacomputation as supercompilation and partial evaluation appeared around half a century ago. Since then, they have fruitfully developed, deep scientific results were achieved, many software prototypes were created. However, they are still not used in the practice of programming, although their authors foresaw a great prospect for them to automate programming and expected rapid achievement of the goals. What's the big deal? We consider the history of programming from the point of view of the evolutionary theory of metasystem transitions by V.F. Turchin in order to reveal the origins of metacomputation methods and their place in the overall picture. We note that unlike software tools that were easily put into practice, such as, for example, optimizing compilers, these methods could not be implemented in such a way that they could be used automatically, because they contain too many points of choice of solutions, options, degrees of freedom that the machine cannot resolve without human assistance. For further progress to practice, we propose to pay special attention to embedding metacomputation tools in modern programming environments and developing and designing convenient human-machine interfaces, where a person will remain the top-level metasystem that makes creative decisions. In addition, we propose to include supercomputers in the arsenal of software developers' tools, including metacomputation, as it happened in applied engineering fields, but for some reason the development of effective and reliable programs for critical applications is not considered to justify the use of supercomputers.

show abstract

Multi-result Supercompilation as Branching Growth of the Penultimate Level in Metasystem Transitions

Cited by 6 publications

References 13 publications

Optimizing Program Size Using Multi-result Supercompilation

Optimizing Program Size Using Multi-result Supercompilation

Proving properties of functional programs by equality saturation

Supercompilation and partial evaluation are still not widely used in practice. Why and what to do?

Contact Info

Product

Resources

About