@stevenvo780/st-lang 4.3.0 → 4.5.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../../../src/profiles/sequent-lk/util.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAEpC;;;GAGG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAa1C;AAED,wBAAgB,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,OAAO,CAEtD;AAED,8EAA8E;AAC9E,wBAAgB,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAExC;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,CAIrD;AAED,0EAA0E;AAC1E,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,SAAS,EAAE,CAI1E;AAED,0EAA0E;AAC1E,wBAAgB,cAAc,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,SAAS,EAAE,CAExE;AAED,wBAAgB,WAAW,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAEjE;AAED,2DAA2D;AAC3D,wBAAgB,KAAK,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAW1C"}

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

@@ -0,0 +1,71 @@
+"use strict";
+// ============================================================
+// LK — Utilidades sintacticas locales
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.lkKey = lkKey;
+exports.eq = eq;
+exports.cloneSeq = cloneSeq;
+exports.removeAt = removeAt;
+exports.removeFirstByKey = removeFirstByKey;
+exports.removeAllByKey = removeAllByKey;
+exports.containsKey = containsKey;
+exports.depth = depth;
+/**
+ * Clave canonica de una formula LK. Sirve para comparar igualdad
+ * sintactica entre formulas y construir conjuntos/multisets.
+ */
+function lkKey(f) {
+    switch (f.kind) {
+        case 'atom':
+            return `a:${f.name}`;
+        case 'not':
+            return `n(${lkKey(f.arg)})`;
+        case 'and':
+            return `&(${lkKey(f.left)},${lkKey(f.right)})`;
+        case 'or':
+            return `|(${lkKey(f.left)},${lkKey(f.right)})`;
+        case 'implies':
+            return `>(${lkKey(f.left)},${lkKey(f.right)})`;
+    }
+}
+function eq(a, b) {
+    return lkKey(a) === lkKey(b);
+}
+/** Devuelve una copia superficial: util para construir premisas sin alias. */
+function cloneSeq(xs) {
+    return xs.slice();
+}
+function removeAt(xs, idx) {
+    const copy = xs.slice();
+    copy.splice(idx, 1);
+    return copy;
+}
+/** Quita la primera ocurrencia de una formula identificable por `key`. */
+function removeFirstByKey(xs, key) {
+    const idx = xs.findIndex((f) => lkKey(f) === key);
+    if (idx === -1)
+        return xs.slice();
+    return removeAt(xs, idx);
+}
+/** Quita todas las ocurrencias de una formula identificable por `key`. */
+function removeAllByKey(xs, key) {
+    return xs.filter((f) => lkKey(f) !== key);
+}
+function containsKey(xs, key) {
+    return xs.some((f) => lkKey(f) === key);
+}
+/** Profundidad de una formula (sub-formulas estrictas). */
+function depth(f) {
+    switch (f.kind) {
+        case 'atom':
+            return 0;
+        case 'not':
+            return depth(f.arg) + 1;
+        case 'and':
+        case 'or':
+        case 'implies':
+            return Math.max(depth(f.left), depth(f.right)) + 1;
+    }
+}
+//# sourceMappingURL=util.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../../../src/profiles/sequent-lk/util.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sCAAsC;AACtC,+DAA+D;;AAQ/D,sBAaC;AAED,gBAEC;AAGD,4BAEC;AAED,4BAIC;AAGD,4CAIC;AAGD,wCAEC;AAED,kCAEC;AAGD,sBAWC;AA9DD;;;GAGG;AACH,SAAgB,KAAK,CAAC,CAAY;IAChC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAC9B,KAAK,KAAK;YACR,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACjD,KAAK,IAAI;YACP,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACjD,KAAK,SAAS;YACZ,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;IACnD,CAAC;AACH,CAAC;AAED,SAAgB,EAAE,CAAC,CAAY,EAAE,CAAY;IAC3C,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED,8EAA8E;AAC9E,SAAgB,QAAQ,CAAI,EAAO;IACjC,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC;AACpB,CAAC;AAED,SAAgB,QAAQ,CAAI,EAAO,EAAE,GAAW;IAC9C,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;IACxB,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACpB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,0EAA0E;AAC1E,SAAgB,gBAAgB,CAAC,EAAe,EAAE,GAAW;IAC3D,MAAM,GAAG,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;IAClD,IAAI,GAAG,KAAK,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC,KAAK,EAAE,CAAC;IAClC,OAAO,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;AAC3B,CAAC;AAED,0EAA0E;AAC1E,SAAgB,cAAc,CAAC,EAAe,EAAE,GAAW;IACzD,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;AAC5C,CAAC;AAED,SAAgB,WAAW,CAAC,EAAe,EAAE,GAAW;IACtD,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;AAC1C,CAAC;AAED,2DAA2D;AAC3D,SAAgB,KAAK,CAAC,CAAY;IAChC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC;QACX,KAAK,KAAK;YACR,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,KAAK,KAAK,CAAC;QACX,KAAK,IAAI,CAAC;QACV,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IACvD,CAAC;AACH,CAAC"}

package/dist/proof-nets/construct.d.ts

@@ -0,0 +1,3 @@
+import { type MLLFormula, type ProofNet } from './types';
+export declare function constructFromSequent(formulas: MLLFormula[]): ProofNet;
+//# sourceMappingURL=construct.d.ts.map

package/dist/proof-nets/construct.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"construct.d.ts","sourceRoot":"","sources":["../../src/proof-nets/construct.ts"],"names":[],"mappings":"AAmBA,OAAO,EACL,KAAK,UAAU,EACf,KAAK,QAAQ,EAKd,MAAM,SAAS,CAAC;AAmCjB,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG,QAAQ,CAqCrE"}

package/dist/proof-nets/construct.js

@@ -0,0 +1,85 @@
+"use strict";
+// ============================================================
+// Proof Nets — Construcción a partir de un secuente
+// ============================================================
+//
+// Dado ⊢ Γ con Γ una lista de fórmulas MLL, esta construcción
+// produce un net candidato:
+//
+//   1. Para cada fórmula F_i de Γ se construye recursivamente su
+//      "árbol de descomposición": cada nodo interno se cablea con
+//      el link correspondiente (⊗ o ⅋), terminando en hojas que
+//      son átomos.
+//   2. Los átomos hoja se emparejan por pares duales (A con A⊥)
+//      vía axiom links. El pairing es greedy: para cada átomo
+//      libre busca su primer dual libre.
+//
+// El net producido puede o no ser correcto: si Γ no es probable
+// en MLL la correctitud Danos-Regnier fallará. Las conclusiones
+// son las raíces de los árboles de descomposición.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.constructFromSequent = constructFromSequent;
+const types_1 = require("./types");
+function freshNode(b, formula) {
+    const id = b.nextId++;
+    b.nodes.push({ id, formula });
+    return id;
+}
+// Construye el árbol de descomposición de `f`. Devuelve el id del
+// nodo raíz y la lista de ids de las hojas-átomo en orden de
+// recorrido en profundidad por la izquierda.
+function buildFormulaTree(b, f) {
+    if (f.kind === 'atom') {
+        const id = freshNode(b, f);
+        return { root: id, atomLeaves: [id] };
+    }
+    const left = buildFormulaTree(b, f.left);
+    const right = buildFormulaTree(b, f.right);
+    const root = freshNode(b, f);
+    b.links.push({
+        kind: f.kind === 'tensor' ? 'tensor' : 'par',
+        ports: [left.root, right.root, root],
+    });
+    return {
+        root,
+        atomLeaves: [...left.atomLeaves, ...right.atomLeaves],
+    };
+}
+function constructFromSequent(formulas) {
+    const b = { nodes: [], links: [], nextId: 0 };
+    const conclusions = [];
+    const atomLeaves = [];
+    for (const f of formulas) {
+        const tree = buildFormulaTree(b, f);
+        conclusions.push(tree.root);
+        atomLeaves.push(...tree.atomLeaves);
+    }
+    // Pairing greedy: para cada hoja sin asignar, busca la primera
+    // hoja dual sin asignar y crea un axiom link entre ambas.
+    const taken = new Set();
+    for (const i of atomLeaves) {
+        if (taken.has(i))
+            continue;
+        const fi = b.nodes[i].formula;
+        let partner = null;
+        for (const j of atomLeaves) {
+            if (j === i || taken.has(j))
+                continue;
+            const fj = b.nodes[j].formula;
+            if ((0, types_1.formulaEquals)(fj, (0, types_1.dual)(fi))) {
+                partner = j;
+                break;
+            }
+        }
+        if (partner === null) {
+            // Átomo sin par: se deja libre. El criterio de corrección
+            // detectará la inconsistencia (componente desconexa).
+            continue;
+        }
+        taken.add(i);
+        taken.add(partner);
+        b.links.push({ kind: 'axiom', ports: [i, partner] });
+    }
+    return { nodes: b.nodes, links: b.links, conclusions };
+}
+//# sourceMappingURL=construct.js.map

package/dist/proof-nets/construct.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"construct.js","sourceRoot":"","sources":["../../src/proof-nets/construct.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oDAAoD;AACpD,+DAA+D;AAC/D,EAAE;AACF,8DAA8D;AAC9D,4BAA4B;AAC5B,EAAE;AACF,iEAAiE;AACjE,kEAAkE;AAClE,gEAAgE;AAChE,mBAAmB;AACnB,gEAAgE;AAChE,8DAA8D;AAC9D,yCAAyC;AACzC,EAAE;AACF,gEAAgE;AAChE,gEAAgE;AAChE,mDAAmD;;AA4CnD,oDAqCC;AA/ED,mCAOiB;AAQjB,SAAS,SAAS,CAAC,CAAU,EAAE,OAAmB;IAChD,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;IACtB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IAC9B,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,kEAAkE;AAClE,6DAA6D;AAC7D,6CAA6C;AAC7C,SAAS,gBAAgB,CAAC,CAAU,EAAE,CAAa;IACjD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACxC,CAAC;IACD,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;QACX,IAAI,EAAE,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK;QAC5C,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC;KACrC,CAAC,CAAC;IACH,OAAO;QACL,IAAI;QACJ,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC;KACtD,CAAC;AACJ,CAAC;AAED,SAAgB,oBAAoB,CAAC,QAAsB;IACzD,MAAM,CAAC,GAAY,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACvD,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;IACtC,CAAC;IAED,+DAA+D;IAC/D,0DAA0D;IAC1D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC3B,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QAC9B,IAAI,OAAO,GAAkB,IAAI,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YACtC,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YAC9B,IAAI,IAAA,qBAAa,EAAC,EAAE,EAAE,IAAA,YAAI,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAChC,OAAO,GAAG,CAAC,CAAC;gBACZ,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACrB,0DAA0D;YAC1D,sDAAsD;YACtD,SAAS;QACX,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC;AACzD,CAAC"}

package/dist/proof-nets/correctness.d.ts

@@ -0,0 +1,3 @@
+import { type ProofNet } from './types';
+export declare function isCorrect(net: ProofNet): boolean;
+//# sourceMappingURL=correctness.d.ts.map

package/dist/proof-nets/correctness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"correctness.d.ts","sourceRoot":"","sources":["../../src/proof-nets/correctness.ts"],"names":[],"mappings":"AA+BA,OAAO,EAAmB,KAAK,QAAQ,EAAuB,MAAM,SAAS,CAAC;AA+J9E,wBAAgB,SAAS,CAAC,GAAG,EAAE,QAAQ,GAAG,OAAO,CAmBhD"}

package/dist/proof-nets/correctness.js

@@ -0,0 +1,213 @@
+"use strict";
+// ============================================================
+// Proof Nets — Criterio de corrección de Danos-Regnier
+// ============================================================
+//
+// Un net MLL es correcto sii para toda elección de "switch" sobre
+// los par-links (cada ⅋ elige una de sus dos premisas para
+// conservar la arista hacia la conclusión, descartando la otra),
+// el grafo resultante es:
+//
+//   - acíclico, y
+//   - conexo.
+//
+// Los demás links contribuyen aristas de forma fija:
+//   axiom  : una arista entre sus dos nodos.
+//   cut    : una arista entre sus dos nodos.
+//   tensor : dos aristas (premisa-izq — conclusión, premisa-der — conclusión).
+//   par    : sólo UNA arista por switch (conclusión — premisa elegida).
+//
+// La validación enumera los 2^(#par) switches. Para MLL el número
+// de par-links en una prueba típica es bajo; si fuera grande, el
+// criterio se puede reformular en tiempo lineal (algoritmo de
+// Guerrini), pero queda fuera del alcance educativo aquí.
+//
+// Además validamos consistencia local del net antes del criterio:
+//   - ports de cada link existen.
+//   - axiom/cut conectan fórmulas duales.
+//   - tensor/par conectan {A, B, A⊗B} resp. {A, B, A⅋B}.
+//   - cada nodo tiene la "valencia" correcta (los átomos terminan
+//     en exactamente un axiom o cut; los compuestos son
+//     premisa/conclusión de su link).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isCorrect = isCorrect;
+const types_1 = require("./types");
+function indexNodes(net) {
+    const idx = new Map();
+    for (const n of net.nodes) {
+        if (idx.has(n.id))
+            return null; // ids duplicados
+        idx.set(n.id, { formula: n.formula });
+    }
+    return idx;
+}
+function structurallyValid(net) {
+    const idx = indexNodes(net);
+    if (!idx)
+        return false;
+    for (const link of net.links) {
+        for (const p of link.ports) {
+            if (!idx.has(p))
+                return false;
+        }
+        if (link.kind === 'axiom' || link.kind === 'cut') {
+            if (link.ports.length !== 2)
+                return false;
+            const [a, b] = link.ports;
+            const fa = idx.get(a).formula;
+            const fb = idx.get(b).formula;
+            if (!(0, types_1.formulaEquals)(fa, (0, types_1.dual)(fb)))
+                return false;
+        }
+        else {
+            if (link.ports.length !== 3)
+                return false;
+            const [l, r, c] = link.ports;
+            const fc = idx.get(c).formula;
+            const fl = idx.get(l).formula;
+            const fr = idx.get(r).formula;
+            if (fc.kind !== link.kind)
+                return false;
+            if (!(0, types_1.formulaEquals)(fc.left, fl) || !(0, types_1.formulaEquals)(fc.right, fr))
+                return false;
+        }
+    }
+    // Valencia mínima: cada átomo debe ser hoja de un axiom o de un
+    // cut. Sin esa condición un átomo "huérfano" pasaría el criterio
+    // DR trivialmente (1 componente, sin ciclos) pero no representa
+    // una prueba: lo rechazamos a nivel estructural.
+    const conclusionsSet = new Set(net.conclusions);
+    for (const node of net.nodes) {
+        if (node.formula.kind !== 'atom')
+            continue;
+        let touches = 0;
+        for (const link of net.links) {
+            if ((link.kind === 'axiom' || link.kind === 'cut') && link.ports.includes(node.id)) {
+                touches++;
+            }
+        }
+        if (touches !== 1) {
+            // Excepción didáctica: si el único uso restante es como
+            // premisa de un tensor/par del cual es hoja, tampoco es
+            // válido — debe terminar en axiom/cut.
+            return false;
+        }
+    }
+    // Suprimimos `conclusionsSet` (declarado por simetría con
+    // futuras extensiones para validar conclusiones explícitas).
+    void conclusionsSet;
+    return true;
+}
+function edgesForSwitching(net, switching) {
+    // `switching[i]` = elección del i-ésimo par-link (true = izquierda).
+    const edges = [];
+    let parIndex = 0;
+    for (const link of net.links) {
+        switch (link.kind) {
+            case 'axiom':
+            case 'cut': {
+                const [a, b] = link.ports;
+                edges.push([a, b]);
+                break;
+            }
+            case 'tensor': {
+                const [l, r, c] = link.ports;
+                edges.push([l, c]);
+                edges.push([r, c]);
+                break;
+            }
+            case 'par': {
+                const [l, r, c] = link.ports;
+                const chooseLeft = switching[parIndex++];
+                edges.push([chooseLeft ? l : r, c]);
+                break;
+            }
+        }
+    }
+    return edges;
+}
+// ---------- Acíclico + conexo por Union-Find ----------
+class UnionFind {
+    parent = new Map();
+    rank = new Map();
+    add(x) {
+        if (!this.parent.has(x)) {
+            this.parent.set(x, x);
+            this.rank.set(x, 0);
+        }
+    }
+    find(x) {
+        let p = this.parent.get(x);
+        if (p !== x) {
+            p = this.find(p);
+            this.parent.set(x, p);
+        }
+        return p;
+    }
+    // Devuelve `false` si los nodos ya estaban en la misma componente
+    // (=> añadir la arista crearía un ciclo).
+    union(x, y) {
+        const rx = this.find(x);
+        const ry = this.find(y);
+        if (rx === ry)
+            return false;
+        const rkx = this.rank.get(rx);
+        const rky = this.rank.get(ry);
+        if (rkx < rky)
+            this.parent.set(rx, ry);
+        else if (rkx > rky)
+            this.parent.set(ry, rx);
+        else {
+            this.parent.set(ry, rx);
+            this.rank.set(rx, rkx + 1);
+        }
+        return true;
+    }
+    components() {
+        const roots = new Set();
+        for (const x of this.parent.keys())
+            roots.add(this.find(x));
+        return roots.size;
+    }
+}
+function switchingIsTree(net, edges) {
+    const uf = new UnionFind();
+    for (const n of net.nodes)
+        uf.add(n.id);
+    for (const [a, b] of edges) {
+        if (!uf.union(a, b))
+            return false; // ciclo
+    }
+    return uf.components() === 1;
+}
+// ---------- Enumeración de switchings ----------
+function countParLinks(net) {
+    let n = 0;
+    for (const l of net.links)
+        if (l.kind === 'par')
+            n++;
+    return n;
+}
+function isCorrect(net) {
+    if (!structurallyValid(net))
+        return false;
+    // Net vacío: trivialmente correcto sólo si no tiene nodos.
+    if (net.nodes.length === 0)
+        return net.links.length === 0;
+    const k = countParLinks(net);
+    // 2^k switchings; protección anti-explosión para tests didácticos.
+    // Con k>20 cualquier net razonable ya excede el alcance educativo.
+    if (k > 20)
+        return false;
+    const total = 1 << k;
+    for (let mask = 0; mask < total; mask++) {
+        const switching = [];
+        for (let i = 0; i < k; i++)
+            switching.push(((mask >> i) & 1) === 1);
+        const edges = edgesForSwitching(net, switching);
+        if (!switchingIsTree(net, edges))
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=correctness.js.map

package/dist/proof-nets/correctness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"correctness.js","sourceRoot":"","sources":["../../src/proof-nets/correctness.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uDAAuD;AACvD,+DAA+D;AAC/D,EAAE;AACF,kEAAkE;AAClE,2DAA2D;AAC3D,iEAAiE;AACjE,0BAA0B;AAC1B,EAAE;AACF,kBAAkB;AAClB,cAAc;AACd,EAAE;AACF,qDAAqD;AACrD,6CAA6C;AAC7C,6CAA6C;AAC7C,+EAA+E;AAC/E,wEAAwE;AACxE,EAAE;AACF,kEAAkE;AAClE,iEAAiE;AACjE,8DAA8D;AAC9D,0DAA0D;AAC1D,EAAE;AACF,kEAAkE;AAClE,kCAAkC;AAClC,0CAA0C;AAC1C,yDAAyD;AACzD,kEAAkE;AAClE,wDAAwD;AACxD,sCAAsC;;AAiKtC,8BAmBC;AAlLD,mCAA8E;AAQ9E,SAAS,UAAU,CAAC,GAAa;IAC/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAqB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC,iBAAiB;QACjD,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,iBAAiB,CAAC,GAAa;IACtC,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG;QAAE,OAAO,KAAK,CAAC;IACvB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAChC,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACjD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC1C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAyB,CAAC;YAC9C,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC;YAC/B,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC;YAC/B,IAAI,CAAC,IAAA,qBAAa,EAAC,EAAE,EAAE,IAAA,YAAI,EAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QACjD,CAAC;aAAM,CAAC;YACN,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC1C,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAiC,CAAC;YACzD,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC;YAC/B,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC;YAC/B,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC;YAC/B,IAAI,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;YACxC,IAAI,CAAC,IAAA,qBAAa,EAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAA,qBAAa,EAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC;gBAAE,OAAO,KAAK,CAAC;QAChF,CAAC;IACH,CAAC;IAED,gEAAgE;IAChE,iEAAiE;IACjE,gEAAgE;IAChE,iDAAiD;IACjD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAChD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QAC3C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACnF,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QACD,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;YAClB,wDAAwD;YACxD,wDAAwD;YACxD,uCAAuC;YACvC,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,0DAA0D;IAC1D,6DAA6D;IAC7D,KAAK,cAAc,CAAC;IACpB,OAAO,IAAI,CAAC;AACd,CAAC;AAMD,SAAS,iBAAiB,CAAC,GAAa,EAAE,SAAoB;IAC5D,qEAAqE;IACrE,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,OAAO,CAAC;YACb,KAAK,KAAK,CAAC,CAAC,CAAC;gBACX,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAyB,CAAC;gBAC9C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACnB,MAAM;YACR,CAAC;YACD,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAiC,CAAC;gBACzD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACnB,MAAM;YACR,CAAC;YACD,KAAK,KAAK,CAAC,CAAC,CAAC;gBACX,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,KAAiC,CAAC;gBACzD,MAAM,UAAU,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC;gBACzC,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,yDAAyD;AAEzD,MAAM,SAAS;IACL,MAAM,GAAwB,IAAI,GAAG,EAAE,CAAC;IACxC,IAAI,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC9C,GAAG,CAAC,CAAS;QACX,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,IAAI,CAAC,CAAS;QACZ,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,kEAAkE;IAClE,0CAA0C;IAC1C,KAAK,CAAC,CAAS,EAAE,CAAS;QACxB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,KAAK,CAAC;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC/B,IAAI,GAAG,GAAG,GAAG;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;aAClC,IAAI,GAAG,GAAG,GAAG;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;aACvC,CAAC;YACJ,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,UAAU;QACR,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,OAAO,KAAK,CAAC,IAAI,CAAC;IACpB,CAAC;CACF;AAED,SAAS,eAAe,CAAC,GAAa,EAAE,KAAa;IACnD,MAAM,EAAE,GAAG,IAAI,SAAS,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK;QAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACxC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,QAAQ;IAC7C,CAAC;IACD,OAAO,EAAE,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED,kDAAkD;AAElD,SAAS,aAAa,CAAC,GAAa;IAClC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,KAAK;QAAE,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;YAAE,CAAC,EAAE,CAAC;IACrD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAgB,SAAS,CAAC,GAAa;IACrC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAE1C,2DAA2D;IAC3D,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IAE1D,MAAM,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IAC7B,mEAAmE;IACnE,mEAAmE;IACnE,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,KAAK,CAAC;IAEzB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QACxC,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACpE,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAChD,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IACjD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/proof-nets/cut-elim.d.ts

@@ -0,0 +1,9 @@
+import { type ProofNet } from './types';
+export declare function reduceCutStep(net: ProofNet): {
+    net: ProofNet;
+    reduced: boolean;
+};
+export declare function reduceCut(net: ProofNet): ProofNet;
+export declare function isCutFree(net: ProofNet): boolean;
+export declare function normalizeCuts(net: ProofNet, maxSteps?: number): ProofNet;
+//# sourceMappingURL=cut-elim.d.ts.map

package/dist/proof-nets/cut-elim.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cut-elim.d.ts","sourceRoot":"","sources":["../../src/proof-nets/cut-elim.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,KAAK,QAAQ,EAA6D,MAAM,SAAS,CAAC;AAuCnG,wBAAgB,aAAa,CAAC,GAAG,EAAE,QAAQ,GAAG;IAAE,GAAG,EAAE,QAAQ,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CAWhF;AAwED,wBAAgB,SAAS,CAAC,GAAG,EAAE,QAAQ,GAAG,QAAQ,CAEjD;AAED,wBAAgB,SAAS,CAAC,GAAG,EAAE,QAAQ,GAAG,OAAO,CAEhD;AAED,wBAAgB,aAAa,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,SAAO,GAAG,QAAQ,CAQtE"}

package/dist/proof-nets/cut-elim.js

@@ -0,0 +1,149 @@
+"use strict";
+// ============================================================
+// Proof Nets — Eliminación de cortes
+// ============================================================
+//
+// Para MLL la cut-elimination es local y confluente. Dos pasos
+// fundamentales:
+//
+//   (axiom-cut)   axiom(a, a') + cut(a', b)
+//                 ─────────────────────────
+//                 las apariciones de a' se "atajan" hacia b:
+//                 los links que tocaban a' tocan ahora a, y
+//                 axiom + cut desaparecen.
+//
+//   (mult-cut)    tensor(l₁,r₁,c₁=A⊗B) + par(l₂,r₂,c₂=A⊥⅋B⊥) + cut(c₁,c₂)
+//                 ──────────────────────────────────────────────────────
+//                 dos cortes más pequeños: cut(l₁,l₂) y cut(r₁,r₂),
+//                 desaparecen los links ⊗, ⅋ y el cut original.
+//                 Los nodos c₁ y c₂ desaparecen.
+//
+// `reduceCut` aplica un paso (si existe alguno). `normalizeCuts`
+// itera hasta normal form (sin cortes). Para MLL la terminación
+// es trivial: cada paso reduce el número de conectivos en el
+// borde del cut.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reduceCutStep = reduceCutStep;
+exports.reduceCut = reduceCut;
+exports.isCutFree = isCutFree;
+exports.normalizeCuts = normalizeCuts;
+const types_1 = require("./types");
+// ---------- Helpers ----------
+function cloneNet(net) {
+    return {
+        nodes: net.nodes.map((n) => ({ id: n.id, formula: n.formula })),
+        links: net.links.map((l) => ({ kind: l.kind, ports: [...l.ports] })),
+        conclusions: [...net.conclusions],
+    };
+}
+function findLinkByPort(links, port, exceptIndex) {
+    for (let i = 0; i < links.length; i++) {
+        if (i === exceptIndex)
+            continue;
+        if (links[i].ports.includes(port))
+            return { index: i, link: links[i] };
+    }
+    return null;
+}
+function removeIndices(arr, indices) {
+    const drop = new Set(indices);
+    return arr.filter((_, i) => !drop.has(i));
+}
+function removeNodesById(nodes, ids) {
+    const drop = new Set(ids);
+    return nodes.filter((n) => !drop.has(n.id));
+}
+// ---------- Pasos de reducción ----------
+// Intenta aplicar UN paso de cut-elimination. Devuelve el nuevo
+// net (mismo objeto si no había nada que reducir) y un boolean
+// `reduced` indicando si efectivamente se redujo.
+function reduceCutStep(net) {
+    for (let i = 0; i < net.links.length; i++) {
+        const cut = net.links[i];
+        if (cut.kind !== 'cut')
+            continue;
+        const [a, b] = cut.ports;
+        const stepAB = tryReduceAt(net, i, a, b);
+        if (stepAB)
+            return { net: stepAB, reduced: true };
+        const stepBA = tryReduceAt(net, i, b, a);
+        if (stepBA)
+            return { net: stepBA, reduced: true };
+    }
+    return { net, reduced: false };
+}
+function tryReduceAt(net, cutIndex, portOnAxiomSide, otherPort) {
+    // Caso 1: axiom-cut. El nodo `portOnAxiomSide` participa en un
+    // axiom link.
+    const ax = findLinkByPort(net.links, portOnAxiomSide, cutIndex);
+    if (ax && ax.link.kind === 'axiom') {
+        const [p, q] = ax.link.ports;
+        const other = p === portOnAxiomSide ? q : p;
+        // Eliminamos axiom + cut. Cualquier link futuro que apuntara
+        // a `portOnAxiomSide` ya no existe (era hoja del axiom). El
+        // axiom ahora pasa a conectar `other` con `otherPort`: lo
+        // representamos como un nuevo axiom link entre ambos (es
+        // congruente con la semántica de "los duales quedan ligados").
+        //
+        // Sin embargo: si `otherPort` también es hoja de otro axiom,
+        // entonces toda esta cadena se colapsa eventualmente. Aquí
+        // hacemos sólo un paso: removemos cut, removemos axiom viejo,
+        // creamos axiom nuevo (other, otherPort) si los formulas son
+        // duales (deberían serlo por estructura del cut).
+        const next = cloneNet(net);
+        next.links = removeIndices(next.links, [cutIndex, ax.index]);
+        next.links.push({ kind: 'axiom', ports: [other, otherPort] });
+        // El nodo `portOnAxiomSide` queda huérfano; se elimina.
+        // Si era una conclusión (no debería: era hoja axiom) la
+        // quitamos también para mantener consistencia.
+        next.nodes = removeNodesById(next.nodes, [portOnAxiomSide]);
+        next.conclusions = next.conclusions.filter((c) => c !== portOnAxiomSide);
+        return next;
+    }
+    // Caso 2: mult-cut. `portOnAxiomSide` es la conclusión de un
+    // tensor link y `otherPort` la conclusión de un par link con
+    // fórmula dual.
+    const tensorLink = findLinkByPort(net.links, portOnAxiomSide, cutIndex);
+    if (tensorLink &&
+        tensorLink.link.kind === 'tensor' &&
+        tensorLink.link.ports[2] === portOnAxiomSide) {
+        const parLink = findLinkByPort(net.links, otherPort, cutIndex);
+        if (parLink && parLink.link.kind === 'par' && parLink.link.ports[2] === otherPort) {
+            const tensorNode = net.nodes.find((n) => n.id === portOnAxiomSide);
+            const parNode = net.nodes.find((n) => n.id === otherPort);
+            if (tensorNode &&
+                parNode &&
+                tensorNode.formula.kind === 'tensor' &&
+                parNode.formula.kind === 'par' &&
+                (0, types_1.formulaEquals)(tensorNode.formula, (0, types_1.dual)(parNode.formula))) {
+                const [tL, tR] = tensorLink.link.ports;
+                const [pL, pR] = parLink.link.ports;
+                const next = cloneNet(net);
+                next.links = removeIndices(next.links, [cutIndex, tensorLink.index, parLink.index]);
+                next.links.push({ kind: 'cut', ports: [tL, pL] });
+                next.links.push({ kind: 'cut', ports: [tR, pR] });
+                next.nodes = removeNodesById(next.nodes, [portOnAxiomSide, otherPort]);
+                next.conclusions = next.conclusions.filter((c) => c !== portOnAxiomSide && c !== otherPort);
+                return next;
+            }
+        }
+    }
+    return null;
+}
+function reduceCut(net) {
+    return reduceCutStep(net).net;
+}
+function isCutFree(net) {
+    return !net.links.some((l) => l.kind === 'cut');
+}
+function normalizeCuts(net, maxSteps = 1000) {
+    let current = net;
+    for (let i = 0; i < maxSteps; i++) {
+        const step = reduceCutStep(current);
+        if (!step.reduced)
+            return step.net;
+        current = step.net;
+    }
+    return current;
+}
+//# sourceMappingURL=cut-elim.js.map

package/dist/proof-nets/cut-elim.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cut-elim.js","sourceRoot":"","sources":["../../src/proof-nets/cut-elim.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qCAAqC;AACrC,+DAA+D;AAC/D,EAAE;AACF,+DAA+D;AAC/D,iBAAiB;AACjB,EAAE;AACF,4CAA4C;AAC5C,4CAA4C;AAC5C,6DAA6D;AAC7D,4DAA4D;AAC5D,2CAA2C;AAC3C,EAAE;AACF,0EAA0E;AAC1E,yEAAyE;AACzE,oEAAoE;AACpE,gEAAgE;AAChE,iDAAiD;AACjD,EAAE;AACF,iEAAiE;AACjE,gEAAgE;AAChE,6DAA6D;AAC7D,iBAAiB;;AAyCjB,sCAWC;AAwED,8BAEC;AAED,8BAEC;AAED,sCAQC;AA1ID,mCAAmG;AAEnG,gCAAgC;AAEhC,SAAS,QAAQ,CAAC,GAAa;IAC7B,OAAO;QACL,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QAC/D,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpE,WAAW,EAAE,CAAC,GAAG,GAAG,CAAC,WAAW,CAAC;KAClC,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CACrB,KAAqB,EACrB,IAAY,EACZ,WAAmB;IAEnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,CAAC,KAAK,WAAW;YAAE,SAAS;QAChC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACzE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,aAAa,CAAI,GAAQ,EAAE,OAAiB;IACnD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAC9B,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED,SAAS,eAAe,CAAC,KAAqB,EAAE,GAAa;IAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1B,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED,2CAA2C;AAE3C,gEAAgE;AAChE,+DAA+D;AAC/D,kDAAkD;AAClD,SAAgB,aAAa,CAAC,GAAa;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK;YAAE,SAAS;QACjC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,KAAyB,CAAC;QAC7C,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,MAAM;YAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QAClD,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,MAAM;YAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IACpD,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AACjC,CAAC;AAED,SAAS,WAAW,CAClB,GAAa,EACb,QAAgB,EAChB,eAAuB,EACvB,SAAiB;IAEjB,+DAA+D;IAC/D,cAAc;IACd,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,eAAe,EAAE,QAAQ,CAAC,CAAC;IAChE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACnC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,KAAyB,CAAC;QACjD,MAAM,KAAK,GAAG,CAAC,KAAK,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,6DAA6D;QAC7D,4DAA4D;QAC5D,0DAA0D;QAC1D,yDAAyD;QACzD,+DAA+D;QAC/D,EAAE;QACF,6DAA6D;QAC7D,2DAA2D;QAC3D,8DAA8D;QAC9D,6DAA6D;QAC7D,kDAAkD;QAClD,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC;QAC9D,wDAAwD;QACxD,wDAAwD;QACxD,+CAA+C;QAC/C,IAAI,CAAC,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC;QAC5D,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,eAAe,CAAC,CAAC;QACzE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6DAA6D;IAC7D,6DAA6D;IAC7D,gBAAgB;IAChB,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,eAAe,EAAE,QAAQ,CAAC,CAAC;IACxE,IACE,UAAU;QACV,UAAU,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ;QACjC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,eAAe,EAC5C,CAAC;QACD,MAAM,OAAO,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC/D,IAAI,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;YAClF,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,eAAe,CAAC,CAAC;YACnE,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC;YAC1D,IACE,UAAU;gBACV,OAAO;gBACP,UAAU,CAAC,OAAO,CAAC,IAAI,KAAK,QAAQ;gBACpC,OAAO,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK;gBAC9B,IAAA,qBAAa,EAAC,UAAU,CAAC,OAAO,EAAE,IAAA,YAAI,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC,EACxD,CAAC;gBACD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,KAAiC,CAAC;gBACnE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,KAAiC,CAAC;gBAChE,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;gBAC3B,IAAI,CAAC,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;gBACpF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBAClD,IAAI,CAAC,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,eAAe,EAAE,SAAS,CAAC,CAAC,CAAC;gBACvE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,eAAe,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC;gBAC5F,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAgB,SAAS,CAAC,GAAa;IACrC,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;AAChC,CAAC;AAED,SAAgB,SAAS,CAAC,GAAa;IACrC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC;AAClD,CAAC;AAED,SAAgB,aAAa,CAAC,GAAa,EAAE,QAAQ,GAAG,IAAI;IAC1D,IAAI,OAAO,GAAG,GAAG,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,OAAO,IAAI,CAAC,GAAG,CAAC;QACnC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC;IACrB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/proof-nets/index.d.ts

@@ -0,0 +1,6 @@
+export type { Polarity, MLLFormula, LinkKind, ProofNetLink, ProofNetNode, ProofNet } from './types';
+export { atomPos, atomNeg, tensor, par, dual, formulaEquals, formulaToString } from './types';
+export { constructFromSequent } from './construct';
+export { isCorrect } from './correctness';
+export { reduceCut, reduceCutStep, normalizeCuts, isCutFree } from './cut-elim';
+//# sourceMappingURL=index.d.ts.map

package/dist/proof-nets/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/proof-nets/index.ts"],"names":[],"mappings":"AAaA,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEpG,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAE9F,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC"}

package/dist/proof-nets/index.js

@@ -0,0 +1,33 @@
+"use strict";
+// ============================================================
+// Proof Nets — Punto de entrada público
+// ============================================================
+//
+// Proof nets de Girard para MLL (Multiplicative Linear Logic):
+//   - construcción a partir de un secuente,
+//   - verificación de corrección (criterio Danos-Regnier),
+//   - eliminación de cortes (axiom-cut y mult-cut).
+//
+// Diseño "didáctico" cercano al estándar de la literatura:
+// nodos numerados, links {axiom, cut, tensor, par} con ports en
+// orden canónico, conclusiones explícitas.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isCutFree = exports.normalizeCuts = exports.reduceCutStep = exports.reduceCut = exports.isCorrect = exports.constructFromSequent = exports.formulaToString = exports.formulaEquals = exports.dual = exports.par = exports.tensor = exports.atomNeg = exports.atomPos = void 0;
+var types_1 = require("./types");
+Object.defineProperty(exports, "atomPos", { enumerable: true, get: function () { return types_1.atomPos; } });
+Object.defineProperty(exports, "atomNeg", { enumerable: true, get: function () { return types_1.atomNeg; } });
+Object.defineProperty(exports, "tensor", { enumerable: true, get: function () { return types_1.tensor; } });
+Object.defineProperty(exports, "par", { enumerable: true, get: function () { return types_1.par; } });
+Object.defineProperty(exports, "dual", { enumerable: true, get: function () { return types_1.dual; } });
+Object.defineProperty(exports, "formulaEquals", { enumerable: true, get: function () { return types_1.formulaEquals; } });
+Object.defineProperty(exports, "formulaToString", { enumerable: true, get: function () { return types_1.formulaToString; } });
+var construct_1 = require("./construct");
+Object.defineProperty(exports, "constructFromSequent", { enumerable: true, get: function () { return construct_1.constructFromSequent; } });
+var correctness_1 = require("./correctness");
+Object.defineProperty(exports, "isCorrect", { enumerable: true, get: function () { return correctness_1.isCorrect; } });
+var cut_elim_1 = require("./cut-elim");
+Object.defineProperty(exports, "reduceCut", { enumerable: true, get: function () { return cut_elim_1.reduceCut; } });
+Object.defineProperty(exports, "reduceCutStep", { enumerable: true, get: function () { return cut_elim_1.reduceCutStep; } });
+Object.defineProperty(exports, "normalizeCuts", { enumerable: true, get: function () { return cut_elim_1.normalizeCuts; } });
+Object.defineProperty(exports, "isCutFree", { enumerable: true, get: function () { return cut_elim_1.isCutFree; } });
+//# sourceMappingURL=index.js.map

package/dist/proof-nets/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/proof-nets/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wCAAwC;AACxC,+DAA+D;AAC/D,EAAE;AACF,+DAA+D;AAC/D,4CAA4C;AAC5C,2DAA2D;AAC3D,oDAAoD;AACpD,EAAE;AACF,2DAA2D;AAC3D,gEAAgE;AAChE,2CAA2C;;;AAI3C,iCAA8F;AAArF,gGAAA,OAAO,OAAA;AAAE,gGAAA,OAAO,OAAA;AAAE,+FAAA,MAAM,OAAA;AAAE,4FAAA,GAAG,OAAA;AAAE,6FAAA,IAAI,OAAA;AAAE,sGAAA,aAAa,OAAA;AAAE,wGAAA,eAAe,OAAA;AAE5E,yCAAmD;AAA1C,iHAAA,oBAAoB,OAAA;AAC7B,6CAA0C;AAAjC,wGAAA,SAAS,OAAA;AAClB,uCAAgF;AAAvE,qGAAA,SAAS,OAAA;AAAE,yGAAA,aAAa,OAAA;AAAE,yGAAA,aAAa,OAAA;AAAE,qGAAA,SAAS,OAAA"}