@stevenvo780/st-lang 4.4.0 → 4.5.0

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

package/dist/tests/coinduction/coinduction.test.js

@@ -0,0 +1,217 @@
+"use strict";
+// ============================================================
+// ST Coinduction — Tests
+// ============================================================
+// Cubre:
+//   • Constructores corecursivos (repeat, iterate, unfold).
+//   • Streams notables (naturals, fibonacci).
+//   • Functor/aplicativo (map, zipWith, zip, scan).
+//   • Identidades coinductivas vía isBisimilar (acotado).
+//   • Bisimulación up-to vía `prove` con relaciones explícitas.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const coinduction_1 = require("../../coinduction");
+(0, vitest_1.describe)('Coinduction — constructores básicos', () => {
+    (0, vitest_1.it)('repeat genera un stream constante', () => {
+        const xs = (0, coinduction_1.repeat)(7);
+        (0, vitest_1.expect)((0, coinduction_1.take)(xs, 5)).toEqual([7, 7, 7, 7, 7]);
+    });
+    (0, vitest_1.it)('repeat preserva identidad de cola (punto fijo)', () => {
+        // tail(repeat x) === repeat x (mismo nodo) — propiedad coinductiva
+        // fuerte que sólo se cumple por la implementación con auto-referencia.
+        const xs = (0, coinduction_1.repeat)(0);
+        (0, vitest_1.expect)(xs.tail()).toBe(xs);
+    });
+    (0, vitest_1.it)('iterate aplica f repetidamente', () => {
+        const xs = (0, coinduction_1.iterate)((n) => n * 2, 1);
+        (0, vitest_1.expect)((0, coinduction_1.take)(xs, 6)).toEqual([1, 2, 4, 8, 16, 32]);
+    });
+    (0, vitest_1.it)('cons construye correctamente cabeza y cola', () => {
+        const xs = (0, coinduction_1.cons)(99, () => (0, coinduction_1.repeat)(0));
+        (0, vitest_1.expect)(xs.head).toBe(99);
+        (0, vitest_1.expect)((0, coinduction_1.take)(xs, 4)).toEqual([99, 0, 0, 0]);
+    });
+    (0, vitest_1.it)('unfold anamorfismo: enumera potencias de 2', () => {
+        const powers = (0, coinduction_1.unfold)(1, (s) => [s, s * 2]);
+        (0, vitest_1.expect)((0, coinduction_1.take)(powers, 5)).toEqual([1, 2, 4, 8, 16]);
+    });
+});
+(0, vitest_1.describe)('Coinduction — observaciones', () => {
+    (0, vitest_1.it)('take devuelve los primeros n elementos', () => {
+        (0, vitest_1.expect)((0, coinduction_1.take)(coinduction_1.naturals, 5)).toEqual([0, 1, 2, 3, 4]);
+    });
+    (0, vitest_1.it)('take con n=0 devuelve array vacío', () => {
+        (0, vitest_1.expect)((0, coinduction_1.take)(coinduction_1.naturals, 0)).toEqual([]);
+    });
+    (0, vitest_1.it)('take rechaza n negativo o no entero', () => {
+        (0, vitest_1.expect)(() => (0, coinduction_1.take)(coinduction_1.naturals, -1)).toThrow();
+        (0, vitest_1.expect)(() => (0, coinduction_1.take)(coinduction_1.naturals, 1.5)).toThrow();
+    });
+    (0, vitest_1.it)('drop descarta n elementos', () => {
+        (0, vitest_1.expect)((0, coinduction_1.take)((0, coinduction_1.drop)(coinduction_1.naturals, 3), 4)).toEqual([3, 4, 5, 6]);
+    });
+    (0, vitest_1.it)('nth recupera el i-ésimo elemento', () => {
+        (0, vitest_1.expect)((0, coinduction_1.nth)(coinduction_1.naturals, 0)).toBe(0);
+        (0, vitest_1.expect)((0, coinduction_1.nth)(coinduction_1.naturals, 10)).toBe(10);
+        (0, vitest_1.expect)((0, coinduction_1.nth)(coinduction_1.fibonacci, 9)).toBe(34);
+    });
+});
+(0, vitest_1.describe)('Coinduction — streams notables', () => {
+    (0, vitest_1.it)('naturals = 0, 1, 2, ...', () => {
+        (0, vitest_1.expect)((0, coinduction_1.take)(coinduction_1.naturals, 5)).toEqual([0, 1, 2, 3, 4]);
+    });
+    (0, vitest_1.it)('fibonacci = 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...', () => {
+        (0, vitest_1.expect)((0, coinduction_1.take)(coinduction_1.fibonacci, 10)).toEqual([0, 1, 1, 2, 3, 5, 8, 13, 21, 34]);
+    });
+    (0, vitest_1.it)('fibonacci satisface F(n+2) = F(n+1) + F(n)', () => {
+        const fs = (0, coinduction_1.take)(coinduction_1.fibonacci, 20);
+        for (let i = 0; i + 2 < fs.length; i++) {
+            const a = fs[i];
+            const b = fs[i + 1];
+            const c = fs[i + 2];
+            if (a === undefined || b === undefined || c === undefined) {
+                throw new Error('fibonacci sample shorter than expected');
+            }
+            (0, vitest_1.expect)(c).toBe(a + b);
+        }
+    });
+});
+(0, vitest_1.describe)('Coinduction — functor/aplicativos', () => {
+    (0, vitest_1.it)('map respeta identidad observacionalmente: map(id, s) ~ s', () => {
+        (0, vitest_1.expect)((0, coinduction_1.isBisimilar)((0, coinduction_1.map)((x) => x, coinduction_1.naturals), coinduction_1.naturals, 50)).toBe(true);
+    });
+    (0, vitest_1.it)('zipWith combina elemento a elemento', () => {
+        const sumS = (0, coinduction_1.zipWith)((a, b) => a + b, coinduction_1.naturals, coinduction_1.naturals);
+        (0, vitest_1.expect)((0, coinduction_1.take)(sumS, 5)).toEqual([0, 2, 4, 6, 8]);
+    });
+    (0, vitest_1.it)('zip produce pares', () => {
+        const ps = (0, coinduction_1.take)((0, coinduction_1.zip)(coinduction_1.naturals, (0, coinduction_1.repeat)('x')), 3);
+        (0, vitest_1.expect)(ps).toEqual([
+            [0, 'x'],
+            [1, 'x'],
+            [2, 'x'],
+        ]);
+    });
+    (0, vitest_1.it)('filter mantiene sólo elementos que pasan el predicado', () => {
+        const evens = (0, coinduction_1.filter)((n) => n % 2 === 0, coinduction_1.naturals);
+        (0, vitest_1.expect)((0, coinduction_1.take)(evens, 5)).toEqual([0, 2, 4, 6, 8]);
+    });
+    (0, vitest_1.it)('scan acumula prefijos: scan(+, 0, naturals) = 0, 0, 1, 3, 6, 10, ...', () => {
+        const s = (0, coinduction_1.scan)((acc, x) => acc + x, 0, coinduction_1.naturals);
+        (0, vitest_1.expect)((0, coinduction_1.take)(s, 6)).toEqual([0, 0, 1, 3, 6, 10]);
+    });
+    (0, vitest_1.it)('interleave alterna a, b, a, b, ...', () => {
+        const xs = (0, coinduction_1.interleave)((0, coinduction_1.repeat)('a'), (0, coinduction_1.repeat)('b'));
+        (0, vitest_1.expect)((0, coinduction_1.take)(xs, 6)).toEqual(['a', 'b', 'a', 'b', 'a', 'b']);
+    });
+});
+(0, vitest_1.describe)('Coinduction — bisimulación acotada', () => {
+    (0, vitest_1.it)('isBisimilar es reflexivo sobre naturals', () => {
+        (0, vitest_1.expect)((0, coinduction_1.isBisimilar)(coinduction_1.naturals, coinduction_1.naturals, 100)).toBe(true);
+    });
+    (0, vitest_1.it)('isBisimilar detecta divergencia inmediata', () => {
+        const a = (0, coinduction_1.cons)(1, () => (0, coinduction_1.repeat)(0));
+        const b = (0, coinduction_1.cons)(2, () => (0, coinduction_1.repeat)(0));
+        (0, vitest_1.expect)((0, coinduction_1.isBisimilar)(a, b, 10)).toBe(false);
+    });
+    (0, vitest_1.it)('isBisimilar(naturals, map(id, naturals)) — corecursión idempotente', () => {
+        (0, vitest_1.expect)((0, coinduction_1.isBisimilar)(coinduction_1.naturals, (0, coinduction_1.map)((x) => x, coinduction_1.naturals), 100)).toBe(true);
+    });
+    (0, vitest_1.it)('isBisimilar de fibonacci consigo mismo', () => {
+        (0, vitest_1.expect)((0, coinduction_1.isBisimilar)(coinduction_1.fibonacci, coinduction_1.fibonacci, 30)).toBe(true);
+    });
+    (0, vitest_1.it)('isBisimilar detecta divergencia en la cola', () => {
+        // a = 0, 1, 2, 3, 4, ...
+        // b = 0, 1, 2, 99, 4, ...
+        const b = (0, coinduction_1.cons)(0, () => (0, coinduction_1.cons)(1, () => (0, coinduction_1.cons)(2, () => (0, coinduction_1.cons)(99, () => (0, coinduction_1.drop)(coinduction_1.naturals, 4)))));
+        (0, vitest_1.expect)((0, coinduction_1.isBisimilar)(coinduction_1.naturals, b, 10)).toBe(false);
+        (0, vitest_1.expect)((0, coinduction_1.isBisimilar)(coinduction_1.naturals, b, 3)).toBe(true); // primeros 3 sí coinciden
+    });
+    (0, vitest_1.it)('isBisimilar funciona con elementos compuestos (objetos planos)', () => {
+        const a = (0, coinduction_1.iterate)((p) => ({ x: p.x + 1 }), { x: 0 });
+        const b = (0, coinduction_1.map)((n) => ({ x: n }), coinduction_1.naturals);
+        (0, vitest_1.expect)((0, coinduction_1.isBisimilar)(a, b, 20)).toBe(true);
+    });
+    (0, vitest_1.it)('isBisimilar rechaza depth inválido', () => {
+        (0, vitest_1.expect)(() => (0, coinduction_1.isBisimilar)(coinduction_1.naturals, coinduction_1.naturals, -1)).toThrow();
+        (0, vitest_1.expect)(() => (0, coinduction_1.isBisimilar)(coinduction_1.naturals, coinduction_1.naturals, 1.5)).toThrow();
+    });
+});
+(0, vitest_1.describe)('Coinduction — bisimulación up-to (prove)', () => {
+    // Identidad clásica: map f (map g s) ~ map (f ∘ g) s.
+    // La relación que la atestigua: R(a, b) ≡ "a = map f (map g s')
+    // y b = map (f∘g) s' para algún s'". Computacionalmente, una vez
+    // que sabés que las cabezas coinciden, las colas se obtienen
+    // aplicando los destructores; la propiedad se sostiene por
+    // construcción. Para `prove`, basta dar una relación que sea
+    // verdadera para el par inicial y se mantenga bajo tail.
+    (0, vitest_1.it)('map (f ∘ g) s  ~  map f (map g s)', () => {
+        const f = (n) => n + 1;
+        const g = (n) => n * 2;
+        const lhs = (0, coinduction_1.map)(f, (0, coinduction_1.map)(g, coinduction_1.naturals));
+        const rhs = (0, coinduction_1.map)((n) => f(g(n)), coinduction_1.naturals);
+        const ok = (0, coinduction_1.prove)({
+            initial: [lhs, rhs],
+            // Relación: "ambos producen los mismos elementos hasta el inf."
+            // El motor de prove ya chequea head equality + avance, asi que
+            // basta un trivially-true predicate aquí (es la identidad up-to).
+            relation: (_a, _b) => true,
+        }, 50);
+        (0, vitest_1.expect)(ok).toBe(true);
+    });
+    (0, vitest_1.it)('prove falla si la relación es falsa en el par inicial', () => {
+        const ok = (0, coinduction_1.prove)({
+            initial: [coinduction_1.naturals, coinduction_1.naturals],
+            relation: (_a, _b) => false,
+        }, 5);
+        (0, vitest_1.expect)(ok).toBe(false);
+    });
+    (0, vitest_1.it)('prove detecta divergencia incluso con relación trivially-true', () => {
+        const a = coinduction_1.naturals;
+        const b = (0, coinduction_1.cons)(0, () => (0, coinduction_1.cons)(99, () => (0, coinduction_1.drop)(coinduction_1.naturals, 2)));
+        const ok = (0, coinduction_1.prove)({ initial: [a, b], relation: (_a, _b) => true }, 5);
+        (0, vitest_1.expect)(ok).toBe(false); // head del segundo paso difiere (1 vs 99)
+    });
+    (0, vitest_1.it)('prove para repeat: repeat x  ~  cons(x, () => repeat x)', () => {
+        const x = 42;
+        const lhs = (0, coinduction_1.repeat)(x);
+        const rhs = (0, coinduction_1.cons)(x, () => (0, coinduction_1.repeat)(x));
+        // Relación R(a, b): "ambos son streams constantes x"
+        const ok = (0, coinduction_1.prove)({
+            initial: [lhs, rhs],
+            relation: (a, b) => a.head === x && b.head === x,
+        }, 100);
+        (0, vitest_1.expect)(ok).toBe(true);
+    });
+    (0, vitest_1.it)('prove para iterate: tail(iterate f x)  ~  iterate f (f x)', () => {
+        const f = (n) => n + 3;
+        const lhs = (0, coinduction_1.iterate)(f, 0).tail();
+        const rhs = (0, coinduction_1.iterate)(f, f(0));
+        const ok = (0, coinduction_1.prove)({
+            initial: [lhs, rhs],
+            relation: (_a, _b) => true,
+        }, 50);
+        (0, vitest_1.expect)(ok).toBe(true);
+    });
+    (0, vitest_1.it)('prove rechaza depth inválido', () => {
+        (0, vitest_1.expect)(() => (0, coinduction_1.prove)({ initial: [coinduction_1.naturals, coinduction_1.naturals], relation: () => true }, -1)).toThrow();
+    });
+});
+(0, vitest_1.describe)('Coinduction — equality helper', () => {
+    const { equal } = coinduction_1.__internals;
+    (0, vitest_1.it)('equal sobre primitivos usa Object.is (NaN igual a NaN)', () => {
+        (0, vitest_1.expect)(equal(NaN, NaN)).toBe(true);
+        (0, vitest_1.expect)(equal(1, 1)).toBe(true);
+        (0, vitest_1.expect)(equal(1, '1')).toBe(false);
+    });
+    (0, vitest_1.it)('equal sobre arrays', () => {
+        (0, vitest_1.expect)(equal([1, 2, 3], [1, 2, 3])).toBe(true);
+        (0, vitest_1.expect)(equal([1, 2], [1, 2, 3])).toBe(false);
+    });
+    (0, vitest_1.it)('equal sobre objetos planos', () => {
+        (0, vitest_1.expect)(equal({ a: 1, b: 2 }, { a: 1, b: 2 })).toBe(true);
+        (0, vitest_1.expect)(equal({ a: 1 }, { a: 1, b: 2 })).toBe(false);
+    });
+});
+//# sourceMappingURL=coinduction.test.js.map

package/dist/tests/coinduction/coinduction.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coinduction.test.js","sourceRoot":"","sources":["../../../src/tests/coinduction/coinduction.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yBAAyB;AACzB,+DAA+D;AAC/D,SAAS;AACT,4DAA4D;AAC5D,8CAA8C;AAC9C,oDAAoD;AACpD,0DAA0D;AAC1D,gEAAgE;AAChE,+DAA+D;;AAE/D,mCAA8C;AAC9C,mDAoB2B;AAE3B,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,EAAE,GAAG,IAAA,oBAAM,EAAC,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,mEAAmE;QACnE,uEAAuE;QACvE,MAAM,EAAE,GAAG,IAAA,oBAAM,EAAC,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,EAAE,GAAG,IAAA,qBAAO,EAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,EAAE,GAAG,IAAA,kBAAI,EAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAA,oBAAM,EAAC,CAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,MAAM,GAAG,IAAA,oBAAM,EAAC,CAAC,EAAE,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAqB,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,sBAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,sBAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,kBAAI,EAAC,sBAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,kBAAI,EAAC,sBAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,IAAA,kBAAI,EAAC,sBAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,IAAA,eAAM,EAAC,IAAA,iBAAG,EAAC,sBAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,iBAAG,EAAC,sBAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,iBAAG,EAAC,uBAAS,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,sBAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,uBAAS,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,EAAE,GAAG,IAAA,kBAAI,EAAC,uBAAS,EAAE,EAAE,CAAC,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC1D,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;YAC5D,CAAC;YACD,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,IAAA,eAAM,EACJ,IAAA,yBAAW,EACT,IAAA,iBAAG,EAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,EAAE,sBAAQ,CAAC,EAC/B,sBAAQ,EACR,EAAE,CACH,CACF,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,IAAI,GAAG,IAAA,qBAAO,EAAC,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,sBAAQ,EAAE,sBAAQ,CAAC,CAAC;QAC1E,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mBAAmB,EAAE,GAAG,EAAE;QAC3B,MAAM,EAAE,GAAG,IAAA,kBAAI,EAAC,IAAA,iBAAG,EAAC,sBAAQ,EAAE,IAAA,oBAAM,EAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,OAAO,CAAC;YACjB,CAAC,CAAC,EAAE,GAAG,CAAC;YACR,CAAC,CAAC,EAAE,GAAG,CAAC;YACR,CAAC,CAAC,EAAE,GAAG,CAAC;SACT,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,KAAK,GAAG,IAAA,oBAAM,EAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,sBAAQ,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,GAAG,IAAA,kBAAI,EAAC,CAAC,GAAW,EAAE,CAAS,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,sBAAQ,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,EAAE,GAAG,IAAA,wBAAU,EAAC,IAAA,oBAAM,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAM,EAAC,GAAG,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,IAAA,kBAAI,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,sBAAQ,EAAE,sBAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,kBAAI,EAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAA,oBAAM,EAAC,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAA,kBAAI,EAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAA,oBAAM,EAAC,CAAC,CAAC,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,IAAA,eAAM,EACJ,IAAA,yBAAW,EACT,sBAAQ,EACR,IAAA,iBAAG,EAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,EAAE,sBAAQ,CAAC,EAC/B,GAAG,CACJ,CACF,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,uBAAS,EAAE,uBAAS,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,yBAAyB;QACzB,0BAA0B;QAC1B,MAAM,CAAC,GAAG,IAAA,kBAAI,EAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAA,kBAAI,EAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAA,kBAAI,EAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAA,kBAAI,EAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAA,kBAAI,EAAC,sBAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,sBAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,sBAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,0BAA0B;IAC5E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,CAAC,GAAG,IAAA,qBAAO,EAAC,CAAC,CAAgB,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACpE,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,sBAAQ,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,yBAAW,EAAC,sBAAQ,EAAE,sBAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC5D,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,yBAAW,EAAC,sBAAQ,EAAE,sBAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC/D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,sDAAsD;IACtD,gEAAgE;IAChE,iEAAiE;IACjE,6DAA6D;IAC7D,2DAA2D;IAC3D,6DAA6D;IAC7D,yDAAyD;IACzD,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,EAAE,sBAAQ,CAAC,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,IAAA,iBAAG,EAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,sBAAQ,CAAC,CAAC;QAElD,MAAM,EAAE,GAAG,IAAA,mBAAK,EACd;YACE,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACnB,gEAAgE;YAChE,+DAA+D;YAC/D,kEAAkE;YAClE,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI;SAC3B,EACD,EAAE,CACH,CAAC;QACF,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,EAAE,GAAG,IAAA,mBAAK,EACd;YACE,OAAO,EAAE,CAAC,sBAAQ,EAAE,sBAAQ,CAAC;YAC7B,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK;SAC5B,EACD,CAAC,CACF,CAAC;QACF,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,CAAC,GAAG,sBAAQ,CAAC;QACnB,MAAM,CAAC,GAAG,IAAA,kBAAI,EAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAA,kBAAI,EAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAA,kBAAI,EAAC,sBAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,IAAA,mBAAK,EAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,0CAA0C;IACpE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,IAAA,oBAAM,EAAC,CAAC,CAAC,CAAC;QACtB,MAAM,GAAG,GAAmB,IAAA,kBAAI,EAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAA,oBAAM,EAAC,CAAC,CAAC,CAAC,CAAC;QACrD,qDAAqD;QACrD,MAAM,EAAE,GAAG,IAAA,mBAAK,EACd;YACE,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACnB,QAAQ,EAAE,CAAC,CAAiB,EAAE,CAAiB,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;SACjF,EACD,GAAG,CACJ,CAAC;QACF,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAA,mBAAK,EACd;YACE,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACnB,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI;SAC3B,EACD,EAAE,CACH,CAAC;QACF,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,mBAAK,EAAC,EAAE,OAAO,EAAE,CAAC,sBAAQ,EAAE,sBAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC7F,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,MAAM,EAAE,KAAK,EAAE,GAAG,yBAAW,CAAC;IAE9B,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,IAAA,eAAM,EAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,IAAA,eAAM,EAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/combinators-ski/combinators-ski.test.d.ts

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

package/dist/tests/combinators-ski/combinators-ski.test.d.ts.map

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