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… Expand
A Positive Supercompiler
A Roadmap to Metacomputation by Supercompilation
A Simple Supercompiler Formally Verified in Coq
Nonlinear Configurations for Superlinear Speedup by Supercompilation
Towards Higher-Level Supercompilation ?
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
...
1
2
3
...