Supercompiler HOSC 1.5: homeomorphic embedding and generalization in a higher-order setting (2010)
by
Ilya G. Klyuchnikov
| Citations: | 4 - 3 self |
BibTeX
@MISC{Klyuchnikov10supercompilerhosc,
author = {Ilya G. Klyuchnikov},
title = {Supercompiler HOSC 1.5: homeomorphic embedding and generalization in a higher-order setting},
year = {2010}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The paper describes the algorithm of the supercompiler HOSC 1.5, an experimental specializer dealing with programs written in a higher-order functional language. The design decisions behind the algorithm are illustrated through a series of examples. Of particular interest are the decisions related to generalization and homeomorphic embedding of expressions with bound variables.
Citations
| 996 | The Lambda Calculus, Its Syntax and Semantics - Barendregt - 1984 |
| 359 | Explicit Substitutions - Abadi, Cardelli, et al. - 1992 |
| 278 | Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem - Bruijn - 1972 |
| 159 | Lambda lifting: Transforming programs to recursive equations - Johnsson - 1985 |
| 33 | A roadmap to metacomputation by supercompilation - Glück, Sørensen - 1996 |
| 16 | A supercompiler for core Haskell - Mitchell, Runciman |
| 10 | Positive supercompilation for a higher order call-by-value language - Jonsson, Nordlander - 2009 |
| 9 | Supercompiler HOSC 1.0: under the hood - Klyuchnikov |
| 8 | Proving the equivalence of higher-order terms by means of supercompilation - Klyuchnikov, Romanenko |
| 5 | Supercompiler HOSC 1.1: proof of termination - Klyuchnikov - 2010 |
| 5 | Towards higher-level supercompilation - Klyuchnikov, Romanenko - 2010 |
| 4 | Supercompiler HOSC: proof of correctness - Klyuchnikov - 2010 |
