Editing Optimizing compiler (section)

=== Functional language optimizations ===
Although many of these also apply to non-functional languages, they either originate in or are particularly critical in [[functional language]]s such as [[Lisp programming language|Lisp]] and [[ML programming language|ML]].

;[[Tail-call optimization]]: A function call consumes stack space and involves some overhead related to parameter passing and flushing the instruction cache. [[Tail recursion|Tail-recursive]] algorithms can be converted to [[iteration]] through a process called tail-recursion elimination or tail-call optimization.

;[[Deforestation (computer science)|Deforestation]] ([[data structure]] fusion): In languages where it is common for a sequence of transformations to be applied to a list, deforestation attempts to remove the construction of intermediate data structures.

;[[Partial evaluation]]: Computations that produce the same output regardless of the dynamic input at runtime can be evaluated at compile time.