We introduce a positive supercompiler, a version of Turchin's super compiler maintaining only positive information during transformation, and using folding without generalization.Expand

Description: The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For… Expand

We present a framework for conjunctive partial deduction, extending the Lloyd–Shepherdson framework by considering conjunctions of atoms (instead of individual atoms) for specialisation and renaming.Expand

Turchin`s supercompiler is a program transformer that includes both partial evaluation and deforestation. Although known in the West since 1979, the essence of its techniques, its more precise… Expand

We show their equivalence by analyzing the definition and construction principles underlying partial deduction, and by giving a translation from a functional language to a definite logic language preserving certain properties.Expand

This paper gives an introduction to Turchin's supercompiler, a program transformer for functional programs which performs optimizations beyond partial evaluation and deforestation.Expand