@stevenvo780/st-lang 4.2.0 → 4.3.0

package/dist/profiles/substructural/prover.js

@@ -0,0 +1,481 @@
+"use strict";
+// ============================================================
+// Substructural Prover — Linear & Affine (backward search)
+// ============================================================
+//
+// Calculo de secuentes intuicionistico bi-zonal para ILL
+// (Intuitionistic Linear Logic) + variante afin:
+//
+//   Σ ; Γ ⊢ A
+//
+// donde:
+//   - Σ es la "zona unrestricted": contiene los argumentos de `!`
+//     ya derelictados. Sobre Σ, contraction y weakening son libres
+//     (de modo implicito: Σ se duplica/descarta sin coste).
+//   - Γ es la "zona lineal": cada formula debe usarse exactamente
+//     una vez (afin: a lo sumo una vez, weakening libre sobre Γ).
+//
+// Esto evita los loops infinitos del enfoque con regla explicita de
+// contraction sobre `!A`, manteniendo expresividad equivalente.
+//
+// Reglas (clave):
+//   axiom              Σ ; A ⊢ A          (linear)
+//   axiom (afin)       Σ ; Γ, A ⊢ A       (descartando Γ por weakening)
+//   axiom (unrestr.)   Σ, A ; · ⊢ A       (afin) o Σ, A ; · ⊢ A en linear
+//                        — copia A desde Σ
+//   oneR               Σ ; · ⊢ 1          (Γ vacio en linear; en afin
+//                                          tambien con Γ no vacio)
+//   oneL               Σ ; Γ, 1 ⊢ C  ↪  Σ ; Γ ⊢ C
+//   tensorR            Σ ; Γ1, Γ2 ⊢ A⊗B  ↪  Σ;Γ1 ⊢ A  ∧  Σ;Γ2 ⊢ B
+//   tensorL            Σ ; Γ, A⊗B ⊢ C    ↪  Σ ; Γ, A, B ⊢ C
+//   lollipopR          Σ ; Γ ⊢ A⊸B       ↪  Σ ; Γ, A ⊢ B
+//   lollipopL          Σ;Γ1,Γ2,A⊸B ⊢ C   ↪  Σ;Γ1 ⊢ A  ∧  Σ;Γ2, B ⊢ C
+//   withR              Σ ; Γ ⊢ A & B     ↪  Σ;Γ ⊢ A  ∧  Σ;Γ ⊢ B
+//   withL1 / withL2    Σ ; Γ, A&B ⊢ C    ↪  Σ ; Γ, A ⊢ C  (o B)
+//   plusR1 / plusR2    Σ ; Γ ⊢ A⊕B       ↪  Σ;Γ ⊢ A  (o B)
+//   plusL              Σ ; Γ, A⊕B ⊢ C    ↪  Σ;Γ,A ⊢ C  ∧  Σ;Γ,B ⊢ C
+//   bangR              Σ ; · ⊢ !A        ↪  Σ ; · ⊢ A
+//                       (en linear Γ debe estar vacio; en afin se
+//                        permite Γ ⊆ formulas no-bang descartables)
+//   bangL (promote)    Σ ; Γ, !A ⊢ C     ↪  Σ, A ; Γ ⊢ C
+//                       (mueve A a la zona unrestricted, "abriendo"
+//                        contraction y weakening implicitos)
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.formulaKey = formulaKey;
+exports.proveLinear = proveLinear;
+exports.proveAffine = proveAffine;
+exports.proofToString = proofToString;
+// --- Utilidades de comparacion sintactica ---
+function formulaKey(f) {
+    switch (f.kind) {
+        case 'atom':
+            return `a:${f.name}`;
+        case 'one':
+            return '1';
+        case 'tensor':
+            return `(${formulaKey(f.left)}*${formulaKey(f.right)})`;
+        case 'lollipop':
+            return `(${formulaKey(f.left)}-o${formulaKey(f.right)})`;
+        case 'with':
+            return `(${formulaKey(f.left)}&${formulaKey(f.right)})`;
+        case 'plus':
+            return `(${formulaKey(f.left)}+${formulaKey(f.right)})`;
+        case 'bang':
+            return `!${formulaKey(f.arg)}`;
+        case 'whynot':
+            return `?${formulaKey(f.arg)}`;
+    }
+}
+function eqFormula(a, b) {
+    return formulaKey(a) === formulaKey(b);
+}
+function removeAt(arr, idx) {
+    const copy = arr.slice();
+    copy.splice(idx, 1);
+    return copy;
+}
+// --- Particiones de multiset (splitting de contexto lineal) ---
+//
+// Solo se usa sobre la zona lineal Γ. Σ se hereda completa en ambas
+// premisas (porque sus formulas son reutilizables).
+function* partitions(gamma) {
+    const n = gamma.length;
+    const total = 1 << n;
+    for (let mask = 0; mask < total; mask++) {
+        const left = [];
+        const right = [];
+        for (let i = 0; i < n; i++) {
+            const item = gamma[i];
+            if (item === undefined)
+                continue;
+            if (mask & (1 << i))
+                left.push(item);
+            else
+                right.push(item);
+        }
+        yield [left, right];
+    }
+}
+function step(ctx) {
+    ctx.used++;
+    return ctx.used <= ctx.budget;
+}
+function goalKey(sigma, gamma, target) {
+    // Ordenamos para que multisets distintos en orden no causen miss.
+    const s = sigma.map(formulaKey).sort().join('|');
+    const g = gamma.map(formulaKey).sort().join('|');
+    return `${s}//${g}//${formulaKey(target)}`;
+}
+// --- Construccion de pruebas ---
+function mkProof(conclusion, rule, premises) {
+    return { conclusion, rule, premises };
+}
+/**
+ * Construye un secuente "plano" para el `LinearProof`. Las formulas
+ * de Σ se preservan como `!A` en el left (notacion: lo que esta en
+ * la zona unrestricted entra al secuente como bangs explicitos).
+ */
+function seqOf(sigma, gamma, delta) {
+    const left = [];
+    for (const s of sigma)
+        left.push({ kind: 'bang', arg: s });
+    for (const g of gamma)
+        left.push(g);
+    return { left, right: delta.slice() };
+}
+// --- Predicados sobre formulas ---
+function isBang(f) {
+    return f.kind === 'bang';
+}
+// --- Cierre por axioma ---
+//
+// Posibles axiomas:
+//   (linear) Σ ; A ⊢ A       — Γ es exactamente [A] y matchea target
+//   (linear) Σ, A ; · ⊢ A    — A esta en Σ y Γ vacio
+//   (afin)   Σ ; Γ ⊢ A       — Γ contiene A; resto se descarta
+//                              por weakening implicito
+//   (afin)   Σ, A ; Γ ⊢ A    — A en Σ, Γ descartable
+function tryAxiom(sigma, gamma, target, mode) {
+    // Caso linear estricto.
+    if (mode === 'linear') {
+        // Γ = [A]
+        if (gamma.length === 1 && gamma[0] && eqFormula(gamma[0], target)) {
+            return mkProof(seqOf(sigma, gamma, [target]), 'axiom', []);
+        }
+        // Γ = [] y A esta en Σ.
+        if (gamma.length === 0 && sigma.some((s) => eqFormula(s, target))) {
+            return mkProof(seqOf(sigma, gamma, [target]), 'axiom', []);
+        }
+        return undefined;
+    }
+    // afin: weakening sobre Γ implicito en el axioma.
+    const inGamma = gamma.findIndex((g) => eqFormula(g, target));
+    if (inGamma >= 0) {
+        // Construimos: axiom + weakening por cada formula sobrante.
+        let cur = mkProof(seqOf(sigma, [target], [target]), 'axiom', []);
+        for (let i = 0; i < gamma.length; i++) {
+            if (i === inGamma)
+                continue;
+            const extra = gamma[i];
+            if (extra === undefined)
+                continue;
+            const accGamma = cur.conclusion.left.slice();
+            accGamma.push(extra);
+            cur = mkProof({ left: accGamma, right: [target] }, 'weakening', [cur]);
+        }
+        return cur;
+    }
+    const inSigma = sigma.findIndex((s) => eqFormula(s, target));
+    if (inSigma >= 0) {
+        // axiom desde Σ + weakening de Γ.
+        let cur = mkProof(seqOf(sigma, [], [target]), 'axiom', []);
+        for (const g of gamma) {
+            const accGamma = cur.conclusion.left.slice();
+            accGamma.push(g);
+            cur = mkProof({ left: accGamma, right: [target] }, 'weakening', [cur]);
+        }
+        return cur;
+    }
+    return undefined;
+}
+function tryOneR(sigma, gamma, target, mode) {
+    if (target.kind !== 'one')
+        return undefined;
+    if (gamma.length === 0) {
+        return mkProof(seqOf(sigma, [], [target]), 'oneR', []);
+    }
+    if (mode === 'affine') {
+        let cur = mkProof(seqOf(sigma, [], [target]), 'oneR', []);
+        for (const g of gamma) {
+            const accGamma = cur.conclusion.left.slice();
+            accGamma.push(g);
+            cur = mkProof({ left: accGamma, right: [target] }, 'weakening', [cur]);
+        }
+        return cur;
+    }
+    return undefined;
+}
+// --- Prover principal ---
+function prove(sigma, gamma, delta, ctx) {
+    if (!step(ctx))
+        return undefined;
+    if (delta.length !== 1)
+        return undefined;
+    const target = delta[0];
+    if (target === undefined)
+        return undefined;
+    const key = goalKey(sigma, gamma, target);
+    const cached = ctx.memo.get(key);
+    if (cached !== undefined)
+        return cached ?? undefined;
+    // Marca temporal contra ciclos sintacticos:
+    ctx.memo.set(key, null);
+    const ans = proveCore(sigma, gamma, target, ctx);
+    ctx.memo.set(key, ans ?? null);
+    return ans;
+}
+function proveCore(sigma, gamma, target, ctx) {
+    // 1. Axiom.
+    const ax = tryAxiom(sigma, gamma, target, ctx.mode);
+    if (ax)
+        return ax;
+    // 2. oneR.
+    const o = tryOneR(sigma, gamma, target, ctx.mode);
+    if (o)
+        return o;
+    // 3. Promover !A de Γ a Σ (bangL): siempre seguro, reduce Γ.
+    for (let i = 0; i < gamma.length; i++) {
+        const f = gamma[i];
+        if (f && f.kind === 'bang') {
+            const rest = removeAt(gamma, i);
+            const sub = prove([...sigma, f.arg], rest, [target], ctx);
+            if (!sub)
+                return undefined;
+            return mkProof(seqOf(sigma, gamma, [target]), 'bangL', [sub]);
+        }
+    }
+    // 4. Reglas reversibles del sucedente.
+    // lollipopR.
+    if (target.kind === 'lollipop') {
+        const sub = prove(sigma, [...gamma, target.left], [target.right], ctx);
+        if (sub)
+            return mkProof(seqOf(sigma, gamma, [target]), 'lollipopR', [sub]);
+        return undefined;
+    }
+    // withR.
+    if (target.kind === 'with') {
+        const subA = prove(sigma, gamma, [target.left], ctx);
+        if (!subA)
+            return undefined;
+        const subB = prove(sigma, gamma, [target.right], ctx);
+        if (!subB)
+            return undefined;
+        return mkProof(seqOf(sigma, gamma, [target]), 'withR', [subA, subB]);
+    }
+    // bangR: en linear, Γ debe estar vacio; en afin, Γ debe ser
+    // descartable (todo no-bang en Γ se weakenea, pero ya promovimos
+    // todos los !A a Σ al inicio, asi que Γ aqui es no-bang).
+    if (target.kind === 'bang') {
+        if (gamma.length === 0) {
+            const sub = prove(sigma, [], [target.arg], ctx);
+            if (sub)
+                return mkProof(seqOf(sigma, [], [target]), 'bangR', [sub]);
+            return undefined;
+        }
+        if (ctx.mode === 'affine') {
+            // Descartar todo Γ por weakening.
+            const sub = prove(sigma, [], [target.arg], ctx);
+            if (sub) {
+                const bangProof = mkProof(seqOf(sigma, [], [target]), 'bangR', [sub]);
+                // Aplicar weakenings.
+                let cur = bangProof;
+                for (const g of gamma) {
+                    const accGamma = cur.conclusion.left.slice();
+                    accGamma.push(g);
+                    cur = mkProof({ left: accGamma, right: [target] }, 'weakening', [cur]);
+                }
+                return cur;
+            }
+        }
+        // En linear con Γ no vacio, bangR no aplica directamente.
+    }
+    // 5. Reglas reversibles de la izquierda (sobre Γ).
+    // tensorL.
+    for (let i = 0; i < gamma.length; i++) {
+        const f = gamma[i];
+        if (f && f.kind === 'tensor') {
+            const rest = removeAt(gamma, i);
+            const sub = prove(sigma, [...rest, f.left, f.right], [target], ctx);
+            if (!sub)
+                return undefined;
+            return mkProof(seqOf(sigma, gamma, [target]), 'tensorL', [sub]);
+        }
+    }
+    // oneL.
+    for (let i = 0; i < gamma.length; i++) {
+        const f = gamma[i];
+        if (f && f.kind === 'one') {
+            const rest = removeAt(gamma, i);
+            const sub = prove(sigma, rest, [target], ctx);
+            if (!sub)
+                return undefined;
+            return mkProof(seqOf(sigma, gamma, [target]), 'oneL', [sub]);
+        }
+    }
+    // plusL.
+    for (let i = 0; i < gamma.length; i++) {
+        const f = gamma[i];
+        if (f && f.kind === 'plus') {
+            const rest = removeAt(gamma, i);
+            const subA = prove(sigma, [...rest, f.left], [target], ctx);
+            if (!subA)
+                continue;
+            const subB = prove(sigma, [...rest, f.right], [target], ctx);
+            if (!subB)
+                continue;
+            return mkProof(seqOf(sigma, gamma, [target]), 'plusL', [subA, subB]);
+        }
+    }
+    // 6. Reglas no-reversibles del sucedente.
+    // tensorR: parte Γ; Σ se hereda completa a ambos lados.
+    if (target.kind === 'tensor') {
+        for (const [g1, g2] of partitions(gamma)) {
+            const subA = prove(sigma, g1, [target.left], ctx);
+            if (!subA)
+                continue;
+            const subB = prove(sigma, g2, [target.right], ctx);
+            if (!subB)
+                continue;
+            return mkProof(seqOf(sigma, gamma, [target]), 'tensorR', [subA, subB]);
+        }
+        return undefined;
+    }
+    // plusR.
+    if (target.kind === 'plus') {
+        const left = prove(sigma, gamma, [target.left], ctx);
+        if (left)
+            return mkProof(seqOf(sigma, gamma, [target]), 'plusR1', [left]);
+        const right = prove(sigma, gamma, [target.right], ctx);
+        if (right)
+            return mkProof(seqOf(sigma, gamma, [target]), 'plusR2', [right]);
+        return undefined;
+    }
+    // 7. Reglas no-reversibles de la izquierda.
+    // withL1/2.
+    for (let i = 0; i < gamma.length; i++) {
+        const f = gamma[i];
+        if (f && f.kind === 'with') {
+            const rest = removeAt(gamma, i);
+            const subA = prove(sigma, [...rest, f.left], [target], ctx);
+            if (subA)
+                return mkProof(seqOf(sigma, gamma, [target]), 'withL1', [subA]);
+            const subB = prove(sigma, [...rest, f.right], [target], ctx);
+            if (subB)
+                return mkProof(seqOf(sigma, gamma, [target]), 'withL2', [subB]);
+        }
+    }
+    // lollipopL: parte Γ (sin contar el ⊸).
+    for (let i = 0; i < gamma.length; i++) {
+        const f = gamma[i];
+        if (f && f.kind === 'lollipop') {
+            const rest = removeAt(gamma, i);
+            for (const [g1, g2] of partitions(rest)) {
+                const subA = prove(sigma, g1, [f.left], ctx);
+                if (!subA)
+                    continue;
+                const subB = prove(sigma, [...g2, f.right], [target], ctx);
+                if (!subB)
+                    continue;
+                return mkProof(seqOf(sigma, gamma, [target]), 'lollipopL', [subA, subB]);
+            }
+        }
+    }
+    // 8. Reglas sobre Σ (zona unrestricted).
+    //
+    // Dereliction implicita: copiamos una formula de Σ a Γ.
+    //
+    // Esto es la combinacion clasica de bangL + contraction:
+    //   Σ, A ; Γ ⊢ C  ↪  Σ, A ; Γ, A ⊢ C
+    //
+    // Para evitar loops, solo copiamos si la formula no aparece ya en
+    // Γ Y el contexto lineal no es "saturado" respecto a esa formula.
+    // Como heuristica simple, limitamos a una copia por formula de Σ
+    // por subgoal sintactico (la memoizacion corta el resto).
+    for (let i = 0; i < sigma.length; i++) {
+        const f = sigma[i];
+        if (f === undefined)
+            continue;
+        // Si Γ ya contiene esta formula, copiar de nuevo es contraccion.
+        // Permitimos hasta un numero acotado por la "demanda" del target:
+        // si el target es lineal-puro, no necesitamos > #atomos(target).
+        const currentCopies = gamma.filter((g) => eqFormula(g, f)).length;
+        const cap = countAtomDemand(target);
+        if (currentCopies >= cap)
+            continue;
+        const sub = prove(sigma, [...gamma, f], [target], ctx);
+        if (sub) {
+            // Etiquetamos como derelictionL (con contraction implicita).
+            return mkProof(seqOf(sigma, gamma, [target]), 'derelictionL', [sub]);
+        }
+    }
+    // 9. Weakening sobre Γ no-bang en afin (descartar recursos sobrantes).
+    if (ctx.mode === 'affine') {
+        for (let i = 0; i < gamma.length; i++) {
+            const f = gamma[i];
+            if (f && !isBang(f)) {
+                const rest = removeAt(gamma, i);
+                const sub = prove(sigma, rest, [target], ctx);
+                if (sub) {
+                    return mkProof(seqOf(sigma, gamma, [target]), 'weakening', [sub]);
+                }
+            }
+        }
+    }
+    return undefined;
+}
+/**
+ * Cota heuristica sobre cuantas copias de un mismo recurso pueden
+ * necesitarse para probar `target`. Cuenta ocurrencias de atomos y
+ * permite un margen pequeno por estructura adicional. Esto acota la
+ * dereliction-con-contraction sin perder casos validos.
+ */
+function countAtomDemand(target) {
+    let count = 0;
+    const stack = [target];
+    while (stack.length > 0) {
+        const f = stack.pop();
+        if (!f)
+            continue;
+        switch (f.kind) {
+            case 'atom':
+                count++;
+                break;
+            case 'one':
+                break;
+            case 'tensor':
+            case 'with':
+            case 'plus':
+            case 'lollipop':
+                stack.push(f.left, f.right);
+                break;
+            case 'bang':
+            case 'whynot':
+                stack.push(f.arg);
+                break;
+        }
+    }
+    // Margen de seguridad: al menos 2 para permitir A ⊗ A desde !A.
+    return Math.max(count, 2);
+}
+function proveWithMode(seqInput, mode, options = {}) {
+    const ctx = {
+        mode,
+        budget: options.budget ?? 50_000,
+        used: 0,
+        memo: new Map(),
+    };
+    // Particionamos el left input en (sigma, gamma): los !A iniciales
+    // pueden empezar en sigma o en gamma. Por uniformidad, todo arranca
+    // en gamma; bangL los promueve a sigma en la primera oportunidad.
+    const tree = prove([], seqInput.left.slice(), seqInput.right.slice(), ctx);
+    if (!tree)
+        return { provable: false };
+    return { provable: true, proof: tree };
+}
+function proveLinear(seqInput, options) {
+    const r = proveWithMode(seqInput, 'linear', options);
+    return r.proof ?? null;
+}
+function proveAffine(seqInput, options) {
+    const r = proveWithMode(seqInput, 'affine', options);
+    return r.proof ?? null;
+}
+function proofToString(p, indent = 0) {
+    const pad = '  '.repeat(indent);
+    const left = p.conclusion.left.map(formulaKey).join(', ') || '·';
+    const right = p.conclusion.right.map(formulaKey).join(', ') || '·';
+    const head = `${pad}${left} ⊢ ${right}    [${p.rule}]`;
+    const tail = p.premises.map((pr) => proofToString(pr, indent + 1)).join('\n');
+    return tail ? `${head}\n${tail}` : head;
+}
+//# sourceMappingURL=prover.js.map

package/dist/profiles/substructural/prover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover.js","sourceRoot":"","sources":["../../../src/profiles/substructural/prover.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2DAA2D;AAC3D,+DAA+D;AAC/D,EAAE;AACF,yDAAyD;AACzD,iDAAiD;AACjD,EAAE;AACF,cAAc;AACd,EAAE;AACF,SAAS;AACT,kEAAkE;AAClE,mEAAmE;AACnE,4DAA4D;AAC5D,kEAAkE;AAClE,kEAAkE;AAClE,EAAE;AACF,oEAAoE;AACpE,gEAAgE;AAChE,EAAE;AACF,kBAAkB;AAClB,mDAAmD;AACnD,wEAAwE;AACxE,0EAA0E;AAC1E,2CAA2C;AAC3C,sEAAsE;AACtE,mEAAmE;AACnE,kDAAkD;AAClD,kEAAkE;AAClE,4DAA4D;AAC5D,yDAAyD;AACzD,qEAAqE;AACrE,gEAAgE;AAChE,gEAAgE;AAChE,2DAA2D;AAC3D,oEAAoE;AACpE,sDAAsD;AACtD,kEAAkE;AAClE,oEAAoE;AACpE,yDAAyD;AACzD,oEAAoE;AACpE,6DAA6D;;AAM7D,gCAmBC;AAycD,kCAGC;AAED,kCAGC;AAED,sCAOC;AA/eD,+CAA+C;AAE/C,SAAgB,UAAU,CAAC,CAAgB;IACzC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,GAAG,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAC1D,KAAK,UAAU;YACb,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAC3D,KAAK,MAAM;YACT,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAC1D,KAAK,MAAM;YACT,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QAC1D,KAAK,MAAM;YACT,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACjC,KAAK,QAAQ;YACX,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;IACnC,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,CAAgB,EAAE,CAAgB;IACnD,OAAO,UAAU,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,QAAQ,CAAI,GAAQ,EAAE,GAAW;IACxC,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;IACzB,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACpB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,iEAAiE;AACjE,EAAE;AACF,oEAAoE;AACpE,oDAAoD;AAEpD,QAAQ,CAAC,CAAC,UAAU,CAAI,KAAU;IAChC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QACxC,MAAM,IAAI,GAAQ,EAAE,CAAC;QACrB,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAS;YACjC,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;gBAChC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QACD,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACtB,CAAC;AACH,CAAC;AAYD,SAAS,IAAI,CAAC,GAAa;IACzB,GAAG,CAAC,IAAI,EAAE,CAAC;IACX,OAAO,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC;AAChC,CAAC;AAED,SAAS,OAAO,CAAC,KAAsB,EAAE,KAAsB,EAAE,MAAqB;IACpF,kEAAkE;IAClE,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjD,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjD,OAAO,GAAG,CAAC,KAAK,CAAC,KAAK,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;AAC7C,CAAC;AAED,kCAAkC;AAElC,SAAS,OAAO,CACd,UAAyB,EACzB,IAAiB,EACjB,QAAuB;IAEvB,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;AACxC,CAAC;AAED;;;;GAIG;AACH,SAAS,KAAK,CACZ,KAAsB,EACtB,KAAsB,EACtB,KAAsB;IAEtB,MAAM,IAAI,GAAoB,EAAE,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC3D,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;AACxC,CAAC;AAED,oCAAoC;AAEpC,SAAS,MAAM,CAAC,CAAgB;IAC9B,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;AAC3B,CAAC;AAED,4BAA4B;AAC5B,EAAE;AACF,oBAAoB;AACpB,qEAAqE;AACrE,qDAAqD;AACrD,+DAA+D;AAC/D,uDAAuD;AACvD,qDAAqD;AAErD,SAAS,QAAQ,CACf,KAAsB,EACtB,KAAsB,EACtB,MAAqB,EACrB,IAAuB;IAEvB,wBAAwB;IACxB,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,UAAU;QACV,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC;YAClE,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;QAC7D,CAAC;QACD,wBAAwB;QACxB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC;YAClE,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,kDAAkD;IAClD,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IAC7D,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,4DAA4D;QAC5D,IAAI,GAAG,GAAgB,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;QAC9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,KAAK,OAAO;gBAAE,SAAS;YAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAClC,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7C,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,GAAG,GAAG,OAAO,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IAC7D,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,kCAAkC;QAClC,IAAI,GAAG,GAAgB,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;QACxE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7C,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,GAAG,GAAG,OAAO,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,OAAO,CACd,KAAsB,EACtB,KAAsB,EACtB,MAAqB,EACrB,IAAuB;IAEvB,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,SAAS,CAAC;IAC5C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IACzD,CAAC;IACD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtB,IAAI,GAAG,GAAgB,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;QACvE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7C,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,GAAG,GAAG,OAAO,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,2BAA2B;AAE3B,SAAS,KAAK,CACZ,KAAsB,EACtB,KAAsB,EACtB,KAAsB,EACtB,GAAa;IAEb,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACzC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAE3C,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,IAAI,SAAS,CAAC;IACrD,4CAA4C;IAC5C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAExB,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACjD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC;IAC/B,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAChB,KAAsB,EACtB,KAAsB,EACtB,MAAqB,EACrB,GAAa;IAEb,YAAY;IACZ,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IACpD,IAAI,EAAE;QAAE,OAAO,EAAE,CAAC;IAElB,WAAW;IACX,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IAClD,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAEhB,6DAA6D;IAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1D,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IAED,uCAAuC;IAEvC,aAAa;IACb,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;QACvE,IAAI,GAAG;YAAE,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3E,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,SAAS;IACT,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;QACtD,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5B,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,4DAA4D;IAC5D,iEAAiE;IACjE,0DAA0D;IAC1D,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAChD,IAAI,GAAG;gBAAE,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACpE,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC1B,kCAAkC;YAClC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAChD,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtE,sBAAsB;gBACtB,IAAI,GAAG,GAAG,SAAS,CAAC;gBACpB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;oBACtB,MAAM,QAAQ,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC7C,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACjB,GAAG,GAAG,OAAO,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACzE,CAAC;gBACD,OAAO,GAAG,CAAC;YACb,CAAC;QACH,CAAC;QACD,0DAA0D;IAC5D,CAAC;IAED,mDAAmD;IAEnD,WAAW;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;YACpE,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IAED,QAAQ;IACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;YAC9C,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,SAAS;IACT,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;YAC5D,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;YAC7D,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IAED,0CAA0C;IAE1C,wDAAwD;IACxD,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;YAClD,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;YACnD,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,SAAS;IACT,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACrD,IAAI,IAAI;YAAE,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1E,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;QACvD,IAAI,KAAK;YAAE,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5E,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,4CAA4C;IAE5C,YAAY;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;YAC5D,IAAI,IAAI;gBAAE,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1E,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;YAC7D,IAAI,IAAI;gBAAE,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;IAED,wCAAwC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChC,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;gBAC7C,IAAI,CAAC,IAAI;oBAAE,SAAS;gBACpB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;gBAC3D,IAAI,CAAC,IAAI;oBAAE,SAAS;gBACpB,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,EAAE;IACF,wDAAwD;IACxD,EAAE;IACF,yDAAyD;IACzD,qCAAqC;IACrC,EAAE;IACF,kEAAkE;IAClE,kEAAkE;IAClE,iEAAiE;IACjE,0DAA0D;IAE1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,KAAK,SAAS;YAAE,SAAS;QAC9B,iEAAiE;QACjE,kEAAkE;QAClE,iEAAiE;QACjE,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAClE,MAAM,GAAG,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,aAAa,IAAI,GAAG;YAAE,SAAS;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;QACvD,IAAI,GAAG,EAAE,CAAC;YACR,6DAA6D;YAC7D,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAChC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;gBAC9C,IAAI,GAAG,EAAE,CAAC;oBACR,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;GAKG;AACH,SAAS,eAAe,CAAC,MAAqB;IAC5C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAoB,CAAC,MAAM,CAAC,CAAC;IACxC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC;YAAE,SAAS;QACjB,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,MAAM;gBACT,KAAK,EAAE,CAAC;gBACR,MAAM;YACR,KAAK,KAAK;gBACR,MAAM;YACR,KAAK,QAAQ,CAAC;YACd,KAAK,MAAM,CAAC;YACZ,KAAK,MAAM,CAAC;YACZ,KAAK,UAAU;gBACb,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBAC5B,MAAM;YACR,KAAK,MAAM,CAAC;YACZ,KAAK,QAAQ;gBACX,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAClB,MAAM;QACV,CAAC;IACH,CAAC;IACD,gEAAgE;IAChE,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC;AAaD,SAAS,aAAa,CACpB,QAAuB,EACvB,IAAuB,EACvB,UAAwB,EAAE;IAE1B,MAAM,GAAG,GAAa;QACpB,IAAI;QACJ,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,MAAM;QAChC,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,IAAI,GAAG,EAAE;KAChB,CAAC;IACF,kEAAkE;IAClE,oEAAoE;IACpE,kEAAkE;IAClE,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC;IAC3E,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IACtC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACzC,CAAC;AAED,SAAgB,WAAW,CAAC,QAAuB,EAAE,OAAsB;IACzE,MAAM,CAAC,GAAG,aAAa,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IACrD,OAAO,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC;AACzB,CAAC;AAED,SAAgB,WAAW,CAAC,QAAuB,EAAE,OAAsB;IACzE,MAAM,CAAC,GAAG,aAAa,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IACrD,OAAO,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC;AACzB,CAAC;AAED,SAAgB,aAAa,CAAC,CAAc,EAAE,MAAM,GAAG,CAAC;IACtD,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;IACjE,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;IACnE,MAAM,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,MAAM,KAAK,QAAQ,CAAC,CAAC,IAAI,GAAG,CAAC;IACvD,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9E,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1C,CAAC"}

package/dist/profiles/substructural/types.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Formulas del lenguaje lineal/afin. Los atomos son neutrales y se
+ * comparan por nombre.
+ */
+export type LinearFormula = {
+    kind: 'atom';
+    name: string;
+} | {
+    kind: 'one';
+} | {
+    kind: 'tensor';
+    left: LinearFormula;
+    right: LinearFormula;
+} | {
+    kind: 'lollipop';
+    left: LinearFormula;
+    right: LinearFormula;
+} | {
+    kind: 'with';
+    left: LinearFormula;
+    right: LinearFormula;
+} | {
+    kind: 'plus';
+    left: LinearFormula;
+    right: LinearFormula;
+} | {
+    kind: 'bang';
+    arg: LinearFormula;
+} | {
+    kind: 'whynot';
+    arg: LinearFormula;
+};
+/**
+ * Reglas del calculo (intuicionistico) de secuentes que usamos.
+ *
+ * El sistema implementado es un calculo de secuentes ILL (Intuitionistic
+ * Linear Logic) restringido a un unico sucedente (Γ ⊢ A). Suficiente
+ * para los enunciados pedidos en el bench: A ⊸ A, conmutatividad,
+ * weakening solo en afin, contraction solo via bang, etc.
+ *
+ * Notas:
+ *   - `weakening` y `contraction` aparecen como reglas estructurales
+ *     explicitas; en linear puro estan deshabilitadas. En afin,
+ *     `weakening` esta habilitada (no asi `contraction`). En ambos,
+ *     `!` da contraction/weakening "locales" sobre el sub-recurso.
+ *   - `oneR` cierra el secuente ⊢ 1; `oneL` permite eliminar 1 a
+ *     izquierda.
+ */
+export type SequentRule = 'axiom' | 'cut' | 'oneR' | 'oneL' | 'tensorR' | 'tensorL' | 'lollipopR' | 'lollipopL' | 'withR' | 'withL1' | 'withL2' | 'plusR1' | 'plusR2' | 'plusL' | 'bangR' | 'bangL' | 'derelictionL' | 'weakening' | 'contraction';
+/**
+ * Secuente intuicionistico Γ ⊢ Δ. En el fragmento que probamos,
+ * `right` es de longitud 1 (un solo sucedente); se permite array
+ * para preservar simetria con G3 y futuras extensiones a Linear Logic
+ * clasica con multiples sucedentes.
+ */
+export interface LinearSequent {
+    left: LinearFormula[];
+    right: LinearFormula[];
+}
+export interface LinearProof {
+    conclusion: LinearSequent;
+    rule: SequentRule;
+    premises: LinearProof[];
+}
+/**
+ * Modo de prueba que controla las reglas estructurales.
+ *
+ *   - 'linear': ni contraction ni weakening (excepto via `!`).
+ *   - 'affine': weakening si, contraction no (excepto via `!`).
+ */
+export type SubstructuralMode = 'linear' | 'affine';
+//# sourceMappingURL=types.d.ts.map

package/dist/profiles/substructural/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/substructural/types.ts"],"names":[],"mappings":"AAyBA;;;GAGG;AACH,MAAM,MAAM,aAAa,GACrB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,KAAK,CAAA;CAAE,GACf;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,aAAa,CAAC;IAAC,KAAK,EAAE,aAAa,CAAA;CAAE,GAC7D;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,aAAa,CAAC;IAAC,KAAK,EAAE,aAAa,CAAA;CAAE,GAC/D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,aAAa,CAAC;IAAC,KAAK,EAAE,aAAa,CAAA;CAAE,GAC3D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,aAAa,CAAC;IAAC,KAAK,EAAE,aAAa,CAAA;CAAE,GAC3D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,aAAa,CAAA;CAAE,GACpC;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,aAAa,CAAA;CAAE,CAAC;AAE3C;;;;;;;;;;;;;;;GAeG;AACH,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,KAAK,GACL,MAAM,GACN,MAAM,GACN,SAAS,GACT,SAAS,GACT,WAAW,GACX,WAAW,GACX,OAAO,GACP,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,OAAO,GACP,OAAO,GACP,OAAO,GACP,cAAc,GACd,WAAW,GACX,aAAa,CAAC;AAElB;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,aAAa,EAAE,CAAC;IACtB,KAAK,EAAE,aAAa,EAAE,CAAC;CACxB;AAED,MAAM,WAAW,WAAW;IAC1B,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,WAAW,CAAC;IAClB,QAAQ,EAAE,WAAW,EAAE,CAAC;CACzB;AAED;;;;;GAKG;AACH,MAAM,MAAM,iBAAiB,GAAG,QAAQ,GAAG,QAAQ,CAAC"}

package/dist/profiles/substructural/types.js

@@ -0,0 +1,27 @@
+"use strict";
+// ============================================================
+// Substructural Logics — Types (Linear + Affine)
+// ============================================================
+//
+// Logicas substructurales (Girard 1987 para Linear Logic, y Affine
+// como su variante con weakening) controlan los recursos:
+//
+//   - Linear:  ni contraction ni weakening. Cada formula del
+//              contexto se usa exactamente una vez.
+//   - Affine:  weakening permitido (descartar hipotesis), pero NO
+//              contraction (no duplicar). Cada formula se usa a lo
+//              sumo una vez.
+//
+// Conectivos del fragmento implementado:
+//   ⊗  (tensor)     — conjuncion multiplicativa, recursos juntos
+//   ⊸  (lollipop)   — implicacion lineal, consume premisa
+//   &  (with)       — conjuncion aditiva, elige uno de dos
+//   ⊕  (plus)       — disyuncion aditiva, alguno de los dos
+//   1               — unidad multiplicativa de ⊗
+//   !  (bang)       — exponencial "of course", habilita contraction
+//                     y weakening para el sub-recurso marcado
+//   ?  (whynot)     — exponencial dual del bang (presente como
+//                     constructor; en el fragmento intuicionista
+//                     fragmentario no se utiliza en reglas activas)
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/profiles/substructural/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/profiles/substructural/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iDAAiD;AACjD,+DAA+D;AAC/D,EAAE;AACF,mEAAmE;AACnE,0DAA0D;AAC1D,EAAE;AACF,6DAA6D;AAC7D,oDAAoD;AACpD,kEAAkE;AAClE,mEAAmE;AACnE,6BAA6B;AAC7B,EAAE;AACF,yCAAyC;AACzC,iEAAiE;AACjE,0DAA0D;AAC1D,2DAA2D;AAC3D,4DAA4D;AAC5D,iDAAiD;AACjD,oEAAoE;AACpE,8DAA8D;AAC9D,+DAA+D;AAC/D,iEAAiE;AACjE,oEAAoE"}

package/dist/runtime/abduction/entails.d.ts

@@ -0,0 +1,21 @@
+import type { EntailmentOracle, Formula } from './types';
+export interface DefaultEntailsOptions {
+    /** Nombres tratados como variables. Default: `{x,y,z,u,v,w}`. */
+    variableNames?: ReadonlySet<string>;
+    /** Tope de iteraciones de forward-chaining. Default 1000. */
+    maxIterations?: number;
+}
+/**
+ * Oráculo de entailment por defecto. Forward-chaining sobre Horn-like.
+ *
+ * Devuelve `true` sii `target` (ground) es derivable de `premises`.
+ * Si `target` contiene variables se reporta `false` (no soportamos
+ * ∃-targets aquí; usar custom oracle).
+ */
+export declare function defaultEntails(opts?: DefaultEntailsOptions): EntailmentOracle;
+/**
+ * Oráculo de consistencia por defecto. Considera inconsistente sii
+ * el forward-chaining deriva un par {p, ¬p}.
+ */
+export declare function defaultConsistent(opts?: DefaultEntailsOptions): (premises: ReadonlyArray<Formula>) => boolean;
+//# sourceMappingURL=entails.d.ts.map

package/dist/runtime/abduction/entails.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entails.d.ts","sourceRoot":"","sources":["../../../src/runtime/abduction/entails.ts"],"names":[],"mappings":"AA8BA,OAAO,KAAK,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAwQzD,MAAM,WAAW,qBAAqB;IACpC,iEAAiE;IACjE,aAAa,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACpC,6DAA6D;IAC7D,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,IAAI,GAAE,qBAA0B,GAAG,gBAAgB,CASjF;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,GAAE,qBAA0B,GAC/B,CAAC,QAAQ,EAAE,aAAa,CAAC,OAAO,CAAC,KAAK,OAAO,CAO/C"}