 | This article relies excessively on references to primary sources. Please improve this article by adding secondary or tertiary sources. Find sources: "A-normal form" – news · newspapers · books · scholar · JSTOR (October 2011) (Learn how and when to remove this message) |
In computer science, A-normal form (abbreviated ANF, sometimes expanded as administrative normal form or as atomic normal form) is an intermediate representation of programs in functional programming language compilers. In ANF, all arguments to a function must be trivial (constants or variables). That is, evaluation of each argument must halt immediately.
ANF was 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.
Grammar
Consider the pure λ-calculus with constants and let-expressions. The ANF restriction is enforced by
- allowing only values (variables, constants, and λ-terms), to serve as operands of function applications, and
- requiring that the result of a non-trivial expression (such as a function application) be immediately captured in a let-bound variable.
The following BNF grammars show how one would modify the syntax of λ-expressions to implement the constraints of ANF:
| Original | ANF |
|---|---|
EXP ::= λ VAR . EXP
| EXP EXP
| VAR
| CONST
| let VAR = EXP in EXP
CONST ::= f | g | h
|
EXP ::= VAL
| let VAR = VAL in EXP
| let VAR = VAL VAL in EXP
VAL ::= VAR
| CONST
| λ VAR . EXP
CONST ::= f | g | h
|
Variants of ANF used in compilers or in research often allow records, tuples, multiargument functions, primitive operations and conditional expressions as well.
Examples
The expression:
f(g(x),h(y))
is written in ANF as:
let v0 = g(x) in
let v1 = h(y) in
f(v0,v1)
By imagining the sort of assembly this function call would produce:
;; let v0 = g(x) move x into args call g move result into temp ;; let v1 = h(y) move y into args call h move result into temp ;; f(v0, v1) move temp into args move temp into args call f
One can see the immediate similarities between ANF and the compiled form of a function; this property is a part of what makes ANF a good intermediate representation for optimisations in compilers.
See also
References
- Sabry, Amr; Felleisen, Matthias. "Reasoning about Programs in Continuation-Passing Style". Proceedings of the 1992 ACM Conference on LISP and Functional Programming, LFP'92. San Francisco, CA, USA. CiteSeerX 10.1.1.22.7509. Sabry92.
- Flanagan, Cormac; Sabry, Amr; Duba, Bruce F.; Felleisen, Matthias. "The Essence of Compiling with Continuations" (PDF). Proceedings ACM SIGPLAN 1993 Conf. on Programming Language Design and Implementation, PLDI'93. Albuquerque, NM, USA. Flanagan93. Retrieved 2012-11-16.
 | This programming-language-related article is a stub. You can help Misplaced Pages by expanding it. |