An Algorithm of Generalization in Positive Supercompilation
@inproceedings{Srensen1995AnAO, title={An Algorithm of Generalization in Positive Supercompilation}, author={M. S{\o}rensen and R. 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
Topics from this paper
191 Citations
Positive supercompilation for a higher order call-by-value language
- Computer Science
- POPL '09
- 2009
- 37
- PDF
Positive Supercompilation for a Higher-Order Call-By-Value Language
- Computer Science
- 2008
- 10
- Highly Influenced
- PDF
A Roadmap to Metacomputation by Supercompilation
- Computer Science
- Dagstuhl Seminar on Partial Evaluation
- 1996
- 69
- PDF
Improving supercompilation: tag-bags, rollback, speculation, normalisation, and generalisation
- Computer Science
- 2011
- 7
- PDF
References
SHOWING 1-10 OF 25 REFERENCES
Turchin's Supercompiler Revisited - An operational theory of positive information propagation
- Mathematics
- 1996
- 47
Application of metasystem transition to function inversion and transformation
- Mathematics, Computer Science
- ISSAC '90
- 1990
- 34
Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance
- Computer Science
- 1995
- 30
Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC
- Computer Science
- ESOP
- 1994
- 87
- PDF