@stevenvo780/st-lang 4.5.1 → 4.6.0

package/dist/game-theory/support-enumeration.js

@@ -0,0 +1,214 @@
+"use strict";
+// ============================================================
+// Support enumeration — algoritmo para enumerar TODOS los Nash
+// equilibria de un juego 2-player.
+// ============================================================
+//
+// Idea (Dickhaut–Kaplan, generalizado): un equilibrio mixto está
+// soportado por dos subconjuntos S_1 ⊆ [n], S_2 ⊆ [m] de igual
+// cardinalidad (por el Lemma de complementariedad).
+//
+// Para cada par (S_1, S_2) del mismo tamaño k:
+//   - jugador 1 mezcla solo en S_1 con probs p_i (i ∈ S_1)
+//   - jugador 2 mezcla solo en S_2 con probs q_j (j ∈ S_2)
+//   - p, q deben volver indiferente al rival en su soporte:
+//       sum_i p_i * a[i][j]  = u_2  para todo j ∈ S_2
+//       sum_j q_j * a'[i][j] = u_1  para todo i ∈ S_1
+//     (donde a' = pagos de player 1, a = pagos de player 2)
+//   - p, q ≥ 0, suman 1
+//   - mejores fuera del soporte no deben superar el pago de equilibrio
+//
+// Resolvemos el sistema lineal y filtramos. Para juegos chicos
+// (n*m ≤ ~10) la enumeración es trivial: 2^n * 2^m subsets.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.enumerateAllNash = enumerateAllNash;
+const types_1 = require("./types");
+const linalg_1 = require("./linalg");
+const TOL = 1e-9;
+function enumerateAllNash(game, maxSize) {
+    if (game.players !== 2) {
+        throw new Error('enumerateAllNash currently supports 2-player games only');
+    }
+    const n = game.strategies[0];
+    const m = game.strategies[1];
+    const a1 = game.payoffs[0]; // a1[i*m+j] = u_1(i, j)
+    const a2 = game.payoffs[1]; // a2[i*m+j] = u_2(i, j)
+    const cap = maxSize ?? Math.min(n, m);
+    const results = [];
+    const seen = new Set();
+    // Enumerar subsets crecientes para que las equilibria puras
+    // aparezcan primero.
+    for (let k = 1; k <= cap; k++) {
+        const subsetsRow = subsetsOfSize(n, k);
+        const subsetsCol = subsetsOfSize(m, k);
+        for (const S1 of subsetsRow) {
+            for (const S2 of subsetsCol) {
+                const eq = solveSupport(n, m, a1, a2, S1, S2);
+                if (eq == null)
+                    continue;
+                const key = canonicalKey(eq.strategies[0].distribution, eq.strategies[1].distribution);
+                if (seen.has(key))
+                    continue;
+                seen.add(key);
+                results.push(eq);
+            }
+        }
+    }
+    return results;
+}
+function solveSupport(n, m, a1, a2, S1, S2) {
+    const k = S1.length;
+    if (S2.length !== k)
+        return null;
+    // Sistema para q (variable del jugador 2, |S2| = k):
+    //   Para cada i ∈ S1:  sum_{j ∈ S2} a1[i,j] * q_j = u_1
+    //   sum_{j ∈ S2} q_j = 1
+    // Variables: q_j (k), u_1 (1). Ecuaciones: k + 1.
+    const A_q = [];
+    const b_q = [];
+    for (const i of S1) {
+        const row = new Array(k + 1).fill(0);
+        for (let idx = 0; idx < k; idx++) {
+            const j = S2[idx];
+            row[idx] = a1[i * m + j];
+        }
+        row[k] = -1; // -u_1
+        A_q.push(row);
+        b_q.push(0);
+    }
+    const last_q = new Array(k + 1).fill(0);
+    for (let idx = 0; idx < k; idx++)
+        last_q[idx] = 1;
+    A_q.push(last_q);
+    b_q.push(1);
+    const solQ = (0, linalg_1.solveLinear)(A_q, b_q);
+    if (solQ === null)
+        return null;
+    // Sistema para p (variable del jugador 1, |S1| = k):
+    //   Para cada j ∈ S2:  sum_{i ∈ S1} a2[i,j] * p_i = u_2
+    //   sum_{i ∈ S1} p_i = 1
+    const A_p = [];
+    const b_p = [];
+    for (const j of S2) {
+        const row = new Array(k + 1).fill(0);
+        for (let idx = 0; idx < k; idx++) {
+            const i = S1[idx];
+            row[idx] = a2[i * m + j];
+        }
+        row[k] = -1; // -u_2
+        A_p.push(row);
+        b_p.push(0);
+    }
+    const last_p = new Array(k + 1).fill(0);
+    for (let idx = 0; idx < k; idx++)
+        last_p[idx] = 1;
+    A_p.push(last_p);
+    b_p.push(1);
+    const solP = (0, linalg_1.solveLinear)(A_p, b_p);
+    if (solP === null)
+        return null;
+    const q_support = solQ.slice(0, k);
+    const u1 = solQ[k];
+    const p_support = solP.slice(0, k);
+    const u2 = solP[k];
+    // Probabilidades dentro del soporte deben ser ≥ 0 (y >0 idealmente)
+    for (const v of q_support) {
+        if (v < -TOL)
+            return null;
+        if (v < TOL)
+            return null; // soporte = solo elementos con prob>0
+    }
+    for (const v of p_support) {
+        if (v < -TOL)
+            return null;
+        if (v < TOL)
+            return null;
+    }
+    // Reconstruir distribuciones completas
+    const p = new Array(n).fill(0);
+    for (let idx = 0; idx < k; idx++)
+        p[S1[idx]] = p_support[idx];
+    const q = new Array(m).fill(0);
+    for (let idx = 0; idx < k; idx++)
+        q[S2[idx]] = q_support[idx];
+    // Mejor respuesta fuera del soporte no debe superar u_1 / u_2
+    for (let i = 0; i < n; i++) {
+        if (S1.includes(i))
+            continue;
+        let u = 0;
+        for (let j = 0; j < m; j++)
+            u += q[j] * a1[i * m + j];
+        if (u > u1 + 1e-7)
+            return null;
+    }
+    for (let j = 0; j < m; j++) {
+        if (S2.includes(j))
+            continue;
+        let u = 0;
+        for (let i = 0; i < n; i++)
+            u += p[i] * a2[i * m + j];
+        if (u > u2 + 1e-7)
+            return null;
+    }
+    const game = {
+        players: 2,
+        strategies: [n, m],
+        payoffs: [a1, a2],
+    };
+    const dists = [p, q];
+    const payoffs = [
+        (0, types_1.expectedPayoffFromDistributions)(game, 0, dists),
+        (0, types_1.expectedPayoffFromDistributions)(game, 1, dists),
+    ];
+    const isPure = k === 1;
+    const isStrict = isPure && isStrictBR(n, m, a1, a2, S1[0], S2[0]);
+    return {
+        strategies: [
+            { player: 0, distribution: p },
+            { player: 1, distribution: q },
+        ],
+        payoffs,
+        isPure,
+        isStrict,
+    };
+}
+function isStrictBR(n, m, a1, a2, i, j) {
+    const cur1 = a1[i * m + j];
+    for (let ii = 0; ii < n; ii++) {
+        if (ii === i)
+            continue;
+        if (a1[ii * m + j] >= cur1 - TOL)
+            return false;
+    }
+    const cur2 = a2[i * m + j];
+    for (let jj = 0; jj < m; jj++) {
+        if (jj === j)
+            continue;
+        if (a2[i * m + jj] >= cur2 - TOL)
+            return false;
+    }
+    return true;
+}
+function subsetsOfSize(n, k) {
+    const result = [];
+    const cur = [];
+    function rec(start) {
+        if (cur.length === k) {
+            result.push(cur.slice());
+            return;
+        }
+        const need = k - cur.length;
+        for (let i = start; i <= n - need; i++) {
+            cur.push(i);
+            rec(i + 1);
+            cur.pop();
+        }
+    }
+    rec(0);
+    return result;
+}
+function canonicalKey(p, q) {
+    const round = (xs) => xs.map((x) => Math.round(x * 1e6) / 1e6).join(',');
+    return `${round(p)}|${round(q)}`;
+}
+//# sourceMappingURL=support-enumeration.js.map

package/dist/game-theory/support-enumeration.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"support-enumeration.js","sourceRoot":"","sources":["../../src/game-theory/support-enumeration.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+DAA+D;AAC/D,mCAAmC;AACnC,+DAA+D;AAC/D,EAAE;AACF,iEAAiE;AACjE,+DAA+D;AAC/D,oDAAoD;AACpD,EAAE;AACF,+CAA+C;AAC/C,2DAA2D;AAC3D,2DAA2D;AAC3D,4DAA4D;AAC5D,sDAAsD;AACtD,sDAAsD;AACtD,4DAA4D;AAC5D,wBAAwB;AACxB,uEAAuE;AACvE,EAAE;AACF,+DAA+D;AAC/D,4DAA4D;;AAQ5D,4CA8BC;AAnCD,mCAA0D;AAC1D,qCAAuC;AAEvC,MAAM,GAAG,GAAG,IAAI,CAAC;AAEjB,SAAgB,gBAAgB,CAAC,IAAoB,EAAE,OAAgB;IACrE,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;IAC7E,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB;IACpD,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB;IAEpD,MAAM,GAAG,GAAG,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,MAAM,OAAO,GAAsB,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,4DAA4D;IAC5D,qBAAqB;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;YAC5B,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;gBAC5B,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC9C,IAAI,EAAE,IAAI,IAAI;oBAAE,SAAS;gBACzB,MAAM,GAAG,GAAG,YAAY,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;gBACvF,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,YAAY,CACnB,CAAS,EACT,CAAS,EACT,EAAY,EACZ,EAAY,EACZ,EAAY,EACZ,EAAY;IAEZ,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC;IACpB,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEjC,qDAAqD;IACrD,wDAAwD;IACxD,yBAAyB;IACzB,kDAAkD;IAClD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAClB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO;QACpB,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE;QAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEZ,MAAM,IAAI,GAAG,IAAA,oBAAW,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACnC,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAE/B,qDAAqD;IACrD,wDAAwD;IACxD,yBAAyB;IACzB,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAClB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO;QACpB,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE;QAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClD,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEZ,MAAM,IAAI,GAAG,IAAA,oBAAW,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACnC,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAE/B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAEnB,oEAAoE;IACpE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAC1B,IAAI,CAAC,GAAG,GAAG;YAAE,OAAO,IAAI,CAAC,CAAC,sCAAsC;IAClE,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAC1B,IAAI,CAAC,GAAG,GAAG;YAAE,OAAO,IAAI,CAAC;IAC3B,CAAC;IAED,uCAAuC;IACvC,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE;QAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC9D,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE;QAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAE9D,8DAA8D;IAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,SAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI;YAAE,OAAO,IAAI,CAAC;IACjC,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,SAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI;YAAE,OAAO,IAAI,CAAC;IACjC,CAAC;IAED,MAAM,IAAI,GAAmB;QAC3B,OAAO,EAAE,CAAC;QACV,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAClB,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;KAClB,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,MAAM,OAAO,GAAG;QACd,IAAA,uCAA+B,EAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC;QAC/C,IAAA,uCAA+B,EAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC;KAChD,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC;IACvB,MAAM,QAAQ,GAAG,MAAM,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,OAAO;QACL,UAAU,EAAE;YACV,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE;YAC9B,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE;SAC/B;QACD,OAAO;QACP,MAAM;QACN,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CACjB,CAAS,EACT,CAAS,EACT,EAAY,EACZ,EAAY,EACZ,CAAS,EACT,CAAS;IAET,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;QAC9B,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;QACvB,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;IACjD,CAAC;IACD,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;QAC9B,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;QACvB,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;IACjD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,aAAa,CAAC,CAAS,EAAE,CAAS;IACzC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,SAAS,GAAG,CAAC,KAAa;QACxB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;YACzB,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,GAAG,CAAC,GAAG,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IACD,GAAG,CAAC,CAAC,CAAC,CAAC;IACP,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,YAAY,CAAC,CAAW,EAAE,CAAW;IAC5C,MAAM,KAAK,GAAG,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnF,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;AACnC,CAAC"}

package/dist/game-theory/types.d.ts

@@ -0,0 +1,57 @@
+export interface NormalFormGame {
+    /** Cantidad de jugadores (≥ 2). */
+    players: number;
+    /** strategies[i] = número de estrategias puras del jugador i. */
+    strategies: number[];
+    /** payoffs[player][profileIndex] = utilidad del jugador en ese perfil. */
+    payoffs: number[][];
+}
+export interface MixedStrategy {
+    /** Índice del jugador (0-based). */
+    player: number;
+    /** Distribución sobre estrategias puras; debe sumar 1 y ser no-negativa. */
+    distribution: number[];
+}
+export interface NashEquilibrium {
+    /** Una distribución mixta por jugador (en orden de jugador). */
+    strategies: MixedStrategy[];
+    /** Pagos esperados por jugador en este equilibrio. */
+    payoffs: number[];
+    /** True si toda distribución pone masa 1 en alguna estrategia pura. */
+    isPure: boolean;
+    /** True si el equilibrio es estricto (best response única para cada jugador puro). */
+    isStrict: boolean;
+}
+/**
+ * Convierte un perfil `(s_0, ..., s_{n-1})` a su índice row-major
+ * en `payoffs[player]`. Lanza si el perfil no encaja en `sizes`.
+ */
+export declare function profileToIndex(profile: number[], sizes: number[]): number;
+/** Inversa de `profileToIndex`. */
+export declare function indexToProfile(index: number, sizes: number[]): number[];
+/** Producto cartesiano de tamaños — número total de perfiles. */
+export declare function totalProfiles(sizes: number[]): number;
+/**
+ * Construye un juego en forma normal validando dimensiones.
+ */
+export declare function createGame(players: number, strategies: number[], payoffs: number[][]): NormalFormGame;
+/**
+ * Construye un juego 2-player a partir de dos matrices NxM.
+ * `payoff1[i][j]` = utilidad del jugador 1 cuando juega i y el 2 juega j.
+ * `payoff2[i][j]` = utilidad del jugador 2.
+ */
+export declare function createTwoPlayerGame(payoff1: number[][], payoff2: number[][]): NormalFormGame;
+/** Lectura ergonómica del pago: u_player(profile). */
+export declare function payoffOf(game: NormalFormGame, player: number, profile: number[]): number;
+/** Suma de un vector — útil para chequeos de simplex. */
+export declare function sumOf(xs: number[]): number;
+/** Pago esperado del jugador en un perfil mixto. */
+export declare function expectedPayoff(game: NormalFormGame, player: number, mixed: MixedStrategy[]): number;
+export declare function expectedPayoffFromDistributions(game: NormalFormGame, player: number, dists: number[][]): number;
+/** Distribución pura: masa 1 en `s`, 0 en el resto. */
+export declare function pureDistribution(s: number, size: number): number[];
+/** Dos números reales aproximadamente iguales. */
+export declare function approxEqual(a: number, b: number, tol?: number): boolean;
+/** Igualdad punto a punto bajo tolerancia. */
+export declare function vectorsApproxEqual(a: number[], b: number[], tol?: number): boolean;
+//# sourceMappingURL=types.d.ts.map

package/dist/game-theory/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/game-theory/types.ts"],"names":[],"mappings":"AAeA,MAAM,WAAW,cAAc;IAC7B,mCAAmC;IACnC,OAAO,EAAE,MAAM,CAAC;IAChB,iEAAiE;IACjE,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,0EAA0E;IAC1E,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC;CACrB;AAED,MAAM,WAAW,aAAa;IAC5B,oCAAoC;IACpC,MAAM,EAAE,MAAM,CAAC;IACf,4EAA4E;IAC5E,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAED,MAAM,WAAW,eAAe;IAC9B,gEAAgE;IAChE,UAAU,EAAE,aAAa,EAAE,CAAC;IAC5B,sDAAsD;IACtD,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,uEAAuE;IACvE,MAAM,EAAE,OAAO,CAAC;IAChB,sFAAsF;IACtF,QAAQ,EAAE,OAAO,CAAC;CACnB;AAID;;;GAGG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAczE;AAED,mCAAmC;AACnC,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAYvE;AAED,iEAAiE;AACjE,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAIrD;AAED;;GAEG;AACH,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,MAAM,EAAE,EACpB,OAAO,EAAE,MAAM,EAAE,EAAE,GAClB,cAAc,CAgBhB;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,cAAc,CAwB5F;AAED,sDAAsD;AACtD,wBAAgB,QAAQ,CAAC,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAOxF;AAED,yDAAyD;AACzD,wBAAgB,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,MAAM,CAI1C;AAED,oDAAoD;AACpD,wBAAgB,cAAc,CAC5B,IAAI,EAAE,cAAc,EACpB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,aAAa,EAAE,GACrB,MAAM,CAGR;AAED,wBAAgB,+BAA+B,CAC7C,IAAI,EAAE,cAAc,EACpB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EAAE,EAAE,GAChB,MAAM,CAmBR;AAED,uDAAuD;AACvD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAIlE;AAED,kDAAkD;AAClD,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,SAAO,GAAG,OAAO,CAErE;AAED,8CAA8C;AAC9C,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,SAAO,GAAG,OAAO,CAMhF"}

package/dist/game-theory/types.js

@@ -0,0 +1,191 @@
+"use strict";
+// ============================================================
+// Game theory — Tipos y utilidades de juegos en forma normal
+// ============================================================
+//
+// Modelo de juego en forma normal (también llamado matriz de
+// pagos) para n jugadores con conjuntos finitos de estrategias
+// puras. Los pagos se almacenan en un layout flat:
+//
+//   payoffs[player][index] = u_player(s_1, ..., s_n)
+//
+// donde `index` es la codificación row-major (lexicográfica) del
+// perfil de estrategias `(s_1, ..., s_n)` usando los tamaños en
+// `strategies`. Esta forma permite manejar uniformemente juegos
+// 2-player NxM y juegos n-player simétricos chicos.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.profileToIndex = profileToIndex;
+exports.indexToProfile = indexToProfile;
+exports.totalProfiles = totalProfiles;
+exports.createGame = createGame;
+exports.createTwoPlayerGame = createTwoPlayerGame;
+exports.payoffOf = payoffOf;
+exports.sumOf = sumOf;
+exports.expectedPayoff = expectedPayoff;
+exports.expectedPayoffFromDistributions = expectedPayoffFromDistributions;
+exports.pureDistribution = pureDistribution;
+exports.approxEqual = approxEqual;
+exports.vectorsApproxEqual = vectorsApproxEqual;
+// ---------- helpers internos ----------
+/**
+ * Convierte un perfil `(s_0, ..., s_{n-1})` a su índice row-major
+ * en `payoffs[player]`. Lanza si el perfil no encaja en `sizes`.
+ */
+function profileToIndex(profile, sizes) {
+    if (profile.length !== sizes.length) {
+        throw new Error(`profile length ${profile.length} != strategies length ${sizes.length}`);
+    }
+    let idx = 0;
+    for (let i = 0; i < profile.length; i++) {
+        const s = profile[i];
+        const size = sizes[i];
+        if (s < 0 || s >= size) {
+            throw new Error(`strategy ${s} out of range [0, ${size}) for player ${i}`);
+        }
+        idx = idx * size + s;
+    }
+    return idx;
+}
+/** Inversa de `profileToIndex`. */
+function indexToProfile(index, sizes) {
+    const profile = new Array(sizes.length);
+    let remaining = index;
+    for (let i = sizes.length - 1; i >= 0; i--) {
+        const size = sizes[i];
+        profile[i] = remaining % size;
+        remaining = Math.floor(remaining / size);
+    }
+    if (remaining !== 0) {
+        throw new Error(`index ${index} out of range for sizes ${sizes.join(',')}`);
+    }
+    return profile;
+}
+/** Producto cartesiano de tamaños — número total de perfiles. */
+function totalProfiles(sizes) {
+    let n = 1;
+    for (const s of sizes)
+        n *= s;
+    return n;
+}
+/**
+ * Construye un juego en forma normal validando dimensiones.
+ */
+function createGame(players, strategies, payoffs) {
+    if (players < 2)
+        throw new Error('a game needs at least 2 players');
+    if (strategies.length !== players) {
+        throw new Error(`strategies length ${strategies.length} != players ${players}`);
+    }
+    const total = totalProfiles(strategies);
+    if (payoffs.length !== players) {
+        throw new Error(`payoffs has ${payoffs.length} rows, expected ${players}`);
+    }
+    for (let i = 0; i < players; i++) {
+        const row = payoffs[i];
+        if (row.length !== total) {
+            throw new Error(`payoffs[${i}] has length ${row.length}, expected ${total}`);
+        }
+    }
+    return { players, strategies: strategies.slice(), payoffs: payoffs.map((r) => r.slice()) };
+}
+/**
+ * Construye un juego 2-player a partir de dos matrices NxM.
+ * `payoff1[i][j]` = utilidad del jugador 1 cuando juega i y el 2 juega j.
+ * `payoff2[i][j]` = utilidad del jugador 2.
+ */
+function createTwoPlayerGame(payoff1, payoff2) {
+    const n = payoff1.length;
+    if (n === 0)
+        throw new Error('payoff1 must have at least one row');
+    const first = payoff1[0];
+    const m = first.length;
+    if (m === 0)
+        throw new Error('payoff1 must have at least one column');
+    if (payoff2.length !== n) {
+        throw new Error(`payoff2 has ${payoff2.length} rows, expected ${n}`);
+    }
+    for (let i = 0; i < n; i++) {
+        const r1 = payoff1[i];
+        const r2 = payoff2[i];
+        if (r1.length !== m)
+            throw new Error(`payoff1[${i}] has length ${r1.length}, expected ${m}`);
+        if (r2.length !== m)
+            throw new Error(`payoff2[${i}] has length ${r2.length}, expected ${m}`);
+    }
+    const flat1 = new Array(n * m);
+    const flat2 = new Array(n * m);
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < m; j++) {
+            flat1[i * m + j] = payoff1[i][j];
+            flat2[i * m + j] = payoff2[i][j];
+        }
+    }
+    return { players: 2, strategies: [n, m], payoffs: [flat1, flat2] };
+}
+/** Lectura ergonómica del pago: u_player(profile). */
+function payoffOf(game, player, profile) {
+    const idx = profileToIndex(profile, game.strategies);
+    const row = game.payoffs[player];
+    if (!row)
+        throw new Error(`player ${player} out of range`);
+    const v = row[idx];
+    if (v === undefined)
+        throw new Error('payoff missing at index');
+    return v;
+}
+/** Suma de un vector — útil para chequeos de simplex. */
+function sumOf(xs) {
+    let s = 0;
+    for (const x of xs)
+        s += x;
+    return s;
+}
+/** Pago esperado del jugador en un perfil mixto. */
+function expectedPayoff(game, player, mixed) {
+    const dists = mixed.map((m) => m.distribution);
+    return expectedPayoffFromDistributions(game, player, dists);
+}
+function expectedPayoffFromDistributions(game, player, dists) {
+    const sizes = game.strategies;
+    const total = totalProfiles(sizes);
+    const row = game.payoffs[player];
+    if (!row)
+        throw new Error(`player ${player} out of range`);
+    let total2 = 0;
+    for (let idx = 0; idx < total; idx++) {
+        const profile = indexToProfile(idx, sizes);
+        let prob = 1;
+        for (let p = 0; p < profile.length; p++) {
+            const d = dists[p];
+            if (!d)
+                throw new Error(`missing distribution for player ${p}`);
+            const sp = profile[p];
+            prob *= d[sp];
+        }
+        if (prob === 0)
+            continue;
+        total2 += prob * row[idx];
+    }
+    return total2;
+}
+/** Distribución pura: masa 1 en `s`, 0 en el resto. */
+function pureDistribution(s, size) {
+    const d = new Array(size).fill(0);
+    d[s] = 1;
+    return d;
+}
+/** Dos números reales aproximadamente iguales. */
+function approxEqual(a, b, tol = 1e-9) {
+    return Math.abs(a - b) < tol;
+}
+/** Igualdad punto a punto bajo tolerancia. */
+function vectorsApproxEqual(a, b, tol = 1e-9) {
+    if (a.length !== b.length)
+        return false;
+    for (let i = 0; i < a.length; i++) {
+        if (!approxEqual(a[i], b[i], tol))
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=types.js.map

package/dist/game-theory/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/game-theory/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6DAA6D;AAC7D,+DAA+D;AAC/D,EAAE;AACF,6DAA6D;AAC7D,+DAA+D;AAC/D,mDAAmD;AACnD,EAAE;AACF,qDAAqD;AACrD,EAAE;AACF,iEAAiE;AACjE,gEAAgE;AAChE,gEAAgE;AAChE,oDAAoD;;AAmCpD,wCAcC;AAGD,wCAYC;AAGD,sCAIC;AAKD,gCAoBC;AAOD,kDAwBC;AAGD,4BAOC;AAGD,sBAIC;AAGD,wCAOC;AAED,0EAuBC;AAGD,4CAIC;AAGD,kCAEC;AAGD,gDAMC;AA3KD,yCAAyC;AAEzC;;;GAGG;AACH,SAAgB,cAAc,CAAC,OAAiB,EAAE,KAAe;IAC/D,IAAI,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,IAAI,KAAK,CAAC,kBAAkB,OAAO,CAAC,MAAM,yBAAyB,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAC3F,CAAC;IACD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,qBAAqB,IAAI,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAC7E,CAAC;QACD,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mCAAmC;AACnC,SAAgB,cAAc,CAAC,KAAa,EAAE,KAAe;IAC3D,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,OAAO,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC;QAC9B,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC;IAC3C,CAAC;IACD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,SAAS,KAAK,2BAA2B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9E,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,iEAAiE;AACjE,SAAgB,aAAa,CAAC,KAAe;IAC3C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,CAAC,IAAI,CAAC,CAAC;IAC9B,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;GAEG;AACH,SAAgB,UAAU,CACxB,OAAe,EACf,UAAoB,EACpB,OAAmB;IAEnB,IAAI,OAAO,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACpE,IAAI,UAAU,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,qBAAqB,UAAU,CAAC,MAAM,eAAe,OAAO,EAAE,CAAC,CAAC;IAClF,CAAC;IACD,MAAM,KAAK,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;IACxC,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,eAAe,OAAO,CAAC,MAAM,mBAAmB,OAAO,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,WAAW,CAAC,gBAAgB,GAAG,CAAC,MAAM,cAAc,KAAK,EAAE,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC;AAC7F,CAAC;AAED;;;;GAIG;AACH,SAAgB,mBAAmB,CAAC,OAAmB,EAAE,OAAmB;IAC1E,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,IAAI,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IACnE,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IACtE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,eAAe,OAAO,CAAC,MAAM,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACvE,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,WAAW,CAAC,gBAAgB,EAAE,CAAC,MAAM,cAAc,CAAC,EAAE,CAAC,CAAC;QAC7F,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,WAAW,CAAC,gBAAgB,EAAE,CAAC,MAAM,cAAc,CAAC,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;AACrE,CAAC;AAED,sDAAsD;AACtD,SAAgB,QAAQ,CAAC,IAAoB,EAAE,MAAc,EAAE,OAAiB;IAC9E,MAAM,GAAG,GAAG,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IACrD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjC,IAAI,CAAC,GAAG;QAAE,MAAM,IAAI,KAAK,CAAC,UAAU,MAAM,eAAe,CAAC,CAAC;IAC3D,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IACnB,IAAI,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IAChE,OAAO,CAAC,CAAC;AACX,CAAC;AAED,yDAAyD;AACzD,SAAgB,KAAK,CAAC,EAAY;IAChC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,EAAE;QAAE,CAAC,IAAI,CAAC,CAAC;IAC3B,OAAO,CAAC,CAAC;AACX,CAAC;AAED,oDAAoD;AACpD,SAAgB,cAAc,CAC5B,IAAoB,EACpB,MAAc,EACd,KAAsB;IAEtB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAC/C,OAAO,+BAA+B,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AAC9D,CAAC;AAED,SAAgB,+BAA+B,CAC7C,IAAoB,EACpB,MAAc,EACd,KAAiB;IAEjB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;IAC9B,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjC,IAAI,CAAC,GAAG;QAAE,MAAM,IAAI,KAAK,CAAC,UAAU,MAAM,eAAe,CAAC,CAAC;IAC3D,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,EAAE,CAAC,CAAC;YAChE,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;QAChB,CAAC;QACD,IAAI,IAAI,KAAK,CAAC;YAAE,SAAS;QACzB,MAAM,IAAI,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,uDAAuD;AACvD,SAAgB,gBAAgB,CAAC,CAAS,EAAE,IAAY;IACtD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACT,OAAO,CAAC,CAAC;AACX,CAAC;AAED,kDAAkD;AAClD,SAAgB,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,GAAG,GAAG,IAAI;IAC1D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;AAC/B,CAAC;AAED,8CAA8C;AAC9C,SAAgB,kBAAkB,CAAC,CAAW,EAAE,CAAW,EAAE,GAAG,GAAG,IAAI;IACrE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;IAClD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/hindley-milner/index.d.ts

@@ -0,0 +1,7 @@
+export type { Type, TypeScheme, Expr } from './types';
+export type { Substitution, UnifyResult } from './substitution';
+export type { InferResult, InferOutcome, InferSchemeResult } from './infer';
+export { TypeEnv, tVar, tConst, tArrow, tApp, scheme, mono, eVar, eLit, eApp, eAppN, eLam, eLet, eLetRec, eIf, TInt, TBool, TStr, typeFreeVars, schemeFreeVars, typeToString, schemeToString, } from './types';
+export { emptySubst, applySubst, applySubstScheme, composeSubsts, freshTypeVar, resetFreshSupply, occursIn, unify, isUnifyError, generalize, instantiate, } from './substitution';
+export { algorithmW, infer, inferScheme, isInferError, initialEnv, normalizeScheme } from './infer';
+//# sourceMappingURL=index.d.ts.map

package/dist/hindley-milner/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/hindley-milner/index.ts"],"names":[],"mappings":"AAeA,YAAY,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AACtD,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAChE,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAE5E,OAAO,EACL,OAAO,EACP,IAAI,EACJ,MAAM,EACN,MAAM,EACN,IAAI,EACJ,MAAM,EACN,IAAI,EACJ,IAAI,EACJ,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,IAAI,EACJ,IAAI,EACJ,OAAO,EACP,GAAG,EACH,IAAI,EACJ,KAAK,EACL,IAAI,EACJ,YAAY,EACZ,cAAc,EACd,YAAY,EACZ,cAAc,GACf,MAAM,SAAS,CAAC;AAEjB,OAAO,EACL,UAAU,EACV,UAAU,EACV,gBAAgB,EAChB,aAAa,EACb,YAAY,EACZ,gBAAgB,EAChB,QAAQ,EACR,KAAK,EACL,YAAY,EACZ,UAAU,EACV,WAAW,GACZ,MAAM,gBAAgB,CAAC;AAExB,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC"}

package/dist/hindley-milner/index.js

@@ -0,0 +1,60 @@
+"use strict";
+// ============================================================
+// Hindley-Milner — Punto de entrada público
+// ============================================================
+//
+// Sistema de tipos let-polimórfico (Damas-Milner). Provee:
+//   - Sintaxis: Type, TypeScheme, Expr, TypeEnv.
+//   - Constructores breves: tVar, tConst, tArrow, tApp, eLam, eApp,
+//     eLet, eLetRec, eIf, eLit, eVar.
+//   - Algoritmo W: algorithmW / infer / inferScheme.
+//   - Unificación y sustituciones: unify, applySubst, composeSubsts,
+//     freshTypeVar, generalize, instantiate.
+//   - Entorno inicial con primitivos (+, ==, pair, cons, ...).
+//   - normalizeScheme: renombra tvars ligadas a a, b, c, ... para
+//     comparación estable en tests.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.normalizeScheme = exports.initialEnv = exports.isInferError = exports.inferScheme = exports.infer = exports.algorithmW = exports.instantiate = exports.generalize = exports.isUnifyError = exports.unify = exports.occursIn = exports.resetFreshSupply = exports.freshTypeVar = exports.composeSubsts = exports.applySubstScheme = exports.applySubst = exports.emptySubst = exports.schemeToString = exports.typeToString = exports.schemeFreeVars = exports.typeFreeVars = exports.TStr = exports.TBool = exports.TInt = exports.eIf = exports.eLetRec = exports.eLet = exports.eLam = exports.eAppN = exports.eApp = exports.eLit = exports.eVar = exports.mono = exports.scheme = exports.tApp = exports.tArrow = exports.tConst = exports.tVar = exports.TypeEnv = void 0;
+var types_1 = require("./types");
+Object.defineProperty(exports, "TypeEnv", { enumerable: true, get: function () { return types_1.TypeEnv; } });
+Object.defineProperty(exports, "tVar", { enumerable: true, get: function () { return types_1.tVar; } });
+Object.defineProperty(exports, "tConst", { enumerable: true, get: function () { return types_1.tConst; } });
+Object.defineProperty(exports, "tArrow", { enumerable: true, get: function () { return types_1.tArrow; } });
+Object.defineProperty(exports, "tApp", { enumerable: true, get: function () { return types_1.tApp; } });
+Object.defineProperty(exports, "scheme", { enumerable: true, get: function () { return types_1.scheme; } });
+Object.defineProperty(exports, "mono", { enumerable: true, get: function () { return types_1.mono; } });
+Object.defineProperty(exports, "eVar", { enumerable: true, get: function () { return types_1.eVar; } });
+Object.defineProperty(exports, "eLit", { enumerable: true, get: function () { return types_1.eLit; } });
+Object.defineProperty(exports, "eApp", { enumerable: true, get: function () { return types_1.eApp; } });
+Object.defineProperty(exports, "eAppN", { enumerable: true, get: function () { return types_1.eAppN; } });
+Object.defineProperty(exports, "eLam", { enumerable: true, get: function () { return types_1.eLam; } });
+Object.defineProperty(exports, "eLet", { enumerable: true, get: function () { return types_1.eLet; } });
+Object.defineProperty(exports, "eLetRec", { enumerable: true, get: function () { return types_1.eLetRec; } });
+Object.defineProperty(exports, "eIf", { enumerable: true, get: function () { return types_1.eIf; } });
+Object.defineProperty(exports, "TInt", { enumerable: true, get: function () { return types_1.TInt; } });
+Object.defineProperty(exports, "TBool", { enumerable: true, get: function () { return types_1.TBool; } });
+Object.defineProperty(exports, "TStr", { enumerable: true, get: function () { return types_1.TStr; } });
+Object.defineProperty(exports, "typeFreeVars", { enumerable: true, get: function () { return types_1.typeFreeVars; } });
+Object.defineProperty(exports, "schemeFreeVars", { enumerable: true, get: function () { return types_1.schemeFreeVars; } });
+Object.defineProperty(exports, "typeToString", { enumerable: true, get: function () { return types_1.typeToString; } });
+Object.defineProperty(exports, "schemeToString", { enumerable: true, get: function () { return types_1.schemeToString; } });
+var substitution_1 = require("./substitution");
+Object.defineProperty(exports, "emptySubst", { enumerable: true, get: function () { return substitution_1.emptySubst; } });
+Object.defineProperty(exports, "applySubst", { enumerable: true, get: function () { return substitution_1.applySubst; } });
+Object.defineProperty(exports, "applySubstScheme", { enumerable: true, get: function () { return substitution_1.applySubstScheme; } });
+Object.defineProperty(exports, "composeSubsts", { enumerable: true, get: function () { return substitution_1.composeSubsts; } });
+Object.defineProperty(exports, "freshTypeVar", { enumerable: true, get: function () { return substitution_1.freshTypeVar; } });
+Object.defineProperty(exports, "resetFreshSupply", { enumerable: true, get: function () { return substitution_1.resetFreshSupply; } });
+Object.defineProperty(exports, "occursIn", { enumerable: true, get: function () { return substitution_1.occursIn; } });
+Object.defineProperty(exports, "unify", { enumerable: true, get: function () { return substitution_1.unify; } });
+Object.defineProperty(exports, "isUnifyError", { enumerable: true, get: function () { return substitution_1.isUnifyError; } });
+Object.defineProperty(exports, "generalize", { enumerable: true, get: function () { return substitution_1.generalize; } });
+Object.defineProperty(exports, "instantiate", { enumerable: true, get: function () { return substitution_1.instantiate; } });
+var infer_1 = require("./infer");
+Object.defineProperty(exports, "algorithmW", { enumerable: true, get: function () { return infer_1.algorithmW; } });
+Object.defineProperty(exports, "infer", { enumerable: true, get: function () { return infer_1.infer; } });
+Object.defineProperty(exports, "inferScheme", { enumerable: true, get: function () { return infer_1.inferScheme; } });
+Object.defineProperty(exports, "isInferError", { enumerable: true, get: function () { return infer_1.isInferError; } });
+Object.defineProperty(exports, "initialEnv", { enumerable: true, get: function () { return infer_1.initialEnv; } });
+Object.defineProperty(exports, "normalizeScheme", { enumerable: true, get: function () { return infer_1.normalizeScheme; } });
+//# sourceMappingURL=index.js.map

package/dist/hindley-milner/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/hindley-milner/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4CAA4C;AAC5C,+DAA+D;AAC/D,EAAE;AACF,2DAA2D;AAC3D,iDAAiD;AACjD,oEAAoE;AACpE,sCAAsC;AACtC,qDAAqD;AACrD,qEAAqE;AACrE,6CAA6C;AAC7C,+DAA+D;AAC/D,kEAAkE;AAClE,oCAAoC;;;AAMpC,iCAuBiB;AAtBf,gGAAA,OAAO,OAAA;AACP,6FAAA,IAAI,OAAA;AACJ,+FAAA,MAAM,OAAA;AACN,+FAAA,MAAM,OAAA;AACN,6FAAA,IAAI,OAAA;AACJ,+FAAA,MAAM,OAAA;AACN,6FAAA,IAAI,OAAA;AACJ,6FAAA,IAAI,OAAA;AACJ,6FAAA,IAAI,OAAA;AACJ,6FAAA,IAAI,OAAA;AACJ,8FAAA,KAAK,OAAA;AACL,6FAAA,IAAI,OAAA;AACJ,6FAAA,IAAI,OAAA;AACJ,gGAAA,OAAO,OAAA;AACP,4FAAA,GAAG,OAAA;AACH,6FAAA,IAAI,OAAA;AACJ,8FAAA,KAAK,OAAA;AACL,6FAAA,IAAI,OAAA;AACJ,qGAAA,YAAY,OAAA;AACZ,uGAAA,cAAc,OAAA;AACd,qGAAA,YAAY,OAAA;AACZ,uGAAA,cAAc,OAAA;AAGhB,+CAYwB;AAXtB,0GAAA,UAAU,OAAA;AACV,0GAAA,UAAU,OAAA;AACV,gHAAA,gBAAgB,OAAA;AAChB,6GAAA,aAAa,OAAA;AACb,4GAAA,YAAY,OAAA;AACZ,gHAAA,gBAAgB,OAAA;AAChB,wGAAA,QAAQ,OAAA;AACR,qGAAA,KAAK,OAAA;AACL,4GAAA,YAAY,OAAA;AACZ,0GAAA,UAAU,OAAA;AACV,2GAAA,WAAW,OAAA;AAGb,iCAAoG;AAA3F,mGAAA,UAAU,OAAA;AAAE,8FAAA,KAAK,OAAA;AAAE,oGAAA,WAAW,OAAA;AAAE,qGAAA,YAAY,OAAA;AAAE,mGAAA,UAAU,OAAA;AAAE,wGAAA,eAAe,OAAA"}

package/dist/hindley-milner/infer.d.ts

@@ -0,0 +1,26 @@
+import type { Expr, Type, TypeScheme } from './types';
+import { TypeEnv } from './types';
+import type { Substitution } from './substitution';
+export interface InferResult {
+    type: Type;
+    subst: Substitution;
+}
+export type InferOutcome = InferResult | {
+    error: string;
+};
+export declare function isInferError(r: InferOutcome): r is {
+    error: string;
+};
+export declare function initialEnv(): TypeEnv;
+export declare function algorithmW(expr: Expr, env: TypeEnv): InferOutcome;
+export declare function infer(expr: Expr, env?: TypeEnv): InferOutcome;
+export interface InferSchemeResult {
+    scheme: TypeScheme;
+    subst: Substitution;
+    type: Type;
+}
+export declare function inferScheme(expr: Expr, env?: TypeEnv): InferSchemeResult | {
+    error: string;
+};
+export declare function normalizeScheme(sc: TypeScheme): TypeScheme;
+//# sourceMappingURL=infer.d.ts.map

package/dist/hindley-milner/infer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"infer.d.ts","sourceRoot":"","sources":["../../src/hindley-milner/infer.ts"],"names":[],"mappings":"AA6BA,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAqB,OAAO,EAA4C,MAAM,SAAS,CAAC;AAC/F,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAanD,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,IAAI,CAAC;IACX,KAAK,EAAE,YAAY,CAAC;CACrB;AAED,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAE3D,wBAAgB,YAAY,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,IAAI;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAEpE;AAOD,wBAAgB,UAAU,IAAI,OAAO,CA+CpC;AAGD,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,GAAG,YAAY,CAsHjE;AAQD,wBAAgB,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,GAAE,OAAsB,GAAG,YAAY,CAE3E;AAED,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,UAAU,CAAC;IACnB,KAAK,EAAE,YAAY,CAAC;IACpB,IAAI,EAAE,IAAI,CAAC;CACZ;AAED,wBAAgB,WAAW,CACzB,IAAI,EAAE,IAAI,EACV,GAAG,GAAE,OAAsB,GAC1B,iBAAiB,GAAG;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAMvC;AAeD,wBAAgB,eAAe,CAAC,EAAE,EAAE,UAAU,GAAG,UAAU,CAyB1D"}