|Sources for development of this article may be located at|
Pure functions are required to construct pure expressions.
- It is possible for a pure expression to yield an impure function (or more generally a value which contains one or more impure functions).
- It is also possible for an expression to be pure even if one or more of the argument subexpressions yields an impure function (or a value which contains one or more impure functions).
} Foo is pure because it always returns the same function, but the function it returns is impure since it has the side effect of modifying the count variable. —Preceding unsigned comment added by GalaxiaGuy (talk • contribs) 13:24, 7 July 2010 (UTC)
alternate usage of the term:
the term definition provided here seems to be hardly in common usage See here for discussion and reference list
Advantages and disadvantages
Would be very good to add advantages and disadvantages of pure functions in comparison with impure ones. Should everyone try to always stick to pure functions? — Preceding unsigned comment added by 18.104.22.168 (talk) 10:58, 25 May 2016 (UTC)