@proposit/proposit-core 0.12.3 → 1.0.1

package/dist/lib/grammar/validators/evaluable.js

@@ -0,0 +1,226 @@
+// Evaluable-tier validators (E-1, E-3..E-7). Code 'E-2' is reserved — see
+// spec §4.2 (formula non-emptiness was promoted to Structural as S-13).
+//
+// E-1  variadic operator arity floor (and/or have ≥ 2 children)
+// E-3  variable binding resolves
+// E-4  axiomatic-binding constraint (runtime guard; AST-level no-op,
+//      documented in JSDoc)
+// E-5  derivation premise consequent present
+// E-6  claim-derivation pairing (≤ 1 derivation premise per normal claim)
+// E-7  argument has conclusion premise
+import { isClaimBound, isPremiseBound } from "../../schemata/propositional.js";
+/**
+ * Build a Map<parentId, child-count> view of the expression tree.
+ * Used by the variadic-arity validator E-1.
+ */
+function childCounts(expressions) {
+    const out = new Map();
+    for (const e of expressions) {
+        if (e.parentId === null)
+            continue;
+        out.set(e.parentId, (out.get(e.parentId) ?? 0) + 1);
+    }
+    return out;
+}
+/**
+ * E-1 — Variadic operator arity floor. `and` and `or` each have at least
+ * two children. (Unary `not`/`formula` are constrained Structurally per
+ * S-12/S-13; binary `implies`/`iff` per S-8.)
+ */
+export function validateE1(ctx) {
+    const violations = [];
+    const counts = childCounts(ctx.expressions);
+    for (const e of ctx.expressions) {
+        if (e.type !== "operator")
+            continue;
+        if (e.operator !== "and" && e.operator !== "or")
+            continue;
+        const count = counts.get(e.id) ?? 0;
+        if (count < 2) {
+            violations.push({
+                tier: "evaluable",
+                code: "E-1",
+                message: `${e.operator} expression ${e.id} has ${count} children (variadic operator requires ≥ 2)`,
+                argumentId: ctx.argument.id,
+                premiseId: e.premiseId,
+                expressionId: e.id,
+            });
+        }
+    }
+    return violations;
+}
+// 'E-2' reserved — not used.
+/**
+ * E-3 — Variable binding resolves. Every variable's claim or premise
+ * reference points at an existing target. External premise bindings
+ * (`boundArgumentId !== argument.id`) resolve in a different argument
+ * and are out of scope here — those targets aren't in this context.
+ */
+export function validateE3(ctx) {
+    const violations = [];
+    const premiseIds = new Set(ctx.premises.map((p) => p.id));
+    const claimIds = new Set(ctx.claims.map((c) => c.id));
+    for (const v of ctx.variables) {
+        const variableId = v.id;
+        if (isClaimBound(v)) {
+            if (!claimIds.has(v.claimId)) {
+                violations.push({
+                    tier: "evaluable",
+                    code: "E-3",
+                    message: `variable ${variableId} claim binding ${v.claimId} does not resolve`,
+                    argumentId: ctx.argument.id,
+                    variableId,
+                    claimId: v.claimId,
+                });
+            }
+        }
+        else if (isPremiseBound(v)) {
+            if (v.boundArgumentId === ctx.argument.id &&
+                !premiseIds.has(v.boundPremiseId)) {
+                violations.push({
+                    tier: "evaluable",
+                    code: "E-3",
+                    message: `variable ${variableId} premise binding ${v.boundPremiseId} does not resolve`,
+                    argumentId: ctx.argument.id,
+                    variableId,
+                    premiseId: v.boundPremiseId,
+                });
+            }
+        }
+    }
+    return violations;
+}
+/**
+ * E-4 — Axiomatic-binding constraint. Axiomatic-bound variables must not
+ * be assigned in the caller's evaluation input. This is a **runtime
+ * guard** on caller-supplied input, not an AST invariant — the check
+ * runs inside `ArgumentEngine.evaluate` / `.checkValidity` and rejects
+ * pre-flight with the engine-error code `AXIOM_VARIABLE_ASSIGNMENT_FORBIDDEN`.
+ * The AST-level validator cannot detect E-4 from the argument tree alone
+ * and intentionally returns an empty array.
+ */
+export function validateE4(_ctx) {
+    return [];
+}
+/**
+ * E-5 — Derivation premise consequent present. Every `type='derivation'`
+ * premise's expression tree includes a variable bound to its
+ * `derivedClaimId`. Naked-Q satisfies this (the lone variable at the
+ * root *is* the consequent).
+ */
+export function validateE5(ctx) {
+    const violations = [];
+    // Build variable lookup: variableId → claimId (for claim-bound only).
+    const varToClaim = new Map();
+    for (const v of ctx.variables) {
+        if (isClaimBound(v))
+            varToClaim.set(v.id, v.claimId);
+    }
+    // Group expressions by premise.
+    const exprsByPremise = new Map();
+    for (const e of ctx.expressions) {
+        const list = exprsByPremise.get(e.premiseId) ?? [];
+        list.push(e);
+        exprsByPremise.set(e.premiseId, list);
+    }
+    for (const p of ctx.premises) {
+        if (p.type !== "derivation")
+            continue;
+        const exprs = exprsByPremise.get(p.id) ?? [];
+        const hasConsequent = exprs.some((e) => e.type === "variable" &&
+            varToClaim.get(e.variableId) === p.derivedClaimId);
+        if (!hasConsequent) {
+            violations.push({
+                tier: "evaluable",
+                code: "E-5",
+                message: `derivation premise ${p.id} has no variable bound to derivedClaimId ${p.derivedClaimId}`,
+                argumentId: ctx.argument.id,
+                premiseId: p.id,
+                claimId: p.derivedClaimId,
+            });
+        }
+    }
+    return violations;
+}
+/**
+ * E-6 — Claim-derivation pairing. For every `type='normal'` claim
+ * referenced in the argument, at most one `type='derivation'` premise
+ * exists with `derivedClaimId` matching that claim. Zero is valid (the
+ * post-publish-pruning state); two or more is the violation.
+ */
+export function validateE6(ctx) {
+    const violations = [];
+    const byDerivedClaim = new Map();
+    for (const p of ctx.premises) {
+        if (p.type !== "derivation")
+            continue;
+        const list = byDerivedClaim.get(p.derivedClaimId) ?? [];
+        list.push(p.id);
+        byDerivedClaim.set(p.derivedClaimId, list);
+    }
+    for (const [claimId, premiseIds] of byDerivedClaim) {
+        if (premiseIds.length > 1) {
+            // Every premise in a >1-group is in violation — "at most one"
+            // has no canonical "first" that's correct and the rest wrong.
+            // Consumers wanting first-wins can dedupe by claimId at the UI
+            // layer. Matches the parallel decision in S-5 (root-only
+            // IMPLIES/IFF) from the B1 review polish.
+            for (const offendingId of premiseIds) {
+                violations.push({
+                    tier: "evaluable",
+                    code: "E-6",
+                    message: `claim ${claimId} has ${premiseIds.length} derivation premises (expected ≤ 1; offender: ${offendingId})`,
+                    argumentId: ctx.argument.id,
+                    premiseId: offendingId,
+                    claimId,
+                });
+            }
+        }
+    }
+    return violations;
+}
+/**
+ * E-7 — Argument has conclusion premise. An argument that has at least
+ * one premise has exactly one premise designated as the conclusion via
+ * `roleState.conclusionPremiseId`. A brand-new argument with zero
+ * premises is exempt.
+ */
+export function validateE7(ctx) {
+    if (ctx.premises.length === 0)
+        return [];
+    const conclusionId = ctx.roleState.conclusionPremiseId;
+    if (conclusionId === undefined) {
+        return [
+            {
+                tier: "evaluable",
+                code: "E-7",
+                message: "argument has premises but no conclusion designated",
+                argumentId: ctx.argument.id,
+            },
+        ];
+    }
+    const found = ctx.premises.some((p) => p.id === conclusionId);
+    if (!found) {
+        return [
+            {
+                tier: "evaluable",
+                code: "E-7",
+                message: `conclusionPremiseId ${conclusionId} does not match any premise`,
+                argumentId: ctx.argument.id,
+                premiseId: conclusionId,
+            },
+        ];
+    }
+    return [];
+}
+export function validateEvaluable(ctx) {
+    return [
+        ...validateE1(ctx),
+        ...validateE3(ctx),
+        ...validateE4(ctx),
+        ...validateE5(ctx),
+        ...validateE6(ctx),
+        ...validateE7(ctx),
+    ];
+}
+//# sourceMappingURL=evaluable.js.map

package/dist/lib/grammar/validators/evaluable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluable.js","sourceRoot":"","sources":["../../../../src/lib/grammar/validators/evaluable.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,wEAAwE;AACxE,EAAE;AACF,gEAAgE;AAChE,iCAAiC;AACjC,qEAAqE;AACrE,4BAA4B;AAC5B,6CAA6C;AAC7C,0EAA0E;AAC1E,uCAAuC;AAIvC,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAA;AAE9E;;;GAGG;AACH,SAAS,WAAW,CAChB,WAAgE;IAEhE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAA;IACrC,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAQ;QACjC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IACvD,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAC3C,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QACnC,IAAI,CAAC,CAAC,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAQ;QACzD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;QACnC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACZ,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,GAAG,CAAC,CAAC,QAAQ,eAAe,CAAC,CAAC,EAAE,QAAQ,KAAK,4CAA4C;gBAClG,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,YAAY,EAAE,CAAC,CAAC,EAAE;aACrB,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED,6BAA6B;AAE7B;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACzD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACrD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,CAAC,CAAC,EAAE,CAAA;QACvB,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC3B,UAAU,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,WAAW;oBACjB,IAAI,EAAE,KAAK;oBACX,OAAO,EAAE,YAAY,UAAU,kBAAkB,CAAC,CAAC,OAAO,mBAAmB;oBAC7E,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;oBAC3B,UAAU;oBACV,OAAO,EAAE,CAAC,CAAC,OAAO;iBACrB,CAAC,CAAA;YACN,CAAC;QACL,CAAC;aAAM,IAAI,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3B,IACI,CAAC,CAAC,eAAe,KAAK,GAAG,CAAC,QAAQ,CAAC,EAAE;gBACrC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,EACnC,CAAC;gBACC,UAAU,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,WAAW;oBACjB,IAAI,EAAE,KAAK;oBACX,OAAO,EAAE,YAAY,UAAU,oBAAoB,CAAC,CAAC,cAAc,mBAAmB;oBACtF,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;oBAC3B,UAAU;oBACV,SAAS,EAAE,CAAC,CAAC,cAAc;iBAC9B,CAAC,CAAA;YACN,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CAAC,IAAuB;IAC9C,OAAO,EAAE,CAAA;AACb,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,sEAAsE;IACtE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC5C,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;QAC5B,IAAI,YAAY,CAAC,CAAC,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAA;IACxD,CAAC;IACD,gCAAgC;IAChC,MAAM,cAAc,GAAG,IAAI,GAAG,EAA8C,CAAA;IAC5E,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,CAAA;QAClD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACZ,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAA;IACzC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;YAAE,SAAQ;QACrC,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QAC5C,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAC5B,CAAC,CAAC,EAAE,EAAE,CACF,CAAC,CAAC,IAAI,KAAK,UAAU;YACrB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,cAAc,CACxD,CAAA;QACD,IAAI,CAAC,aAAa,EAAE,CAAC;YACjB,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,4CAA4C,CAAC,CAAC,cAAc,EAAE;gBACjG,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;gBACf,OAAO,EAAE,CAAC,CAAC,cAAc;aAC5B,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoB,CAAA;IAClD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;YAAE,SAAQ;QACrC,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,EAAE,CAAA;QACvD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;QACf,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAA;IAC9C,CAAC;IACD,KAAK,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,IAAI,cAAc,EAAE,CAAC;QACjD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,8DAA8D;YAC9D,8DAA8D;YAC9D,+DAA+D;YAC/D,yDAAyD;YACzD,0CAA0C;YAC1C,KAAK,MAAM,WAAW,IAAI,UAAU,EAAE,CAAC;gBACnC,UAAU,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,WAAW;oBACjB,IAAI,EAAE,KAAK;oBACX,OAAO,EAAE,SAAS,OAAO,QAAQ,UAAU,CAAC,MAAM,iDAAiD,WAAW,GAAG;oBACjH,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;oBAC3B,SAAS,EAAE,WAAW;oBACtB,OAAO;iBACV,CAAC,CAAA;YACN,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IACxC,MAAM,YAAY,GAAG,GAAG,CAAC,SAAS,CAAC,mBAAmB,CAAA;IACtD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO;YACH;gBACI,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,oDAAoD;gBAC7D,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;aAC9B;SACJ,CAAA;IACL,CAAC;IACD,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,YAAY,CAAC,CAAA;IAC7D,IAAI,CAAC,KAAK,EAAE,CAAC;QACT,OAAO;YACH;gBACI,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,uBAAuB,YAAY,6BAA6B;gBACzE,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,YAAY;aAC1B;SACJ,CAAA;IACL,CAAC;IACD,OAAO,EAAE,CAAA;AACb,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC7B,GAAsB;IAEtB,OAAO;QACH,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;KACrB,CAAA;AACL,CAAC"}

package/dist/lib/grammar/validators/presentable.d.ts

@@ -0,0 +1,45 @@
+import type { TViolation } from "../types.js";
+import type { TValidatorContext } from "./context.js";
+/**
+ * P-1 — Formula buffer between operators. A non-`not` operator (`and`,
+ * `or`, `implies`, `iff`) is never a direct child of another operator
+ * expression. `not` is exempt — it can be a direct child of any
+ * operator.
+ *
+ * Reports the inner (child) operator that breaks the rule, with the
+ * outer (parent) operator referenced in the message.
+ */
+export declare function validateP1(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * P-2 — No double negation. `not(not(x))` does not appear in the tree.
+ * Reports the outer NOT.
+ */
+export declare function validateP2(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * P-3 — Formula has operator descendant. A `formula` node's bounded
+ * subtree (stopping at the next nested formula) contains at least one
+ * binary operator (`and` or `or`). Formulas wrapping a leaf or a single
+ * `not` chain are not Presentable.
+ */
+export declare function validateP3(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * P-4 — No single-child binary operator. `and` / `or` with exactly one
+ * child is not Presentable. Largely redundant with E-1 (variadic arity
+ * ≥ 2), kept for clarity in the rule inventory.
+ */
+export declare function validateP4(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * P-5 — No operator-of-same-type adjacency through a formula. When a
+ * parent operator (`and` / `or`) has a `formula` child whose only
+ * descendant operator (after peeling through transparent formula
+ * buffers) is the same operator, the inner operator should be absorbed
+ * into the parent.
+ *
+ * Example: `AND(formula(AND(b, c)), d)` should be `AND(b, c, d)`.
+ *
+ * The rule applies to `and` / `or` only — `implies` / `iff` are root-
+ * only per S-5 and cannot appear as a child operator.
+ */
+export declare function validateP5(ctx: TValidatorContext): readonly TViolation[];
+export declare function validatePresentable(ctx: TValidatorContext): readonly TViolation[];
+//# sourceMappingURL=presentable.d.ts.map

package/dist/lib/grammar/validators/presentable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"presentable.d.ts","sourceRoot":"","sources":["../../../../src/lib/grammar/validators/presentable.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAA;AAqCrD;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAoBxE;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAoBxE;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAwBxE;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAmBxE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAuBxE;AA8BD,wBAAgB,mBAAmB,CAC/B,GAAG,EAAE,iBAAiB,GACvB,SAAS,UAAU,EAAE,CAQvB"}

package/dist/lib/grammar/validators/presentable.js

@@ -0,0 +1,231 @@
+// Presentable-tier validators (P-1..P-5).
+//
+// P-1 formula buffer between operators
+// P-2 no double negation
+// P-3 formula has operator descendant
+// P-4 no single-child binary operator (largely redundant with E-1, kept
+//     for clarity in the rule inventory)
+// P-5 no operator-of-same-type adjacency through a formula
+import { hasBinaryOperatorInBoundedSubtree } from "../bounded-subtree.js";
+/**
+ * Build a Map<parentId, children-sorted-by-position> view of the
+ * expression tree.
+ */
+function buildChildMap(expressions) {
+    const out = new Map();
+    for (const e of expressions) {
+        if (e.parentId === null)
+            continue;
+        const list = out.get(e.parentId) ?? [];
+        list.push(e);
+        out.set(e.parentId, list);
+    }
+    for (const list of out.values()) {
+        list.sort((a, b) => a.position - b.position);
+    }
+    return out;
+}
+/**
+ * Map<expressionId, expression> view for quick lookup.
+ */
+function buildExpressionsById(expressions) {
+    const out = new Map();
+    for (const e of expressions)
+        out.set(e.id, e);
+    return out;
+}
+/**
+ * P-1 — Formula buffer between operators. A non-`not` operator (`and`,
+ * `or`, `implies`, `iff`) is never a direct child of another operator
+ * expression. `not` is exempt — it can be a direct child of any
+ * operator.
+ *
+ * Reports the inner (child) operator that breaks the rule, with the
+ * outer (parent) operator referenced in the message.
+ */
+export function validateP1(ctx) {
+    const violations = [];
+    const byId = buildExpressionsById(ctx.expressions);
+    for (const e of ctx.expressions) {
+        if (e.type !== "operator")
+            continue;
+        if (e.operator === "not")
+            continue;
+        if (e.parentId === null)
+            continue;
+        const parent = byId.get(e.parentId);
+        if (parent === undefined)
+            continue;
+        if (parent.type !== "operator")
+            continue;
+        violations.push({
+            tier: "presentable",
+            code: "P-1",
+            message: `${e.operator} expression ${e.id} is a direct child of operator ${parent.operator} ${parent.id} (formula buffer required)`,
+            argumentId: ctx.argument.id,
+            premiseId: e.premiseId,
+            expressionId: e.id,
+        });
+    }
+    return violations;
+}
+/**
+ * P-2 — No double negation. `not(not(x))` does not appear in the tree.
+ * Reports the outer NOT.
+ */
+export function validateP2(ctx) {
+    const violations = [];
+    const children = buildChildMap(ctx.expressions);
+    for (const outer of ctx.expressions) {
+        if (outer.type !== "operator" || outer.operator !== "not")
+            continue;
+        const kids = children.get(outer.id) ?? [];
+        if (kids.length !== 1)
+            continue;
+        const child = kids[0];
+        if (child.type === "operator" && child.operator === "not") {
+            violations.push({
+                tier: "presentable",
+                code: "P-2",
+                message: `not expression ${outer.id} wraps another not (${child.id})`,
+                argumentId: ctx.argument.id,
+                premiseId: outer.premiseId,
+                expressionId: outer.id,
+            });
+        }
+    }
+    return violations;
+}
+/**
+ * P-3 — Formula has operator descendant. A `formula` node's bounded
+ * subtree (stopping at the next nested formula) contains at least one
+ * binary operator (`and` or `or`). Formulas wrapping a leaf or a single
+ * `not` chain are not Presentable.
+ */
+export function validateP3(ctx) {
+    const violations = [];
+    const children = buildChildMap(ctx.expressions);
+    const exprById = new Map();
+    for (const e of ctx.expressions)
+        exprById.set(e.id, e);
+    const lookup = (id) => children.get(id) ?? [];
+    const getExpression = (id) => exprById.get(id);
+    for (const f of ctx.expressions) {
+        if (f.type !== "formula")
+            continue;
+        if (!hasBinaryOperatorInBoundedSubtree(f.id, lookup, getExpression)) {
+            violations.push({
+                tier: "presentable",
+                code: "P-3",
+                message: `formula ${f.id} has no binary operator (and/or) descendant in its bounded subtree`,
+                argumentId: ctx.argument.id,
+                premiseId: f.premiseId,
+                expressionId: f.id,
+            });
+        }
+    }
+    return violations;
+}
+/**
+ * P-4 — No single-child binary operator. `and` / `or` with exactly one
+ * child is not Presentable. Largely redundant with E-1 (variadic arity
+ * ≥ 2), kept for clarity in the rule inventory.
+ */
+export function validateP4(ctx) {
+    const violations = [];
+    const children = buildChildMap(ctx.expressions);
+    for (const e of ctx.expressions) {
+        if (e.type !== "operator")
+            continue;
+        if (e.operator !== "and" && e.operator !== "or")
+            continue;
+        const count = (children.get(e.id) ?? []).length;
+        if (count === 1) {
+            violations.push({
+                tier: "presentable",
+                code: "P-4",
+                message: `${e.operator} expression ${e.id} has a single child`,
+                argumentId: ctx.argument.id,
+                premiseId: e.premiseId,
+                expressionId: e.id,
+            });
+        }
+    }
+    return violations;
+}
+/**
+ * P-5 — No operator-of-same-type adjacency through a formula. When a
+ * parent operator (`and` / `or`) has a `formula` child whose only
+ * descendant operator (after peeling through transparent formula
+ * buffers) is the same operator, the inner operator should be absorbed
+ * into the parent.
+ *
+ * Example: `AND(formula(AND(b, c)), d)` should be `AND(b, c, d)`.
+ *
+ * The rule applies to `and` / `or` only — `implies` / `iff` are root-
+ * only per S-5 and cannot appear as a child operator.
+ */
+export function validateP5(ctx) {
+    const violations = [];
+    const children = buildChildMap(ctx.expressions);
+    for (const parent of ctx.expressions) {
+        if (parent.type !== "operator")
+            continue;
+        if (parent.operator !== "and" && parent.operator !== "or")
+            continue;
+        const parentOp = parent.operator;
+        for (const child of children.get(parent.id) ?? []) {
+            if (child.type !== "formula")
+                continue;
+            const innerOp = singleOperatorInsideFormula(child, children);
+            if (innerOp === parentOp) {
+                violations.push({
+                    tier: "presentable",
+                    code: "P-5",
+                    message: `${parentOp} expression ${parent.id} has a formula child ${child.id} whose inner operator is the same (${innerOp}); absorb`,
+                    argumentId: ctx.argument.id,
+                    premiseId: parent.premiseId,
+                    expressionId: child.id,
+                });
+            }
+        }
+    }
+    return violations;
+}
+/**
+ * Returns the operator kind (`and` / `or` / `implies` / `iff`) of the
+ * single operator expression inside a `formula`'s bounded subtree —
+ * stopping at any nested formula. Returns `undefined` if the formula
+ * contains no operator, or more than one operator at the same level,
+ * or contains a `not` operator anywhere (different shape; not the
+ * absorption case P-5 targets).
+ *
+ * This is a deliberate simplification: P-5 fires on the canonical
+ * `parent(formula(sameOp(...)))` shape where the formula immediately
+ * wraps a single operator of the same kind as the parent. More complex
+ * mixed-operator-under-formula shapes are not the absorbable case.
+ */
+function singleOperatorInsideFormula(formula, children) {
+    const kids = children.get(formula.id) ?? [];
+    if (kids.length !== 1)
+        return undefined;
+    const inner = kids[0];
+    if (inner.type !== "operator")
+        return undefined;
+    // Exclude `not` — P-5 targets the absorption case where the parent
+    // and inner operators are the same `and` / `or` / `implies` / `iff`
+    // kind. A NOT inside the formula is a different shape (not absorbable).
+    if (inner.operator === "not")
+        return undefined;
+    return inner.operator;
+}
+export function validatePresentable(ctx) {
+    return [
+        ...validateP1(ctx),
+        ...validateP2(ctx),
+        ...validateP3(ctx),
+        ...validateP4(ctx),
+        ...validateP5(ctx),
+    ];
+}
+//# sourceMappingURL=presentable.js.map

package/dist/lib/grammar/validators/presentable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"presentable.js","sourceRoot":"","sources":["../../../../src/lib/grammar/validators/presentable.ts"],"names":[],"mappings":"AAAA,0CAA0C;AAC1C,EAAE;AACF,uCAAuC;AACvC,yBAAyB;AACzB,sCAAsC;AACtC,wEAAwE;AACxE,yCAAyC;AACzC,2DAA2D;AAK3D,OAAO,EAAE,iCAAiC,EAAE,MAAM,uBAAuB,CAAA;AAIzE;;;GAGG;AACH,SAAS,aAAa,CAClB,WAAoD;IAEpD,MAAM,GAAG,GAAc,IAAI,GAAG,EAAE,CAAA;IAChC,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAQ;QACjC,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;QACtC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACZ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;IAC7B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAA;IAChD,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CACzB,WAAoD;IAEpD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAwC,CAAA;IAC3D,KAAK,MAAM,CAAC,IAAI,WAAW;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;IAC7C,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,IAAI,GAAG,oBAAoB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAClD,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QACnC,IAAI,CAAC,CAAC,QAAQ,KAAK,KAAK;YAAE,SAAQ;QAClC,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAQ;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAA;QACnC,IAAI,MAAM,KAAK,SAAS;YAAE,SAAQ;QAClC,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QACxC,UAAU,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,aAAa;YACnB,IAAI,EAAE,KAAK;YACX,OAAO,EAAE,GAAG,CAAC,CAAC,QAAQ,eAAe,CAAC,CAAC,EAAE,kCAAkC,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,EAAE,4BAA4B;YACnI,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;YAC3B,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,YAAY,EAAE,CAAC,CAAC,EAAE;SACrB,CAAC,CAAA;IACN,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAC/C,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK;YAAE,SAAQ;QACnE,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QACzC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACrB,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;YACxD,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,aAAa;gBACnB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,kBAAkB,KAAK,CAAC,EAAE,uBAAuB,KAAK,CAAC,EAAE,GAAG;gBACrE,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,YAAY,EAAE,KAAK,CAAC,EAAE;aACzB,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwC,CAAA;IAChE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;IACtD,MAAM,MAAM,GAAG,CAAC,EAAU,EAA2C,EAAE,CACnE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;IAC1B,MAAM,aAAa,GAAG,CAClB,EAAU,EAC8B,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IAC/D,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;YAAE,SAAQ;QAClC,IAAI,CAAC,iCAAiC,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,aAAa,CAAC,EAAE,CAAC;YAClE,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,aAAa;gBACnB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,WAAW,CAAC,CAAC,EAAE,oEAAoE;gBAC5F,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,YAAY,EAAE,CAAC,CAAC,EAAE;aACrB,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAC/C,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QACnC,IAAI,CAAC,CAAC,QAAQ,KAAK,KAAK,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAQ;QACzD,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAA;QAC/C,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YACd,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,aAAa;gBACnB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,GAAG,CAAC,CAAC,QAAQ,eAAe,CAAC,CAAC,EAAE,qBAAqB;gBAC9D,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,YAAY,EAAE,CAAC,CAAC,EAAE;aACrB,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAC/C,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QACnC,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QACxC,IAAI,MAAM,CAAC,QAAQ,KAAK,KAAK,IAAI,MAAM,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAQ;QACnE,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAA;QAChC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAChD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;gBAAE,SAAQ;YACtC,MAAM,OAAO,GAAG,2BAA2B,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;YAC5D,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;gBACvB,UAAU,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,aAAa;oBACnB,IAAI,EAAE,KAAK;oBACX,OAAO,EAAE,GAAG,QAAQ,eAAe,MAAM,CAAC,EAAE,wBAAwB,KAAK,CAAC,EAAE,sCAAsC,OAAO,WAAW;oBACpI,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;oBAC3B,SAAS,EAAE,MAAM,CAAC,SAAS;oBAC3B,YAAY,EAAE,KAAK,CAAC,EAAE;iBACzB,CAAC,CAAA;YACN,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,2BAA2B,CAChC,OAAqC,EACrC,QAAmB;IAEnB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;IAC3C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;IACrB,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,SAAS,CAAA;IAC/C,mEAAmE;IACnE,oEAAoE;IACpE,wEAAwE;IACxE,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK;QAAE,OAAO,SAAS,CAAA;IAC9C,OAAO,KAAK,CAAC,QAAQ,CAAA;AACzB,CAAC;AAED,MAAM,UAAU,mBAAmB,CAC/B,GAAsB;IAEtB,OAAO;QACH,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;KACrB,CAAA;AACL,CAAC"}

package/dist/lib/grammar/validators/structural.d.ts

@@ -0,0 +1,103 @@
+import type { TViolation } from "../types.js";
+import type { TValidatorContext } from "./context.js";
+/**
+ * S-1 — FK soundness.
+ *
+ * For every entity in the context, check that its foreign-key fields
+ * resolve to an existing target:
+ * - `expression.parentId` (when non-null) resolves to another expression
+ *   in the context.
+ * - Claim-bound variable's `claimId` resolves to a claim in the context.
+ * - Premise-bound variable's `boundPremiseId` resolves to a premise in the
+ *   context **only when** the binding is internal
+ *   (`boundArgumentId === argument.id`); externally-bound variables
+ *   resolve in a different argument and are not S-1's concern.
+ *
+ * Premise `argumentId`/`argumentVersion` matching its container argument
+ * is checked here too (same-FK-soundness umbrella).
+ */
+export declare function validateS1(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-2 — Operator types. Every expression's `type` is one of `variable`,
+ * `operator`, `formula`. For operator-typed expressions, the `operator`
+ * field is one of `not`, `and`, `or`, `implies`, `iff`.
+ */
+export declare function validateS2(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-3 — Variable required reference. Every variable has either a claim ref
+ * or a premise ref, not both, not neither.
+ */
+export declare function validateS3(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-4 — No cycles. The expression tree of every premise (parent-pointer
+ * graph) is acyclic.
+ */
+export declare function validateS4(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-5 — Root-only IMPLIES/IFF. Within a single premise's AST, `implies`
+ * and `iff` may appear at most once and only at the root (parentId === null).
+ */
+export declare function validateS5(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-6 — Premise type discriminator consistency. `type='derivation'`
+ * premises have a non-null `derivedClaimId`; `type='freeform'` premises
+ * have no `derivedClaimId` (or it is null/undefined).
+ *
+ * `TCoreFreeformPremise` and `TCoreDerivationPremise` are both
+ * `additionalProperties: true` in their TypeBox schemas, so a freeform
+ * premise CAN carry a stray `derivedClaimId` field at runtime even
+ * though the TS shape doesn't surface it. We use the `in` operator and
+ * a narrow shape cast to read the field as `unknown` rather than the
+ * earlier `as unknown` double-cast.
+ */
+export declare function validateS6(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-7 — Claim type immutability. Creation-time invariant enforced by
+ * `ClaimLibrary.update()` via the engine-error code `CLAIM_TYPE_IMMUTABLE`.
+ * The AST-level validator is intentionally a no-op; callers cannot
+ * observe a type-mutation event from a static argument snapshot.
+ */
+export declare function validateS7(_ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-8 — Binary operator arity + positions. `implies` and `iff` have
+ * exactly 2 children, at positions `0` and `1`.
+ *
+ * One violation per binary expression. When arity is wrong the position
+ * check is skipped — position invariants are only meaningful for an
+ * exactly-2-child shape; reporting both would noise the violation list
+ * with the same structural problem.
+ */
+export declare function validateS8(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-9 — Sibling position uniqueness. Within a single parent's children,
+ * no two siblings share the same `position`.
+ */
+export declare function validateS9(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-10 — Entity ID uniqueness. Within an argument, premises, expressions,
+ * and variables each have unique IDs in their respective collection.
+ */
+export declare function validateS10(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-11 — Variable symbol uniqueness. Within a single argument, no two
+ * variables share the same `symbol`.
+ */
+export declare function validateS11(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-12 — NOT unary arity. Every `not` expression has exactly one child.
+ */
+export declare function validateS12(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-13 — Formula unary arity. Every `formula` expression has exactly one
+ * child.
+ */
+export declare function validateS13(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * S-14 — Derivation premise root operator. Every `type='derivation'`
+ * premise's root expression is one of `variable`, `implies`, or `iff`.
+ * (`iff` is Structurally allowed; D-1 narrows the populated form to
+ * `implies` only — Derivable concern.)
+ */
+export declare function validateS14(ctx: TValidatorContext): readonly TViolation[];
+export declare function validateStructural(ctx: TValidatorContext): readonly TViolation[];
+//# sourceMappingURL=structural.d.ts.map

package/dist/lib/grammar/validators/structural.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"structural.d.ts","sourceRoot":"","sources":["../../../../src/lib/grammar/validators/structural.ts"],"names":[],"mappings":"AAoBA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAA;AAGrD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAqExE;AAQD;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAiCxE;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CA6BxE;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CA+BxE;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CA8CxE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAkCxE;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAEzE;AAqBD;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CA+BxE;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAkCxE;AAiBD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CA8BzE;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAkBzE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAkBzE;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAkBzE;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAuCzE;AAED,wBAAgB,kBAAkB,CAC9B,GAAG,EAAE,iBAAiB,GACvB,SAAS,UAAU,EAAE,CAiBvB"}