By bloid
via gaetanocaruana.com
Published: Mar 11 2007 / 20:30
Pure functional languages are referential transparent. Referential transparency states that the output of a function strictly depends on its inputs. That is, irrespective of how many times and the order of how functions are evaluated, the same output is given for the same input.
Add your comment
