index sequence for array access
"Aspects of language design for combinatorial computing",
IEEE Transactions on Electronic Computers, EC-13, 4, pp. 431-438, April 1964.
|QuoteRef: wellMB4_1964 ;;433 j~k is all x bounded by j and k i.e. [j,k)
|QuoteRef: wellMB4_1964 ;;433 set difference by all x such that x=a-b for a in A, b in B, and a-b >= 0 [others do the same on any range i.e., bounded by high and low for the set.
Topic: index sequence for array access (16 items)
Topic: set operations (12 items)
ThesaHelp: references t-z (309 items)