Topic: index sequence for array access
Topic: set operations
ThesaHelp: references tz
 
Reference
Wells, M.B.,
"Aspects of language design for combinatorial computing",
IEEE Transactions on Electronic Computers, EC13, 4, pp. 431438, April 1964.
Google
Notes
Madcap
Quotations
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=ab for a in A, b in B, and ab >= 0 [others do the same on any range i.e., bounded by high and low for the set.

Related Topics
Topic: index sequence for array access (16 items)
Topic: set operations (12 items)
ThesaHelp: references tz (309 items)
