2 ;;Quote: with a programming language, deal with mathematical integers instead of bitpatterns and addresses

2 ;;Quote: even though computers approximate real operations, ignore this until get programs that would be correct with exact operations

2 ;;Quote: "mathematical" approach to programming considers values of expressions instead of the steps that produced them

2+;;Quote: "operational" approach to programming specifies a sequence of steps to obtain a result

6 ;;Quote: in typefree, lambda calculus, can not define a universal domain that includes all functions

7 ;;Quote: need to prove that reflexive domains exist; i.e., domains defined by selfreferential equations

7+;;Quote: because of selfreference, could not construct a settheoretic model of the .lambda.calculus

7 ;;Quote: Scott argued that a universal domain only needs continuous functions

7+;;Quote: Scott enhances a domain with a partial ordering based on degree of approximation

8 ;;Quote: Scott proved the existence of a universal domain that contains subdomains including function spaces

8 ;;Quote: the function spaces found by Scott include all ordinary and reasonable functions

9 ;;Quote: the names/identifiers in a programming language are part of language itself; not manipulated by it

10 ;;Quote: a variable denotes a fixed address whose content is its value

11 ;;Quote: while the environment may behave mathematically, the machine state behaves operationally; state transformations are essentially irreversible

12 ;;Quote: contents of a formal location is a function on stores yielding values; a store is a set of functions on locations yielding values

12 ;;Quote: updating a location is the same as producing a new store which is a slight modification of the original one
