QuoteRef: grayJC_1973 ;; L* is set oriented

QuoteRef: grayJC_1973 ;;168 unordered sets do not contain duplicates while lists may

QuoteRef: grayJC_1973 ;;168 sets unordered or indexed, fixed or free (conversions between types e.g., undex (set)

168 ;;Quote: L* items contain attributes, relations to other items or sets, and tags (e.g., male)

QuoteRef: grayJC_1973 ;;169 restructure (<%) result := new-idem-format <% item by common index names.

QuoteRef: grayJC_1973 ;;169 combine (<') like restructure but takes a list of items, i.e., builds a compound item using a template.

QuoteRef: grayJC_1973 ;;169 component selection by selector.item

QuoteRef: grayJC_1973 ;;169 merge (A '++ B) the blank indices (may be set blank) of A are replaced by corresponding values in B

QuoteRef: grayJC_1973 ;;169 permute (index-set '% set) e.g., [3 2]'%[a b c d] == [c b]

QuoteRef: grayJC_1973 ;;169 also set size, component type, union, intersection, difference, append reduction (parametric relationship).(param//set) is a slice based on a predicate (short form e.g., (age=50).parents)

QuoteRef: grayJC_1973 ;;169 projection (component-name.param).(param//item-set) is a slice across the set by a component name

QuoteRef: grayJC_1973 ;;169 reduction (parametric relationship).(param//set) is a slice based on a predicate (short form e.g., (age=50).parents)

QuoteRef: grayJC_1973 ;;170 have converse of a relation eg children^name-set generates the set of parents whose children are in name-set

QuoteRef: grayJC_1973 ;;170 indirect product of two sets: from all element is set A form a reduction in set B and check number of elements

QuoteRef: grayJC_1973 ;;170 streaming (processing each element in my turn) to prevent "swelling" of intermediate sets

QuoteRef: grayJC_1973 ;;170 do loops optional preludes and postludes by $(prelude$(body of loop$) postlude$) if neither short form of $$(loop-body$$)

QuoteRef: grayJC_1973 ;;170 "jumpout" to skip do loop postlude

QuoteRef: grayJC_1973 ;;170 dyadic application: eg +!s2 sums all members of s2

QuoteRef: grayJC_1973 ;;170 in L*, function definition is similar to do loop