Compilation by Transformation in the Glasgow Haskell Compiler (1994)
| Citations: | 7 - 1 self |
BibTeX
@MISC{Jones94compilationby,
author = {Simon Peyton Jones and André Santos and Jones Andr'e Santos},
title = {Compilation by Transformation in the Glasgow Haskell Compiler},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we describe the full set of local program transformations implemented in the Glasgow Haskell Compiler. The transformations are presented as source to source transformations in a simple functional language. The idea is that by composing these simple and small high level transformations one can achieve most of the benefits of more complicated and specialised transformations, many of which are often implemented as code generation optimisations. 1 Motivation Quite a few compilers use the compilation by transformation idiom. The idea is that as much as possible of the compilation process is expressed as correctnesspreserving transformations, each of which transforms a program into a semantically -equivalent program that (hopefully) executes more quickly or in less space. Functional languages are particularly amenable to this approach because they have a particularly rich family of possible transformations. Examples of transformation -based compilers include the Orbit compiler...
Citations
No citations identified.
