| 
|
Topic: binding names to variables or expressions
topics >
aliasing
Topic:
binding of names to objects
Topic:
flag computer
Topic:
macros
Topic:
named constants and expressions
Topic:
parameter passing by name
Topic:
pointers to data
Topic:
replacement as defining a variable
Topic:
Goldstine and von Neumann consistency proof
Summary
Variables can be names bound to values or to other variables. If an object is renamed then all references to the object become references to the new name. For instance an object named 'i' can be renamed 'i+1'. Then if 'j' had been bound to 'i', 'j' would be bound to 'i+1' after the renaming. Such indirection results in unusually behaviors. (cbb 5/80)
Quote: a name definition replaces an expression; e.g., cw = sam.car.weight and cw := 401 [»maclBJ12_1983] Quote: if A is an array in a cell computer, the name A(i) must be moved whenever cell i is changed [»hehnEC_1977a] QuoteRef: goldHH_1948 ;;92 substitution boxes for changing bound induction variables (eg setting i to i+1 QuoteRef: kayAC6_1968 ;;32 a<- "b" and a<-c+d is same as b<-c+d QuoteRef: thorRC_1969 ;; (1 x y) <-z means z points to (1 x y) if 2<-x, 2<-y then is (1 2 2) QuoteRef: thorRC_1969 ;; 1"y all pointers to 1 will point to y and 1 redefinable (renaming eg +"add) QuoteRef: thorRC_1969 ;; 2<-x means x points to 2 QuoteRef: hehnEC7_1975 ;;15 allows literals such as j: 2*i+1 QuoteRef: wulfWA12_1971 ;;783 Literals by BIND y2= y+2 Quote: in Euclid, can bind an identifier to part of an existing variable; e.g., bind var X to A[5]
[»veneT3_1978]
Topic: aliasing (28 items)
Topic: binding of names to objects (19 items)
Topic: flag computer (2 items)
Topic: macros (22 items)
Topic: named constants and expressions (21 items)
Topic: parameter passing by name (11 items)
Topic: pointers to data (55 items)
Topic: replacement as defining a variable (8 items)
Topic: Goldstine and von Neumann consistency proof
(6 items)