Evaluation Order and Infinite Lists
- slide 2 : 27
Referential transparency
Two equal expressions can substitute each other without affecting the meaning of a functional program
Referential transparency
provides for easy
equational reasoning
about a program
does not rely on a particular notion of equality
Reference equality, shallow equality and deep equality do all apply
is a major contrast to imperative programming
Equals can be replaced by equals
Our earlier discussion of referential transparency
Equality in Scheme
![Previous page: Referential Transparency [Section] -- Keyboard shortcut: 'p'](./images/nav-left.gif "Previous page: Referential Transparency [Section] -- Keyboard shortcut: 'p'")
