# Supercompilation of Double Interpretation ( How One Hour of the Machine ' s Time Can Be Turned to One Second )

@inproceedings{Karliukou2002SupercompilationOD, title={Supercompilation of Double Interpretation ( How One Hour of the Machine ' s Time Can Be Turned to One Second )}, author={Aliaksandr Karliukou and Andrei P. Nemytykh}, year={2002} }

Supercompilation is a program transformation method that can achieve partial evaluation, and in some respect more powerful. In this paper, we describe some experiments with the supercompiler Scp4. We specialize an XSLT-interpreter w.r.t. a Turing Machine interpreter written in XSLT. The running time speedup observed by us is entered in the title of this paper.

## 3 Citations

### The Supercompiler SCP4: General Structure

- Computer ScienceErshov Memorial Conference
- 2003

Scp4 is a first experimental supercompiler for the real functional language Refal-5 and its principal new tool is an online analysis of global properties of folded-components of the meta-tree MTr of all potential computations.

### Reachability Analysis in Verification via Supercompilation

- Computer ScienceInt. J. Found. Comput. Sci.
- 2008

It is shown that reachability analysis performed by supercompilation can be seen as the proof of a correctness condition by induction.

### A note on elimination of simplest recursions

- Computer ScienceASIA-PEPM '02
- 2002

It is shown that an easily recognized characterization of a class of recursive definitions, called syntactical monomials, that can be transformed to one-step definitions is meaningful for specialization of interpreters and self-application of specializers.

## References

SHOWING 1-10 OF 35 REFERENCES

### Supercompilation: Techniques and Results

- Computer ScienceErshov Memorial Conference
- 1996

The current state of work on supercompilation is illustrated by several examples of successful transformation, and an outline of such a language, SCPL, for the top level of control in a supercompiler is given.

### Program Transformation with Metasystem Transitions: Experiments with a Supercompiler

- Computer ScienceErshov Memorial Conference
- 1996

Turchin's supercompilation is a program transformation technique for functional languages which can perform a deep transformation of programs using a principle which is similar to partial evaluation.

### The concept of a supercompiler

- Computer ScienceTOPL
- 1986

It is argued that the language Refal serves the needs of supercompilation best, and it is described and compared with the usual approach to program transformation as a stepwise application of a number of equivalence rules.

### An experiment in partial evaluation: the generation of a compiler generator

- Computer ScienceSIGP
- 1985

A running, non-trivial partial evaluator is described, which is the first which has been used in practice to transform interpreters into corresponding stand-alone compilers, or to generate a compile r generator by transforming itself.

### A Self-Applicable Supercompiler

- Computer ScienceDagstuhl Seminar on Partial Evaluation
- 1996

This paper describes the first self-applicable model of a supercompiler and presents some tests, which distinguish it from the previous models and make self-application possible.

### A compiler generator produced by a self-applicable specializer can have a surprisingly natural and u

- Computer Science
- 1988

This paper describes the structure of, and the ideas behind, a self-applicable specializer of programs, as well as the principles of operation of a compiler generator that has been produced…

### What Not to Do When Writing an Interpreter for Specialisation

- Computer ScienceDagstuhl Seminar on Partial Evaluation
- 1996

A partial evaluator, given a program and a known “static” part of its input data, outputs a specialised or residual program in which computations depending only on the static data have been performed…

### Metavariables : their Implementation and Use in Program Transformation

- Computer Science
- 1995

To make jumping possible, the authors introduce one more type of a linked piece called an unknown, which represents a metavariable of a degree d 0.

### Computability and complexity - from a programming perspective

- Computer ScienceFoundations of computing series
- 1997

These notes contain some high points from the recent book, emphasising what is different or novel with respect to more traditional treatments of computability and complexity theory, and some new results as well.

### Partial evaluation and automatic program generation

- Computer SciencePrentice Hall international series in computer science
- 1993

This paper presents a guide to the literature the self-applicable scheme specializer, a partial evaluator for a subset of scheme for a first-order functional languages.