@stevenvo780/st-lang 4.3.0 → 4.5.0

package/dist/profiles/sequent-lk/prover.js

@@ -0,0 +1,532 @@
+"use strict";
+// ============================================================
+// LK — Backward proof search
+// ============================================================
+//
+// Demostrador hacia atras para LK clasico multisuccedente. La
+// estrategia es la siguiente:
+//
+//  1. Si Γ ⊢ Δ comparte una formula identica en ambos lados,
+//     se cierra con `axiom` precedido (si es necesario) de
+//     weakenings.
+//  2. Aplicamos reglas no ramificantes (notL/notR, andL, orR, impR)
+//     antes que las ramificantes (andR, orL, impL). Esto reduce el
+//     branching factor y mantiene el arbol pequeño.
+//  3. La contraccion implicita se obtiene "conservando" la formula
+//     principal en la premisa (estandar en presentaciones LK con
+//     contraccion implicita). Esto evita reglas explicitas de
+//     contraccion en el prover, pero las exportamos para clientes
+//     que construyan derivaciones a mano.
+//
+// El prover NO introduce cortes — produce derivaciones cut-free.
+// La eliminacion de cortes vive en `cut-elimination.ts`.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.proveLK = proveLK;
+exports.proveLKFormula = proveLKFormula;
+exports.isValid = isValid;
+exports.hasCut = hasCut;
+const util_1 = require("./util");
+function exhausted(ctx) {
+    return ctx.used >= ctx.budget;
+}
+function isAtomic(f) {
+    return f.kind === 'atom';
+}
+function findAxiom(left, right) {
+    const rkeys = new Set(right.map(util_1.lkKey));
+    for (const f of left) {
+        if (rkeys.has((0, util_1.lkKey)(f)))
+            return f;
+    }
+    return undefined;
+}
+function firstComplex(xs) {
+    for (let i = 0; i < xs.length; i++) {
+        const f = xs[i];
+        if (f && !isAtomic(f))
+            return i;
+    }
+    return -1;
+}
+function prove(left, right, ctx) {
+    ctx.used++;
+    if (exhausted(ctx))
+        return undefined;
+    // 1. Axioma
+    const axF = findAxiom(left, right);
+    if (axF) {
+        return {
+            goal: { left: left.slice(), right: right.slice() },
+            rule: 'axiom',
+            premises: [],
+            principalFormula: axF,
+        };
+    }
+    // 2. Reglas no ramificantes a la izquierda
+    for (let i = 0; i < left.length; i++) {
+        const f = left[i];
+        if (!f)
+            continue;
+        if (f.kind === 'not') {
+            // ¬A, Γ ⊢ Δ   ↦   Γ ⊢ A, Δ
+            const newL = (0, util_1.removeAt)(left, i);
+            const newR = [f.arg, ...right];
+            const sub = prove(newL, newR, ctx);
+            if (!sub)
+                return undefined;
+            return {
+                goal: { left: left.slice(), right: right.slice() },
+                rule: 'notL',
+                premises: [sub],
+                principalFormula: f,
+            };
+        }
+        if (f.kind === 'and') {
+            // A∧B, Γ ⊢ Δ   ↦   A, B, Γ ⊢ Δ
+            const newL = [f.left, f.right, ...(0, util_1.removeAt)(left, i)];
+            const sub = prove(newL, right, ctx);
+            if (!sub)
+                return undefined;
+            return {
+                goal: { left: left.slice(), right: right.slice() },
+                rule: 'andL',
+                premises: [sub],
+                principalFormula: f,
+            };
+        }
+    }
+    // 3. Reglas no ramificantes a la derecha
+    for (let i = 0; i < right.length; i++) {
+        const f = right[i];
+        if (!f)
+            continue;
+        if (f.kind === 'not') {
+            // Γ ⊢ ¬A, Δ   ↦   A, Γ ⊢ Δ
+            const newR = (0, util_1.removeAt)(right, i);
+            const newL = [f.arg, ...left];
+            const sub = prove(newL, newR, ctx);
+            if (!sub)
+                return undefined;
+            return {
+                goal: { left: left.slice(), right: right.slice() },
+                rule: 'notR',
+                premises: [sub],
+                principalFormula: f,
+            };
+        }
+        if (f.kind === 'or') {
+            // Γ ⊢ A∨B, Δ   ↦   Γ ⊢ A, B, Δ
+            const newR = [f.left, f.right, ...(0, util_1.removeAt)(right, i)];
+            const sub = prove(left, newR, ctx);
+            if (!sub)
+                return undefined;
+            return {
+                goal: { left: left.slice(), right: right.slice() },
+                rule: 'orR',
+                premises: [sub],
+                principalFormula: f,
+            };
+        }
+        if (f.kind === 'implies') {
+            // Γ ⊢ A→B, Δ   ↦   A, Γ ⊢ B, Δ
+            const newL = [f.left, ...left];
+            const newR = [f.right, ...(0, util_1.removeAt)(right, i)];
+            const sub = prove(newL, newR, ctx);
+            if (!sub)
+                return undefined;
+            return {
+                goal: { left: left.slice(), right: right.slice() },
+                rule: 'impR',
+                premises: [sub],
+                principalFormula: f,
+            };
+        }
+    }
+    // 4. Reglas ramificantes
+    for (let i = 0; i < right.length; i++) {
+        const f = right[i];
+        if (!f)
+            continue;
+        if (f.kind === 'and') {
+            // Γ ⊢ A∧B, Δ   ↦   Γ ⊢ A, Δ   y   Γ ⊢ B, Δ
+            const rest = (0, util_1.removeAt)(right, i);
+            const subL = prove(left, [f.left, ...rest], ctx);
+            if (!subL)
+                return undefined;
+            const subR = prove(left, [f.right, ...rest], ctx);
+            if (!subR)
+                return undefined;
+            return {
+                goal: { left: left.slice(), right: right.slice() },
+                rule: 'andR',
+                premises: [subL, subR],
+                principalFormula: f,
+            };
+        }
+    }
+    for (let i = 0; i < left.length; i++) {
+        const f = left[i];
+        if (!f)
+            continue;
+        if (f.kind === 'or') {
+            // A∨B, Γ ⊢ Δ   ↦   A, Γ ⊢ Δ   y   B, Γ ⊢ Δ
+            const rest = (0, util_1.removeAt)(left, i);
+            const subL = prove([f.left, ...rest], right, ctx);
+            if (!subL)
+                return undefined;
+            const subR = prove([f.right, ...rest], right, ctx);
+            if (!subR)
+                return undefined;
+            return {
+                goal: { left: left.slice(), right: right.slice() },
+                rule: 'orL',
+                premises: [subL, subR],
+                principalFormula: f,
+            };
+        }
+        if (f.kind === 'implies') {
+            // A→B, Γ ⊢ Δ   ↦   Γ ⊢ A, Δ   y   B, Γ ⊢ Δ
+            const rest = (0, util_1.removeAt)(left, i);
+            const subL = prove(rest, [f.left, ...right], ctx);
+            if (!subL)
+                return undefined;
+            const subR = prove([f.right, ...rest], right, ctx);
+            if (!subR)
+                return undefined;
+            return {
+                goal: { left: left.slice(), right: right.slice() },
+                rule: 'impL',
+                premises: [subL, subR],
+                principalFormula: f,
+            };
+        }
+    }
+    // 5. Sin reglas aplicables → secuente no derivable
+    if (firstComplex(left) === -1 && firstComplex(right) === -1) {
+        return undefined;
+    }
+    return undefined;
+}
+/**
+ * Demuestra el secuente `seq` en LK clasico (sin cortes).
+ * Devuelve `null` si no encuentra derivacion dentro del budget.
+ */
+function proveLK(seq, options = {}) {
+    const ctx = { budget: options.budget ?? 5_000, used: 0 };
+    const tree = prove(seq.left.slice(), seq.right.slice(), ctx);
+    return tree ?? null;
+}
+/** Atajo: ⊢ φ. */
+function proveLKFormula(formula, options = {}) {
+    return proveLK({ left: [], right: [formula] }, options);
+}
+// ============================================================
+// Validacion de derivaciones LK
+// ============================================================
+function multisetIncludes(haystack, needle) {
+    const counts = new Map();
+    for (const f of haystack)
+        counts.set((0, util_1.lkKey)(f), (counts.get((0, util_1.lkKey)(f)) ?? 0) + 1);
+    for (const f of needle) {
+        const k = (0, util_1.lkKey)(f);
+        const c = counts.get(k) ?? 0;
+        if (c <= 0)
+            return false;
+        counts.set(k, c - 1);
+    }
+    return true;
+}
+function sameMultiset(a, b) {
+    if (a.length !== b.length)
+        return false;
+    return multisetIncludes(a, b) && multisetIncludes(b, a);
+}
+/**
+ * Verifica que `proof` sea una derivacion LK valida segun la regla
+ * declarada en cada nodo. La validacion es estructural — comprueba
+ * que las premisas y la conclusion encajen con el patron de la regla.
+ *
+ * Es deliberadamente flexible respecto al orden (multisets) y permite
+ * contraccion implicita en las reglas logicas (la formula principal
+ * puede aparecer en las premisas, como en presentaciones modernas).
+ */
+function isValid(proof) {
+    const { goal, rule, premises } = proof;
+    const L = goal.left;
+    const R = goal.right;
+    // Premisas validas recursivamente
+    for (const p of premises) {
+        if (!isValid(p))
+            return false;
+    }
+    switch (rule) {
+        case 'axiom': {
+            // Necesita una formula compartida entre L y R
+            if (premises.length !== 0)
+                return false;
+            const rkeys = new Set(R.map(util_1.lkKey));
+            return L.some((f) => rkeys.has((0, util_1.lkKey)(f)));
+        }
+        case 'cut': {
+            if (premises.length !== 2)
+                return false;
+            const cf = proof.cutFormula;
+            if (!cf)
+                return false;
+            const [p1, p2] = premises;
+            if (!p1 || !p2)
+                return false;
+            // p1: Γ ⊢ Δ, A   ;   p2: A, Σ ⊢ Π   ⟹   Γ, Σ ⊢ Δ, Π
+            if (!(0, util_1.containsKey)(p1.goal.right, (0, util_1.lkKey)(cf)))
+                return false;
+            if (!(0, util_1.containsKey)(p2.goal.left, (0, util_1.lkKey)(cf)))
+                return false;
+            const gamma = p1.goal.left;
+            const delta = (0, util_1.removeFirstByKey)(p1.goal.right, (0, util_1.lkKey)(cf));
+            const sigma = (0, util_1.removeFirstByKey)(p2.goal.left, (0, util_1.lkKey)(cf));
+            const pi = p2.goal.right;
+            return sameMultiset(L, [...gamma, ...sigma]) && sameMultiset(R, [...delta, ...pi]);
+        }
+        case 'weakL': {
+            if (premises.length !== 1)
+                return false;
+            const [p] = premises;
+            if (!p)
+                return false;
+            // p: Γ ⊢ Δ  ;  conclusion: A, Γ ⊢ Δ   (A = principalFormula)
+            if (!sameMultiset(p.goal.right, R))
+                return false;
+            // L = principalFormula :: p.goal.left (multiset)
+            // Existe alguna formula en L cuya remocion deje L \ {x} igual a p.goal.left
+            for (let i = 0; i < L.length; i++) {
+                const candidate = L[i];
+                if (!candidate)
+                    continue;
+                if (sameMultiset((0, util_1.removeAt)(L, i), p.goal.left))
+                    return true;
+            }
+            return false;
+        }
+        case 'weakR': {
+            if (premises.length !== 1)
+                return false;
+            const [p] = premises;
+            if (!p)
+                return false;
+            if (!sameMultiset(p.goal.left, L))
+                return false;
+            for (let i = 0; i < R.length; i++) {
+                const candidate = R[i];
+                if (!candidate)
+                    continue;
+                if (sameMultiset((0, util_1.removeAt)(R, i), p.goal.right))
+                    return true;
+            }
+            return false;
+        }
+        case 'contrL': {
+            if (premises.length !== 1)
+                return false;
+            const [p] = premises;
+            if (!p)
+                return false;
+            if (!sameMultiset(p.goal.right, R))
+                return false;
+            // p.goal.left = L con alguna formula duplicada → reducir una.
+            // Existe x tal que p.goal.left ≡ L con x duplicada.
+            for (let i = 0; i < L.length; i++) {
+                const x = L[i];
+                if (!x)
+                    continue;
+                const candidate = [x, ...L];
+                if (sameMultiset(p.goal.left, candidate))
+                    return true;
+            }
+            return false;
+        }
+        case 'contrR': {
+            if (premises.length !== 1)
+                return false;
+            const [p] = premises;
+            if (!p)
+                return false;
+            if (!sameMultiset(p.goal.left, L))
+                return false;
+            for (let i = 0; i < R.length; i++) {
+                const x = R[i];
+                if (!x)
+                    continue;
+                const candidate = [x, ...R];
+                if (sameMultiset(p.goal.right, candidate))
+                    return true;
+            }
+            return false;
+        }
+        case 'exL':
+        case 'exR': {
+            if (premises.length !== 1)
+                return false;
+            const [p] = premises;
+            if (!p)
+                return false;
+            // Intercambio: la conclusion es una permutacion de la premisa.
+            return sameMultiset(p.goal.left, L) && sameMultiset(p.goal.right, R);
+        }
+        case 'notL': {
+            if (premises.length !== 1)
+                return false;
+            const [p] = premises;
+            if (!p)
+                return false;
+            const pf = proof.principalFormula;
+            if (!pf || pf.kind !== 'not')
+                return false;
+            // conclusion: ¬A, Γ ⊢ Δ   ;   premisa: Γ ⊢ A, Δ
+            if (!(0, util_1.containsKey)(L, (0, util_1.lkKey)(pf)))
+                return false;
+            const gamma = (0, util_1.removeFirstByKey)(L, (0, util_1.lkKey)(pf));
+            if (!(0, util_1.containsKey)(p.goal.right, (0, util_1.lkKey)(pf.arg)))
+                return false;
+            const delta = (0, util_1.removeFirstByKey)(p.goal.right, (0, util_1.lkKey)(pf.arg));
+            return sameMultiset(p.goal.left, gamma) && sameMultiset(delta, R);
+        }
+        case 'notR': {
+            if (premises.length !== 1)
+                return false;
+            const [p] = premises;
+            if (!p)
+                return false;
+            const pf = proof.principalFormula;
+            if (!pf || pf.kind !== 'not')
+                return false;
+            if (!(0, util_1.containsKey)(R, (0, util_1.lkKey)(pf)))
+                return false;
+            const delta = (0, util_1.removeFirstByKey)(R, (0, util_1.lkKey)(pf));
+            if (!(0, util_1.containsKey)(p.goal.left, (0, util_1.lkKey)(pf.arg)))
+                return false;
+            const gamma = (0, util_1.removeFirstByKey)(p.goal.left, (0, util_1.lkKey)(pf.arg));
+            return sameMultiset(gamma, L) && sameMultiset(p.goal.right, delta);
+        }
+        case 'andL': {
+            if (premises.length !== 1)
+                return false;
+            const [p] = premises;
+            if (!p)
+                return false;
+            const pf = proof.principalFormula;
+            if (!pf || pf.kind !== 'and')
+                return false;
+            // conclusion: A∧B, Γ ⊢ Δ ; premisa: A, B, Γ ⊢ Δ
+            if (!(0, util_1.containsKey)(L, (0, util_1.lkKey)(pf)))
+                return false;
+            const gamma = (0, util_1.removeFirstByKey)(L, (0, util_1.lkKey)(pf));
+            const expectedP = [pf.left, pf.right, ...gamma];
+            return sameMultiset(p.goal.left, expectedP) && sameMultiset(p.goal.right, R);
+        }
+        case 'andR': {
+            if (premises.length !== 2)
+                return false;
+            const [p1, p2] = premises;
+            if (!p1 || !p2)
+                return false;
+            const pf = proof.principalFormula;
+            if (!pf || pf.kind !== 'and')
+                return false;
+            // conclusion: Γ ⊢ A∧B, Δ ; premisas: Γ ⊢ A, Δ y Γ ⊢ B, Δ
+            if (!(0, util_1.containsKey)(R, (0, util_1.lkKey)(pf)))
+                return false;
+            const delta = (0, util_1.removeFirstByKey)(R, (0, util_1.lkKey)(pf));
+            const okL = sameMultiset(p1.goal.left, L) &&
+                (0, util_1.containsKey)(p1.goal.right, (0, util_1.lkKey)(pf.left)) &&
+                sameMultiset((0, util_1.removeFirstByKey)(p1.goal.right, (0, util_1.lkKey)(pf.left)), delta);
+            const okR = sameMultiset(p2.goal.left, L) &&
+                (0, util_1.containsKey)(p2.goal.right, (0, util_1.lkKey)(pf.right)) &&
+                sameMultiset((0, util_1.removeFirstByKey)(p2.goal.right, (0, util_1.lkKey)(pf.right)), delta);
+            return okL && okR;
+        }
+        case 'orL': {
+            if (premises.length !== 2)
+                return false;
+            const [p1, p2] = premises;
+            if (!p1 || !p2)
+                return false;
+            const pf = proof.principalFormula;
+            if (!pf || pf.kind !== 'or')
+                return false;
+            if (!(0, util_1.containsKey)(L, (0, util_1.lkKey)(pf)))
+                return false;
+            const gamma = (0, util_1.removeFirstByKey)(L, (0, util_1.lkKey)(pf));
+            const okL = (0, util_1.containsKey)(p1.goal.left, (0, util_1.lkKey)(pf.left)) &&
+                sameMultiset((0, util_1.removeFirstByKey)(p1.goal.left, (0, util_1.lkKey)(pf.left)), gamma) &&
+                sameMultiset(p1.goal.right, R);
+            const okR = (0, util_1.containsKey)(p2.goal.left, (0, util_1.lkKey)(pf.right)) &&
+                sameMultiset((0, util_1.removeFirstByKey)(p2.goal.left, (0, util_1.lkKey)(pf.right)), gamma) &&
+                sameMultiset(p2.goal.right, R);
+            return okL && okR;
+        }
+        case 'orR': {
+            if (premises.length !== 1)
+                return false;
+            const [p] = premises;
+            if (!p)
+                return false;
+            const pf = proof.principalFormula;
+            if (!pf || pf.kind !== 'or')
+                return false;
+            // conclusion: Γ ⊢ A∨B, Δ ; premisa: Γ ⊢ A, B, Δ
+            if (!(0, util_1.containsKey)(R, (0, util_1.lkKey)(pf)))
+                return false;
+            const delta = (0, util_1.removeFirstByKey)(R, (0, util_1.lkKey)(pf));
+            const expectedR = [pf.left, pf.right, ...delta];
+            return sameMultiset(p.goal.left, L) && sameMultiset(p.goal.right, expectedR);
+        }
+        case 'impL': {
+            if (premises.length !== 2)
+                return false;
+            const [p1, p2] = premises;
+            if (!p1 || !p2)
+                return false;
+            const pf = proof.principalFormula;
+            if (!pf || pf.kind !== 'implies')
+                return false;
+            if (!(0, util_1.containsKey)(L, (0, util_1.lkKey)(pf)))
+                return false;
+            const gamma = (0, util_1.removeFirstByKey)(L, (0, util_1.lkKey)(pf));
+            // p1: Γ ⊢ A, Δ
+            const okL = sameMultiset(p1.goal.left, gamma) &&
+                (0, util_1.containsKey)(p1.goal.right, (0, util_1.lkKey)(pf.left)) &&
+                sameMultiset((0, util_1.removeFirstByKey)(p1.goal.right, (0, util_1.lkKey)(pf.left)), R);
+            // p2: B, Γ ⊢ Δ
+            const okR = (0, util_1.containsKey)(p2.goal.left, (0, util_1.lkKey)(pf.right)) &&
+                sameMultiset((0, util_1.removeFirstByKey)(p2.goal.left, (0, util_1.lkKey)(pf.right)), gamma) &&
+                sameMultiset(p2.goal.right, R);
+            return okL && okR;
+        }
+        case 'impR': {
+            if (premises.length !== 1)
+                return false;
+            const [p] = premises;
+            if (!p)
+                return false;
+            const pf = proof.principalFormula;
+            if (!pf || pf.kind !== 'implies')
+                return false;
+            // conclusion: Γ ⊢ A→B, Δ ; premisa: A, Γ ⊢ B, Δ
+            if (!(0, util_1.containsKey)(R, (0, util_1.lkKey)(pf)))
+                return false;
+            const delta = (0, util_1.removeFirstByKey)(R, (0, util_1.lkKey)(pf));
+            const okL = (0, util_1.containsKey)(p.goal.left, (0, util_1.lkKey)(pf.left)) &&
+                sameMultiset((0, util_1.removeFirstByKey)(p.goal.left, (0, util_1.lkKey)(pf.left)), L);
+            const okR = (0, util_1.containsKey)(p.goal.right, (0, util_1.lkKey)(pf.right)) &&
+                sameMultiset((0, util_1.removeFirstByKey)(p.goal.right, (0, util_1.lkKey)(pf.right)), delta);
+            return okL && okR;
+        }
+    }
+}
+/** Cuenta si existe al menos un nodo `cut` en la derivacion. */
+function hasCut(proof) {
+    if (proof.rule === 'cut')
+        return true;
+    return proof.premises.some(hasCut);
+}
+//# sourceMappingURL=prover.js.map

package/dist/profiles/sequent-lk/prover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover.js","sourceRoot":"","sources":["../../../src/profiles/sequent-lk/prover.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6BAA6B;AAC7B,+DAA+D;AAC/D,EAAE;AACF,8DAA8D;AAC9D,8BAA8B;AAC9B,EAAE;AACF,6DAA6D;AAC7D,2DAA2D;AAC3D,kBAAkB;AAClB,oEAAoE;AACpE,mEAAmE;AACnE,oDAAoD;AACpD,mEAAmE;AACnE,iEAAiE;AACjE,8DAA8D;AAC9D,kEAAkE;AAClE,0CAA0C;AAC1C,EAAE;AACF,iEAAiE;AACjE,yDAAyD;;AA4LzD,0BAIC;AAGD,wCAKC;AAgCD,0BA2NC;AAGD,wBAGC;AAtcD,iCAAwE;AAOxE,SAAS,SAAS,CAAC,GAAa;IAC9B,OAAO,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC;AAChC,CAAC;AAED,SAAS,QAAQ,CAAC,CAAY;IAC5B,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;AAC3B,CAAC;AAED,SAAS,SAAS,CAAC,IAAiB,EAAE,KAAkB;IACtD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,YAAK,CAAC,CAAC,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAA,YAAK,EAAC,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,YAAY,CAAC,EAAe;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED,SAAS,KAAK,CAAC,IAAiB,EAAE,KAAkB,EAAE,GAAa;IACjE,GAAG,CAAC,IAAI,EAAE,CAAC;IACX,IAAI,SAAS,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IAErC,YAAY;IACZ,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACnC,IAAI,GAAG,EAAE,CAAC;QACR,OAAO;YACL,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE;YAClD,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,GAAG;SACtB,CAAC;IACJ,CAAC;IAED,2CAA2C;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,CAAC;YAAE,SAAS;QACjB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,2BAA2B;YAC3B,MAAM,IAAI,GAAG,IAAA,eAAQ,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC;YAC/B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO;gBACL,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE;gBAClD,IAAI,EAAE,MAAM;gBACZ,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,gBAAgB,EAAE,CAAC;aACpB,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,+BAA+B;YAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,IAAA,eAAQ,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YACrD,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YACpC,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO;gBACL,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE;gBAClD,IAAI,EAAE,MAAM;gBACZ,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,gBAAgB,EAAE,CAAC;aACpB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,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,CAAC;YAAE,SAAS;QACjB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,2BAA2B;YAC3B,MAAM,IAAI,GAAG,IAAA,eAAQ,EAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;YAC9B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO;gBACL,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE;gBAClD,IAAI,EAAE,MAAM;gBACZ,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,gBAAgB,EAAE,CAAC;aACpB,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACpB,+BAA+B;YAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,IAAA,eAAQ,EAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO;gBACL,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE;gBAClD,IAAI,EAAE,KAAK;gBACX,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,gBAAgB,EAAE,CAAC;aACpB,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACzB,+BAA+B;YAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,IAAA,eAAQ,EAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAC;YAC3B,OAAO;gBACL,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE;gBAClD,IAAI,EAAE,MAAM;gBACZ,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,gBAAgB,EAAE,CAAC;aACpB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,yBAAyB;IACzB,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,CAAC;YAAE,SAAS;QACjB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,2CAA2C;YAC3C,MAAM,IAAI,GAAG,IAAA,eAAQ,EAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;YACjD,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;YAClD,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,OAAO;gBACL,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE;gBAClD,IAAI,EAAE,MAAM;gBACZ,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;gBACtB,gBAAgB,EAAE,CAAC;aACpB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,CAAC;YAAE,SAAS;QACjB,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACpB,2CAA2C;YAC3C,MAAM,IAAI,GAAG,IAAA,eAAQ,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAClD,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YACnD,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,OAAO;gBACL,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE;gBAClD,IAAI,EAAE,KAAK;gBACX,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;gBACtB,gBAAgB,EAAE,CAAC;aACpB,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACzB,2CAA2C;YAC3C,MAAM,IAAI,GAAG,IAAA,eAAQ,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;YAClD,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YACnD,IAAI,CAAC,IAAI;gBAAE,OAAO,SAAS,CAAC;YAC5B,OAAO;gBACL,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE;gBAClD,IAAI,EAAE,MAAM;gBACZ,QAAQ,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;gBACtB,gBAAgB,EAAE,CAAC;aACpB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QAC5D,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAgB,OAAO,CAAC,GAAc,EAAE,UAA+B,EAAE;IACvE,MAAM,GAAG,GAAa,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IACnE,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC;IAC7D,OAAO,IAAI,IAAI,IAAI,CAAC;AACtB,CAAC;AAED,kBAAkB;AAClB,SAAgB,cAAc,CAC5B,OAAkB,EAClB,UAA+B,EAAE;IAEjC,OAAO,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;AAC1D,CAAC;AAED,+DAA+D;AAC/D,gCAAgC;AAChC,+DAA+D;AAE/D,SAAS,gBAAgB,CAAC,QAAqB,EAAE,MAAmB;IAClE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,MAAM,CAAC,GAAG,CAAC,IAAA,YAAK,EAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAA,YAAK,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChF,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,IAAA,YAAK,EAAC,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,YAAY,CAAC,CAAc,EAAE,CAAc;IAClD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,OAAO,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,OAAO,CAAC,KAAc;IACpC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IACvC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;IACpB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;IAErB,kCAAkC;IAClC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAChC,CAAC;IAED,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,8CAA8C;YAC9C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,YAAK,CAAC,CAAC,CAAC;YACpC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAA,YAAK,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC;YAC5B,IAAI,CAAC,EAAE;gBAAE,OAAO,KAAK,CAAC;YACtB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,QAAQ,CAAC;YAC1B,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,OAAO,KAAK,CAAC;YAC7B,oDAAoD;YACpD,IAAI,CAAC,IAAA,kBAAW,EAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACzD,IAAI,CAAC,IAAA,kBAAW,EAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxD,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;YAC3B,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC,CAAC;YACxD,MAAM,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;YACzB,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACrF,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,6DAA6D;YAC7D,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACjD,iDAAiD;YACjD,4EAA4E;YAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,SAAS;oBAAE,SAAS;gBACzB,IAAI,YAAY,CAAC,IAAA,eAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YAC7D,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,SAAS;oBAAE,SAAS;gBACzB,IAAI,YAAY,CAAC,IAAA,eAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC;YAC9D,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACjD,8DAA8D;YAC9D,oDAAoD;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACf,IAAI,CAAC,CAAC;oBAAE,SAAS;gBACjB,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC5B,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC;oBAAE,OAAO,IAAI,CAAC;YACxD,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACf,IAAI,CAAC,CAAC;oBAAE,SAAS;gBACjB,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC5B,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC;oBAAE,OAAO,IAAI,CAAC;YACzD,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,KAAK,CAAC;QACX,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,+DAA+D;YAC/D,OAAO,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACvE,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,CAAC;YAClC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YAC3C,gDAAgD;YAChD,IAAI,CAAC,IAAA,kBAAW,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAA,kBAAW,EAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC5D,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5D,OAAO,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACpE,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,CAAC;YAClC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YAC3C,IAAI,CAAC,IAAA,kBAAW,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAA,kBAAW,EAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC3D,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3D,OAAO,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACrE,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,CAAC;YAClC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YAC3C,gDAAgD;YAChD,IAAI,CAAC,IAAA,kBAAW,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,SAAS,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC;YAChD,OAAO,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC/E,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,QAAQ,CAAC;YAC1B,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,OAAO,KAAK,CAAC;YAC7B,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,CAAC;YAClC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YAC3C,yDAAyD;YACzD,IAAI,CAAC,IAAA,kBAAW,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,GAAG,GACP,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC7B,IAAA,kBAAW,EAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBAC1C,YAAY,CAAC,IAAA,uBAAgB,EAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACvE,MAAM,GAAG,GACP,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC7B,IAAA,kBAAW,EAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,KAAK,CAAC,CAAC;gBAC3C,YAAY,CAAC,IAAA,uBAAgB,EAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACxE,OAAO,GAAG,IAAI,GAAG,CAAC;QACpB,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,QAAQ,CAAC;YAC1B,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,OAAO,KAAK,CAAC;YAC7B,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,CAAC;YAClC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,IAAA,kBAAW,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,GAAG,GACP,IAAA,kBAAW,EAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBACzC,YAAY,CAAC,IAAA,uBAAgB,EAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC;gBACnE,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACjC,MAAM,GAAG,GACP,IAAA,kBAAW,EAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,KAAK,CAAC,CAAC;gBAC1C,YAAY,CAAC,IAAA,uBAAgB,EAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;gBACpE,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACjC,OAAO,GAAG,IAAI,GAAG,CAAC;QACpB,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,CAAC;YAClC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YAC1C,gDAAgD;YAChD,IAAI,CAAC,IAAA,kBAAW,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,SAAS,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC;YAChD,OAAO,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC/E,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,QAAQ,CAAC;YAC1B,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,OAAO,KAAK,CAAC;YAC7B,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,CAAC;YAClC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YAC/C,IAAI,CAAC,IAAA,kBAAW,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,eAAe;YACf,MAAM,GAAG,GACP,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC;gBACjC,IAAA,kBAAW,EAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBAC1C,YAAY,CAAC,IAAA,uBAAgB,EAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,eAAe;YACf,MAAM,GAAG,GACP,IAAA,kBAAW,EAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,KAAK,CAAC,CAAC;gBAC1C,YAAY,CAAC,IAAA,uBAAgB,EAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;gBACpE,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACjC,OAAO,GAAG,IAAI,GAAG,CAAC;QACpB,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,CAAC;YAClC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YAC/C,gDAAgD;YAChD,IAAI,CAAC,IAAA,kBAAW,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAA,uBAAgB,EAAC,CAAC,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,MAAM,GAAG,GACP,IAAA,kBAAW,EAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBACxC,YAAY,CAAC,IAAA,uBAAgB,EAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjE,MAAM,GAAG,GACP,IAAA,kBAAW,EAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,KAAK,CAAC,CAAC;gBAC1C,YAAY,CAAC,IAAA,uBAAgB,EAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAK,EAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACvE,OAAO,GAAG,IAAI,GAAG,CAAC;QACpB,CAAC;IACH,CAAC;AACH,CAAC;AAED,gEAAgE;AAChE,SAAgB,MAAM,CAAC,KAAc;IACnC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC;IACtC,OAAO,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACrC,CAAC"}

package/dist/profiles/sequent-lk/types.d.ts

@@ -0,0 +1,55 @@
+/** Sintaxis proposicional minima del perfil LK. */
+export type LKFormula = {
+    kind: 'atom';
+    name: string;
+} | {
+    kind: 'not';
+    arg: LKFormula;
+} | {
+    kind: 'and';
+    left: LKFormula;
+    right: LKFormula;
+} | {
+    kind: 'or';
+    left: LKFormula;
+    right: LKFormula;
+} | {
+    kind: 'implies';
+    left: LKFormula;
+    right: LKFormula;
+};
+/**
+ * Reglas del calculo LK clasico (proposicional).
+ *
+ *   axiom   : A ⊢ A
+ *   cut     : Γ ⊢ Δ, A   y   A, Σ ⊢ Π   ⟹   Γ, Σ ⊢ Δ, Π
+ *   weakL   : Γ ⊢ Δ                       ⟹   A, Γ ⊢ Δ
+ *   weakR   : Γ ⊢ Δ                       ⟹   Γ ⊢ Δ, A
+ *   contrL  : A, A, Γ ⊢ Δ                ⟹   A, Γ ⊢ Δ
+ *   contrR  : Γ ⊢ Δ, A, A                ⟹   Γ ⊢ Δ, A
+ *   exL     : permuta una formula a la izquierda
+ *   exR     : permuta una formula a la derecha
+ *   notL    : Γ ⊢ Δ, A                   ⟹   ¬A, Γ ⊢ Δ
+ *   notR    : A, Γ ⊢ Δ                   ⟹   Γ ⊢ Δ, ¬A
+ *   andL    : A, B, Γ ⊢ Δ                ⟹   A∧B, Γ ⊢ Δ
+ *   andR    : Γ ⊢ Δ, A   y   Γ ⊢ Δ, B    ⟹   Γ ⊢ Δ, A∧B
+ *   orL     : A, Γ ⊢ Δ   y   B, Γ ⊢ Δ    ⟹   A∨B, Γ ⊢ Δ
+ *   orR     : Γ ⊢ Δ, A, B                ⟹   Γ ⊢ Δ, A∨B
+ *   impL    : Γ ⊢ Δ, A   y   B, Γ ⊢ Δ    ⟹   A→B, Γ ⊢ Δ
+ *   impR    : A, Γ ⊢ Δ, B                ⟹   Γ ⊢ Δ, A→B
+ */
+export type LKRule = 'axiom' | 'cut' | 'weakL' | 'weakR' | 'contrL' | 'contrR' | 'exL' | 'exR' | 'notL' | 'notR' | 'andL' | 'andR' | 'orL' | 'orR' | 'impL' | 'impR';
+export interface LKSequent {
+    left: LKFormula[];
+    right: LKFormula[];
+}
+export interface LKProof {
+    goal: LKSequent;
+    rule: LKRule;
+    premises: LKProof[];
+    /** Formula que se corta (presente solo cuando `rule === 'cut'`). */
+    cutFormula?: LKFormula;
+    /** Formula principal a la que se aplica la regla (axioma / logicas). */
+    principalFormula?: LKFormula;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/profiles/sequent-lk/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/sequent-lk/types.ts"],"names":[],"mappings":"AAgBA,mDAAmD;AACnD,MAAM,MAAM,SAAS,GACjB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,SAAS,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,SAAS,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,SAAS,CAAA;CAAE,GACjD;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,SAAS,CAAA;CAAE,CAAC;AAE3D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,MAAM,MAAM,GACd,OAAO,GACP,KAAK,GACL,OAAO,GACP,OAAO,GACP,QAAQ,GACR,QAAQ,GACR,KAAK,GACL,KAAK,GACL,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,KAAK,GACL,KAAK,GACL,MAAM,GACN,MAAM,CAAC;AAEX,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,SAAS,EAAE,CAAC;IAClB,KAAK,EAAE,SAAS,EAAE,CAAC;CACpB;AAED,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,SAAS,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,oEAAoE;IACpE,UAAU,CAAC,EAAE,SAAS,CAAC;IACvB,wEAAwE;IACxE,gBAAgB,CAAC,EAAE,SAAS,CAAC;CAC9B"}

package/dist/profiles/sequent-lk/types.js

@@ -0,0 +1,18 @@
+"use strict";
+// ============================================================
+// LK Sequent Calculus — Types (Gentzen 1934)
+// ============================================================
+//
+// Calculo de secuentes clasico LK de Gentzen. A diferencia de G3,
+// LK incluye explicitamente las reglas estructurales (weakening,
+// contraccion, intercambio) y la regla de corte (cut). El
+// Hauptsatz (teorema fundamental) afirma que toda derivacion en
+// LK puede transformarse en una derivacion sin cortes.
+//
+// Convencion: secuentes multisuccedentes Γ ⊢ Δ con `left` y
+// `right` como listas (multisets con orden preservado). Las
+// formulas se modelan localmente en `LKFormula` para que el
+// perfil pueda evolucionar sin atar el calculo a la representacion
+// global de `Formula`.
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/profiles/sequent-lk/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/profiles/sequent-lk/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6CAA6C;AAC7C,+DAA+D;AAC/D,EAAE;AACF,kEAAkE;AAClE,iEAAiE;AACjE,0DAA0D;AAC1D,gEAAgE;AAChE,uDAAuD;AACvD,EAAE;AACF,4DAA4D;AAC5D,4DAA4D;AAC5D,4DAA4D;AAC5D,mEAAmE;AACnE,uBAAuB"}

package/dist/profiles/sequent-lk/util.d.ts

@@ -0,0 +1,18 @@
+import { LKFormula } from './types';
+/**
+ * Clave canonica de una formula LK. Sirve para comparar igualdad
+ * sintactica entre formulas y construir conjuntos/multisets.
+ */
+export declare function lkKey(f: LKFormula): string;
+export declare function eq(a: LKFormula, b: LKFormula): boolean;
+/** Devuelve una copia superficial: util para construir premisas sin alias. */
+export declare function cloneSeq<T>(xs: T[]): T[];
+export declare function removeAt<T>(xs: T[], idx: number): T[];
+/** Quita la primera ocurrencia de una formula identificable por `key`. */
+export declare function removeFirstByKey(xs: LKFormula[], key: string): LKFormula[];
+/** Quita todas las ocurrencias de una formula identificable por `key`. */
+export declare function removeAllByKey(xs: LKFormula[], key: string): LKFormula[];
+export declare function containsKey(xs: LKFormula[], key: string): boolean;
+/** Profundidad de una formula (sub-formulas estrictas). */
+export declare function depth(f: LKFormula): number;
+//# sourceMappingURL=util.d.ts.map