Types for Register Allocation (1998)
| Venue: | Lecture Notes in Computer Science |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Agat98typesfor,
author = {Johan Agat},
title = {Types for Register Allocation},
booktitle = {Lecture Notes in Computer Science},
year = {1998},
pages = {92--111},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We have set out to explore a type based approach to register allocation for purely functional languages. To lay a theoretical ground for that work, we have first developed a functional typed intermediate language with explicit register usage that we present in this paper. The language, which is a lambda calculus with flavours of assembly language, is able to express the register assignments resulting from a global, graph coloring based register allocation. We prove that our system is consistent and correct with respect to a standard semantics. 1 Introduction Register allocation is the process of deciding where, in which register or in the memory, to store each value computed by the program being compiled. In modern RISC architectures, the difference in access time between a register and a memory cell can be as much as 4 to 10 times (or much more if a cache miss occurs) [1]. The register utilisation thus has a significant impact on the execution speed of a program. mov 3,%r8 mov 5,%r...
