Add to ORKGAbstract: The paper explains the principles of multi-result supercompilation. We introduce a formalism for representing supercompilation algorithms as rewriting rules for graphs of configurations. Some low-level technical details related to the implementation of multi-result supercompilation in MRSC are discussed. In particular, we consider the advantages of using spaghetti stacks for representing graphs of configurations.Note: Publication language:englis
Abstract. We introduce the notion of a perfect process tree as a model for the full propagation of i...
This archive contains the raw evaluation results and scripts associated with the experiments describ...
Intermediate structures such as lists and higher-order functions are very common in most styles of f...
Abstract: The paper presents a simple domain-specific multi-result supercompiler for count...
Abstract: When applying supercompilation to problem-solving, multi-result supercompilation...
Abstract: We consider an application of supercompilation to the analysis of counter transi...
Abstract: This paper presents a reformulation of the notion of multi-result supercompilati...
Abstract: An introduction to supercompilation, a program analysis and transformation techn...
A supercompiler is a program which can perform a deep transformation of programs using a principle w...
Abstract: The paper presents a number of improvements to the method of two-level supercomp...
The current growing interest in supercomputers will undoubtedly give rise to the question of how to ...
This paper gives a gentle introduction to Turchin's supercompilation and its applications in me...
Turchin's supercompilation is a program transformation technique for functional languages. A su...
Abstract: There are considered a number of issues related to supercompilation: (1) the use...
It has previously been shown by Turchin in the context of supercompilation how metasystem transition...
Abstract. We introduce the notion of a perfect process tree as a model for the full propagation of i...
This archive contains the raw evaluation results and scripts associated with the experiments describ...
Intermediate structures such as lists and higher-order functions are very common in most styles of f...
Abstract: The paper presents a simple domain-specific multi-result supercompiler for count...
Abstract: When applying supercompilation to problem-solving, multi-result supercompilation...
Abstract: We consider an application of supercompilation to the analysis of counter transi...
Abstract: This paper presents a reformulation of the notion of multi-result supercompilati...
Abstract: An introduction to supercompilation, a program analysis and transformation techn...
A supercompiler is a program which can perform a deep transformation of programs using a principle w...
Abstract: The paper presents a number of improvements to the method of two-level supercomp...
The current growing interest in supercomputers will undoubtedly give rise to the question of how to ...
This paper gives a gentle introduction to Turchin's supercompilation and its applications in me...
Turchin's supercompilation is a program transformation technique for functional languages. A su...
Abstract: There are considered a number of issues related to supercompilation: (1) the use...
It has previously been shown by Turchin in the context of supercompilation how metasystem transition...
Abstract. We introduce the notion of a perfect process tree as a model for the full propagation of i...
This archive contains the raw evaluation results and scripts associated with the experiments describ...
Intermediate structures such as lists and higher-order functions are very common in most styles of f...