Lecture overview -- Keyboard shortcut: 'u'  Previous page: Referential transparency [Section] -- Keyboard shortcut: 'p'  Next page: An illustration of referential transparency -- Keyboard shortcut: 'n'  Lecture notes - all slides and notes together  slide -- Keyboard shortcut: 't'  Textbook -- Keyboard shortcut: 'v'  Help page about these notes  Alphabetic index  Course home    Lecture 5 - Page 2 : 26
Functional Programming in Scheme
The Order of Evaluation
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 cannot be distinguished by functional means

    • is a major contrast to imperative programming

Equals can be replaced by equals