A-normal form
In computer science, A-normal form (abbreviated ANF) is an intermediate representation of programs in functional compilers introduced by Sabry and Felleisen in 1992 as a simpler alternative to continuation-passing style (CPS). Some of the advantages of using CPS as an intermediate representation are that optimizations are easier to perform on programs in CPS than in the source language, and that it is also easier for compilers to generate machine code for programs in CPS. Flanagan et al. showed how compilers could use ANF to achieve those same benefits with one source-level transformation; in contrast, for realistic compilers the CPS transformation typically involves additional phases, for example, to simplify CPS terms.
primaryTopic
A-normal form
In computer science, A-normal form (abbreviated ANF) is an intermediate representation of programs in functional compilers introduced by Sabry and Felleisen in 1992 as a simpler alternative to continuation-passing style (CPS). Some of the advantages of using CPS as an intermediate representation are that optimizations are easier to perform on programs in CPS than in the source language, and that it is also easier for compilers to generate machine code for programs in CPS. Flanagan et al. showed how compilers could use ANF to achieve those same benefits with one source-level transformation; in contrast, for realistic compilers the CPS transformation typically involves additional phases, for example, to simplify CPS terms.
has abstract
In computer science, A-normal ...... e or returned from a function.
@en
Wikipage page ID
Wikipage revision ID
724.703.597
hypernym
comment
In computer science, A-normal ...... xample, to simplify CPS terms.
@en
label
A-normal form
@en