What does the term referential transparency mean? I've heard it described as "it means you can replace equals with equals" but this seems like an inadequate explanation.
相关问题
- Relation between Function1 and Reader Monad
- scala passing function with underscore produces a
- Combining n vectors into one vector of n-tuples
- Improve this code by eliminating nested for cycles
- Redefine list monad instance
相关文章
- Is there something like the threading macro from C
- Algorithm for partially filling a polygonal mesh
- Learning F#: What books using other programming la
- Creating a list of functions using a loop in R
- When to use interfaces, and when to use higher ord
- Functors in Ocaml
- Proving correctness of multithread algorithms
- Java Lambda Referencing Enclosing Object: Replace
An expression is referentially transparent if it can be replaced with its value, without changing the algorithm, yielding an algorithm that has the same effects and output on the same input.