@stevenvo780/st-lang 4.4.0 → 4.5.0

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"}

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

@@ -0,0 +1,36 @@
+export type Polarity = 'pos' | 'neg';
+export type MLLFormula = {
+    kind: 'atom';
+    name: string;
+    polarity: Polarity;
+} | {
+    kind: 'tensor';
+    left: MLLFormula;
+    right: MLLFormula;
+} | {
+    kind: 'par';
+    left: MLLFormula;
+    right: MLLFormula;
+};
+export type LinkKind = 'axiom' | 'cut' | 'tensor' | 'par';
+export interface ProofNetLink {
+    kind: LinkKind;
+    ports: number[];
+}
+export interface ProofNetNode {
+    id: number;
+    formula: MLLFormula;
+}
+export interface ProofNet {
+    nodes: ProofNetNode[];
+    links: ProofNetLink[];
+    conclusions: number[];
+}
+export declare const atomPos: (name: string) => MLLFormula;
+export declare const atomNeg: (name: string) => MLLFormula;
+export declare const tensor: (left: MLLFormula, right: MLLFormula) => MLLFormula;
+export declare const par: (left: MLLFormula, right: MLLFormula) => MLLFormula;
+export declare function dual(f: MLLFormula): MLLFormula;
+export declare function formulaEquals(a: MLLFormula, b: MLLFormula): boolean;
+export declare function formulaToString(f: MLLFormula): string;
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/proof-nets/types.ts"],"names":[],"mappings":"AAwBA,MAAM,MAAM,QAAQ,GAAG,KAAK,GAAG,KAAK,CAAC;AAErC,MAAM,MAAM,UAAU,GAClB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GACvD;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,CAAC;AAEzD,MAAM,MAAM,QAAQ,GAAG,OAAO,GAAG,KAAK,GAAG,QAAQ,GAAG,KAAK,CAAC;AAO1D,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,QAAQ,CAAC;IACf,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,UAAU,CAAC;CACrB;AAED,MAAM,WAAW,QAAQ;IACvB,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAID,eAAO,MAAM,OAAO,GAAI,MAAM,MAAM,KAAG,UAIrC,CAAC;AAEH,eAAO,MAAM,OAAO,GAAI,MAAM,MAAM,KAAG,UAIrC,CAAC;AAEH,eAAO,MAAM,MAAM,GAAI,MAAM,UAAU,EAAE,OAAO,UAAU,KAAG,UAI3D,CAAC;AAEH,eAAO,MAAM,GAAG,GAAI,MAAM,UAAU,EAAE,OAAO,UAAU,KAAG,UAIxD,CAAC;AAGH,wBAAgB,IAAI,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU,CAS9C;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,GAAG,OAAO,CAWnE;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,CASrD"}

package/dist/proof-nets/types.js

@@ -0,0 +1,89 @@
+"use strict";
+// ============================================================
+// Proof Nets — Tipos para MLL (Multiplicative Linear Logic)
+// ============================================================
+//
+// Proof nets de Girard: representación gráfica de pruebas en
+// linear logic sin "bureaucracy" de orden estructural.
+//
+// Para MLL puro sólo aparecen dos conectivos:
+//   ⊗  (tensor)  — multiplicativo positivo
+//   ⅋  (par)     — multiplicativo negativo
+//
+// Los átomos llevan polaridad explícita (A vs A⊥); la dualidad
+// satisface (A⊥)⊥ = A, (A⊗B)⊥ = A⊥ ⅋ B⊥, (A⅋B)⊥ = A⊥ ⊗ B⊥.
+//
+// Un nodo del net es la ocurrencia de una fórmula en algún punto
+// del grafo. Un link une nodos con la semántica habitual:
+//   axiom    : dos nodos duales, frescos como hojas del net.
+//   cut      : dos nodos duales, no aportan a la conclusión.
+//   tensor   : tres nodos {premisa-izq, premisa-der, conclusión}.
+//   par      : tres nodos {premisa-izq, premisa-der, conclusión}.
+//
+// Las conclusiones del net son los ids de los nodos que viven en
+// el "borde": ni premisa de tensor/par, ni participan en un cut.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.par = exports.tensor = exports.atomNeg = exports.atomPos = void 0;
+exports.dual = dual;
+exports.formulaEquals = formulaEquals;
+exports.formulaToString = formulaToString;
+// ---------- Constructores convenientes para fórmulas ----------
+const atomPos = (name) => ({
+    kind: 'atom',
+    name,
+    polarity: 'pos',
+});
+exports.atomPos = atomPos;
+const atomNeg = (name) => ({
+    kind: 'atom',
+    name,
+    polarity: 'neg',
+});
+exports.atomNeg = atomNeg;
+const tensor = (left, right) => ({
+    kind: 'tensor',
+    left,
+    right,
+});
+exports.tensor = tensor;
+const par = (left, right) => ({
+    kind: 'par',
+    left,
+    right,
+});
+exports.par = par;
+// Dualidad lineal: involutiva, distribuye De Morgan sobre ⊗ / ⅋.
+function dual(f) {
+    switch (f.kind) {
+        case 'atom':
+            return { kind: 'atom', name: f.name, polarity: f.polarity === 'pos' ? 'neg' : 'pos' };
+        case 'tensor':
+            return { kind: 'par', left: dual(f.left), right: dual(f.right) };
+        case 'par':
+            return { kind: 'tensor', left: dual(f.left), right: dual(f.right) };
+    }
+}
+function formulaEquals(a, b) {
+    if (a.kind !== b.kind)
+        return false;
+    switch (a.kind) {
+        case 'atom':
+            return a.name === b.name && a.polarity === b.polarity;
+        case 'tensor':
+        case 'par': {
+            const bb = b;
+            return formulaEquals(a.left, bb.left) && formulaEquals(a.right, bb.right);
+        }
+    }
+}
+function formulaToString(f) {
+    switch (f.kind) {
+        case 'atom':
+            return f.polarity === 'pos' ? f.name : `${f.name}⊥`;
+        case 'tensor':
+            return `(${formulaToString(f.left)} ⊗ ${formulaToString(f.right)})`;
+        case 'par':
+            return `(${formulaToString(f.left)} ⅋ ${formulaToString(f.right)})`;
+    }
+}
+//# sourceMappingURL=types.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/proof-nets/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4DAA4D;AAC5D,+DAA+D;AAC/D,EAAE;AACF,6DAA6D;AAC7D,uDAAuD;AACvD,EAAE;AACF,8CAA8C;AAC9C,2CAA2C;AAC3C,2CAA2C;AAC3C,EAAE;AACF,+DAA+D;AAC/D,2DAA2D;AAC3D,EAAE;AACF,iEAAiE;AACjE,0DAA0D;AAC1D,6DAA6D;AAC7D,6DAA6D;AAC7D,kEAAkE;AAClE,kEAAkE;AAClE,EAAE;AACF,iEAAiE;AACjE,iEAAiE;;;AA2DjE,oBASC;AAED,sCAWC;AAED,0CASC;AA5DD,iEAAiE;AAE1D,MAAM,OAAO,GAAG,CAAC,IAAY,EAAc,EAAE,CAAC,CAAC;IACpD,IAAI,EAAE,MAAM;IACZ,IAAI;IACJ,QAAQ,EAAE,KAAK;CAChB,CAAC,CAAC;AAJU,QAAA,OAAO,WAIjB;AAEI,MAAM,OAAO,GAAG,CAAC,IAAY,EAAc,EAAE,CAAC,CAAC;IACpD,IAAI,EAAE,MAAM;IACZ,IAAI;IACJ,QAAQ,EAAE,KAAK;CAChB,CAAC,CAAC;AAJU,QAAA,OAAO,WAIjB;AAEI,MAAM,MAAM,GAAG,CAAC,IAAgB,EAAE,KAAiB,EAAc,EAAE,CAAC,CAAC;IAC1E,IAAI,EAAE,QAAQ;IACd,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAJU,QAAA,MAAM,UAIhB;AAEI,MAAM,GAAG,GAAG,CAAC,IAAgB,EAAE,KAAiB,EAAc,EAAE,CAAC,CAAC;IACvE,IAAI,EAAE,KAAK;IACX,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAJU,QAAA,GAAG,OAIb;AAEH,iEAAiE;AACjE,SAAgB,IAAI,CAAC,CAAa;IAChC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;QACxF,KAAK,QAAQ;YACX,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QACnE,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;IACxE,CAAC;AACH,CAAC;AAED,SAAgB,aAAa,CAAC,CAAa,EAAE,CAAa;IACxD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAM,CAAc,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,KAAM,CAAc,CAAC,QAAQ,CAAC;QACpF,KAAK,QAAQ,CAAC;QACd,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAgB,eAAe,CAAC,CAAa;IAC3C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,QAAQ,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC;QACtD,KAAK,QAAQ;YACX,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;QACtE,KAAK,KAAK;YACR,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;IACxE,CAAC;AACH,CAAC"}

package/dist/tableau-framework/TableauProver.d.ts

@@ -0,0 +1,10 @@
+import type { Tableau, TableauBranch, Rule, ClosureCondition } from './types';
+export declare class TableauProver<F> {
+    private rules;
+    private closureConditions;
+    registerRule(rule: Rule<F>): void;
+    registerClosureCondition(check: ClosureCondition<F>): void;
+    prove(root: TableauBranch<F>, maxDepth?: number): Tableau<F>;
+    private checkClosure;
+}
+//# sourceMappingURL=TableauProver.d.ts.map

package/dist/tableau-framework/TableauProver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TableauProver.d.ts","sourceRoot":"","sources":["../../src/tableau-framework/TableauProver.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EACV,OAAO,EACP,aAAa,EAEb,IAAI,EACJ,gBAAgB,EACjB,MAAM,SAAS,CAAC;AAYjB,qBAAa,aAAa,CAAC,CAAC;IAC1B,OAAO,CAAC,KAAK,CAAiB;IAC9B,OAAO,CAAC,iBAAiB,CAA6B;IAEtD,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;IAIjC,wBAAwB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI;IAI1D,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,QAAQ,SAAK,GAAG,OAAO,CAAC,CAAC,CAAC;IAwFxD,OAAO,CAAC,YAAY;CAWrB"}