| 
|
QuoteRef: straC3_1973
topics >
all references >
ThesaHelp:
references sa-sz
Topic:
abstraction in programming
Topic:
programming as mathematics
Topic:
integer values and operations
Topic:
numerical error
Topic:
expression language
Topic:
statement language
Topic:
lambda calculus
Group:
sets
Topic:
universal data type
Topic:
procedures as data
Topic:
self reference
Topic:
lattice theory of types
Topic:
variable as reference to a value
Topic:
using pointers in Thesa
Topic:
replacement as setting a reference to a value
Topic:
variable as reference to storage
Topic:
semantics by an abstract machine
Topic:
variable as function that accesses an object's value
Topic:
functional programming
Topic:
object modification
Reference
Strachey, C., "The varieties of programming languages", Oxford University Computing Laboratory, Programming Research Group, Technical Monograph PRG-10, March 1973. Google
Other Reference
Stanford Computer Library #44010
2 ;;Quote: with a programming language, deal with mathematical integers instead of bit-patterns 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 type-free, 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 self-referential equations
7+;;Quote: because of self-reference, could not construct a set-theoretic 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 sub-domains 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
ThesaHelp: references sa-sz (237 items)
Topic: abstraction in programming (67 items)
Topic: programming as mathematics (27 items)
Topic: integer values and operations (13 items)
Topic: numerical error (19 items)
Topic: expression language (14 items)
Topic: statement language (10 items)
Topic: lambda calculus (16 items)
Group: sets (7 topics, 148 quotes)
Topic: universal data type (18 items)
Topic: procedures as data (22 items)
Topic: self reference (27 items)
Topic: lattice theory of types (15 items)
Topic: variable as reference to a value (21 items)
Topic: using pointers in Thesa (49 items)
Topic: replacement as setting a reference to a value (10 items)
Topic: variable as reference to storage (12 items)
Topic: semantics by an abstract machine (38 items)
Topic: variable as function that accesses an object's value (21 items)
Topic: functional programming (45 items)
Topic: object modification (10 items)