Referential transparency may refer to:
*
* The opposite of an
Wikimedia Foundation. 2010.
Referential transparency (computer science) — Referential transparency and referential opaqueness are properties of parts of computer programs. An expression is said to be referentially transparent if it can be replaced with its value without changing the program (in other words, yielding a… … Wikipedia
Transparency — may refer to:*Transparency (optics), the physical property of allowing the transmission of light through a materialLiteral uses: *Electromagnetically induced transparency, an effect in which a medium that is normally opaque at a particular… … Wikipedia
Side effect (computer science) — In computer science, a function or expression is said to produce a side effect if it modifies some state in addition to returning a value. For example, a function might modify a global or a static variable, modify one of its arguments, write data … Wikipedia
Uniqueness type — In computing, a unique type guarantees that an object is used in a single threaded way, with at most a single reference to it. If a value has a unique type, a function applied to it can be made to update the value in place in the object code. In… … Wikipedia
Functional programming — In computer science, functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids state and mutable data. It emphasizes the application of functions, in contrast with the… … Wikipedia
Idempotence — IPAEng|ˌaɪdɨmˈpoʊtəns describes the property of operations in mathematics and computer science which means that multiple applications of the operation does not change the result. The concept of idempotence arises in a number of places in abstract … Wikipedia
Identity (object-oriented programming) — An identity in object oriented programming, object oriented design and object oriented analysis describes the property of objects that distinguishes them from other objects. This is closely related to the philosophical concept of identity.… … Wikipedia
Gödel numbering for sequences — A Gödel numbering for sequences provides us an effective way to represent each finite sequence of natural numbers as a single natural number. Of course, the embedding is surely possible set theoretically, but the emphasis is on the effectiveness… … Wikipedia
Magic (programming) — In the context of computer programming, magic is an informal term for abstraction it is used to describe code that handles complex tasks while hiding that complexity to present a simple interface. The term is somewhat tongue in cheek and carries… … Wikipedia
Common Lisp — Paradigm(s) Multi paradigm: procedural, functional, object oriented, meta, reflective, generic Appeared in 1984, 1994 for ANSI Common Lisp Developer ANSI X3J13 committee Typing discipline … Wikipedia
