DMCA
The GRIN Project: A Highly Optimising Back End for Lazy Functional Languages (1996)
| Venue: | In Proc IFL ’96, volume 1268 of LNCS |
| Citations: | 20 - 0 self |
BibTeX
@INPROCEEDINGS{Boquist96thegrin,
author = {Urban Boquist and Thomas Johnsson},
title = {The GRIN Project: A Highly Optimising Back End for Lazy Functional Languages},
booktitle = {In Proc IFL ’96, volume 1268 of LNCS},
year = {1996},
pages = {58--84},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Low level optimisations from conventional compiler technology often give very poor results when applied to code from lazy functional languages, mainly because of the completely dioeerent structure of the code, unknown control flow, etc. A novel approach to compiling laziness is needed. We describe a complete back end for lazy functional languages, which uses various interprocedural optimisations to produce highly optimised code. The main features of our new back end are the following. It uses a monadic intermediate code, called GRIN (Graph Reduction Intermediate Notation). This code has a very "functional flavour", making it well suited for analysis and program transformations, but at the same time provides the "low level" machinery needed to express many concrete implementation concerns. Using a heap points-to analysis, we are able to eliminate most unknown control flow due to evals (i.e., forcing of closures) and applications of higher order functions, in the program. A transformat...
Keyphrases
lazy functional language highly optimising back end grin project unknown control flow heap points-to analysis low level optimisation low level machinery new back end poor result graph reduction intermediate notation monadic intermediate code optimised code functional flavour novel approach conventional compiler technology completely dioeerent structure many concrete implementation concern program transformation various interprocedural optimisation order function main feature
