A property of a function, variable, or expression whereby the expression can be replaced by its (evaluated) value without affecting the behavior of the program.
What does the term referential transparency mean? I've heard it described as "it means you can replace equals with equals" …
functional-programming computer-science theory referential-transparencyI've frequently heard claims that Haskell doesn't have variables; in particular, this answer claims that it doesn't, and it was …
variables haskell immutability monads referential-transparencyI've played around with a few functional programming languages and really enjoy the s-expr syntax used by Lisps (Scheme in …
haskell functional-programming scheme referential-transparencyHaskell is generally referenced as an example of a purely functional language. How can this be justified given the existence …
haskell functional-programming type-systems referential-transparency unsafe-perform-io