aontu 0.52.1 → 0.54.0

package/dist/val/PrefVal.js

@@ -2,59 +2,130 @@
 /* Copyright (c) 2021-2025 Richard Rodger, MIT License */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.PrefVal = void 0;
+exports.prefInnerPeg = prefInnerPeg;
 const type_1 = require("../type");
 const unify_1 = require("../unify");
 const err_1 = require("../err");
 const utility_1 = require("../utility");
 const top_1 = require("./top");
 const FeatureVal_1 = require("./FeatureVal");
-const ScalarKindVal_1 = require("./ScalarKindVal");
+const FuncBaseVal_1 = require("./FuncBaseVal");
+const SuperFuncVal_1 = require("./SuperFuncVal");
+// The innermost preferred value under every pref layer: the value a
+// preference of ANY rank ultimately defends, and the one generation
+// emits for it. Shared by the disjunct admission gate (DisjunctVal),
+// the defaulted-scrutinee rule (MatchFuncVal) and the effective-default
+// walk (subsume.ts) so "the default's value" cannot mean three things.
+function prefInnerPeg(v) {
+    let out = v;
+    while (true === out?.isPref) {
+        out = out.peg;
+    }
+    return out;
+}
+// A CONTAINER DEFAULT IS LEAFWISE (ADR-011 R3,
+// docs/design/DEFAULTS.0.md): `*{p:1}` MEANS `{p: *1}` and `*[1]`
+// means `[*1]`, so there is no such thing as a preference whose
+// preferred value is a bag. Shape is not a value and takes no star --
+// key optionality, closedness and a `&:` spread template ride through
+// untouched; only the values a reader could override are defaulted.
+//
+// This is the rule `pref()` already had (its resolve walked and
+// wrapped every scalar child) and the star prefix did not, so the two
+// spellings of one operator disagreed: `pref({p:1}) & {q:2}` kept the
+// `p` default and `*{p:1} & {q:2}` dropped it. Both spellings and the
+// resolve-time case (`*$.shape`) come through here now, so they
+// cannot drift apart again. Wrapping the non-bag arm rather than
+// walking for scalars also closes the other half of that gap:
+// `pref(integer)` and `pref(min(3))` used to answer the bare value,
+// losing the preference outright.
 class PrefVal extends FeatureVal_1.FeatureVal {
     constructor(spec, ctx) {
         super(spec, ctx);
         this.isPref = true;
         this.isGenable = true;
         this.cjo = 30000;
+        // THE GATE AN OVERRIDING PEER MUST PASS IS `superpeg` ITSELF — the
+        // preferred value's own KIND, not its family.
+        //
+        // A preference is a DEFAULT, so a concrete peer replaces it, but only
+        // where the peer is the same kind of thing: `*lower(1.1) & a` is a
+        // conflict, not an override. The number tower made `integer` and
+        // `float` disjoint siblings under `number`, and this gate used to
+        // widen to that family — so `*2.2 & 3` worked, and so did
+        // `*8080 & 3.5`. Those are ONE rule in two directions; no kind-based
+        // gate can keep the first and refuse the second.
+        //
+        // Refusing both is the choice, because the second is the documented
+        // default idiom: `port: *8080 | integer` accepted 3.5 in both ports,
+        // silently widening every key written that way from integer to
+        // number — the finding §6 of the 2026-08-21 status report calls the
+        // most consequential, precisely because docs/skill/examples.md
+        // teaches the idiom to agents.
+        //
+        // What the tightening costs is named rather than hidden: mixing the
+        // numeric leaves around a preference is now an error instead of a
+        // silent widening. `*1.5 & integer` used to answer `integer` and
+        // DISCARD a default that could never apply; it now says so.
         this.rank = 0;
         // this.pref = spec.pref || spec.peg
         // this.superpeg = makeSuper(spec.peg)
         if (spec.peg instanceof PrefVal) {
             this.rank = 1 + spec.peg.rank;
         }
-        this.resuper();
+        this.resuper(ctx);
         // console.log('PVC', this.peg.canon, this.superpeg.canon)
     }
     // Recompute the type yardstick and the override gate from the current
     // peg. Called again whenever the peg resolves (e.g. a ref).
-    resuper() {
-        const peg = this.peg;
-        // A preference whose peg is ITSELF a kind (`*integer`) constrains
-        // nothing: there is no type-of-a-type in this lattice, so any peer
-        // wins. (Pinned by test/spec/var.tsv:var-pref-kind-narrow. Before
-        // the tower this fell out of a ScalarKindVal's superior being top;
-        // now that a leaf kind lifts to `number`, it has to be said.)
-        if (true === peg.isScalarKind) {
-            this.superpeg = (0, top_1.top)();
-            this.familypeg = this.superpeg;
-            return;
-        }
-        const sup = peg.superior();
-        this.superpeg = sup;
-        // No optional chain: superior() is contractually non-null (every
-        // Val returns one, a NilVal returning itself), so guarding against
-        // nullish here would claim a possibility the type does not have.
-        if (true === sup.isScalarKind) {
-            const family = (0, ScalarKindVal_1.kindFamily)(sup.peg);
-            // The gate stands in for the preferred value in any conflict it
-            // reports, so it must carry the same site and path as the type it
-            // widens -- otherwise NilVal.make picks a different primary and
-            // the error moves to the wrong path.
-            this.familypeg = family === sup.peg ?
-                sup : sup.place(new ScalarKindVal_1.ScalarKindVal({ peg: family, path: sup.path }));
+    //
+    // THE GATE IS super() (ADR-011 R4, docs/design/DEFAULTS.0.md). `*x`
+    // is sugar for `*x | super(x)`, so the type an overriding peer must
+    // pass is the one the long form spells out loud -- one function, not
+    // a second implementation that agrees with it on the common case.
+    // Two special cases retired with the switch: a KIND peg gated
+    // nothing (`*integer` was overridden by `"s"`) and a CONSTRAINT peg
+    // had no gate at all, both written when a kind's superior was top.
+    // `super(integer)` is `number`, so `7` still wins and `"s"` refuses.
+    resuper(ctx) {
+        // THE RANK-UNIFORM MEET (ADR-004). The yardstick is the INNERMOST
+        // preferred value's kind, whatever the preference's rank: `**1.5`
+        // defends `float` exactly as `*1.5` does. The old rule read the
+        // immediate peg, and a rank>=2 peg is itself a PrefVal whose
+        // superior is top -- so ANY conjunct overrode a ranked default
+        // (`**1.5 & float` dropped the default and died as mapval_no_gen;
+        // `**2|integer` met by a bare `integer` lost the default the
+        // spelling exists to carry -- use-cases/BUGS.md §3), while the
+        // rank-1 spelling of the same document kept it. One rule, every
+        // rank. Pinned by test/spec/pref.tsv (pref-rank2-* rows, and the
+        // flipped pref-nested-concrete-wins).
+        // THE RANK-UNIFORM MEET (ADR-004) is unchanged: the yardstick is
+        // the INNERMOST preferred value, whatever the rank, so `**1.5`
+        // defends `float` exactly as `*1.5` does.
+        let peg = this.peg;
+        while (true === peg?.isPref) {
+            peg = peg.peg;
         }
-        else {
-            this.familypeg = sup;
+        const base = (0, SuperFuncVal_1.superOf)(ctx, peg);
+        // A gate that a meet has already narrowed stays narrowed: the
+        // override space only ever shrinks.
+        this.superpeg = null == this.narrowed ? base
+            : (0, unify_1.unite)(ctx, base, this.narrowed, 'pref-narrow/' + this.id);
+    }
+    // The default, standing but NARROWED: `*integer & 7` is `*7`, which
+    // is what the long form answers (`(integer&7) | (number&7)` keeps
+    // the star on the arm that survived). The rank rides across -- a
+    // ladder rung that narrows is still that rung.
+    // The rank is REBUILT as nesting rather than stamped: canon renders
+    // one star per layer (`'*' + peg.canon`), so a rank set directly on
+    // a single layer would print `*x` for a rank-2 default and the
+    // document would no longer round-trip.
+    restand(met, ctx) {
+        let out = met;
+        for (let rI = 0; rI <= this.rank; rI++) {
+            out = new PrefVal({ peg: out }, ctx);
         }
+        return this.place(out);
     }
     // PrefVal unify always returns a PrefVal
     // PrefVals can only be removed by becoming Nil in a Disjunct
@@ -67,8 +138,25 @@ class PrefVal extends FeatureVal_1.FeatureVal {
             const resolved = (0, unify_1.unite)(te ? ctx.clone({ explain: (0, utility_1.ec)(te, 'RES') }) : ctx, this.peg, (0, top_1.top)(), 'pref/resolve');
             // console.log('PREF-RESOLVED', this.peg.canon, '->', resolved)
             this.peg = resolved;
-            this.resuper();
+            this.resuper(ctx);
         }
+        // A CONTAINER DEFAULT IS LEAFWISE IN EFFECT (ADR-011 R3), and it
+        // gets there through the meet above rather than through a rewrite.
+        // `*{p:1}` keeps its written shape -- canon prints `*{"p":1}` and
+        // reparses to itself, which a rewrite to `{p:*1}` would break, and
+        // an alternative still has a star for a disjunction to choose by.
+        // What makes it leafwise is that the two arms decide:
+        //
+        //   `& {q:2}`  the preferred value ITSELF admits the peer (maps
+        //              merge), so the default stands as `*{p:1,q:2}` and
+        //              `p` survives -- it used to be REPLACED outright.
+        //   `& {p:2}`  the preferred value refuses, so the gate answers:
+        //              `super({p:1})` is `{p:integer}`, which admits it.
+        //   `& "s"`    both arms are empty, so the whole default is --
+        //              a string used to override a map default silently.
+        //
+        // Which is every rule R3 asks for, with no bag ever standing where
+        // the author wrote a scalar and no canon that fails to round-trip.
         if (peer instanceof PrefVal) {
             why += 'pref-';
             if (this.id === peer.id) {
@@ -93,22 +181,93 @@ class PrefVal extends FeatureVal_1.FeatureVal {
                 //   this.peg.id, this.peg, this.peg.done,
                 //   peer.peg.id, peer.peg, peer.peg.done,
                 // )
-                let peg = (0, unify_1.unite)(te ? ctx.clone({ explain: (0, utility_1.ec)(te, 'PREF-PEER') }) : ctx, this.peg, peer.peg, 'pref-peer/' + this.id);
-                out = new PrefVal({ peg }, ctx);
+                const peg = (0, FuncBaseVal_1.trialUnify)(ctx, prefInnerPeg(this).clone(ctx), prefInnerPeg(peer));
+                // TWO DEFAULTS OF EQUAL RANK THAT CANNOT AGREE (ADR-011 R2):
+                // the refusal is about the DEFAULTS, not about the values they
+                // happen to hold, and its hint names the fix -- rank one of
+                // them. Compatible pegs still fold (`*1 & *integer` is `*1`),
+                // and identical ones collapse, so only a real disagreement
+                // reaches this arm. The three spellings of it -- `*1 & *7`,
+                // `(*1|integer) & *7` and `*1|*7` -- used to answer a value
+                // conflict, the newcomer, and the newcomer again.
+                out = undefined === peg
+                    ? (0, err_1.makeNilErr)(ctx, 'pref_rank_clash', this, peer, 'unify')
+                    : this.restand(peg, ctx);
                 // console.log('PREF-RANK-SAME-OUT', peg, peg.done, out, out.done)
                 why += 'rank-same';
             }
         }
         else if (!peer.isTop) {
             why += 'super-';
-            out = (0, unify_1.unite)(te ? ctx.clone({ explain: (0, utility_1.ec)(te, 'SUPER') }) : ctx, this.familypeg, peer, 'pref-super/' + this.id);
-            // The peer added nothing beyond a type the preferred value already
-            // satisfies (`*1 & integer`, `*1 & number`), so the preference
-            // stands. Anything else is a concrete override and wins.
-            if (out.same(this.superpeg) || out.same(this.familypeg)) {
-                out = this.peg;
-                why += 'same';
+            // THE MEET IS THE DESUGARING, DISTRIBUTED (ADR-011 R1,
+            // docs/design/DEFAULTS.0.md). `*x` stands for `*x | super(x)`,
+            // and a peer meets a disjunction arm by arm:
+            //
+            //     (x & peer)  |  (super(x) & peer)
+            //
+            // THE FIRST ARM DECIDES. When the preferred value itself still
+            // satisfies the peer the default STANDS -- `*1 & integer`,
+            // `*8080 & min(1024)`, `**2 & neq(1)`: the peer narrowed the
+            // type without ruling the default out, which is the whole point
+            // of writing one. Only when that arm is empty does the second
+            // answer, and that is the override. When BOTH are empty nothing
+            // remains of the disjunction the star stands for -- `empty`,
+            // the same refusal the written-out long form gives.
+            //
+            // The old rule asked instead whether the peer resolved to
+            // exactly `super(x)`, so any narrowing at all counted as an
+            // override: `*1 & integer` stood (the peer WAS the gate) but
+            // `*8080 & min(1024)` silently dropped the default and answered
+            // the bare constraint, and a rank ladder lost its weaker arm to
+            // the same rule the moment anything narrowed it.
+            //
+            // Trialled against a CLONE, on the innermost value (the
+            // rank-uniform meet): the preferred value must stay pristine for
+            // the arm that stands, and a failed trial must not leave its
+            // errors on the context -- the DisjunctVal admission gate's own
+            // precedent, and its mechanism.
+            const met = (0, FuncBaseVal_1.trialUnify)(ctx, prefInnerPeg(this).clone(ctx), peer);
+            if (undefined !== met) {
+                // THE SECOND ARM IS CARRIED FORWARD, not discarded. It is the
+                // override space -- everything the peer would still admit
+                // INSTEAD of the default -- and meeting a peer narrows it just
+                // as it narrows the default: two successive meets compose to
+                // `(x & p1 & p2) | (super(x) & p1 & p2)`, which is the
+                // distribution over both. Dropping it let a constraint that
+                // arrived beside a default vanish: `r:*2` with `r:max(20)`
+                // stood as a bare `*2`, and `r:40` then overrode it through a
+                // gate that no longer remembered the bound.
+                //
+                // It cannot fail: the first arm succeeded, so `x & peer` has a
+                // value, and that value satisfies `super(x)` and `peer` both.
+                const gate = (0, unify_1.unite)(te ? ctx.clone({ explain: (0, utility_1.ec)(te, 'GATE') }) : ctx, this.superpeg.clone(ctx), peer, 'pref-gate/' + this.id);
+                // Unchanged on both counts is the SAME preference, returned as
+                // itself: minting a new one every pass would keep the fixpoint
+                // moving for ever.
+                if (met.same(prefInnerPeg(this)) && gate.same(this.superpeg)) {
+                    out = this;
+                }
+                else {
+                    const stood = this.restand(met, ctx);
+                    stood.narrowed = gate;
+                    stood.superpeg = gate;
+                    out = stood;
+                }
+                why += 'stands';
+                (0, utility_1.explainClose)(te, out);
+                out.dc = type_1.DONE;
+                return out;
             }
+            // The override arm is trialled too: its failure is not the
+            // answer, it is half of the reason the answer is `empty`, and a
+            // recorded `no_scalar_unify` would be the code the reader sees
+            // however the refusal is relabelled afterwards.
+            const over = (0, FuncBaseVal_1.trialUnify)(ctx, this.superpeg.clone(ctx), peer);
+            out = undefined !== over ? over
+                // A peer that arrived already failed keeps its own refusal:
+                // that is its failure, not the default's.
+                : peer.isNil ? peer
+                    : (0, err_1.makeNilErr)(ctx, 'empty', this, peer, 'unify');
             // }
         }
         else {
@@ -131,7 +290,30 @@ class PrefVal extends FeatureVal_1.FeatureVal {
     }
     clone(ctx, spec) {
         let out = super.clone(ctx, spec);
-        // out.pref = this.pref.clone(null, ctx)
+        // THE NARROWED OVERRIDE SPACE TRAVELS WITH THE COPY (ADR-011 R1).
+        // A default a meet has pinned stays pinned through a reference:
+        // without this, `T:{e:***false & false}` copied by `f:$.T` handed
+        // back a default whose gate had widened again to `boolean`, and
+        // `f:{e:true}` overrode a value the author had pinned. The Go
+        // twin carries the same two fields explicitly (clone.go).
+        if (null != this.narrowed) {
+            out.narrowed = this.narrowed;
+            out.superpeg = this.superpeg;
+        }
+        // THE PER-DESTINATION INSTANTIATION RULE (ADR-005). The default
+        // clone shares the preferred value (`peg: this.peg` in Val.clone)
+        // — a cloned pref spread template resolves its inner value at the
+        // template's own location, pinned behaviour. But a template
+        // INSTANCE must own it: with the peg shared, a rank-2 default
+        // (`**key(1) | string`) in a pack template resolved its one
+        // shared inner key() at the first destination and every child got
+        // the first child's key (use-cases/BUGS.md §9 — rank 1 escaped
+        // only because its unify builds a fresh PrefVal per meet). The
+        // superpeg yardstick from the shared peg still holds: the clone's
+        // innermost value is the same kind.
+        if (true === spec?.dup && true === this.peg?.isVal) {
+            out.peg = this.peg.clone(ctx, { dup: true });
+        }
         return out;
     }
     get canon() {
@@ -147,6 +329,6 @@ class PrefVal extends FeatureVal_1.FeatureVal {
         }
         return val.gen(ctx);
     }
-} /* node:coverage ignore next 6 */
+} /* node:coverage ignore next 7 */
 exports.PrefVal = PrefVal;
 //# sourceMappingURL=PrefVal.js.map

package/dist/val/PrefVal.js.map

@@ -1 +1 @@
-{"version":3,"file":"PrefVal.js","sourceRoot":"","sources":["../../src/val/PrefVal.ts"],"names":[],"mappings":";AAAA,yDAAyD;;;AAOzD,kCAEgB;AAGhB,oCAAgC;AAChC,gCAAmC;AAEnC,wCAImB;AAGnB,+BAA2B;AAE3B,6CAAyC;AACzC,mDAA2D;AAG3D,MAAM,OAAQ,SAAQ,uBAAU;IA2B9B,YACE,IAAa,EACb,GAAkB;QAElB,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QA9BlB,WAAM,GAAG,IAAI,CAAA;QACb,cAAS,GAAG,IAAI,CAAA;QAChB,QAAG,GAAG,KAAK,CAAA;QAsBX,SAAI,GAAW,CAAC,CAAA;QAOd,oCAAoC;QAEpC,sCAAsC;QAEtC,IAAI,IAAI,CAAC,GAAG,YAAY,OAAO,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAA;QAC/B,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAA;QACd,0DAA0D;IAC5D,CAAC;IAGD,sEAAsE;IACtE,4DAA4D;IACpD,OAAO;QACb,MAAM,GAAG,GAAQ,IAAI,CAAC,GAAG,CAAA;QAEzB,kEAAkE;QAClE,mEAAmE;QACnE,kEAAkE;QAClE,mEAAmE;QACnE,8DAA8D;QAC9D,IAAI,IAAI,KAAK,GAAG,CAAC,YAAY,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,GAAG,IAAA,SAAG,GAAE,CAAA;YACrB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAA;YAC9B,OAAM;QACR,CAAC;QAED,MAAM,GAAG,GAAQ,GAAG,CAAC,QAAQ,EAAE,CAAA;QAC/B,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAA;QAEnB,iEAAiE;QACjE,mEAAmE;QACnE,iEAAiE;QACjE,IAAI,IAAI,KAAK,GAAG,CAAC,YAAY,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,IAAA,0BAAU,EAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAClC,gEAAgE;YAChE,kEAAkE;YAClE,gEAAgE;YAChE,qCAAqC;YACrC,IAAI,CAAC,SAAS,GAAG,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;gBACnC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,6BAAa,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QACvE,CAAC;aACI,CAAC;YACJ,IAAI,CAAC,SAAS,GAAG,GAAG,CAAA;QACtB,CAAC;IACH,CAAC;IAGD,yCAAyC;IACzC,6DAA6D;IAC7D,KAAK,CAAC,IAAS,EAAE,GAAiB;QAChC,IAAI,GAAG,IAAI,IAAI,IAAA,SAAG,GAAE,CAAA;QAEpB,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,IAAI,IAAA,qBAAW,EAAC,GAAG,EAAE,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAC3E,IAAI,GAAG,GAAQ,IAAI,CAAA;QACnB,IAAI,GAAG,GAAG,EAAE,CAAA;QAEZ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACnB,MAAM,QAAQ,GAAG,IAAA,aAAK,EAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,IAAA,YAAE,EAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EACrE,IAAI,CAAC,GAAG,EAAE,IAAA,SAAG,GAAE,EAAE,cAAc,CAAC,CAAA;YAClC,+DAA+D;YAC/D,IAAI,CAAC,GAAG,GAAG,QAAQ,CAAA;YACnB,IAAI,CAAC,OAAO,EAAE,CAAA;QAChB,CAAC;QAED,IAAI,IAAI,YAAY,OAAO,EAAE,CAAC;YAC5B,GAAG,IAAI,OAAO,CAAA;YACd,IAAI,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gBACxB,GAAG,GAAG,IAAI,CAAA;gBACV,GAAG,IAAI,MAAM,CAAA;YACf,CAAC;YAED,wBAAwB;iBACnB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;gBACrC,GAAG,GAAG,IAAI,CAAA;gBACV,GAAG,IAAI,UAAU,CAAA;YACnB,CAAC;iBAEI,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC/B,GAAG,GAAG,IAAI,CAAA;gBACV,GAAG,IAAI,UAAU,CAAA;YACnB,CAAC;iBACI,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC/B,GAAG,GAAG,IAAI,CAAA;gBACV,GAAG,IAAI,WAAW,CAAA;YACpB,CAAC;iBACI,CAAC;gBACJ,2BAA2B;gBAC3B,0CAA0C;gBAC1C,0CAA0C;gBAC1C,IAAI;gBAEJ,IAAI,GAAG,GAAG,IAAA,aAAK,EAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,IAAA,YAAE,EAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EACpE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,CAAA;gBAC7C,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,CAAA;gBAC/B,kEAAkE;gBAClE,GAAG,IAAI,WAAW,CAAA;YACpB,CAAC;QACH,CAAC;aACI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACrB,GAAG,IAAI,QAAQ,CAAA;YAEf,GAAG,GAAG,IAAA,aAAK,EAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,IAAA,YAAE,EAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAC5D,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,CAAA;YAEhD,mEAAmE;YACnE,+DAA+D;YAC/D,yDAAyD;YACzD,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBACxD,GAAG,GAAG,IAAI,CAAC,GAAG,CAAA;gBACd,GAAG,IAAI,MAAM,CAAA;YACf,CAAC;YAED,IAAI;QACN,CAAC;aACI,CAAC;YACJ,GAAG,IAAI,MAAM,CAAA;QACf,CAAC;QAED,iEAAiE;QACjE,4DAA4D;QAC5D,GAAG,CAAC,EAAE,GAAG,WAAI,CAAA;QAEb,qFAAqF;QAErF,GAAG,CAAC,OAAO,IAAI,IAAA,sBAAY,EAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QAEpC,OAAO,GAAG,CAAA;IACZ,CAAC;IAGD,IAAI,CAAC,IAAS;QACZ,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACjB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC;YACnC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;QAE7C,OAAO,OAAO,CAAA;IAChB,CAAC;IAGD,KAAK,CAAC,GAAiB,EAAE,IAAc;QACrC,IAAI,GAAG,GAAI,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAa,CAAA;QAC7C,wCAAwC;QACxC,OAAO,GAAG,CAAA;IACZ,CAAC;IAGD,IAAI,KAAK;QACP,2EAA2E;QAC3E,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAA;IAC7B,CAAC;IAGD,GAAG,CAAC,GAAkB;QACpB,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAA;QAElB,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YACd,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;gBAChB,MAAM,IAAI,gBAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IACrB,CAAC;CACF,CAAC,iCAAiC;QAIjC,OAAO"}
+{"version":3,"file":"PrefVal.js","sourceRoot":"","sources":["../../src/val/PrefVal.ts"],"names":[],"mappings":";AAAA,yDAAyD;;;QAwavD,YAAY;AAjad,kCAEgB;AAGhB,oCAAgC;AAChC,gCAA+C;AAE/C,wCAImB;AAGnB,+BAA2B;AAE3B,6CAAyC;AACzC,+CAA0C;AAC1C,iDAAwC;AAGxC,oEAAoE;AACpE,oEAAoE;AACpE,qEAAqE;AACrE,wEAAwE;AACxE,uEAAuE;AACvE,SAAS,YAAY,CAAC,CAAM;IAC1B,IAAI,GAAG,GAAQ,CAAC,CAAA;IAChB,OAAO,IAAI,KAAK,GAAG,EAAE,MAAM,EAAE,CAAC;QAC5B,GAAG,GAAG,GAAG,CAAC,GAAG,CAAA;IACf,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAGD,+CAA+C;AAC/C,kEAAkE;AAClE,gEAAgE;AAChE,sEAAsE;AACtE,sEAAsE;AACtE,oEAAoE;AACpE,EAAE;AACF,gEAAgE;AAChE,sEAAsE;AACtE,sEAAsE;AACtE,sEAAsE;AACtE,gEAAgE;AAChE,iEAAiE;AACjE,8DAA8D;AAC9D,oEAAoE;AACpE,kCAAkC;AAClC,MAAM,OAAQ,SAAQ,uBAAU;IA6C9B,YACE,IAAa,EACb,GAAkB;QAElB,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAhDlB,WAAM,GAAG,IAAI,CAAA;QACb,cAAS,GAAG,IAAI,CAAA;QAChB,QAAG,GAAG,KAAK,CAAA;QAQX,mEAAmE;QACnE,8CAA8C;QAC9C,EAAE;QACF,sEAAsE;QACtE,mEAAmE;QACnE,iEAAiE;QACjE,kEAAkE;QAClE,0DAA0D;QAC1D,qEAAqE;QACrE,iDAAiD;QACjD,EAAE;QACF,oEAAoE;QACpE,qEAAqE;QACrE,+DAA+D;QAC/D,oEAAoE;QACpE,+DAA+D;QAC/D,+BAA+B;QAC/B,EAAE;QACF,oEAAoE;QACpE,kEAAkE;QAClE,iEAAiE;QACjE,4DAA4D;QAE5D,SAAI,GAAW,CAAC,CAAA;QAgBd,oCAAoC;QAEpC,sCAAsC;QAEtC,IAAI,IAAI,CAAC,GAAG,YAAY,OAAO,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAA;QAC/B,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QACjB,0DAA0D;IAC5D,CAAC;IAGD,sEAAsE;IACtE,4DAA4D;IAC5D,EAAE;IACF,oEAAoE;IACpE,oEAAoE;IACpE,qEAAqE;IACrE,kEAAkE;IAClE,8DAA8D;IAC9D,oEAAoE;IACpE,mEAAmE;IACnE,qEAAqE;IAC7D,OAAO,CAAC,GAAkB;QAChC,kEAAkE;QAClE,kEAAkE;QAClE,gEAAgE;QAChE,6DAA6D;QAC7D,+DAA+D;QAC/D,kEAAkE;QAClE,6DAA6D;QAC7D,+DAA+D;QAC/D,gEAAgE;QAChE,iEAAiE;QACjE,sCAAsC;QACtC,iEAAiE;QACjE,+DAA+D;QAC/D,0CAA0C;QAC1C,IAAI,GAAG,GAAQ,IAAI,CAAC,GAAG,CAAA;QACvB,OAAO,IAAI,KAAK,GAAG,EAAE,MAAM,EAAE,CAAC;YAC5B,GAAG,GAAG,GAAG,CAAC,GAAG,CAAA;QACf,CAAC;QAED,MAAM,IAAI,GAAG,IAAA,sBAAO,EAAC,GAAmB,EAAE,GAAG,CAAC,CAAA;QAE9C,8DAA8D;QAC9D,oCAAoC;QACpC,IAAI,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI;YAC1C,CAAC,CAAC,IAAA,aAAK,EAAC,GAAmB,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,EAC9C,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,CAAA;IAC/B,CAAC;IAGD,oEAAoE;IACpE,kEAAkE;IAClE,iEAAiE;IACjE,+CAA+C;IAC/C,oEAAoE;IACpE,oEAAoE;IACpE,+DAA+D;IAC/D,uCAAuC;IAC/B,OAAO,CAAC,GAAQ,EAAE,GAAiB;QACzC,IAAI,GAAG,GAAQ,GAAG,CAAA;QAClB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACvC,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,CAAA;QACtC,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;IACxB,CAAC;IAGD,yCAAyC;IACzC,6DAA6D;IAC7D,KAAK,CAAC,IAAS,EAAE,GAAiB;QAChC,IAAI,GAAG,IAAI,IAAI,IAAA,SAAG,GAAE,CAAA;QAEpB,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,IAAI,IAAA,qBAAW,EAAC,GAAG,EAAE,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAC3E,IAAI,GAAG,GAAQ,IAAI,CAAA;QACnB,IAAI,GAAG,GAAG,EAAE,CAAA;QAEZ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACnB,MAAM,QAAQ,GAAG,IAAA,aAAK,EAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,IAAA,YAAE,EAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EACrE,IAAI,CAAC,GAAG,EAAE,IAAA,SAAG,GAAE,EAAE,cAAc,CAAC,CAAA;YAClC,+DAA+D;YAC/D,IAAI,CAAC,GAAG,GAAG,QAAQ,CAAA;YACnB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QACnB,CAAC;QAED,iEAAiE;QACjE,mEAAmE;QACnE,kEAAkE;QAClE,mEAAmE;QACnE,kEAAkE;QAClE,sDAAsD;QACtD,EAAE;QACF,gEAAgE;QAChE,iEAAiE;QACjE,gEAAgE;QAChE,iEAAiE;QACjE,iEAAiE;QACjE,+DAA+D;QAC/D,iEAAiE;QACjE,EAAE;QACF,mEAAmE;QACnE,mEAAmE;QAEnE,IAAI,IAAI,YAAY,OAAO,EAAE,CAAC;YAC5B,GAAG,IAAI,OAAO,CAAA;YACd,IAAI,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gBACxB,GAAG,GAAG,IAAI,CAAA;gBACV,GAAG,IAAI,MAAM,CAAA;YACf,CAAC;YAED,wBAAwB;iBACnB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;gBACrC,GAAG,GAAG,IAAI,CAAA;gBACV,GAAG,IAAI,UAAU,CAAA;YACnB,CAAC;iBAEI,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC/B,GAAG,GAAG,IAAI,CAAA;gBACV,GAAG,IAAI,UAAU,CAAA;YACnB,CAAC;iBACI,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC/B,GAAG,GAAG,IAAI,CAAA;gBACV,GAAG,IAAI,WAAW,CAAA;YACpB,CAAC;iBACI,CAAC;gBACJ,2BAA2B;gBAC3B,0CAA0C;gBAC1C,0CAA0C;gBAC1C,IAAI;gBAEJ,MAAM,GAAG,GAAG,IAAA,wBAAU,EAAC,GAAG,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EACvD,YAAY,CAAC,IAAI,CAAC,CAAC,CAAA;gBAErB,6DAA6D;gBAC7D,+DAA+D;gBAC/D,4DAA4D;gBAC5D,8DAA8D;gBAC9D,2DAA2D;gBAC3D,4DAA4D;gBAC5D,4DAA4D;gBAC5D,kDAAkD;gBAClD,GAAG,GAAG,SAAS,KAAK,GAAG;oBACrB,CAAC,CAAC,IAAA,gBAAU,EAAC,GAAG,EAAE,iBAAiB,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC;oBACzD,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;gBAC1B,kEAAkE;gBAClE,GAAG,IAAI,WAAW,CAAA;YACpB,CAAC;QACH,CAAC;aACI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACrB,GAAG,IAAI,QAAQ,CAAA;YAEf,uDAAuD;YACvD,+DAA+D;YAC/D,6CAA6C;YAC7C,EAAE;YACF,uCAAuC;YACvC,EAAE;YACF,+DAA+D;YAC/D,2DAA2D;YAC3D,6DAA6D;YAC7D,gEAAgE;YAChE,8DAA8D;YAC9D,gEAAgE;YAChE,6DAA6D;YAC7D,oDAAoD;YACpD,EAAE;YACF,0DAA0D;YAC1D,4DAA4D;YAC5D,6DAA6D;YAC7D,gEAAgE;YAChE,gEAAgE;YAChE,iDAAiD;YACjD,EAAE;YACF,wDAAwD;YACxD,iEAAiE;YACjE,6DAA6D;YAC7D,gEAAgE;YAChE,gCAAgC;YAChC,MAAM,GAAG,GAAG,IAAA,wBAAU,EAAC,GAAG,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAA;YAEhE,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;gBACtB,8DAA8D;gBAC9D,0DAA0D;gBAC1D,+DAA+D;gBAC/D,6DAA6D;gBAC7D,uDAAuD;gBACvD,4DAA4D;gBAC5D,2DAA2D;gBAC3D,8DAA8D;gBAC9D,4CAA4C;gBAC5C,EAAE;gBACF,+DAA+D;gBAC/D,8DAA8D;gBAC9D,MAAM,IAAI,GAAG,IAAA,aAAK,EAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,IAAA,YAAE,EAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,CAAA;gBAEzD,+DAA+D;gBAC/D,+DAA+D;gBAC/D,mBAAmB;gBACnB,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC7D,GAAG,GAAG,IAAI,CAAA;gBACZ,CAAC;qBACI,CAAC;oBACJ,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAY,CAAA;oBAC/C,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAA;oBACrB,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAA;oBACrB,GAAG,GAAG,KAAK,CAAA;gBACb,CAAC;gBAED,GAAG,IAAI,QAAQ,CAAA;gBACf,IAAA,sBAAY,EAAC,EAAE,EAAE,GAAG,CAAC,CAAA;gBACrB,GAAG,CAAC,EAAE,GAAG,WAAI,CAAA;gBACb,OAAO,GAAG,CAAA;YACZ,CAAC;YAED,2DAA2D;YAC3D,gEAAgE;YAChE,+DAA+D;YAC/D,gDAAgD;YAChD,MAAM,IAAI,GAAG,IAAA,wBAAU,EAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAA;YAE5D,GAAG,GAAG,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI;gBAC7B,4DAA4D;gBAC5D,0CAA0C;gBAC1C,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI;oBACjB,CAAC,CAAC,IAAA,gBAAU,EAAC,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;YAInD,IAAI;QACN,CAAC;aACI,CAAC;YACJ,GAAG,IAAI,MAAM,CAAA;QACf,CAAC;QAED,iEAAiE;QACjE,4DAA4D;QAC5D,GAAG,CAAC,EAAE,GAAG,WAAI,CAAA;QAEb,qFAAqF;QAErF,GAAG,CAAC,OAAO,IAAI,IAAA,sBAAY,EAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QAEpC,OAAO,GAAG,CAAA;IACZ,CAAC;IAGD,IAAI,CAAC,IAAS;QACZ,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACjB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC;YACnC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;QAE7C,OAAO,OAAO,CAAA;IAChB,CAAC;IAGD,KAAK,CAAC,GAAiB,EAAE,IAAc;QACrC,IAAI,GAAG,GAAI,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAa,CAAA;QAE7C,kEAAkE;QAClE,gEAAgE;QAChE,kEAAkE;QAClE,gEAAgE;QAChE,8DAA8D;QAC9D,0DAA0D;QAC1D,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1B,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;YAC5B,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC9B,CAAC;QACD,gEAAgE;QAChE,kEAAkE;QAClE,kEAAkE;QAClE,4DAA4D;QAC5D,8DAA8D;QAC9D,4DAA4D;QAC5D,kEAAkE;QAClE,+DAA+D;QAC/D,+DAA+D;QAC/D,kEAAkE;QAClE,oCAAoC;QACpC,IAAI,IAAI,KAAK,IAAI,EAAE,GAAG,IAAI,IAAI,KAAM,IAAI,CAAC,GAAW,EAAE,KAAK,EAAE,CAAC;YAC5D,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAA;QAC9C,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;IAGD,IAAI,KAAK;QACP,2EAA2E;QAC3E,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAA;IAC7B,CAAC;IAGD,GAAG,CAAC,GAAkB;QACpB,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAA;QAElB,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YACd,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;gBAChB,MAAM,IAAI,gBAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IACrB,CAAC;CACF,CAAC,iCAAiC;QAIjC,OAAO"}

package/dist/val/RecurseVal.d.ts

@@ -0,0 +1,19 @@
+import type { Val, ValSpec } from '../type';
+import { AontuContext } from '../ctx';
+import { FeatureVal } from './FeatureVal';
+declare class RecurseVal extends FeatureVal {
+    isRecurse: boolean;
+    isGenable: boolean;
+    cjo: number;
+    target: string[];
+    xc: number;
+    constructor(spec: ValSpec, ctx?: AontuContext);
+    clone(ctx: AontuContext, spec?: ValSpec): Val;
+    private body;
+    unify(peer: Val, ctx: AontuContext): Val;
+    get canon(): string;
+    gen(ctx: AontuContext): undefined;
+}
+declare function bumpRecurse(v: any, xc: number): void;
+declare function containsRecurseOf(v: any, target: string[], depth?: number): boolean;
+export { RecurseVal, bumpRecurse, containsRecurseOf, };

package/dist/val/RecurseVal.js

@@ -0,0 +1,217 @@
+"use strict";
+/* Copyright (c) 2025 Richard Rodger, MIT License */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RecurseVal = void 0;
+exports.bumpRecurse = bumpRecurse;
+exports.containsRecurseOf = containsRecurseOf;
+const type_1 = require("../type");
+const err_1 = require("../err");
+const FeatureVal_1 = require("./FeatureVal");
+const ConjunctVal_1 = require("./ConjunctVal");
+const unify_1 = require("../unify");
+const utility_1 = require("../utility");
+class RecurseVal extends FeatureVal_1.FeatureVal {
+    constructor(spec, ctx) {
+        super(spec, ctx);
+        this.isRecurse = true;
+        this.isGenable = true;
+        // LAST in a conjunct fold, after even the graph atoms: the residual
+        // wants to see the assembled concrete structure it expands against.
+        this.cjo = 47000;
+        this.target = spec.target ?? [];
+        this.xc = spec.xc ?? 0;
+        // A settled residual: a type() body carrying one must settle, and
+        // an unmet recursion is its own value until data arrives.
+        this.dc = type_1.DONE;
+    }
+    clone(ctx, spec) {
+        const out = super.clone(ctx, spec);
+        out.target = this.target;
+        out.xc = this.xc;
+        return out;
+    }
+    // The schema body the target names, from the ROOT: the fixpoint is
+    // over the finished definition, and the definition's own residual
+    // keeps it finite. When the root does not contain the target -- the
+    // residual was LIFTED out of its defining tree, as vet's anchored
+    // meet does -- fall back to ctx._fixroot, the settled tree the
+    // lifter kept for exactly this walk.
+    body(ctx) {
+        return walkTarget(ctx.root, this.target)
+            ?? walkTarget(ctx._fixroot, this.target);
+    }
+    unify(peer, ctx) {
+        const p = peer;
+        // The self-drive: nothing to advance -- the residual waits for
+        // structure. (A null/nil peer never arrives; unite's ladder
+        // absorbs both.)
+        if (null == peer || true === p.isTop) {
+            return this;
+        }
+        // The same fixpoint twice is one fixpoint.
+        if (true === p.isRecurse) {
+            if (this.target.length === p.target.length
+                && this.target.every((s, i) => s === p.target[i])) {
+                return this;
+            }
+            // Different targets -- mutual recursion meeting -- are BOTH
+            // held: each expands as data arrives, through the fold that
+            // keeps a conjunct's members separate.
+            const out = new ConjunctVal_1.ConjunctVal({ peg: [this, peer] }, ctx);
+            (0, utility_1.propagateMarks)(this, out);
+            out.path = this.path;
+            return out;
+        }
+        // CONCRETE STRUCTURE: expand one level against it.
+        if (true === p.isMap || true === p.isList || true === p.isScalar) {
+            if (ctx.budget.depth <= this.xc) {
+                return (0, err_1.makeNilErr)(ctx, 'recursion_budget', this, peer, 'recurse', { target: '$.' + this.target.join('.') });
+            }
+            const body = this.body(ctx);
+            if (undefined === body) {
+                // The definition has not assembled yet (an early pass): hold
+                // the peer beside the residual and try again when it has.
+                const out = new ConjunctVal_1.ConjunctVal({ peg: [this, peer] }, ctx);
+                (0, utility_1.propagateMarks)(this, out);
+                out.path = this.path;
+                return out;
+            }
+            // ADR-005's clone discipline: the expansion is a per-destination
+            // instantiation, so the definition itself is never written
+            // into. The clone's type/hide marks are CLEARED at every depth,
+            // exactly as a plain reference copy clears them (concreteFlow's
+            // rule): the schema is hidden, the instances it expands into
+            // are the output.
+            // The clone is REBASED to the DRIVE path explicitly (spec.path;
+            // the Go twin passes cp(r.path), whose stored paths its clone
+            // arms keep clean): the default rebase slices the definition's
+            // path by the destination's length, which leaks definition
+            // segments into instance paths whenever the destination is
+            // shallower -- a residual carried inside a copied definition
+            // body (`chain: $.spec.Step` inside Policy, copied to a slot
+            // shallower than the definition) reported
+            // `$.payments_policy.Policy.chain.then.approver` for the
+            // finding Go placed at `$.payments_policy.chain.then.approver`.
+            // The drive path is also right under vet's anchored meet, which
+            // drives AT the anchor's own path (see vet.ts), so anchored
+            // findings land in the schema's namespace in both ports.
+            const level = body.clone(ctx, {
+                dup: true, path: [...ctx.path],
+            });
+            (0, utility_1.walk)(level, (_key, v) => {
+                v.mark.type = false;
+                v.mark.hide = false;
+                return v;
+            });
+            bumpRecurse(level, this.xc + 1);
+            return (0, unify_1.unite)(ctx, level, peer, 'recurse-expand');
+        }
+        // Anything else -- a func still resolving, a reference, a
+        // constraint -- waits beside the residual.
+        const out = new ConjunctVal_1.ConjunctVal({ peg: [this, peer] }, ctx);
+        (0, utility_1.propagateMarks)(this, out);
+        out.path = this.path;
+        return out;
+    }
+    get canon() {
+        return '$.' + this.target.join('.');
+    }
+    gen(ctx) {
+        // An unexpanded residual in a demanded position refuses;
+        // guardedness is emergent -- under an optional key the bag's
+        // isolated context swallows this and drops the key.
+        (0, err_1.makeNilErr)(ctx, 'recursion_unexpanded', this, undefined, 'recurse', { target: '$.' + this.target.join('.') });
+        return undefined;
+    }
+}
+exports.RecurseVal = RecurseVal;
+// walkTarget descends a tree by the residual's absolute target path,
+// answering the definition node or undefined.
+function walkTarget(root, target) {
+    let node = root;
+    for (const seg of target) {
+        node = node?.peg?.[seg];
+    }
+    return null != node && true === node.isVal ? node : undefined;
+}
+// bumpRecurse stamps the expansion depth onto every residual inside a
+// freshly cloned level, so descent is charged along the chain.
+function bumpRecurse(v, xc) {
+    if (null == v || true !== v.isVal) {
+        return;
+    }
+    if (true === v.isRecurse) {
+        v.xc = Math.max(v.xc, xc);
+        return;
+    }
+    const peg = v.peg;
+    if (true === v.isMap && null != peg) {
+        for (const k of Object.keys(peg)) {
+            bumpRecurse(peg[k], xc);
+        }
+    }
+    else if (true === v.isList && Array.isArray(peg)) {
+        for (const e of peg) {
+            bumpRecurse(e, xc);
+        }
+    }
+    else if (true === v.isConjunct && Array.isArray(peg)) {
+        for (const e of peg) {
+            bumpRecurse(e, xc);
+        }
+    }
+    if (null != v.spread?.cj) {
+        bumpRecurse(v.spread.cj, xc);
+    }
+}
+// containsRecurseOf answers whether a definition holds a residual of
+// the given target -- i.e. the definition is (transitively) the
+// fixpoint that target names. A reference RESOLVING to such a
+// definition must itself answer the residual: cloned instead, every
+// reparse of a canon unrolled the schema one more level and canon
+// never converged.
+function containsRecurseOf(v, target, depth) {
+    const d = depth ?? 0;
+    if (null == v || true !== v.isVal || 8 < d) {
+        return false;
+    }
+    if (true === v.isRecurse) {
+        return v.target.length === target.length
+            && v.target.every((s, i) => s === target[i]);
+    }
+    // A RAW REFERENCE to the target IS the recursion, minted or not:
+    // the answer must not depend on whether the definition's own
+    // prefix position has been visited yet. Without this arm the
+    // answer was ORDER-DEPENDENT -- reparsing a generated canon puts
+    // the instance before the definition, its trailing `$.spec.Step`
+    // leaves resolved before `Step.then` had minted, and each resolve
+    // cloned one more unrolled level until the unify depth guard
+    // (unify_cycle) killed the document.
+    if (true === v.isRef && Array.isArray(v.peg)) {
+        if (v.peg.length === target.length
+            && v.peg.every((s, i) => s === target[i])) {
+            return true;
+        }
+    }
+    const peg = v.peg;
+    if (true === v.isMap && null != peg) {
+        for (const k of Object.keys(peg)) {
+            if (containsRecurseOf(peg[k], target, d + 1)) {
+                return true;
+            }
+        }
+    }
+    else if ((true === v.isList || true === v.isConjunct || true === v.isDisjunct)
+        && Array.isArray(peg)) {
+        for (const e of peg) {
+            if (containsRecurseOf(e, target, d + 1)) {
+                return true;
+            }
+        }
+    }
+    if (null != v.spread?.cj && containsRecurseOf(v.spread.cj, target, d + 1)) {
+        return true;
+    }
+    return false;
+} /* node:coverage ignore next 7 */
+//# sourceMappingURL=RecurseVal.js.map

package/dist/val/RecurseVal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RecurseVal.js","sourceRoot":"","sources":["../../src/val/RecurseVal.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;QA0RlD,WAAW;QACX,iBAAiB;AAzPnB,kCAEgB;AAMhB,gCAAmC;AAEnC,6CAAyC;AACzC,+CAA2C;AAC3C,oCAAgC;AAChC,wCAAiD;AAGjD,MAAM,UAAW,SAAQ,uBAAU;IAcjC,YAAY,IAAa,EAAE,GAAkB;QAC3C,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAdlB,cAAS,GAAG,IAAI,CAAA;QAChB,cAAS,GAAG,IAAI,CAAA;QAChB,oEAAoE;QACpE,oEAAoE;QACpE,QAAG,GAAG,KAAK,CAAA;QAWT,IAAI,CAAC,MAAM,GAAI,IAAY,CAAC,MAAM,IAAI,EAAE,CAAA;QACxC,IAAI,CAAC,EAAE,GAAI,IAAY,CAAC,EAAE,IAAI,CAAC,CAAA;QAC/B,kEAAkE;QAClE,0DAA0D;QAC1D,IAAI,CAAC,EAAE,GAAG,WAAI,CAAA;IAChB,CAAC;IAED,KAAK,CAAC,GAAiB,EAAE,IAAc;QACrC,MAAM,GAAG,GAAQ,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QACvC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QACxB,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAA;QAChB,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,mEAAmE;IACnE,kEAAkE;IAClE,oEAAoE;IACpE,kEAAkE;IAClE,+DAA+D;IAC/D,qCAAqC;IAC7B,IAAI,CAAC,GAAiB;QAC5B,OAAO,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC;eACnC,UAAU,CAAE,GAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;IACrD,CAAC;IAED,KAAK,CAAC,IAAS,EAAE,GAAiB;QAChC,MAAM,CAAC,GAAQ,IAAI,CAAA;QAEnB,+DAA+D;QAC/D,4DAA4D;QAC5D,iBAAiB;QACjB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;YACrC,OAAO,IAAI,CAAA;QACb,CAAC;QAED,2CAA2C;QAC3C,IAAI,IAAI,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM;mBACrC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpD,OAAO,IAAI,CAAA;YACb,CAAC;YACD,4DAA4D;YAC5D,4DAA4D;YAC5D,uCAAuC;YACvC,MAAM,GAAG,GAAG,IAAI,yBAAW,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;YACvD,IAAA,wBAAc,EAAC,IAAI,EAAE,GAAG,CAAC,CAAA;YACzB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;YACpB,OAAO,GAAG,CAAA;QACZ,CAAC;QAED,mDAAmD;QACnD,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,IAAI,IAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;YACjE,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;gBAChC,OAAO,IAAA,gBAAU,EAAC,GAAG,EAAE,kBAAkB,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAC9D,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YAC7C,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YAC3B,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,6DAA6D;gBAC7D,0DAA0D;gBAC1D,MAAM,GAAG,GAAG,IAAI,yBAAW,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;gBACvD,IAAA,wBAAc,EAAC,IAAI,EAAE,GAAG,CAAC,CAAA;gBACzB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;gBACpB,OAAO,GAAG,CAAA;YACZ,CAAC;YACD,iEAAiE;YACjE,2DAA2D;YAC3D,gEAAgE;YAChE,gEAAgE;YAChE,6DAA6D;YAC7D,kBAAkB;YAClB,gEAAgE;YAChE,8DAA8D;YAC9D,+DAA+D;YAC/D,2DAA2D;YAC3D,2DAA2D;YAC3D,6DAA6D;YAC7D,6DAA6D;YAC7D,0CAA0C;YAC1C,yDAAyD;YACzD,gEAAgE;YAChE,gEAAgE;YAChE,4DAA4D;YAC5D,yDAAyD;YACzD,MAAM,KAAK,GAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE;gBACjC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;aACxB,CAAC,CAAA;YACT,IAAA,cAAI,EAAC,KAAK,EAAE,CAAC,IAAiC,EAAE,CAAM,EAAE,EAAE;gBACxD,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;gBACnB,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;gBACnB,OAAO,CAAC,CAAA;YACV,CAAC,CAAC,CAAA;YACF,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;YAC/B,OAAO,IAAA,aAAK,EAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAA;QAClD,CAAC;QAED,0DAA0D;QAC1D,2CAA2C;QAC3C,MAAM,GAAG,GAAG,IAAI,yBAAW,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;QACvD,IAAA,wBAAc,EAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACzB,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACrC,CAAC;IAED,GAAG,CAAC,GAAiB;QACnB,yDAAyD;QACzD,6DAA6D;QAC7D,oDAAoD;QACpD,IAAA,gBAAU,EAAC,GAAG,EAAE,sBAAsB,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAChE,EAAE,MAAM,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC3C,OAAO,SAAS,CAAA;IAClB,CAAC;CACF;QAmGC,UAAU;AAhGZ,qEAAqE;AACrE,8CAA8C;AAC9C,SAAS,UAAU,CAAC,IAAS,EAAE,MAAgB;IAC7C,IAAI,IAAI,GAAQ,IAAI,CAAA;IACpB,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAA;IACzB,CAAC;IACD,OAAO,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAA;AAC/D,CAAC;AAGD,sEAAsE;AACtE,+DAA+D;AAC/D,SAAS,WAAW,CAAC,CAAM,EAAE,EAAU;IACrC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;QAClC,OAAM;IACR,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;QACzB,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QACzB,OAAM;IACR,CAAC;IACD,MAAM,GAAG,GAAQ,CAAC,CAAC,GAAG,CAAA;IACtB,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACjC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;QACzB,CAAC;IACH,CAAC;SACI,IAAI,IAAI,KAAK,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,WAAW,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;QACpB,CAAC;IACH,CAAC;SACI,IAAI,IAAI,KAAK,CAAC,CAAC,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACrD,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,WAAW,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;QACpB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC;QACzB,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;IAC9B,CAAC;AACH,CAAC;AAGD,qEAAqE;AACrE,gEAAgE;AAChE,8DAA8D;AAC9D,oEAAoE;AACpE,kEAAkE;AAClE,mBAAmB;AACnB,SAAS,iBAAiB,CAAC,CAAM,EAAE,MAAgB,EAAE,KAAc;IACjE,MAAM,CAAC,GAAG,KAAK,IAAI,CAAC,CAAA;IACpB,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC3C,OAAO,KAAK,CAAA;IACd,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;QACzB,OAAO,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM;eACnC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IAChE,CAAC;IACD,iEAAiE;IACjE,6DAA6D;IAC7D,6DAA6D;IAC7D,iEAAiE;IACjE,iEAAiE;IACjE,kEAAkE;IAClE,6DAA6D;IAC7D,qCAAqC;IACrC,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7C,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM;eAC7B,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAM,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACzD,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAAQ,CAAC,CAAC,GAAG,CAAA;IACtB,IAAI,IAAI,KAAK,CAAC,CAAC,KAAK,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACjC,IAAI,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC7C,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;SACI,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,MAAM,IAAI,IAAI,KAAK,CAAC,CAAC,UAAU,IAAI,IAAI,KAAK,CAAC,CAAC,UAAU,CAAC;WACzE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,IAAI,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACxC,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,IAAI,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,IAAI,iBAAiB,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC1E,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAC,iCAAiC"}