Robert Glück

Learn More
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(More)
We introduce the notion of a perfect process tree as a model for the full propagation of in formation in metacomputation. Starting with constant propagation we construct step-by-step the driving mechanism used in supercompila tion which ensures the perfect propagation of information. The concept of a simple supercompiler based on perfect driving coupled(More)
Multiple program specialization can stage a computation into several computation phases. This paper presents an e ective solution for multiple program specialization by generalizing conventional o -line partial evaluation and integrating the \cogen approach" with a multi-level binding-time analysis. This novel \multi-cogen approach" solves two fundamental(More)
This paper gives a gentle introduction to Turchin's super-compilation and its applications in metacomputation with an emphasis on recent developments. First, a complete supercompiler, including positive driving and generalization, is deened for a functional language and illustrated with examples. Then a taxonomy of related transformers is given and compared(More)
ion Operators We now specify the abstraction operators Absγ,L, deciding which conjunctions are added to the global tree in order to ensure coveredness for bodies of newly derived resultants. Ensuring coveredness is basically simple: add to the global tree all (unchanged) bodies of produced resultants as new, “to be partially deduced” conjunctions. However,(More)