In analytic philosophy and computer science, referential transparency and referential opacity are properties of linguistic constructions, and by extension... 12 KB (1,468 words) - 12:54, 21 April 2024 |
is a necessary, but not sufficient, condition for referential transparency. Referential transparency means that an expression (such as a function call)... 10 KB (1,083 words) - 18:51, 24 April 2024 |
transparency, independence of location Order-independent transparency in 3D computer graphics Referential transparency Security through transparency,... 3 KB (327 words) - 18:54, 18 April 2024 |
constant with respect to that argument list (sometimes called referential transparency or idempotence), i.e., calling the pure function again with the... 84 KB (8,445 words) - 07:15, 30 April 2024 |
sentence, has referential transparency: it is either referentially transparent or referentially opaque. A construction is referentially transparent if... 26 KB (3,705 words) - 10:41, 20 November 2023 |
variables, mutable reference arguments or input streams, i.e., referential transparency), and the function has no side effects (no mutation of local static... 12 KB (1,361 words) - 02:22, 1 May 2024 |
improve the efficiency of functional languages while maintaining referential transparency. Unique types can also be used to integrate functional and imperative... 5 KB (578 words) - 17:57, 30 January 2023 |
return value. This style handles state changes without losing the referential transparency of the program expressions. Purely functional programming consists... 8 KB (903 words) - 14:04, 11 February 2024 |
identifiers and prevents accidental capture. This property is called referential transparency. In cases where capture is desired, some systems allow the programmer... 21 KB (2,417 words) - 10:05, 7 February 2024 |
definiteness, substitutivity of identity, unfoldability, and referential transparency. "Some Basic QUESTIONS". velocity reviews. Retrieved 2011-06-17... 3 KB (328 words) - 12:12, 21 September 2021 |
mutable state Functionality doctrine, in intellectual property law Referential transparency This disambiguation page lists articles associated with the title... 456 bytes (83 words) - 12:30, 30 September 2016 |
Opaque context (redirect from Referential opacity) Inscrutability of reference Masked-man fallacy Pure functions Referential transparency Transitivity of identity "Definition of "opaque context" | Collins... 4 KB (497 words) - 07:11, 31 August 2023 |
local manner, or usage of a pure functional programming style with referential transparency. The term is based on the concept of action at a distance in physics... 5 KB (623 words) - 12:14, 5 October 2023 |
expression with side effects does not normally have the property of referential transparency. In many languages (e.g. C++), expressions may be ended with a... 5 KB (586 words) - 08:16, 16 January 2024 |
might imply changes of non-local state. The purpose is to enforce referential transparency, i.e. functions that do not depend on the state of some variable(s)... 33 KB (3,304 words) - 18:57, 11 August 2023 |
value during their entire lifetime due to the requirements of referential transparency. In imperative languages, the same behavior is exhibited by (named)... 21 KB (2,795 words) - 04:34, 28 April 2024 |
considered unequal. Referential equality implies intensional and extensional equality. Referential equality breaks referential transparency and is therefore... 27 KB (2,522 words) - 11:20, 13 April 2024 |
"L-value", "ad hoc polymorphism", "parametric polymorphism", and "referential transparency". The lecture notes were reprinted in 2000 in a special issue of... 3 KB (251 words) - 02:07, 25 July 2023 |
Processing model Opaque context — another problem for compositionality Referential transparency — in programming languages Semantic decomposition (natural language... 13 KB (1,404 words) - 22:02, 31 March 2024 |
language, it combines a declarative (non-procedural) structure for referential transparency, array abstraction, and automatic dependency maintenance for efficient... 35 KB (3,903 words) - 04:12, 29 April 2024 |
mutable data Lambda calculus, compositionality, formula, recursion, referential transparency, no side effects Declarative C++, C#,[circular reference] Clojure... 30 KB (2,594 words) - 23:05, 1 February 2024 |
from a fundamental property of pure functional languages, termed referential transparency: the value of a computed result does not depend on the order or... 15 KB (1,650 words) - 23:03, 18 March 2024 |
global variables as parameters then swap() would not be reentrant Referential transparency Kerrisk 2010, p. 657. Ralston 2000, p. 1514–1515.... 18 KB (2,028 words) - 23:40, 3 February 2024 |
programming Lambda programming Static scoping Higher-order function Referential transparency Currying Lambda abstraction Church–Rosser theorem Extensionality... 4 KB (205 words) - 12:10, 30 October 2023 |
properties and syntax with a younger sibling language, Haskell: referential transparency, list comprehension, guards, garbage collection, higher order functions... 16 KB (965 words) - 14:50, 10 March 2024 |
operating systems. Imperative procedures with side effects violate referential transparency and therefore are not cleanly composable. However if one considers... 19 KB (2,145 words) - 17:53, 17 January 2024 |