157 ;;Quote: an entity frame needs binding link for local variables, access link for arguments, control link for return, and process state

QuoteRef: bobrDG9_1974 ;;158 macro value substituted into pattern before matching

QuoteRef: bobrDG9_1974 ;;158 "demon" module automatically activated under certain conditions

QuoteRef: bobrDG9_1974 ;;158 pattern matching-- modes of unit(one element) or segment(multiple el) types of open (any item), closed (match previous assignment), semiopen (open for first then closed), restricted (to class), macro (value substituted into pattern before matching)

QuoteRef: bobrDG9_1974 ;;159 Hewitt 71 Planner: routine activation by pattern match on arguments. eg for goal oriented describe pattern of output and appropriate routine is called

QuoteRef: bobrDG9_1974 ;;161 Conniver: has data-base context which easily changed (%eg INFOS subindex)

QuoteRef: bobrDG9_1974 ;;161 qlisp: a "bag" is an unordered tuple (i.e., may have duplicates e.g., tuple plus (bag 5 c d d) matches 5+c+d+d and d+5+c+d

QuoteRef: bobrDG9_1974 ;;165 Qlisp: patterns typed by pre-fix operator eg open ( *), semiopen(?) closed ($), segment patterns by doubling eg $$

QuoteRef: bobrDG9_1974 ;;166 Popler: tentative assigning to variable by #:id i.e. on pattern failure id contains original value

QuoteRef: bobrDG9_1974 ;;167 planner: theorems part of data base. consist of pattern to be tested by a program which generally consists of other pattern tests.

QuoteRef: bobrDG9_1974 ;;167 theorems for goal oriented searches e.g., consequent (part $?x $?z) [this is a pattern] (goal (part $?x $?y)) (goal (part $?Y $?z)) tests for transitivity in data base.

QuoteRef: bobrDG9_1974 ;;167 theorem to build resultant data items from a new datum (antecedent)

QuoteRef: bobrDG9_1974 ;;167 theorems to delete corresponding data [derived data relationships] whenever a datum is deleted (erase, opposite of antecedent)