• (cons item list), (first list), (rest list): be able to give the result of a call to these functions, and the ones below.
• (length list), (reverse list), (append list1 list2), (member item list), (assocl key alist)
• intersection, union, set-difference, subset?, set=
• (map fn list), (doseq [item list] ...)
• (some fn list), (every fn list)
• (fn [args] code)
• (equal tree1 tree2), (match pattern tree), (copy-tree tree), (subst new old tree), (sublis ((old new) ...) tree)
• (let [var init ...] code)

• cons as binary tree
• First-child / next-sibling tree
• Nested linked list tree
• Arithmetic expression tree: (op tree), (lhs tree), (rhs tree)
• Binary tree search
• Depth-first search: order of search, stack space used, Big O
• Nested tree recursion

• Matching: Pattern × Input → Bindings
• Rules for matching: structure and constants must match exactly; a pattern variable can match anything, but must match consistently.
• Substitution: Bindings × Pattern → Result
• Pattern-pair or rewrite rule: (input-pattern output-pattern)
• (transform pattern-pair input) : if it matches, rewrite it.
• Uses: equation solving, optimization, partial evaluation, symbolic differentiation, code translation

• Propositional Logic: just Boolean variables P, Q, R
• First-order Predicate Calculus: Predicate P(x), term, variable, function, constant
• Conjunctive Normal Form (CNF) (... ∨ ...) ∧ (... ∨ ...) ∧ ...
• Satisfiability, SAT Solver
• Backchaining: be able to do a simple problem
• Resolution: be able to do a simple problem

Vocabulary