@stevenvo780/st-lang 4.4.0 → 4.5.1

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

package/dist/tableau-framework/TableauProver.js

@@ -0,0 +1,118 @@
+"use strict";
+// ============================================================
+// Tableau Framework — TableauProver<F>
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TableauProver = void 0;
+class TableauProver {
+    rules = [];
+    closureConditions = [];
+    registerRule(rule) {
+        this.rules.push(rule);
+    }
+    registerClosureCondition(check) {
+        this.closureConditions.push(check);
+    }
+    prove(root, maxDepth = 50) {
+        const rootClone = cloneBranch(root);
+        const rootEntry = { branch: rootClone, superseded: false };
+        const allEntries = [rootEntry];
+        // Work-list: pairs of (entry, depth).
+        const workList = [
+            { entry: rootEntry, depth: 0 },
+        ];
+        while (workList.length > 0) {
+            const item = workList.shift();
+            if (!item)
+                break;
+            const { entry, depth } = item;
+            const { branch } = entry;
+            if (branch.closed || entry.superseded)
+                continue;
+            // Check closure before any expansion.
+            this.checkClosure(branch);
+            if (branch.closed)
+                continue;
+            if (depth >= maxDepth)
+                continue;
+            // Find the first applicable rule.
+            let expanded = false;
+            for (let i = 0; i < branch.nodes.length; i++) {
+                const node = branch.nodes[i];
+                if (!node)
+                    continue;
+                const rule = this.rules.find(r => r.match(node, branch));
+                if (!rule)
+                    continue;
+                const expansions = rule.apply(node, branch);
+                if (expansions.length === 0)
+                    continue;
+                // Remaining nodes after removing the expanded node.
+                const remaining = [
+                    ...branch.nodes.slice(0, i),
+                    ...branch.nodes.slice(i + 1),
+                ];
+                if (expansions.length === 1 && expansions[0]) {
+                    // α-rule: extend this branch in place (no split).
+                    branch.nodes = [...remaining, ...expansions[0]];
+                    this.checkClosure(branch);
+                    if (!branch.closed) {
+                        workList.unshift({ entry, depth: depth + 1 });
+                    }
+                }
+                else {
+                    // β-rule: mark this entry as superseded, create children.
+                    entry.superseded = true;
+                    for (const newNodes of expansions) {
+                        const childBranch = cloneBranch({ nodes: [...remaining, ...newNodes], closed: false });
+                        const childEntry = { branch: childBranch, superseded: false };
+                        allEntries.push(childEntry);
+                        this.checkClosure(childBranch);
+                        if (!childBranch.closed) {
+                            workList.push({ entry: childEntry, depth: depth + 1 });
+                        }
+                    }
+                }
+                expanded = true;
+                break;
+            }
+            // No rule fired — saturated branch, run closure one more time.
+            if (!expanded) {
+                this.checkClosure(branch);
+            }
+        }
+        // Collect all branches (for the public API).
+        const allBranches = allEntries.map(e => e.branch);
+        // Leaf branches: not superseded (true terminal nodes of the tree).
+        const leafEntries = allEntries.filter(e => !e.superseded);
+        const open = leafEntries.filter(e => !e.branch.closed).map(e => e.branch);
+        const tableClosed = open.length === 0;
+        return {
+            root: rootClone,
+            branches: allBranches,
+            open,
+            closed: tableClosed,
+        };
+    }
+    checkClosure(branch) {
+        if (branch.closed)
+            return;
+        for (const cond of this.closureConditions) {
+            const reason = cond(branch);
+            if (reason !== null) {
+                branch.closed = true;
+                branch.reason = reason;
+                return;
+            }
+        }
+    }
+}
+exports.TableauProver = TableauProver;
+function cloneBranch(branch) {
+    return {
+        nodes: branch.nodes.map(n => ({ ...n })),
+        closed: branch.closed,
+        reason: branch.reason,
+    };
+}
+//# sourceMappingURL=TableauProver.js.map

package/dist/tableau-framework/TableauProver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TableauProver.js","sourceRoot":"","sources":["../../src/tableau-framework/TableauProver.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uCAAuC;AACvC,+DAA+D;;;AAoB/D,MAAa,aAAa;IAChB,KAAK,GAAc,EAAE,CAAC;IACtB,iBAAiB,GAA0B,EAAE,CAAC;IAEtD,YAAY,CAAC,IAAa;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED,wBAAwB,CAAC,KAA0B;QACjD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,KAAK,CAAC,IAAsB,EAAE,QAAQ,GAAG,EAAE;QACzC,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,SAAS,GAAmB,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;QAC3E,MAAM,UAAU,GAAqB,CAAC,SAAS,CAAC,CAAC;QAEjD,sCAAsC;QACtC,MAAM,QAAQ,GAAoD;YAChE,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE;SAC/B,CAAC;QAEF,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI;gBAAE,MAAM;YACjB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;YAC9B,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;YAEzB,IAAI,MAAM,CAAC,MAAM,IAAI,KAAK,CAAC,UAAU;gBAAE,SAAS;YAEhD,sCAAsC;YACtC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC1B,IAAI,MAAM,CAAC,MAAM;gBAAE,SAAS;YAE5B,IAAI,KAAK,IAAI,QAAQ;gBAAE,SAAS;YAEhC,kCAAkC;YAClC,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,CAAC,IAAI;oBAAE,SAAS;gBACpB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;gBACzD,IAAI,CAAC,IAAI;oBAAE,SAAS;gBAEpB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC5C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;gBAEtC,oDAAoD;gBACpD,MAAM,SAAS,GAAqB;oBAClC,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;oBAC3B,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;iBAC7B,CAAC;gBAEF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC7C,kDAAkD;oBAClD,MAAM,CAAC,KAAK,GAAG,CAAC,GAAG,SAAS,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;oBAC1B,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;wBACnB,QAAQ,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBAChD,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,0DAA0D;oBAC1D,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;oBACxB,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;wBAClC,MAAM,WAAW,GAAG,WAAW,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,EAAE,GAAG,QAAQ,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;wBACvF,MAAM,UAAU,GAAmB,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;wBAC9E,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBAC5B,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;wBAC/B,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;4BACxB,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;wBACzD,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,QAAQ,GAAG,IAAI,CAAC;gBAChB,MAAM;YACR,CAAC;YAED,+DAA+D;YAC/D,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,6CAA6C;QAC7C,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAElD,mEAAmE;QACnE,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QAC1D,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC1E,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;QAEtC,OAAO;YACL,IAAI,EAAE,SAAS;YACf,QAAQ,EAAE,WAAW;YACrB,IAAI;YACJ,MAAM,EAAE,WAAW;SACpB,CAAC;IACJ,CAAC;IAEO,YAAY,CAAC,MAAwB;QAC3C,IAAI,MAAM,CAAC,MAAM;YAAE,OAAO;QAC1B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5B,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACpB,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC;gBACrB,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC;gBACvB,OAAO;YACT,CAAC;QACH,CAAC;IACH,CAAC;CACF;AA/GD,sCA+GC;AAED,SAAS,WAAW,CAAI,MAAwB;IAC9C,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,MAAM,EAAE,MAAM,CAAC,MAAM;KACtB,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,5 @@
+export type { TableauNode, TableauBranch, Tableau, Rule, ClosureCondition } from './types';
+export { TableauProver } from './TableauProver';
+export { createPropositionalProver } from './propositional';
+export type { PropFormula } from './propositional';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/tableau-framework/index.ts"],"names":[],"mappings":"AAIA,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC3F,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,yBAAyB,EAAE,MAAM,iBAAiB,CAAC;AAC5D,YAAY,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC"}

package/dist/tableau-framework/index.js

@@ -0,0 +1,11 @@
+"use strict";
+// ============================================================
+// Tableau Framework — Public API
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createPropositionalProver = exports.TableauProver = void 0;
+var TableauProver_1 = require("./TableauProver");
+Object.defineProperty(exports, "TableauProver", { enumerable: true, get: function () { return TableauProver_1.TableauProver; } });
+var propositional_1 = require("./propositional");
+Object.defineProperty(exports, "createPropositionalProver", { enumerable: true, get: function () { return propositional_1.createPropositionalProver; } });
+//# sourceMappingURL=index.js.map

package/dist/tableau-framework/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/tableau-framework/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iCAAiC;AACjC,+DAA+D;;;AAG/D,iDAAgD;AAAvC,8GAAA,aAAa,OAAA;AACtB,iDAA4D;AAAnD,0HAAA,yBAAyB,OAAA"}

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

@@ -0,0 +1,11 @@
+import { TableauProver } from './TableauProver';
+/**
+ * Minimal formula shape used by the propositional prover.
+ * More fields (args, name, etc.) are allowed via the index signature.
+ */
+export type PropFormula = {
+    kind: string;
+    [k: string]: unknown;
+};
+export declare function createPropositionalProver(): TableauProver<PropFormula>;
+//# sourceMappingURL=propositional.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"propositional.d.ts","sourceRoot":"","sources":["../../src/tableau-framework/propositional.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;GAGG;AACH,MAAM,MAAM,WAAW,GAAG;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CACtB,CAAC;AA4IF,wBAAgB,yBAAyB,IAAI,aAAa,CAAC,WAAW,CAAC,CActE"}

package/dist/tableau-framework/propositional.js

@@ -0,0 +1,143 @@
+"use strict";
+// ============================================================
+// Tableau Framework — Propositional prover factory
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createPropositionalProver = createPropositionalProver;
+const TableauProver_1 = require("./TableauProver");
+// ── Helpers ──────────────────────────────────────────────────
+function args(f) {
+    return Array.isArray(f['args']) ? f['args'] : [];
+}
+function arg0(f) {
+    const a = args(f);
+    if (!a[0])
+        throw new Error(`Expected at least one argument in ${f.kind}`);
+    return a[0];
+}
+function arg1(f) {
+    const a = args(f);
+    if (!a[1])
+        throw new Error(`Expected at least two arguments in ${f.kind}`);
+    return a[1];
+}
+function signed(formula, s, label) {
+    return { formula, signed: s, label };
+}
+// ── Standard signed-tableau rules ────────────────────────────
+/**
+ * T¬A → F A
+ */
+const ruleT_Not = {
+    name: 'T-Not',
+    match: n => n.signed === 'T' && n.formula.kind === 'not',
+    apply: (n) => [[signed(arg0(n.formula), 'F', 'T-Not')]],
+};
+/**
+ * F¬A → T A
+ */
+const ruleF_Not = {
+    name: 'F-Not',
+    match: n => n.signed === 'F' && n.formula.kind === 'not',
+    apply: (n) => [[signed(arg0(n.formula), 'T', 'F-Not')]],
+};
+/**
+ * T(A∧B) → T A, T B  (α-rule)
+ */
+const ruleT_And = {
+    name: 'T-And',
+    match: n => n.signed === 'T' && n.formula.kind === 'and',
+    apply: (n) => [[signed(arg0(n.formula), 'T', 'T-And'), signed(arg1(n.formula), 'T', 'T-And')]],
+};
+/**
+ * F(A∧B) → F A | F B  (β-rule)
+ */
+const ruleF_And = {
+    name: 'F-And',
+    match: n => n.signed === 'F' && n.formula.kind === 'and',
+    apply: (n) => [
+        [signed(arg0(n.formula), 'F', 'F-And')],
+        [signed(arg1(n.formula), 'F', 'F-And')],
+    ],
+};
+/**
+ * T(A∨B) → T A | T B  (β-rule)
+ */
+const ruleT_Or = {
+    name: 'T-Or',
+    match: n => n.signed === 'T' && n.formula.kind === 'or',
+    apply: (n) => [
+        [signed(arg0(n.formula), 'T', 'T-Or')],
+        [signed(arg1(n.formula), 'T', 'T-Or')],
+    ],
+};
+/**
+ * F(A∨B) → F A, F B  (α-rule)
+ */
+const ruleF_Or = {
+    name: 'F-Or',
+    match: n => n.signed === 'F' && n.formula.kind === 'or',
+    apply: (n) => [[signed(arg0(n.formula), 'F', 'F-Or'), signed(arg1(n.formula), 'F', 'F-Or')]],
+};
+/**
+ * T(A→B) → F A | T B  (β-rule)
+ */
+const ruleT_Implies = {
+    name: 'T-Implies',
+    match: n => n.signed === 'T' && n.formula.kind === 'implies',
+    apply: (n) => [
+        [signed(arg0(n.formula), 'F', 'T-Implies')],
+        [signed(arg1(n.formula), 'T', 'T-Implies')],
+    ],
+};
+/**
+ * F(A→B) → T A, F B  (α-rule)
+ */
+const ruleF_Implies = {
+    name: 'F-Implies',
+    match: n => n.signed === 'F' && n.formula.kind === 'implies',
+    apply: (n) => [[signed(arg0(n.formula), 'T', 'F-Implies'), signed(arg1(n.formula), 'F', 'F-Implies')]],
+};
+// ── Standard closure condition ────────────────────────────────
+/**
+ * A branch closes when it contains both T A and F A for some formula A.
+ */
+function contradictionClosure(branch) {
+    const tSet = new Set();
+    const fSet = new Set();
+    for (const n of branch.nodes) {
+        const key = formulaKey(n.formula);
+        if (n.signed === 'T')
+            tSet.add(key);
+        if (n.signed === 'F')
+            fSet.add(key);
+    }
+    for (const k of tSet) {
+        if (fSet.has(k))
+            return `Contradiction: T ${k} and F ${k}`;
+    }
+    return null;
+}
+function formulaKey(f) {
+    const a = args(f);
+    if (a.length === 0) {
+        const name = typeof f['name'] === 'string' ? f['name'] : '';
+        return `${f.kind}(${name})`;
+    }
+    return `${f.kind}(${a.map(formulaKey).join(',')})`;
+}
+// ── Factory ───────────────────────────────────────────────────
+function createPropositionalProver() {
+    const prover = new TableauProver_1.TableauProver();
+    for (const rule of [
+        ruleT_Not, ruleF_Not,
+        ruleT_And, ruleF_And,
+        ruleT_Or, ruleF_Or,
+        ruleT_Implies, ruleF_Implies,
+    ]) {
+        prover.registerRule(rule);
+    }
+    prover.registerClosureCondition(contradictionClosure);
+    return prover;
+}
+//# sourceMappingURL=propositional.js.map

package/dist/tableau-framework/propositional.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"propositional.js","sourceRoot":"","sources":["../../src/tableau-framework/propositional.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mDAAmD;AACnD,+DAA+D;;AAwJ/D,8DAcC;AApKD,mDAAgD;AAehD,gEAAgE;AAEhE,SAAS,IAAI,CAAC,CAAc;IAC1B,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,MAAM,CAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;AACtE,CAAC;AAED,SAAS,IAAI,CAAC,CAAc;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1E,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AACd,CAAC;AAED,SAAS,IAAI,CAAC,CAAc;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3E,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AACd,CAAC;AAED,SAAS,MAAM,CAAC,OAAoB,EAAE,CAAY,EAAE,KAAc;IAChE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;AACvC,CAAC;AAED,gEAAgE;AAEhE;;GAEG;AACH,MAAM,SAAS,GAAsB;IACnC,IAAI,EAAE,OAAO;IACb,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK;IACxD,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;CACxD,CAAC;AAEF;;GAEG;AACH,MAAM,SAAS,GAAsB;IACnC,IAAI,EAAE,OAAO;IACb,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK;IACxD,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;CACxD,CAAC;AAEF;;GAEG;AACH,MAAM,SAAS,GAAsB;IACnC,IAAI,EAAE,OAAO;IACb,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK;IACxD,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;CAC/F,CAAC;AAEF;;GAEG;AACH,MAAM,SAAS,GAAsB;IACnC,IAAI,EAAE,OAAO;IACb,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK;IACxD,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;QACZ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;KACxC;CACF,CAAC;AAEF;;GAEG;AACH,MAAM,QAAQ,GAAsB;IAClC,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,IAAI;IACvD,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;QACZ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;QACtC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;KACvC;CACF,CAAC;AAEF;;GAEG;AACH,MAAM,QAAQ,GAAsB;IAClC,IAAI,EAAE,MAAM;IACZ,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,IAAI;IACvD,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;CAC7F,CAAC;AAEF;;GAEG;AACH,MAAM,aAAa,GAAsB;IACvC,IAAI,EAAE,WAAW;IACjB,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,SAAS;IAC5D,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;QACZ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;QAC3C,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;KAC5C;CACF,CAAC;AAEF;;GAEG;AACH,MAAM,aAAa,GAAsB;IACvC,IAAI,EAAE,WAAW;IACjB,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,SAAS;IAC5D,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC;CACvG,CAAC;AAEF,iEAAiE;AAEjE;;GAEG;AACH,SAAS,oBAAoB,CAAC,MAAe;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,CAAC,MAAM,KAAK,GAAG;YAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,CAAC,MAAM,KAAK,GAAG;YAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,oBAAoB,CAAC,UAAU,CAAC,EAAE,CAAC;IAC7D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,UAAU,CAAC,CAAc;IAChC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5D,OAAO,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,GAAG,CAAC;IAC9B,CAAC;IACD,OAAO,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AACrD,CAAC;AAED,iEAAiE;AAEjE,SAAgB,yBAAyB;IACvC,MAAM,MAAM,GAAG,IAAI,6BAAa,EAAe,CAAC;IAEhD,KAAK,MAAM,IAAI,IAAI;QACjB,SAAS,EAAE,SAAS;QACpB,SAAS,EAAE,SAAS;QACpB,QAAQ,EAAG,QAAQ;QACnB,aAAa,EAAE,aAAa;KAC7B,EAAE,CAAC;QACF,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,wBAAwB,CAAC,oBAAoB,CAAC,CAAC;IACtD,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,32 @@
+export interface TableauNode<F> {
+    formula: F;
+    signed?: 'T' | 'F';
+    label?: string;
+}
+export interface TableauBranch<F> {
+    nodes: TableauNode<F>[];
+    closed: boolean;
+    reason?: string;
+}
+export interface Tableau<F> {
+    root: TableauBranch<F>;
+    branches: TableauBranch<F>[];
+    open: TableauBranch<F>[];
+    closed: boolean;
+}
+/**
+ * A rule consumes a node from a branch and expands it into
+ * one or more groups of new nodes.  Each inner array represents
+ * a new branch (α-rules return 1 group, β-rules return 2+).
+ */
+export type Rule<F> = {
+    name: string;
+    match: (node: TableauNode<F>, branch: TableauBranch<F>) => boolean;
+    apply: (node: TableauNode<F>, branch: TableauBranch<F>) => TableauNode<F>[][];
+};
+/**
+ * A closure condition inspects a branch and returns a human-readable
+ * reason string when the branch should be closed, or null otherwise.
+ */
+export type ClosureCondition<F> = (branch: TableauBranch<F>) => string | null;
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/tableau-framework/types.ts"],"names":[],"mappings":"AAIA,MAAM,WAAW,WAAW,CAAC,CAAC;IAC5B,OAAO,EAAE,CAAC,CAAC;IACX,MAAM,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IACxB,MAAM,EAAE,OAAO,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,OAAO,CAAC,CAAC;IACxB,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;IACvB,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7B,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC;IACzB,MAAM,EAAE,OAAO,CAAC;CACjB;AAED;;;;GAIG;AACH,MAAM,MAAM,IAAI,CAAC,CAAC,IAAI;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC;IACnE,KAAK,EAAE,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;CAC/E,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,gBAAgB,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,MAAM,GAAG,IAAI,CAAC"}

package/dist/tableau-framework/types.js

@@ -0,0 +1,6 @@
+"use strict";
+// ============================================================
+// Tableau Framework — Core types
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/tableau-framework/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/tableau-framework/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iCAAiC;AACjC,+DAA+D"}

package/dist/tests/coinduction/coinduction.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=coinduction.test.d.ts.map

package/dist/tests/coinduction/coinduction.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coinduction.test.d.ts","sourceRoot":"","sources":["../../../src/tests/coinduction/coinduction.test.ts"],"names":[],"mappings":""}