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
    191 Citations

    Topics from this paper

    Positive Supercompilation for a Higher-Order Call-By-Value Language
    • 10
    • Highly Influenced
    • PDF
    A Positive Supercompiler Capsule Review
    • N. D. JONESDIKU
    • 1993
    A Roadmap to Metacomputation by Supercompilation
    • 69
    • PDF
    A Positive Supercompiler
    • 197
    A Simple Supercompiler Formally Verified in Coq
    • 8
    • PDF
    Nonlinear Configurations for Superlinear Speedup by Supercompilation
    • 1
    • PDF
    Towards Higher-Level Supercompilation ?
    • 22
    • PDF

    References

    SHOWING 1-10 OF 25 REFERENCES
    The concept of a supercompiler
    • 423
    • PDF
    Experiments with a supercompiler
    • 52
    Application of metasystem transition to function inversion and transformation
    • 34
    An Introduction to Partial Deduction
    • 73
    • PDF
    Partial Evaluation and Mixed Computation
    • 122
    • PDF
    Loop checking in partial deduction
    • R. Bol
    • Mathematics, Computer Science
    • J. Log. Program.
    • 1993
    • 86
    • PDF