Follow the interface. Preserve the invariant. Extend the table.

Answer The pair is useful machinery, while the public idea is the interface. Keeping representation knowledge behind a stable interface makes later changes local instead of contagious.

Answer A vector uses an indexed sequence convention. vector-ref selects an item by position, while vector-set! changes one position without rebuilding the whole vector.

Answer The control structure mirrors the data definition. That correspondence is why the procedure works for a shallow list and a deeply nested tree without separate cases for each depth.

Answer The printed #0= label introduces the shared object and #0# refers to that same object again. The labels preserve identity that ordinary list notation would hide.

Answer accumulate combines the transformed sequence with + and the initial value 0. The complete program still recurses, but its control is distributed across reusable stages instead of fused into one special-purpose procedure.

Answer make-sum and make-product own representation cleanup. They remove additions by zero, multiplications by zero or one, and combine numeric operands, so the differentiation cases state their mathematical rules without repeating simplification details.

Answer apply-generic removes the tag only after get has selected the matching procedure. Client code names magnitude and supplies tagged data without asking which representation it contains. Adding a representation changes the table rather than the generic interface.

Answer Addition combines the two lower bounds and the two upper bounds. Multiplication must consider all four endpoint products because the smallest or largest result can come from a different corner when an interval crosses zero. The result is the interval enclosure of those possible products.

Answer union-ordered-set compares the two heads. It keeps the smaller one and advances that list; equal heads produce one element and advance both. Every recursive step consumes at least one current head, preserving sorted order without restarting a search from the beginning.

Answer Encoding asks whether the next symbol belongs to the left or right branch and records 0 or 1 before continuing below that branch. Decoding consumes the same decisions in the opposite direction. Reaching a leaf emits its symbol and returns to the root for the next code word. Equal weights can admit another valid tree; the explicit insertion rule fixes the tree used by these runs.

Answer The first program constructs 3 + 4i in both forms and asks the same four selectors to observe them. close? records that the inexact trigonometric path agrees within a stated tolerance. The second program adds through real and imaginary parts and deliberately returns a rectangular object, while multiplication combines magnitudes and angles and returns a polar object. Generic selectors verify the abstract results without exposing either object’s contents to the caller.

Answer The second program replaces pairwise coercion choices with an ordered tower. rank identifies integer, rational, and complex levels. raise performs only the next upward conversion, and raise-to repeats it until both values reach the higher input rank. Integer plus rational therefore uses rational addition; rational plus complex uses complex addition after one raise; an unrelated polynomial tag has no rank and returns no-common-type. A tower reduces ambiguity for these ordered types, but it does not imply that every data type belongs in one hierarchy or that downward projection is always lossless.

Answer The second program multiplies one term by every term in the other polynomial, shifts orders by addition, multiplies coefficients, and merges the partial products through add-terms. Multiplying x + 1 by x − 1 creates two middle terms that cancel, leaving x² − 1. A separate evaluator uses the package selectors and reports 8 at x = 3. This lesson models sparse univariate integer-coefficient polynomials with tagged addition, multiplication, normalization, and evaluation.

Answer The first run places one outline-and-cross painter inside a square frame. The second applies a diamond painter to a skewed frame. The painter definitions do not contain the final page coordinates. Each run prints one SEG line per mapped segment, and the app-local visualizer parses those transcript lines into a monochrome SVG. The returned (segments n) value remains a separate observation.

Answer The first run places four transformed chevrons in a square. The second defines right-split recursively: the left half keeps the original painter while the right half stacks two smaller copies. At depth three, a three-segment base painter produces 45 mapped segments. The visualizer draws exactly the SEG lines produced by Lispex and caps only the browser rendering, not the runtime’s own execution limits.

Answer The point example uses message dispatch. make-point returns a procedure that answers x, y, and sum messages. The selectors know only those messages. A conventional pair, a vector, or another closure could replace this implementation if the same observable constructor-selector behavior remains available.

Answer eq? asks whether its operands denote the same symbol or object identity. equal? descends through compound data and compares structure and leaves. The second program therefore distinguishes one shared list from a separate list with the same contents while still recognizing their structural equality.

Answer A binary search tree stores smaller entries on the left and larger entries on the right. Each comparison chooses one branch instead of scanning every entry. tree->list performs an in-order traversal and recovers an ordered sequence. The balanced hand-built tree demonstrates the search rule, while a one-sided tree exposes a linear path.

Answer The second program begins with only an integer description method. A rational value initially produces no-method. Installing one more table entry makes the same describe dispatcher accept it without editing the dispatcher or the integer package. Additivity here is explicit and finite: extension occurs by registering another method under a new key.

Answer drop attempts the reverse direction conservatively. A rational projects to an integer only when its denominator is 1. A complex value projects to its real component only when its imaginary component is exactly zero. The projected value is raised again and compared with the original before simplification continues, so a nonzero imaginary component cannot disappear.