An Algorithm of Generalization in Positive Supercompilation

@inproceedings{Srensen1995AnAO,
  title={An Algorithm of Generalization in Positive Supercompilation},
  author={Morten Heine S\orensen and Robert Gl{\"u}ck},
  booktitle={ILPS},
  year={1995}
}
This paper presents a termination technique for positive supercompilation, based on notions from term algebra. The technique is not particularily biased towards positive supercompilation, but also works for deforestation and partial evaluation. It appears to be well suited for partial deduction too. The technique guarantees termination, yet it is not overly conservative. Our technique can be viewed as an instance of Martens' and Gallagher's recent framework for global termination of partial… CONTINUE READING
Highly Influential
This paper has highly influenced 19 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 313 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 124 extracted citations

313 Citations

0102030'93'98'04'10'16
Citations per Year
Semantic Scholar estimates that this publication has 313 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Generating Transformers for Deforestation and Driving Static Analysis

R Gl Uck, J Jjrgensen
LNCS • 1994

Turchin's Supercompiler Revisited. An Operational Theory of Positive Information Propagation

M H Ssrensen
Turchin's Supercompiler Revisited. An Operational Theory of Positive Information Propagation • 1994

Partial evaluation and automatic program generation

Prentice Hall international series in computer science • 1993