fix(quandledb): complete KRL expansion — "resolution language" in self-referential uses

Title, abstract, conclusion in WHITEPAPER; safety model table; CHANGELOG;
EXPLAINME. Generic comparisons to SQL/GraphQL left as "query language".

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>

Author: hyperpolymath

quandledb/CHANGELOG.md

@@ -41,4 +41,4 @@ History preserved in the absorption commit message.
 - fix: replace Obj.magic with typed Fetch API bindings in Api.res
 - chore: batch RSR compliance
 - docs: KRL safety model — two-tier architecture with TypeLL levels
-- feat: KRL query language design — SQL compat + dependent type variants
+- feat: KRL resolution language design — SQL compat + dependent type variants

quandledb/EXPLAINME.adoc

@@ -29,7 +29,7 @@ This project *does NOT* do the following:
 
 * Compute invariants (Jones, Alexander, etc. — that's KnotTheory.jl's job)
 * Store raw diagrams (that's Skein.jl's job)
-* Parse KRL or any knot-specific query language
+* Parse KRL or any knot-specific resolution language
 * Implement Reidemeister moves
 
 == Why it exists
@@ -96,7 +96,7 @@ V API triples + Julia/Elixir service layer).
 |TangleIR definition + adapters
 |`../../KRLAdapter.jl`
 
-|KRL query language
+|KRL resolution language
 |`../../krl/` (forthcoming)
 |===
 

quandledb/WHITEPAPER.md

@@ -1,7 +1,7 @@
 # SPDX-License-Identifier: PMPL-1.0-or-later
 # Copyright (c) 2026 Jonathan D.A. Jewell (hyperpolymath) <j.d.a.jewell@open.ac.uk>
 
-# KRL: A Knot-Theoretic Query Language for Topological Data
+# KRL: A Knot-Theoretic Resolution Language for Topological Data
 
 **Author:** Jonathan D.A. Jewell
 **Version:** 1.0
@@ -12,7 +12,7 @@
 
 ## Abstract
 
-We present KRL (Knot Resolution Language), a domain-specific query language for
+We present KRL (Knot Resolution Language), a domain-specific resolution language for
 QuandleDB that treats mathematical equivalence as a first-class query primitive.
 Traditional database query languages (SQL, GraphQL, Cypher) model equality as a
 binary predicate: two values are either equal or not. This model is fundamentally
@@ -411,7 +411,7 @@ KRL demonstrates that domain-specific query languages can and should respect
 the mathematical structure of their data. For topological data, binary equality
 is the wrong abstraction. By grounding query semantics in HoTT identity types,
 executing queries via equality saturation, and carrying provenance through
-results, KRL provides a query language that is mathematically honest about
+results, KRL provides a resolution language that is mathematically honest about
 what it means for two knots to be "the same."
 
 The broader lesson is that the choice of equality model is a fundamental design

quandledb/docs/krl-safety-model.adoc

@@ -15,7 +15,7 @@ KRL (Knot Resolution Language) follows the same two-tier model as VCL:
 | Tier | What | How
 
 | **KRL**
-| The query language
+| The resolution language
 | Pipeline syntax (`from knots \| where ... \| return ...`), parsed and executed.
   What users write.