Multi-result supercompilation as branching growth of the penultimate level in metasystem transitions

Authors:
Ilya Klyuchnikov;Sergei A. Romanenko
Affiliations:
Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, Russia;Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, Russia
Venue:
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Year:
2011

Citing 10
Cited 2

The concept of a supercompiler

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Total correctness by local improvement in the transformation of functional programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Metacomputation: Metasystem Transitions plus Supercompilation

Selected Papers from the Internaltional Seminar on Partial Evaluation
A Self-Applicable Supercompiler

Selected Papers from the Internaltional Seminar on Partial Evaluation
Distillation: extracting the essence of programs

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A Supercompiler for Core Haskell

Implementation and Application of Functional Languages
Equality saturation: a new approach to optimization

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Is there a fourth Futamura projection?

Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Rethinking supercompilation

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Proving the equivalence of higher-order terms by means of supercompilation

PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics

Solving coverability problem for monotonic counter systems by supercompilation

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Higher-level supercompilation as a metasystem transition

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper deals with some aspects of metasystem transitions in the context of supercompilation. We consider the manifestations of the law of branching growth of the penultimate level in the case of higher-level supercompilation and argue that this law provides some useful hints regarding the ways of constructing metasystems by combining supercompilers. In particular we show the usefulness of multi-result supercompilation for proving the equivalence of expressions and in two-level supercompilation.