• DOI:10.7551/mitpress/4301.003.0048
Corpus ID: 16888002

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}
}

M. Sørensen, R. Glück

Published in ILPS 1995

Computer Science

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

View via Publisher

ieeexplore.ieee.org

Save to Library

Create Alert

Cite

Launch Research Feed