Functional Elimination of Φ-instructions | Zendy

Lennart Beringer | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Functional Elimination of Φ-instructions

Author(s) -

Lennart Beringer

Publication year - 2007

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.06.003

Subject(s) - computer science , programming language , functional programming , code (set theory) , translation (biology) , theoretical computer science , biochemistry , chemistry , set (abstract data type) , messenger rna , gene

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research