@stevenvo780/st-lang 4.5.2 → 4.6.0

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

package/dist/hindley-milner/infer.js

@@ -0,0 +1,278 @@
+"use strict";
+// ============================================================
+// Hindley-Milner — Algorithm W (Damas-Milner)
+// ============================================================
+//
+// Implementación de Algorithm W tal como aparece en Damas & Milner
+// 1982. La función W toma un entorno Γ y una expresión e, y devuelve
+// un par (S, τ) donde S es la sustitución principal y τ el tipo
+// principal de e bajo S(Γ).
+//
+// Reglas (esquemáticas):
+//   W(Γ, x)        = (∅, [β/α] τ) si Γ(x) = ∀α. τ con β frescas
+//   W(Γ, λx.e)     = sea β fresca; (S, τ) = W(Γ[x:β], e);
+//                    devolver (S, S(β) → τ)
+//   W(Γ, e₁ e₂)    = (S₁, τ₁) = W(Γ, e₁);
+//                    (S₂, τ₂) = W(S₁(Γ), e₂);
+//                    β fresca; V = mgu(S₂(τ₁), τ₂ → β);
+//                    devolver (V ∘ S₂ ∘ S₁, V(β))
+//   W(Γ, let x = e₁ in e₂) =
+//                    (S₁, τ₁) = W(Γ, e₁);
+//                    σ = generalize(S₁(Γ), τ₁);
+//                    (S₂, τ₂) = W(S₁(Γ)[x:σ], e₂);
+//                    devolver (S₂ ∘ S₁, τ₂)
+//   W(Γ, if c then a else b) = unificar c con Bool y a con b.
+//   W(Γ, letRec [n₁=e₁,...] in e) — todos los nᵢ con tvars frescos
+//   en el entorno mientras se infieren los eᵢ; luego generalizar.
+//
+// Convención: trabajamos con `freshTypeVar('t')`. Para tests con
+// nombres predecibles se llama `resetFreshSupply()`.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isInferError = isInferError;
+exports.initialEnv = initialEnv;
+exports.algorithmW = algorithmW;
+exports.infer = infer;
+exports.inferScheme = inferScheme;
+exports.normalizeScheme = normalizeScheme;
+const types_1 = require("./types");
+const substitution_1 = require("./substitution");
+function isInferError(r) {
+    return typeof r === 'object' && r !== null && 'error' in r && !('type' in r);
+}
+// ---------- Entorno inicial con primitivos ----------
+//
+// Operadores aritméticos como Int → Int → Int. Comparadores son
+// polimórficos: ∀α. α → α → Bool. Listas y pares con sus
+// constructores y proyectores.
+function initialEnv() {
+    const a = 'a';
+    const b = 'b';
+    const TA = { kind: 'tvar', name: a };
+    const TB = { kind: 'tvar', name: b };
+    const arithBinop = (0, types_1.mono)((0, types_1.tArrow)(types_1.TInt, (0, types_1.tArrow)(types_1.TInt, types_1.TInt)));
+    const cmpBinop = (0, types_1.scheme)([a], (0, types_1.tArrow)(TA, (0, types_1.tArrow)(TA, types_1.TBool)));
+    const pairTy = (0, types_1.tApp)('Pair', TA, TB);
+    const listTyA = (0, types_1.tApp)('List', TA);
+    return new types_1.TypeEnv(new Map([
+        ['+', arithBinop],
+        ['-', arithBinop],
+        ['*', arithBinop],
+        ['/', arithBinop],
+        ['mod', arithBinop],
+        ['==', cmpBinop],
+        ['!=', cmpBinop],
+        ['<', cmpBinop],
+        ['>', cmpBinop],
+        ['<=', cmpBinop],
+        ['>=', cmpBinop],
+        ['true', (0, types_1.mono)(types_1.TBool)],
+        ['false', (0, types_1.mono)(types_1.TBool)],
+        ['not', (0, types_1.mono)((0, types_1.tArrow)(types_1.TBool, types_1.TBool))],
+        ['&&', (0, types_1.mono)((0, types_1.tArrow)(types_1.TBool, (0, types_1.tArrow)(types_1.TBool, types_1.TBool)))],
+        ['||', (0, types_1.mono)((0, types_1.tArrow)(types_1.TBool, (0, types_1.tArrow)(types_1.TBool, types_1.TBool)))],
+        ['pair', (0, types_1.scheme)([a, b], (0, types_1.tArrow)(TA, (0, types_1.tArrow)(TB, pairTy)))],
+        ['fst', (0, types_1.scheme)([a, b], (0, types_1.tArrow)(pairTy, TA))],
+        ['snd', (0, types_1.scheme)([a, b], (0, types_1.tArrow)(pairTy, TB))],
+        ['nil', (0, types_1.scheme)([a], listTyA)],
+        ['cons', (0, types_1.scheme)([a], (0, types_1.tArrow)(TA, (0, types_1.tArrow)(listTyA, listTyA)))],
+        ['head', (0, types_1.scheme)([a], (0, types_1.tArrow)(listTyA, TA))],
+        ['tail', (0, types_1.scheme)([a], (0, types_1.tArrow)(listTyA, listTyA))],
+        ['isEmpty', (0, types_1.scheme)([a], (0, types_1.tArrow)(listTyA, types_1.TBool))],
+        // fixpoint, útil para introducir letRec puntualmente sin el azúcar
+        ['fix', (0, types_1.scheme)([a], (0, types_1.tArrow)((0, types_1.tArrow)(TA, TA), TA))],
+    ]));
+}
+// ---------- Algorithm W ----------
+function algorithmW(expr, env) {
+    switch (expr.kind) {
+        case 'lit': {
+            const t = typeof expr.value === 'number' ? types_1.TInt : typeof expr.value === 'boolean' ? types_1.TBool : types_1.TStr;
+            return { type: t, subst: (0, substitution_1.emptySubst)() };
+        }
+        case 'var': {
+            const sc = env.lookup(expr.name);
+            if (sc === undefined)
+                return { error: `unbound variable: ${expr.name}` };
+            return { type: (0, substitution_1.instantiate)(sc), subst: (0, substitution_1.emptySubst)() };
+        }
+        case 'lam': {
+            const tv = (0, substitution_1.freshTypeVar)('t');
+            const env2 = env.extend(expr.param, (0, types_1.mono)(tv));
+            const body = algorithmW(expr.body, env2);
+            if (isInferError(body))
+                return body;
+            return {
+                type: (0, types_1.tArrow)((0, substitution_1.applySubst)(tv, body.subst), body.type),
+                subst: body.subst,
+            };
+        }
+        case 'app': {
+            const r1 = algorithmW(expr.fn, env);
+            if (isInferError(r1))
+                return r1;
+            const env2 = applyEnv(env, r1.subst);
+            const r2 = algorithmW(expr.arg, env2);
+            if (isInferError(r2))
+                return r2;
+            const tv = (0, substitution_1.freshTypeVar)('t');
+            const u = (0, substitution_1.unify)((0, substitution_1.applySubst)(r1.type, r2.subst), (0, types_1.tArrow)(r2.type, tv));
+            if ((0, substitution_1.isUnifyError)(u))
+                return { error: u.error };
+            const finalSubst = (0, substitution_1.composeSubsts)(u, (0, substitution_1.composeSubsts)(r2.subst, r1.subst));
+            return { type: (0, substitution_1.applySubst)(tv, u), subst: finalSubst };
+        }
+        case 'let': {
+            const r1 = algorithmW(expr.value, env);
+            if (isInferError(r1))
+                return r1;
+            const env1 = applyEnv(env, r1.subst);
+            const sc = (0, substitution_1.generalize)(env1.freeVars(), r1.type);
+            const env2 = env1.extend(expr.bind, sc);
+            const r2 = algorithmW(expr.body, env2);
+            if (isInferError(r2))
+                return r2;
+            return {
+                type: r2.type,
+                subst: (0, substitution_1.composeSubsts)(r2.subst, r1.subst),
+            };
+        }
+        case 'letRec': {
+            // Asignar tvar fresco a cada def, inferir cada body bajo el
+            // entorno extendido, unificar el tipo de cada body con el tvar
+            // declarado, y al final generalizar.
+            if (expr.defs.length === 0)
+                return algorithmW(expr.body, env);
+            const freshVars = expr.defs.map(() => (0, substitution_1.freshTypeVar)('t'));
+            let envExt = env;
+            for (let i = 0; i < expr.defs.length; i++) {
+                envExt = envExt.extend(expr.defs[i].name, (0, types_1.mono)(freshVars[i]));
+            }
+            let s = (0, substitution_1.emptySubst)();
+            for (let i = 0; i < expr.defs.length; i++) {
+                const def = expr.defs[i];
+                const fv = freshVars[i];
+                const ri = algorithmW(def.body, applyEnv(envExt, s));
+                if (isInferError(ri))
+                    return ri;
+                const u = (0, substitution_1.unify)((0, substitution_1.applySubst)(fv, (0, substitution_1.composeSubsts)(ri.subst, s)), ri.type);
+                if ((0, substitution_1.isUnifyError)(u))
+                    return { error: u.error };
+                s = (0, substitution_1.composeSubsts)(u, (0, substitution_1.composeSubsts)(ri.subst, s));
+            }
+            // Reconstruir entorno generalizado.
+            const envAfter = applyEnv(env, s);
+            const envFv = envAfter.freeVars();
+            let envGen = envAfter;
+            for (let i = 0; i < expr.defs.length; i++) {
+                const ty = (0, substitution_1.applySubst)(freshVars[i], s);
+                const sc = (0, substitution_1.generalize)(envFv, ty);
+                envGen = envGen.extend(expr.defs[i].name, sc);
+            }
+            const rBody = algorithmW(expr.body, envGen);
+            if (isInferError(rBody))
+                return rBody;
+            return {
+                type: rBody.type,
+                subst: (0, substitution_1.composeSubsts)(rBody.subst, s),
+            };
+        }
+        case 'if': {
+            const rc = algorithmW(expr.cond, env);
+            if (isInferError(rc))
+                return rc;
+            const uCond = (0, substitution_1.unify)(rc.type, types_1.TBool);
+            if ((0, substitution_1.isUnifyError)(uCond)) {
+                return { error: `condition of 'if' must be Bool: ${uCond.error}` };
+            }
+            const s1 = (0, substitution_1.composeSubsts)(uCond, rc.subst);
+            const rt = algorithmW(expr.then, applyEnv(env, s1));
+            if (isInferError(rt))
+                return rt;
+            const s2 = (0, substitution_1.composeSubsts)(rt.subst, s1);
+            const re = algorithmW(expr.else, applyEnv(env, s2));
+            if (isInferError(re))
+                return re;
+            const s3 = (0, substitution_1.composeSubsts)(re.subst, s2);
+            const u = (0, substitution_1.unify)((0, substitution_1.applySubst)(rt.type, s3), re.type);
+            if ((0, substitution_1.isUnifyError)(u)) {
+                return { error: `branches of 'if' must agree: ${u.error}` };
+            }
+            const finalSubst = (0, substitution_1.composeSubsts)(u, s3);
+            return { type: (0, substitution_1.applySubst)(re.type, u), subst: finalSubst };
+        }
+    }
+}
+// ---------- API de alto nivel ----------
+//
+// infer() devuelve sólo lo necesario al consumidor: el tipo final
+// y la sustitución que lo produjo (útil para imprimirla, debug,
+// etc.). El esquema principal lo expone `inferScheme`.
+function infer(expr, env = initialEnv()) {
+    return algorithmW(expr, env);
+}
+function inferScheme(expr, env = initialEnv()) {
+    const r = algorithmW(expr, env);
+    if (isInferError(r))
+        return r;
+    const envAfter = applyEnv(env, r.subst);
+    const sc = (0, substitution_1.generalize)(envAfter.freeVars(), r.type);
+    return { scheme: sc, subst: r.subst, type: r.type };
+}
+// ---------- Helpers ----------
+function applyEnv(env, s) {
+    if (s.size === 0)
+        return env;
+    const next = new Map();
+    for (const [name, sc] of env.bindings) {
+        next.set(name, (0, substitution_1.applySubstScheme)(sc, s));
+    }
+    return new types_1.TypeEnv(next);
+}
+// Renombrado canónico de un esquema para tests: ∀t5 t9. t5 → t9
+// pasa a ser ∀a b. a → b. Asegura comparaciones estables sin
+// depender del contador global.
+function normalizeScheme(sc) {
+    const fv = Array.from((0, types_1.typeFreeVars)(sc.body));
+    const ordered = sc.forall.filter((v) => fv.includes(v));
+    const namePool = 'abcdefghijklmnopqrstuvwxyz'.split('');
+    const renames = new Map();
+    let i = 0;
+    function pick() {
+        if (i < namePool.length)
+            return namePool[i++];
+        return `t${i++}`;
+    }
+    // Recorrer en orden de aparición en el cuerpo para que el nombre
+    // resultante sea estable bajo equivalencia α.
+    visitTypeVars(sc.body, (v) => {
+        if (ordered.includes(v) && !renames.has(v)) {
+            renames.set(v, pick());
+        }
+    });
+    const sub = new Map();
+    for (const [old, fresh] of renames) {
+        sub.set(old, { kind: 'tvar', name: fresh });
+    }
+    return {
+        forall: Array.from(renames.values()),
+        body: (0, substitution_1.applySubst)(sc.body, sub),
+    };
+}
+function visitTypeVars(t, cb) {
+    switch (t.kind) {
+        case 'tvar':
+            cb(t.name);
+            return;
+        case 'tconst':
+            return;
+        case 'arrow':
+            visitTypeVars(t.from, cb);
+            visitTypeVars(t.to, cb);
+            return;
+        case 'tapp':
+            for (const a of t.args)
+                visitTypeVars(a, cb);
+            return;
+    }
+}
+//# sourceMappingURL=infer.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"infer.js","sourceRoot":"","sources":["../../src/hindley-milner/infer.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,8CAA8C;AAC9C,+DAA+D;AAC/D,EAAE;AACF,mEAAmE;AACnE,qEAAqE;AACrE,gEAAgE;AAChE,4BAA4B;AAC5B,EAAE;AACF,yBAAyB;AACzB,gEAAgE;AAChE,0DAA0D;AAC1D,4CAA4C;AAC5C,0CAA0C;AAC1C,8CAA8C;AAC9C,wDAAwD;AACxD,kDAAkD;AAClD,6BAA6B;AAC7B,0CAA0C;AAC1C,gDAAgD;AAChD,mDAAmD;AACnD,4CAA4C;AAC5C,8DAA8D;AAC9D,mEAAmE;AACnE,kEAAkE;AAClE,EAAE;AACF,iEAAiE;AACjE,qDAAqD;;AAwBrD,oCAEC;AAOD,gCA+CC;AAGD,gCAsHC;AAQD,sBAEC;AAQD,kCASC;AAeD,0CAyBC;AAzQD,mCAA+F;AAE/F,iDAUwB;AASxB,SAAgB,YAAY,CAAC,CAAe;IAC1C,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED,uDAAuD;AACvD,EAAE;AACF,gEAAgE;AAChE,yDAAyD;AACzD,+BAA+B;AAC/B,SAAgB,UAAU;IACxB,MAAM,CAAC,GAAG,GAAG,CAAC;IACd,MAAM,CAAC,GAAG,GAAG,CAAC;IACd,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAU,CAAC;IAC7C,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAU,CAAC;IAE7C,MAAM,UAAU,GAAe,IAAA,YAAI,EAAC,IAAA,cAAM,EAAC,YAAI,EAAE,IAAA,cAAM,EAAC,YAAI,EAAE,YAAI,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,QAAQ,GAAe,IAAA,cAAM,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,EAAE,EAAE,IAAA,cAAM,EAAC,EAAE,EAAE,aAAK,CAAC,CAAC,CAAC,CAAC;IAExE,MAAM,MAAM,GAAG,IAAA,YAAI,EAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,IAAA,YAAI,EAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAEjC,OAAO,IAAI,eAAO,CAChB,IAAI,GAAG,CAAqB;QAC1B,CAAC,GAAG,EAAE,UAAU,CAAC;QACjB,CAAC,GAAG,EAAE,UAAU,CAAC;QACjB,CAAC,GAAG,EAAE,UAAU,CAAC;QACjB,CAAC,GAAG,EAAE,UAAU,CAAC;QACjB,CAAC,KAAK,EAAE,UAAU,CAAC;QAEnB,CAAC,IAAI,EAAE,QAAQ,CAAC;QAChB,CAAC,IAAI,EAAE,QAAQ,CAAC;QAChB,CAAC,GAAG,EAAE,QAAQ,CAAC;QACf,CAAC,GAAG,EAAE,QAAQ,CAAC;QACf,CAAC,IAAI,EAAE,QAAQ,CAAC;QAChB,CAAC,IAAI,EAAE,QAAQ,CAAC;QAEhB,CAAC,MAAM,EAAE,IAAA,YAAI,EAAC,aAAK,CAAC,CAAC;QACrB,CAAC,OAAO,EAAE,IAAA,YAAI,EAAC,aAAK,CAAC,CAAC;QACtB,CAAC,KAAK,EAAE,IAAA,YAAI,EAAC,IAAA,cAAM,EAAC,aAAK,EAAE,aAAK,CAAC,CAAC,CAAC;QACnC,CAAC,IAAI,EAAE,IAAA,YAAI,EAAC,IAAA,cAAM,EAAC,aAAK,EAAE,IAAA,cAAM,EAAC,aAAK,EAAE,aAAK,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,IAAI,EAAE,IAAA,YAAI,EAAC,IAAA,cAAM,EAAC,aAAK,EAAE,IAAA,cAAM,EAAC,aAAK,EAAE,aAAK,CAAC,CAAC,CAAC,CAAC;QAEjD,CAAC,MAAM,EAAE,IAAA,cAAM,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,EAAE,EAAE,IAAA,cAAM,EAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC,KAAK,EAAE,IAAA,cAAM,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3C,CAAC,KAAK,EAAE,IAAA,cAAM,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;QAE3C,CAAC,KAAK,EAAE,IAAA,cAAM,EAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAC7B,CAAC,MAAM,EAAE,IAAA,cAAM,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,EAAE,EAAE,IAAA,cAAM,EAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC,MAAM,EAAE,IAAA,cAAM,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;QAC1C,CAAC,MAAM,EAAE,IAAA,cAAM,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;QAC/C,CAAC,SAAS,EAAE,IAAA,cAAM,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,OAAO,EAAE,aAAK,CAAC,CAAC,CAAC;QAEhD,mEAAmE;QACnE,CAAC,KAAK,EAAE,IAAA,cAAM,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,cAAM,EAAC,IAAA,cAAM,EAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;KACjD,CAAC,CACH,CAAC;AACJ,CAAC;AAED,oCAAoC;AACpC,SAAgB,UAAU,CAAC,IAAU,EAAE,GAAY;IACjD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,CAAC,GACL,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,YAAI,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,aAAK,CAAC,CAAC,CAAC,YAAI,CAAC;YACzF,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,IAAA,yBAAU,GAAE,EAAE,CAAC;QAC1C,CAAC;QAED,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,EAAE,KAAK,SAAS;gBAAE,OAAO,EAAE,KAAK,EAAE,qBAAqB,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACzE,OAAO,EAAE,IAAI,EAAE,IAAA,0BAAW,EAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAA,yBAAU,GAAE,EAAE,CAAC;QACxD,CAAC;QAED,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,IAAA,2BAAY,EAAC,GAAG,CAAC,CAAC;YAC7B,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,IAAA,YAAI,EAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACzC,IAAI,YAAY,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,OAAO;gBACL,IAAI,EAAE,IAAA,cAAM,EAAC,IAAA,yBAAU,EAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC;gBACnD,KAAK,EAAE,IAAI,CAAC,KAAK;aAClB,CAAC;QACJ,CAAC;QAED,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACpC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACtC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,IAAA,2BAAY,EAAC,GAAG,CAAC,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAA,oBAAK,EAAC,IAAA,yBAAU,EAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,IAAA,cAAM,EAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;YACpE,IAAI,IAAA,2BAAY,EAAC,CAAC,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;YAC/C,MAAM,UAAU,GAAG,IAAA,4BAAa,EAAC,CAAC,EAAE,IAAA,4BAAa,EAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YACvE,OAAO,EAAE,IAAI,EAAE,IAAA,yBAAU,EAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;QACxD,CAAC;QAED,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACvC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,EAAE,GAAG,IAAA,yBAAU,EAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACxC,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACvC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,OAAO;gBACL,IAAI,EAAE,EAAE,CAAC,IAAI;gBACb,KAAK,EAAE,IAAA,4BAAa,EAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC;aACzC,CAAC;QACJ,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,4DAA4D;YAC5D,+DAA+D;YAC/D,qCAAqC;YACrC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAE9D,MAAM,SAAS,GAAW,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAA,2BAAY,EAAC,GAAG,CAAC,CAAC,CAAC;YACjE,IAAI,MAAM,GAAG,GAAG,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,IAAA,YAAI,EAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChE,CAAC;YAED,IAAI,CAAC,GAAiB,IAAA,yBAAU,GAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBACxB,MAAM,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrD,IAAI,YAAY,CAAC,EAAE,CAAC;oBAAE,OAAO,EAAE,CAAC;gBAChC,MAAM,CAAC,GAAG,IAAA,oBAAK,EAAC,IAAA,yBAAU,EAAC,EAAE,EAAE,IAAA,4BAAa,EAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;gBACrE,IAAI,IAAA,2BAAY,EAAC,CAAC,CAAC;oBAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC/C,CAAC,GAAG,IAAA,4BAAa,EAAC,CAAC,EAAE,IAAA,4BAAa,EAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;YAED,oCAAoC;YACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,MAAM,GAAG,QAAQ,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,EAAE,GAAG,IAAA,yBAAU,EAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvC,MAAM,EAAE,GAAG,IAAA,yBAAU,EAAC,KAAK,EAAE,EAAE,CAAC,CAAC;gBACjC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAChD,CAAC;YAED,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC5C,IAAI,YAAY,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACtC,OAAO;gBACL,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,KAAK,EAAE,IAAA,4BAAa,EAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;aACrC,CAAC;QACJ,CAAC;QAED,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACtC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,KAAK,GAAG,IAAA,oBAAK,EAAC,EAAE,CAAC,IAAI,EAAE,aAAK,CAAC,CAAC;YACpC,IAAI,IAAA,2BAAY,EAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,EAAE,KAAK,EAAE,mCAAmC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YACrE,CAAC;YACD,MAAM,EAAE,GAAG,IAAA,4BAAa,EAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;YAE1C,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YACpD,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,IAAA,4BAAa,EAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAEvC,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;YACpD,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,IAAA,4BAAa,EAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAEvC,MAAM,CAAC,GAAG,IAAA,oBAAK,EAAC,IAAA,yBAAU,EAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;YAClD,IAAI,IAAA,2BAAY,EAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,OAAO,EAAE,KAAK,EAAE,gCAAgC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;YAC9D,CAAC;YACD,MAAM,UAAU,GAAG,IAAA,4BAAa,EAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACxC,OAAO,EAAE,IAAI,EAAE,IAAA,yBAAU,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;QAC7D,CAAC;IACH,CAAC;AACH,CAAC;AAED,0CAA0C;AAC1C,EAAE;AACF,kEAAkE;AAClE,gEAAgE;AAChE,uDAAuD;AAEvD,SAAgB,KAAK,CAAC,IAAU,EAAE,MAAe,UAAU,EAAE;IAC3D,OAAO,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AAC/B,CAAC;AAQD,SAAgB,WAAW,CACzB,IAAU,EACV,MAAe,UAAU,EAAE;IAE3B,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAChC,IAAI,YAAY,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAC9B,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,EAAE,GAAG,IAAA,yBAAU,EAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACnD,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;AACtD,CAAC;AAED,gCAAgC;AAChC,SAAS,QAAQ,CAAC,GAAY,EAAE,CAAe;IAC7C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QACtC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAA,+BAAgB,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,eAAO,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED,gEAAgE;AAChE,6DAA6D;AAC7D,gCAAgC;AAChC,SAAgB,eAAe,CAAC,EAAc;IAC5C,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,IAAA,oBAAY,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7C,MAAM,OAAO,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAG,4BAA4B,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,SAAS,IAAI;QACX,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM;YAAE,OAAO,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;QAC9C,OAAO,IAAI,CAAC,EAAE,EAAE,CAAC;IACnB,CAAC;IACD,iEAAiE;IACjE,8CAA8C;IAC9C,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;QAC3B,IAAI,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3C,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QACzB,CAAC;IACH,CAAC,CAAC,CAAC;IACH,MAAM,GAAG,GAAiB,IAAI,GAAG,EAAE,CAAC;IACpC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;QACnC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO;QACL,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,EAAE,IAAA,yBAAU,EAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC;KAC/B,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,CAAO,EAAE,EAA0B;IACxD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACX,OAAO;QACT,KAAK,QAAQ;YACX,OAAO;QACT,KAAK,OAAO;YACV,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC1B,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACxB,OAAO;QACT,KAAK,MAAM;YACT,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;gBAAE,aAAa,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7C,OAAO;IACX,CAAC;AACH,CAAC"}

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

@@ -0,0 +1,21 @@
+import type { Type, TypeScheme } from './types';
+import { schemeFreeVars } from './types';
+export type Substitution = Map<string, Type>;
+export declare const emptySubst: () => Substitution;
+export declare function applySubst(t: Type, s: Substitution): Type;
+export declare function applySubstScheme(sc: TypeScheme, s: Substitution): TypeScheme;
+export declare function composeSubsts(s1: Substitution, s2: Substitution): Substitution;
+export declare function resetFreshSupply(): void;
+export declare function freshTypeVar(prefix?: string): Type;
+export declare function occursIn(name: string, t: Type): boolean;
+export type UnifyResult = Substitution | {
+    error: string;
+};
+export declare function isUnifyError(r: UnifyResult): r is {
+    error: string;
+};
+export declare function unify(t1: Type, t2: Type): UnifyResult;
+export declare function generalize(envFreeVars: Set<string>, t: Type): TypeScheme;
+export declare function instantiate(sc: TypeScheme): Type;
+export { schemeFreeVars };
+//# sourceMappingURL=substitution.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"substitution.d.ts","sourceRoot":"","sources":["../../src/hindley-milner/substitution.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAChD,OAAO,EAAE,cAAc,EAA8B,MAAM,SAAS,CAAC;AAErE,MAAM,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAE7C,eAAO,MAAM,UAAU,QAAO,YAAyB,CAAC;AAExD,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,YAAY,GAAG,IAAI,CAGzD;AA6BD,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,YAAY,GAAG,UAAU,CAU5E;AAED,wBAAgB,aAAa,CAAC,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,GAAG,YAAY,CAO9E;AAQD,wBAAgB,gBAAgB,IAAI,IAAI,CAEvC;AAED,wBAAgB,YAAY,CAAC,MAAM,SAAM,GAAG,IAAI,CAG/C;AAKD,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAWvD;AAKD,MAAM,MAAM,WAAW,GAAG,YAAY,GAAG;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAE3D,wBAAgB,YAAY,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,IAAI;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAEnE;AAED,wBAAgB,KAAK,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,WAAW,CAsCrD;AAmCD,wBAAgB,UAAU,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,GAAG,UAAU,CASxE;AAED,wBAAgB,WAAW,CAAC,EAAE,EAAE,UAAU,GAAG,IAAI,CAOhD;AAGD,OAAO,EAAE,cAAc,EAAE,CAAC"}

package/dist/hindley-milner/substitution.js

@@ -0,0 +1,215 @@
+"use strict";
+// ============================================================
+// Hindley-Milner — Sustituciones, unificación, fresh vars
+// ============================================================
+//
+// Sustitución σ : tvar → Type. Aplicar σ a un tipo reemplaza las
+// variables libres que aparezcan en su dominio.
+//
+// composeSubsts(s1, s2) calcula s1 ∘ s2 : primero aplica s2, luego s1.
+// El truco habitual es:
+//
+//    (s1 ∘ s2)(α) = s1 (s2 α)
+//
+// Implementado como: aplicar s1 a los valores de s2, y añadir las
+// entradas de s1 que s2 no tocó.
+//
+// Unificación es la unificación de primer orden Robinson, con
+// occurs-check para impedir tipos infinitos (`α ≡ α → α` falla).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.schemeFreeVars = exports.emptySubst = void 0;
+exports.applySubst = applySubst;
+exports.applySubstScheme = applySubstScheme;
+exports.composeSubsts = composeSubsts;
+exports.resetFreshSupply = resetFreshSupply;
+exports.freshTypeVar = freshTypeVar;
+exports.occursIn = occursIn;
+exports.isUnifyError = isUnifyError;
+exports.unify = unify;
+exports.generalize = generalize;
+exports.instantiate = instantiate;
+const types_1 = require("./types");
+Object.defineProperty(exports, "schemeFreeVars", { enumerable: true, get: function () { return types_1.schemeFreeVars; } });
+const emptySubst = () => new Map();
+exports.emptySubst = emptySubst;
+function applySubst(t, s) {
+    if (s.size === 0)
+        return t;
+    return applySubstChase(t, s, new Set());
+}
+function applySubstChase(t, s, seen) {
+    switch (t.kind) {
+        case 'tvar': {
+            const r = s.get(t.name);
+            if (r === undefined)
+                return t;
+            if (seen.has(t.name))
+                return t; // guard contra cadenas cíclicas (no deberían ocurrir tras unify)
+            const nextSeen = new Set(seen);
+            nextSeen.add(t.name);
+            return applySubstChase(r, s, nextSeen);
+        }
+        case 'tconst':
+            return t;
+        case 'arrow':
+            return {
+                kind: 'arrow',
+                from: applySubstChase(t.from, s, seen),
+                to: applySubstChase(t.to, s, seen),
+            };
+        case 'tapp':
+            return {
+                kind: 'tapp',
+                fn: t.fn,
+                args: t.args.map((a) => applySubstChase(a, s, seen)),
+            };
+    }
+}
+function applySubstScheme(sc, s) {
+    if (s.size === 0)
+        return sc;
+    // No sustituir las variables ligadas por el ∀.
+    let restricted = s;
+    if (sc.forall.length > 0) {
+        restricted = new Map(s);
+        for (const b of sc.forall)
+            restricted.delete(b);
+        if (restricted.size === 0)
+            return sc;
+    }
+    return { forall: sc.forall, body: applySubst(sc.body, restricted) };
+}
+function composeSubsts(s1, s2) {
+    const result = new Map();
+    for (const [k, v] of s2)
+        result.set(k, applySubst(v, s1));
+    for (const [k, v] of s1) {
+        if (!result.has(k))
+            result.set(k, v);
+    }
+    return result;
+}
+// ---------- Generación de variables frescas ----------
+//
+// freshCounter es módulo-global. resetFreshSupply() permite que los
+// tests obtengan nombres reproducibles.
+let freshCounter = 0;
+function resetFreshSupply() {
+    freshCounter = 0;
+}
+function freshTypeVar(prefix = 't') {
+    const name = `${prefix}${freshCounter++}`;
+    return { kind: 'tvar', name };
+}
+// ---------- Occurs check ----------
+// α aparece en t como subtérmino? Si sí, unificarlos crearía un
+// tipo recursivo (infinito).
+function occursIn(name, t) {
+    switch (t.kind) {
+        case 'tvar':
+            return t.name === name;
+        case 'tconst':
+            return false;
+        case 'arrow':
+            return occursIn(name, t.from) || occursIn(name, t.to);
+        case 'tapp':
+            return t.args.some((a) => occursIn(name, a));
+    }
+}
+function isUnifyError(r) {
+    return typeof r === 'object' && r !== null && !(r instanceof Map) && 'error' in r;
+}
+function unify(t1, t2) {
+    if (t1.kind === 'tvar')
+        return bindVar(t1.name, t2);
+    if (t2.kind === 'tvar')
+        return bindVar(t2.name, t1);
+    if (t1.kind === 'tconst' && t2.kind === 'tconst') {
+        if (t1.name === t2.name)
+            return (0, exports.emptySubst)();
+        return { error: `cannot unify ${t1.name} with ${t2.name}` };
+    }
+    if (t1.kind === 'arrow' && t2.kind === 'arrow') {
+        const sFrom = unify(t1.from, t2.from);
+        if (isUnifyError(sFrom))
+            return sFrom;
+        const sTo = unify(applySubst(t1.to, sFrom), applySubst(t2.to, sFrom));
+        if (isUnifyError(sTo))
+            return sTo;
+        return composeSubsts(sTo, sFrom);
+    }
+    if (t1.kind === 'tapp' && t2.kind === 'tapp') {
+        if (t1.fn !== t2.fn)
+            return { error: `cannot unify ${t1.fn} with ${t2.fn}` };
+        if (t1.args.length !== t2.args.length) {
+            return {
+                error: `arity mismatch on ${t1.fn}: ${t1.args.length} vs ${t2.args.length}`,
+            };
+        }
+        let s = (0, exports.emptySubst)();
+        for (let i = 0; i < t1.args.length; i++) {
+            const a1 = applySubst(t1.args[i], s);
+            const a2 = applySubst(t2.args[i], s);
+            const step = unify(a1, a2);
+            if (isUnifyError(step))
+                return step;
+            s = composeSubsts(step, s);
+        }
+        return s;
+    }
+    return {
+        error: `cannot unify ${describeKind(t1)} with ${describeKind(t2)}`,
+    };
+}
+function describeKind(t) {
+    switch (t.kind) {
+        case 'tvar':
+            return `tvar ${t.name}`;
+        case 'tconst':
+            return t.name;
+        case 'arrow':
+            return 'function type';
+        case 'tapp':
+            return `${t.fn} type constructor`;
+    }
+}
+function bindVar(name, t) {
+    if (t.kind === 'tvar' && t.name === name)
+        return (0, exports.emptySubst)();
+    if (occursIn(name, t)) {
+        return { error: `occurs check failed: ${name} occurs in ${(0, types_1.typeToString)(t)}` };
+    }
+    const s = new Map();
+    s.set(name, t);
+    return s;
+}
+// ---------- generalize / instantiate ----------
+//
+// generalize cierra los tipos libres que no están en el entorno: es
+// la regla que convierte un monotipo en un esquema polimórfico. Sólo
+// debe llamarse al tipar la RHS de un `let`.
+//
+// instantiate abre un esquema reemplazando cada cuantificador con una
+// variable fresca: es la regla que vuelve a "abrir" un binding cuando
+// se usa una variable polimórfica.
+function generalize(envFreeVars, t) {
+    const tFv = (0, types_1.typeFreeVars)(t);
+    const quantified = [];
+    for (const v of tFv) {
+        if (!envFreeVars.has(v))
+            quantified.push(v);
+    }
+    // orden estable para que la salida sea reproducible.
+    quantified.sort();
+    return { forall: quantified, body: t };
+}
+function instantiate(sc) {
+    if (sc.forall.length === 0)
+        return sc.body;
+    const s = new Map();
+    for (const b of sc.forall) {
+        s.set(b, freshTypeVar('t'));
+    }
+    return applySubst(sc.body, s);
+}
+//# sourceMappingURL=substitution.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"substitution.js","sourceRoot":"","sources":["../../src/hindley-milner/substitution.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,0DAA0D;AAC1D,+DAA+D;AAC/D,EAAE;AACF,iEAAiE;AACjE,gDAAgD;AAChD,EAAE;AACF,uEAAuE;AACvE,wBAAwB;AACxB,EAAE;AACF,8BAA8B;AAC9B,EAAE;AACF,kEAAkE;AAClE,iCAAiC;AACjC,EAAE;AACF,8DAA8D;AAC9D,iEAAiE;;;AASjE,gCAGC;AA6BD,4CAUC;AAED,sCAOC;AAQD,4CAEC;AAED,oCAGC;AAKD,4BAWC;AAOD,oCAEC;AAED,sBAsCC;AAmCD,gCASC;AAED,kCAOC;AA9LD,mCAAqE;AAiM5D,+FAjMA,sBAAc,OAiMA;AA7LhB,MAAM,UAAU,GAAG,GAAiB,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;AAA3C,QAAA,UAAU,cAAiC;AAExD,SAAgB,UAAU,CAAC,CAAO,EAAE,CAAe;IACjD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3B,OAAO,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;AAC1C,CAAC;AAED,SAAS,eAAe,CAAC,CAAO,EAAE,CAAe,EAAE,IAAiB;IAClE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACxB,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,CAAC,CAAC;YAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,iEAAiE;YACjG,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC/B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACrB,OAAO,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QACzC,CAAC;QACD,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC;QACX,KAAK,OAAO;YACV,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC;gBACtC,EAAE,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC;aACnC,CAAC;QACJ,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;aACrD,CAAC;IACN,CAAC;AACH,CAAC;AAED,SAAgB,gBAAgB,CAAC,EAAc,EAAE,CAAe;IAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC5B,+CAA+C;IAC/C,IAAI,UAAU,GAAiB,CAAC,CAAC;IACjC,IAAI,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM;YAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;IACvC,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC;AACtE,CAAC;AAED,SAAgB,aAAa,CAAC,EAAgB,EAAE,EAAgB;IAC9D,MAAM,MAAM,GAAiB,IAAI,GAAG,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,wDAAwD;AACxD,EAAE;AACF,oEAAoE;AACpE,wCAAwC;AACxC,IAAI,YAAY,GAAG,CAAC,CAAC;AAErB,SAAgB,gBAAgB;IAC9B,YAAY,GAAG,CAAC,CAAC;AACnB,CAAC;AAED,SAAgB,YAAY,CAAC,MAAM,GAAG,GAAG;IACvC,MAAM,IAAI,GAAG,GAAG,MAAM,GAAG,YAAY,EAAE,EAAE,CAAC;IAC1C,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,qCAAqC;AACrC,gEAAgE;AAChE,6BAA6B;AAC7B,SAAgB,QAAQ,CAAC,IAAY,EAAE,CAAO;IAC5C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;QACzB,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC;QACf,KAAK,OAAO;YACV,OAAO,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACxD,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;AACH,CAAC;AAOD,SAAgB,YAAY,CAAC,CAAc;IACzC,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,IAAI,OAAO,IAAI,CAAC,CAAC;AACpF,CAAC;AAED,SAAgB,KAAK,CAAC,EAAQ,EAAE,EAAQ;IACtC,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACpD,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAEpD,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACjD,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI;YAAE,OAAO,IAAA,kBAAU,GAAE,CAAC;QAC7C,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;IAC9D,CAAC;IAED,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,YAAY,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACtC,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;QACtE,IAAI,YAAY,CAAC,GAAG,CAAC;YAAE,OAAO,GAAG,CAAC;QAClC,OAAO,aAAa,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC7C,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;YAAE,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;QAC7E,IAAI,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,OAAO;gBACL,KAAK,EAAE,qBAAqB,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM,OAAO,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE;aAC5E,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,GAAiB,IAAA,kBAAU,GAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,MAAM,EAAE,GAAG,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3B,IAAI,YAAY,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,CAAC,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,OAAO;QACL,KAAK,EAAE,gBAAgB,YAAY,CAAC,EAAE,CAAC,SAAS,YAAY,CAAC,EAAE,CAAC,EAAE;KACnE,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,CAAO;IAC3B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QAC1B,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,OAAO;YACV,OAAO,eAAe,CAAC;QACzB,KAAK,MAAM;YACT,OAAO,GAAG,CAAC,CAAC,EAAE,mBAAmB,CAAC;IACtC,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,IAAY,EAAE,CAAO;IACpC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAA,kBAAU,GAAE,CAAC;IAC9D,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;QACtB,OAAO,EAAE,KAAK,EAAE,wBAAwB,IAAI,cAAc,IAAA,oBAAY,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IAChF,CAAC;IACD,MAAM,CAAC,GAAiB,IAAI,GAAG,EAAE,CAAC;IAClC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACf,OAAO,CAAC,CAAC;AACX,CAAC;AAED,iDAAiD;AACjD,EAAE;AACF,oEAAoE;AACpE,qEAAqE;AACrE,6CAA6C;AAC7C,EAAE;AACF,sEAAsE;AACtE,sEAAsE;AACtE,mCAAmC;AAEnC,SAAgB,UAAU,CAAC,WAAwB,EAAE,CAAO;IAC1D,MAAM,GAAG,GAAG,IAAA,oBAAY,EAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,qDAAqD;IACrD,UAAU,CAAC,IAAI,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;AACzC,CAAC;AAED,SAAgB,WAAW,CAAC,EAAc;IACxC,IAAI,EAAE,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,IAAI,CAAC;IAC3C,MAAM,CAAC,GAAiB,IAAI,GAAG,EAAE,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;QAC1B,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAChC,CAAC"}