Chapter 16. The Derived Stack
Six chapters have scored eight columns between them, and every column holds a failure. One column remains, scored on the same seven rows: the stack Part III revealed as RDF, SPARQL, XSLT and CSS. An audit that stopped here would have skipped exactly the technology the book argues for. This chapter scores it against the same seven properties. It is the audit with the least new work in it, and that is the finding: every cell below carries a citation to a result already proved.
When Chapter 11 scored the SPA, each score was an argument made in prose: the cell named its property, and disputing the score meant attacking that property. The cells below assert nothing new. R2’s ✓ is the union law (5.1), proved in Part II before the stack was named; S2’s ✓ is Theorem 8.2, proved in Part III. The part’s opening rule is that rejecting a score means rejecting a property. That rule reaches its hardest case here: each cell below names the proved result behind its score.
The three R-cells are the derivation itself, taken in the order Chapter 5 proved them: R2 first, then R3, then R1. R2 is the union law (5.1): merge is set union, total, order-free, idempotent, the only composition the coordination-free laws leave. R3 is (5.3): the first two positions of every fact lie in I, so reference is global by type rather than by discipline. R1 is Proposition 5.2 with Theorem 5.4: triples encode any domain, and any arity-minimal model satisfying all three requirements is isomorphic to this one. Chapter 5 defended the requirements one rejection at a time (reject R2 or R3 and you have built a silo), before any stack had been named, so the rows were not drawn to favor this column. The ✓s carry over because Chapter 8 proved the stack is the derived model, renamed.
The four S-cells draw on the two halves that met in Chapter 8: analysis and synthesis. From the analysis half, S1: it holds by construction of the factorization (4.3). From the synthesis half, S2 and S3: each factor denotes a term in a language with closed, cited semantics (SPARQL’s algebra, XSLT-over-canon, CSS) and terms with closed semantics substitute per factor (8.2). S4 draws on both halves. The factorization requires every stage value to be addressable (4.3), and the stack delivers that by construction: the graph, the query result, and the document each have a URI that dereferences (8.2). One qualification carries over with the theorem. Theorem 8.2 covers only transforms that are generic, meaning invariant under URI renaming (B.8): an arrange term must not treat particular URIs specially. The S2 and S3 ✓s therefore hold for that class of transforms, not for arbitrary code.
A self-scored column is suspect only if it leaves defects unstated, and Chapter 9 already stated them: four mismatches. The two model mismatches affect the rows most directly. Blank nodes weaken R2 slightly: idempotence holds up to logical equivalence rather than syntactic identity, and that cost is computed exactly (Prop. 9.1). Over ground facts the row holds exactly, and the composition laws still hold. The fourth position adds a requirement rather than removing a score: the web requires R4 (attribution), and the column meets R4 by moving to quads, where merge is still set union (Prop. 9.2). R4 is not a row below because no column in this part was scored on it; it is Chapter 9’s addition, and the quad model satisfies it.
The two platform mismatches leave every row’s score unchanged, because no row measures maintenance. The abandoned seam and the write-side last mile are deployment failures, and deployment failure is what this part has measured in every other column’s compensating industry. The stack’s own deployment failures are itemized in Chapter 9 as mismatches three and four. The mismatches do not soften the column. They are why it can be trusted: Chapter 9 stated all four openly before this audit began.
Derived stack
| Derived stack | |
|---|---|
| R1 | ✓ — encodes any domain; the model is forced (5.2, 5.4) |
| R2 | ✓ — merge is set union: total, order-free, idempotent (5.1) |
| R3 | ✓ — reference is global by type: the first two positions lie in I (5.3) |
| S1 | ✓ — factor boundaries by construction (4.3) |
| S2 | ✓ — each factor a term with closed, cited semantics (8.2) |
| S3 | ✓ — terms substitute per factor (8.2) |
| S4 | ✓ — every stage value dereferences (4.3, 8.2) |