| 
|
Topic: replacement as defining a variable
topics >
computer science >
data >
binding names to variables or expressions
Topic:
definition
Topic:
definition languages
Topic:
initialized constants
Topic:
named constants and expressions
Topic:
no need for replacement
Topic:
static single assignment; SSA
Summary
Replacement may define a variable's meaning or value. This makes all variables constants. This restriction simplifies language semantics, program proofs, and parallel processing. (cbb 5/80)MacLennan proposes that objects have a constant name, but the components of an object may be assigned. (cbb 1/90)
Subtopic: asignment as binding
Quote: a definition language, turns replacement into the definition of a variable [»ackeWB_1979] Quote: names could be fixed at the creation of a value or object; they would be constants instead of variables [»maclBJ12_1982] Quote: in Prolog, a variable is defined as a value; it is only changed through backtracking [»warrDH2_1980]
Subtopic: component assignment
Quote: an assignment statement only binds a value to a name [»ackeWB_1979] Quote: a binding defines a name as the current value or object described by an expression [»maclBJ12_1983] Quote: a binding associates a name with a particular value or object [»maclBJ12_1983] Quote: a refinement is an assignment to a global named variable
Quote: could limit assignment statements to changing a component of an object's state
Topic: binding names to variables or expressions (10 items)
Topic: definition (17 items)
Topic: definition languages (3 items)
Topic: initialized constants (12 items)
Topic: named constants and expressions (21 items)
Topic: no need for replacement (4 items)
Topic: static single assignment; SSA
(19 items)