Functional Elimination of Φ-instructions

We present a functional analogue of the elimination of Φ-instructions from Static Single Assignment (SSA) code. Extending earlier work on the relationship between SSA and functional languages we show that transformations from A-normal form (ANF) into a more restrictive form called GNF require the sa...

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in theoretical computer science 2007-07, Vol.176 (3), p.3-20
Main Author: Beringer, Lennart
Format: Article
Language:English
Subjects:
Compilation
Functional intermediate representations
Phi-elimination
Static single assignment form
Type systems for register allocation
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a functional analogue of the elimination of Φ-instructions from Static Single Assignment (SSA) code. Extending earlier work on the relationship between SSA and functional languages we show that transformations from A-normal form (ANF) into a more restrictive form called GNF require the same compensating instructions to be inserted as are commonly inserted during the translation from SSA to machine code. Lifting the translation from the syntactic level to the type level, we introduce type systems that mediate the transition from ANF code into correctly register-allocated machine code and allow code optimisations and transformations to be performed in a typed functional setting.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2007.06.003