@stevenvo780/st-lang 4.5.1 → 4.6.0

package/dist/profiles/hol/term.js

@@ -0,0 +1,345 @@
+"use strict";
+// ============================================================
+// HOL — Operaciones sobre términos
+// ============================================================
+//
+// Type inference, α-equivalencia, sustitución capture-free,
+// detección de variables libres, etc.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mkAbs = exports.mkComb = exports.mkConst = exports.mkVar = void 0;
+exports.typeOf = typeOf;
+exports.alphaEq = alphaEq;
+exports.freeVars = freeVars;
+exports.occursFree = occursFree;
+exports.freshName = freshName;
+exports.substTerm = substTerm;
+exports.instTypeInTerm = instTypeInTerm;
+exports.termToString = termToString;
+exports.eqConst = eqConst;
+exports.mkEq = mkEq;
+exports.destEq = destEq;
+exports.isEq = isEq;
+exports.isIff = isIff;
+const type_system_1 = require("./type-system");
+// Constructores ergonómicos ------------------------------------
+const mkVar = (name, type) => ({ kind: 'var', name, type });
+exports.mkVar = mkVar;
+const mkConst = (name, type) => ({ kind: 'const', name, type });
+exports.mkConst = mkConst;
+const mkComb = (fn, arg) => {
+    // Bien-formado: el tipo de `fn` debe ser `T(arg) → ?` y los
+    // dominios deben coincidir.
+    const fnType = typeOf(fn);
+    const argType = typeOf(arg);
+    if (!(0, type_system_1.isFunType)(fnType)) {
+        throw new Error(`mkComb: el lado izquierdo no es función: ${termToString(fn)} : ${(0, type_system_1.typeToString)(fnType)}`);
+    }
+    if (!(0, type_system_1.typeEq)((0, type_system_1.funDomain)(fnType), argType)) {
+        throw new Error(`mkComb: tipos incompatibles. esperaba ${(0, type_system_1.typeToString)((0, type_system_1.funDomain)(fnType))}, ` +
+            `recibido ${(0, type_system_1.typeToString)(argType)}`);
+    }
+    return { kind: 'comb', fn, arg };
+};
+exports.mkComb = mkComb;
+const mkAbs = (param, paramType, body) => ({
+    kind: 'abs',
+    param,
+    paramType,
+    body,
+});
+exports.mkAbs = mkAbs;
+// Type inference -----------------------------------------------
+/**
+ * Calcula el tipo de un término bien formado. Lanza si el
+ * término está mal tipado (combinación con dominios disjuntos).
+ */
+function typeOf(t) {
+    switch (t.kind) {
+        case 'var':
+        case 'const':
+            return t.type;
+        case 'abs':
+            return (0, type_system_1.funTy)(t.paramType, typeOf(t.body));
+        case 'comb': {
+            const fnType = typeOf(t.fn);
+            const argType = typeOf(t.arg);
+            if (!(0, type_system_1.isFunType)(fnType)) {
+                throw new Error(`typeOf: aplicación sobre no-función: ${termToString(t.fn)} : ${(0, type_system_1.typeToString)(fnType)}`);
+            }
+            if (!(0, type_system_1.typeEq)((0, type_system_1.funDomain)(fnType), argType)) {
+                throw new Error(`typeOf: tipos incompatibles en aplicación: ` +
+                    `${(0, type_system_1.typeToString)((0, type_system_1.funDomain)(fnType))} vs ${(0, type_system_1.typeToString)(argType)}`);
+            }
+            return (0, type_system_1.funCodomain)(fnType);
+        }
+    }
+}
+// α-equivalencia ----------------------------------------------
+/**
+ * Igualdad estructural módulo α-renaming. Implementación con
+ * dos mapas de profundidad (de Bruijn implícito sobre nombres).
+ */
+function alphaEq(a, b) {
+    return alphaEqAux(a, b, new Map(), new Map(), 0);
+}
+function alphaEqAux(a, b, envA, envB, depth) {
+    if (a.kind !== b.kind)
+        return false;
+    switch (a.kind) {
+        case 'var': {
+            const bb = b;
+            // Misma variable: o ambas ligadas a la misma profundidad,
+            // o ambas libres con mismo nombre y mismo tipo.
+            const da = envA.get(a.name);
+            const db = envB.get(bb.name);
+            if (da !== undefined && db !== undefined) {
+                return da === db && (0, type_system_1.typeEq)(a.type, bb.type);
+            }
+            if (da === undefined && db === undefined) {
+                return a.name === bb.name && (0, type_system_1.typeEq)(a.type, bb.type);
+            }
+            return false;
+        }
+        case 'const': {
+            const bb = b;
+            return a.name === bb.name && (0, type_system_1.typeEq)(a.type, bb.type);
+        }
+        case 'comb': {
+            const bb = b;
+            return (alphaEqAux(a.fn, bb.fn, envA, envB, depth) && alphaEqAux(a.arg, bb.arg, envA, envB, depth));
+        }
+        case 'abs': {
+            const bb = b;
+            if (!(0, type_system_1.typeEq)(a.paramType, bb.paramType))
+                return false;
+            // Sombreamos en ambos environments con la misma profundidad
+            // para que las ocurrencias del binder coincidan.
+            const nextA = new Map(envA);
+            const nextB = new Map(envB);
+            nextA.set(a.param, depth);
+            nextB.set(bb.param, depth);
+            return alphaEqAux(a.body, bb.body, nextA, nextB, depth + 1);
+        }
+    }
+}
+/**
+ * Devuelve las variables libres de `t` con su tipo. Una variable
+ * con mismo nombre pero distinto tipo aparece dos veces.
+ */
+function freeVars(t, out = []) {
+    const seen = new Set();
+    const collect = (term, bound) => {
+        switch (term.kind) {
+            case 'var': {
+                const boundType = bound.get(term.name);
+                if (boundType !== undefined && (0, type_system_1.typeEq)(boundType, term.type))
+                    return;
+                const key = `${term.name}::${(0, type_system_1.typeToString)(term.type)}`;
+                if (seen.has(key))
+                    return;
+                seen.add(key);
+                out.push({ name: term.name, type: term.type });
+                return;
+            }
+            case 'const':
+                return;
+            case 'comb':
+                collect(term.fn, bound);
+                collect(term.arg, bound);
+                return;
+            case 'abs': {
+                const next = new Map(bound);
+                next.set(term.param, term.paramType);
+                collect(term.body, next);
+                return;
+            }
+        }
+    };
+    collect(t, new Map());
+    return out;
+}
+/**
+ * Devuelve true si `name` aparece libre en `term` con tipo `ty`.
+ */
+function occursFree(name, ty, term) {
+    return freeVars(term).some((v) => v.name === name && (0, type_system_1.typeEq)(v.type, ty));
+}
+/** Genera un nombre fresco respecto a un conjunto de nombres prohibidos. */
+function freshName(base, forbidden) {
+    if (!forbidden.has(base))
+        return base;
+    let i = 0;
+    while (forbidden.has(`${base}'${i}`))
+        i++;
+    return `${base}'${i}`;
+}
+// Sustitución capture-free -----------------------------------
+/**
+ * Sustituye [v := value] en `term`. Renombra binders si haría
+ * falta para evitar captura. `v` se identifica por nombre + tipo.
+ */
+function substTerm(name, ty, value, term) {
+    if (!(0, type_system_1.typeEq)(typeOf(value), ty)) {
+        throw new Error(`substTerm: el valor tiene tipo ${(0, type_system_1.typeToString)(typeOf(value))}, esperaba ${(0, type_system_1.typeToString)(ty)}`);
+    }
+    return substTermAux(name, ty, value, term, collectAllVarNames(value));
+}
+function substTermAux(name, ty, value, term, valueVars) {
+    switch (term.kind) {
+        case 'var':
+            if (term.name === name && (0, type_system_1.typeEq)(term.type, ty))
+                return value;
+            return term;
+        case 'const':
+            return term;
+        case 'comb':
+            return {
+                kind: 'comb',
+                fn: substTermAux(name, ty, value, term.fn, valueVars),
+                arg: substTermAux(name, ty, value, term.arg, valueVars),
+            };
+        case 'abs': {
+            // Si el binder shadowsa exactamente la variable objetivo,
+            // la sustitución es identidad dentro del body.
+            if (term.param === name && (0, type_system_1.typeEq)(term.paramType, ty))
+                return term;
+            // Captura: el binder coincide con una variable libre de `value`.
+            if (valueVars.has(term.param) && occursFree(name, ty, term.body)) {
+                const forbidden = new Set([...valueVars, ...collectAllVarNames(term.body), name]);
+                const fresh = freshName(term.param, forbidden);
+                const renamedBody = renameBoundVar(term.param, term.paramType, fresh, term.body);
+                return {
+                    kind: 'abs',
+                    param: fresh,
+                    paramType: term.paramType,
+                    body: substTermAux(name, ty, value, renamedBody, valueVars),
+                };
+            }
+            return {
+                kind: 'abs',
+                param: term.param,
+                paramType: term.paramType,
+                body: substTermAux(name, ty, value, term.body, valueVars),
+            };
+        }
+    }
+}
+/** Renombra ocurrencias libres de `(from : ty)` por `to` en `term`. */
+function renameBoundVar(from, ty, to, term) {
+    switch (term.kind) {
+        case 'var':
+            if (term.name === from && (0, type_system_1.typeEq)(term.type, ty)) {
+                return { kind: 'var', name: to, type: term.type };
+            }
+            return term;
+        case 'const':
+            return term;
+        case 'comb':
+            return {
+                kind: 'comb',
+                fn: renameBoundVar(from, ty, to, term.fn),
+                arg: renameBoundVar(from, ty, to, term.arg),
+            };
+        case 'abs': {
+            if (term.param === from && (0, type_system_1.typeEq)(term.paramType, ty))
+                return term;
+            return {
+                kind: 'abs',
+                param: term.param,
+                paramType: term.paramType,
+                body: renameBoundVar(from, ty, to, term.body),
+            };
+        }
+    }
+}
+function collectAllVarNames(term, out = new Set()) {
+    switch (term.kind) {
+        case 'var':
+            out.add(term.name);
+            return out;
+        case 'const':
+            return out;
+        case 'comb':
+            collectAllVarNames(term.fn, out);
+            return collectAllVarNames(term.arg, out);
+        case 'abs':
+            out.add(term.param);
+            return collectAllVarNames(term.body, out);
+    }
+}
+// Sustitución de variables de tipo en términos ----------------
+function instTypeInTerm(subst, term) {
+    switch (term.kind) {
+        case 'var':
+            return { kind: 'var', name: term.name, type: (0, type_system_1.substType)(subst, term.type) };
+        case 'const':
+            return { kind: 'const', name: term.name, type: (0, type_system_1.substType)(subst, term.type) };
+        case 'comb':
+            return {
+                kind: 'comb',
+                fn: instTypeInTerm(subst, term.fn),
+                arg: instTypeInTerm(subst, term.arg),
+            };
+        case 'abs':
+            return {
+                kind: 'abs',
+                param: term.param,
+                paramType: (0, type_system_1.substType)(subst, term.paramType),
+                body: instTypeInTerm(subst, term.body),
+            };
+    }
+}
+// Pretty-printing --------------------------------------------
+function termToString(t) {
+    switch (t.kind) {
+        case 'var':
+            return t.name;
+        case 'const':
+            return t.name;
+        case 'comb':
+            return `(${termToString(t.fn)} ${termToString(t.arg)})`;
+        case 'abs':
+            return `(λ${t.param}:${(0, type_system_1.typeToString)(t.paramType)}. ${termToString(t.body)})`;
+    }
+}
+// Igualdad como aplicación primitiva --------------------------
+/**
+ * Constructor de igualdad polimórfica `= : α → α → bool`.
+ * Devuelve la `const` `=` instanciada al tipo del término.
+ */
+function eqConst(ty) {
+    return (0, exports.mkConst)('=', (0, type_system_1.funTy)(ty, (0, type_system_1.funTy)(ty, type_system_1.TyBool)));
+}
+/** Construye el término `l = r` (chequea que sus tipos coincidan). */
+function mkEq(l, r) {
+    const ty = typeOf(l);
+    if (!(0, type_system_1.typeEq)(ty, typeOf(r))) {
+        throw new Error(`mkEq: tipos diferentes — ${(0, type_system_1.typeToString)(ty)} vs ${(0, type_system_1.typeToString)(typeOf(r))}`);
+    }
+    return (0, exports.mkComb)((0, exports.mkComb)(eqConst(ty), l), r);
+}
+/** Descompone `l = r` en `[l, r]` o null si no es igualdad. */
+function destEq(t) {
+    // Forma: ((= ty) l) r
+    if (t.kind !== 'comb')
+        return null;
+    if (t.fn.kind !== 'comb')
+        return null;
+    const head = t.fn.fn;
+    if (head.kind !== 'const' || head.name !== '=')
+        return null;
+    return [t.fn.arg, t.arg];
+}
+/** True si `t` es una igualdad de la forma `l = r`. */
+function isEq(t) {
+    return destEq(t) !== null;
+}
+/** True si `t` es una bi-implicación bool ↔ bool (sintácticamente `=` sobre bool). */
+function isIff(t) {
+    const parts = destEq(t);
+    if (parts === null)
+        return false;
+    // El término-igualdad tiene tipo bool si los lados son bool.
+    return (0, type_system_1.typeEq)(typeOf(parts[0]), type_system_1.TyBool);
+}
+//# sourceMappingURL=term.js.map

package/dist/profiles/hol/term.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"term.js","sourceRoot":"","sources":["../../../src/profiles/hol/term.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mCAAmC;AACnC,+DAA+D;AAC/D,EAAE;AACF,4DAA4D;AAC5D,sCAAsC;;;AAoDtC,wBAwBC;AAQD,0BAEC;AA4DD,4BA6BC;AAKD,gCAEC;AAGD,8BAKC;AAQD,8BAOC;AA6FD,wCAoBC;AAID,oCAWC;AAQD,0BAEC;AAGD,oBAMC;AAGD,wBAOC;AAGD,oBAEC;AAGD,sBAKC;AApXD,+CASuB;AAEvB,iEAAiE;AAE1D,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,IAAa,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;AAAhF,QAAA,KAAK,SAA2E;AAEtF,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,IAAa,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;AAApF,QAAA,OAAO,WAA6E;AAE1F,MAAM,MAAM,GAAG,CAAC,EAAW,EAAE,GAAY,EAAW,EAAE;IAC3D,4DAA4D;IAC5D,4BAA4B;IAC5B,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,CAAC,IAAA,uBAAS,EAAC,MAAM,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CACb,4CAA4C,YAAY,CAAC,EAAE,CAAC,MAAM,IAAA,0BAAY,EAAC,MAAM,CAAC,EAAE,CACzF,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,IAAA,oBAAM,EAAC,IAAA,uBAAS,EAAC,MAAM,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;QACxC,MAAM,IAAI,KAAK,CACb,yCAAyC,IAAA,0BAAY,EAAC,IAAA,uBAAS,EAAC,MAAM,CAAC,CAAC,IAAI;YAC1E,YAAY,IAAA,0BAAY,EAAC,OAAO,CAAC,EAAE,CACtC,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;AACnC,CAAC,CAAC;AAjBW,QAAA,MAAM,UAiBjB;AAEK,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,SAAkB,EAAE,IAAa,EAAW,EAAE,CAAC,CAAC;IACnF,IAAI,EAAE,KAAK;IACX,KAAK;IACL,SAAS;IACT,IAAI;CACL,CAAC,CAAC;AALU,QAAA,KAAK,SAKf;AAEH,iEAAiE;AAEjE;;;GAGG;AACH,SAAgB,MAAM,CAAC,CAAU;IAC/B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC;QACX,KAAK,OAAO;YACV,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,KAAK;YACR,OAAO,IAAA,mBAAK,EAAC,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5C,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC5B,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAA,uBAAS,EAAC,MAAM,CAAC,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CACb,wCAAwC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,IAAA,0BAAY,EAAC,MAAM,CAAC,EAAE,CACvF,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,IAAA,oBAAM,EAAC,IAAA,uBAAS,EAAC,MAAM,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;gBACxC,MAAM,IAAI,KAAK,CACb,6CAA6C;oBAC3C,GAAG,IAAA,0BAAY,EAAC,IAAA,uBAAS,EAAC,MAAM,CAAC,CAAC,OAAO,IAAA,0BAAY,EAAC,OAAO,CAAC,EAAE,CACnE,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,yBAAW,EAAC,MAAM,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE;;;GAGG;AACH,SAAgB,OAAO,CAAC,CAAU,EAAE,CAAU;IAC5C,OAAO,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,SAAS,UAAU,CACjB,CAAU,EACV,CAAU,EACV,IAAyB,EACzB,IAAyB,EACzB,KAAa;IAEb,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,CAAiD,CAAC;YAC7D,0DAA0D;YAC1D,gDAAgD;YAChD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACzC,OAAO,EAAE,KAAK,EAAE,IAAI,IAAA,oBAAM,EAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;YAC9C,CAAC;YACD,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACzC,OAAO,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,IAAI,IAAA,oBAAM,EAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;YACvD,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,EAAE,GAAG,CAAmD,CAAC;YAC/D,OAAO,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,IAAI,IAAA,oBAAM,EAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACvD,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,CAAgD,CAAC;YAC5D,OAAO,CACL,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAC3F,CAAC;QACJ,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,CAAsE,CAAC;YAClF,IAAI,CAAC,IAAA,oBAAM,EAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrD,4DAA4D;YAC5D,iDAAiD;YACjD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5B,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC1B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3B,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;AACH,CAAC;AASD;;;GAGG;AACH,SAAgB,QAAQ,CAAC,CAAU,EAAE,MAAkB,EAAE;IACvD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,OAAO,GAAG,CAAC,IAAa,EAAE,KAA2B,EAAQ,EAAE;QACnE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,KAAK,CAAC,CAAC,CAAC;gBACX,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvC,IAAI,SAAS,KAAK,SAAS,IAAI,IAAA,oBAAM,EAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC;oBAAE,OAAO;gBACpE,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,KAAK,IAAA,0BAAY,EAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,OAAO;gBAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC/C,OAAO;YACT,CAAC;YACD,KAAK,OAAO;gBACV,OAAO;YACT,KAAK,MAAM;gBACT,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBACxB,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBACzB,OAAO;YACT,KAAK,KAAK,CAAC,CAAC,CAAC;gBACX,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC5B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;gBACrC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBACzB,OAAO;YACT,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IACF,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACtB,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAC,IAAY,EAAE,EAAW,EAAE,IAAa;IACjE,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,IAAA,oBAAM,EAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;AAC3E,CAAC;AAED,4EAA4E;AAC5E,SAAgB,SAAS,CAAC,IAAY,EAAE,SAAsB;IAC5D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;QAAE,CAAC,EAAE,CAAC;IAC1C,OAAO,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;AACxB,CAAC;AAED,+DAA+D;AAE/D;;;GAGG;AACH,SAAgB,SAAS,CAAC,IAAY,EAAE,EAAW,EAAE,KAAc,EAAE,IAAa;IAChF,IAAI,CAAC,IAAA,oBAAM,EAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CACb,kCAAkC,IAAA,0BAAY,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,cAAc,IAAA,0BAAY,EAAC,EAAE,CAAC,EAAE,CAC9F,CAAC;IACJ,CAAC;IACD,OAAO,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;AACxE,CAAC;AAED,SAAS,YAAY,CACnB,IAAY,EACZ,EAAW,EACX,KAAc,EACd,IAAa,EACb,SAAsB;IAEtB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK;YACR,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAA,oBAAM,EAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC9D,OAAO,IAAI,CAAC;QACd,KAAK,OAAO;YACV,OAAO,IAAI,CAAC;QACd,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,EAAE,EAAE,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC;gBACrD,GAAG,EAAE,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC;aACxD,CAAC;QACJ,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,0DAA0D;YAC1D,+CAA+C;YAC/C,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,IAAA,oBAAM,EAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YACnE,iEAAiE;YACjE,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,SAAS,EAAE,GAAG,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBAC1F,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;gBAC/C,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjF,OAAO;oBACL,IAAI,EAAE,KAAK;oBACX,KAAK,EAAE,KAAK;oBACZ,SAAS,EAAE,IAAI,CAAC,SAAS;oBACzB,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,SAAS,CAAC;iBAC5D,CAAC;YACJ,CAAC;YACD,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC;aAC1D,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED,uEAAuE;AACvE,SAAS,cAAc,CAAC,IAAY,EAAE,EAAW,EAAE,EAAU,EAAE,IAAa;IAC1E,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK;YACR,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAA,oBAAM,EAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;gBAChD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;YACpD,CAAC;YACD,OAAO,IAAI,CAAC;QACd,KAAK,OAAO;YACV,OAAO,IAAI,CAAC;QACd,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,EAAE,EAAE,cAAc,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBACzC,GAAG,EAAE,cAAc,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC;aAC5C,CAAC;QACJ,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI,IAAA,oBAAM,EAAC,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YACnE,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,IAAI,EAAE,cAAc,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC;aAC9C,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CAAC,IAAa,EAAE,MAAmB,IAAI,GAAG,EAAE;IACrE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK;YACR,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,OAAO,GAAG,CAAC;QACb,KAAK,OAAO;YACV,OAAO,GAAG,CAAC;QACb,KAAK,MAAM;YACT,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACjC,OAAO,kBAAkB,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC3C,KAAK,KAAK;YACR,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,OAAO,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC9C,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE,SAAgB,cAAc,CAAC,KAA8B,EAAE,IAAa;IAC1E,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAA,uBAAS,EAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7E,KAAK,OAAO;YACV,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAA,uBAAS,EAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/E,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,EAAE,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;gBAClC,GAAG,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC;aACrC,CAAC;QACJ,KAAK,KAAK;YACR,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,SAAS,EAAE,IAAA,uBAAS,EAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC;gBAC3C,IAAI,EAAE,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC;aACvC,CAAC;IACN,CAAC;AACH,CAAC;AAED,+DAA+D;AAE/D,SAAgB,YAAY,CAAC,CAAU;IACrC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,OAAO;YACV,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,MAAM;YACT,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAC1D,KAAK,KAAK;YACR,OAAO,KAAK,CAAC,CAAC,KAAK,IAAI,IAAA,0BAAY,EAAC,CAAC,CAAC,SAAS,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;IACjF,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE;;;GAGG;AACH,SAAgB,OAAO,CAAC,EAAW;IACjC,OAAO,IAAA,eAAO,EAAC,GAAG,EAAE,IAAA,mBAAK,EAAC,EAAE,EAAE,IAAA,mBAAK,EAAC,EAAE,EAAE,oBAAM,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAED,sEAAsE;AACtE,SAAgB,IAAI,CAAC,CAAU,EAAE,CAAU;IACzC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,IAAI,CAAC,IAAA,oBAAM,EAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAA,0BAAY,EAAC,EAAE,CAAC,OAAO,IAAA,0BAAY,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAChG,CAAC;IACD,OAAO,IAAA,cAAM,EAAC,IAAA,cAAM,EAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED,+DAA+D;AAC/D,SAAgB,MAAM,CAAC,CAAU;IAC/B,sBAAsB;IACtB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IACnC,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IACtC,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IACrB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IAC5D,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;AAC3B,CAAC;AAED,uDAAuD;AACvD,SAAgB,IAAI,CAAC,CAAU;IAC7B,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;AAC5B,CAAC;AAED,sFAAsF;AACtF,SAAgB,KAAK,CAAC,CAAU;IAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IACjC,6DAA6D;IAC7D,OAAO,IAAA,oBAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAM,CAAC,CAAC;AAC1C,CAAC"}

package/dist/profiles/hol/type-system.d.ts

@@ -0,0 +1,38 @@
+import { HOLType } from './types';
+/** Construye una variable de tipo `α`, `β`, etc. */
+export declare const tvar: (name: string) => HOLType;
+/** Constante de tipo: `bool`, `ind`, ... */
+export declare const tconst: (name: string) => HOLType;
+/** Aplicación de constructor de tipo (e.g. `fun`, `prod`). */
+export declare const tapp: (fn: string, args: HOLType[]) => HOLType;
+export declare const TyBool: HOLType;
+export declare const TyInd: HOLType;
+/** `A → B` */
+export declare const funTy: (from: HOLType, to: HOLType) => HOLType;
+/** Empareja `A → B → ...` de derecha a izquierda. */
+export declare const funTyN: (...types: HOLType[]) => HOLType;
+/**
+ * Igualdad estructural de tipos. Las variables de tipo se
+ * comparan por nombre (no hay α-renaming sobre tipos en HOL).
+ */
+export declare function typeEq(a: HOLType, b: HOLType): boolean;
+/** Devuelve true si `t` es una flecha `A → B`. */
+export declare function isFunType(t: HOLType): t is {
+    kind: 'tapp';
+    fn: 'fun';
+    args: HOLType[];
+};
+/** Dominio de una flecha. Lanza si el tipo no es flecha. */
+export declare function funDomain(t: HOLType): HOLType;
+/** Codominio de una flecha. Lanza si el tipo no es flecha. */
+export declare function funCodomain(t: HOLType): HOLType;
+/** Pretty-printer; útil para mensajes de error y tests. */
+export declare function typeToString(t: HOLType): string;
+/**
+ * Sustitución sobre variables de tipo. Aplica `subst` a `t`
+ * de manera capture-free (los tipos no tienen binders).
+ */
+export declare function substType(subst: Record<string, HOLType>, t: HOLType): HOLType;
+/** Recolecta los nombres de las variables de tipo libres en `t`. */
+export declare function freeTypeVars(t: HOLType, out?: Set<string>): Set<string>;
+//# sourceMappingURL=type-system.d.ts.map

package/dist/profiles/hol/type-system.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-system.d.ts","sourceRoot":"","sources":["../../../src/profiles/hol/type-system.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAElC,oDAAoD;AACpD,eAAO,MAAM,IAAI,GAAI,MAAM,MAAM,KAAG,OAAmC,CAAC;AAExE,4CAA4C;AAC5C,eAAO,MAAM,MAAM,GAAI,MAAM,MAAM,KAAG,OAAqC,CAAC;AAE5E,8DAA8D;AAC9D,eAAO,MAAM,IAAI,GAAI,IAAI,MAAM,EAAE,MAAM,OAAO,EAAE,KAAG,OAAuC,CAAC;AAI3F,eAAO,MAAM,MAAM,EAAE,OAAwB,CAAC;AAC9C,eAAO,MAAM,KAAK,EAAE,OAAuB,CAAC;AAE5C,cAAc;AACd,eAAO,MAAM,KAAK,GAAI,MAAM,OAAO,EAAE,IAAI,OAAO,KAAG,OAAkC,CAAC;AAEtF,qDAAqD;AACrD,eAAO,MAAM,MAAM,GAAI,GAAG,OAAO,OAAO,EAAE,KAAG,OAY5C,CAAC;AAEF;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAiBtD;AAED,kDAAkD;AAClD,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,OAAO,EAAE,CAAA;CAAE,CAEvF;AAED,4DAA4D;AAC5D,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAK7C;AAED,8DAA8D;AAC9D,wBAAgB,WAAW,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAK/C;AAED,2DAA2D;AAC3D,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,CAY/C;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAY7E;AAED,oEAAoE;AACpE,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,GAAE,GAAG,CAAC,MAAM,CAAa,GAAG,GAAG,CAAC,MAAM,CAAC,CAWlF"}

package/dist/profiles/hol/type-system.js

@@ -0,0 +1,133 @@
+"use strict";
+// ============================================================
+// HOL — Sistema de tipos
+// ============================================================
+//
+// Tipos simples polimórficos: variables de tipo, constantes y
+// aplicaciones. La función `fun(A, B)` representa el flecha.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.funTyN = exports.funTy = exports.TyInd = exports.TyBool = exports.tapp = exports.tconst = exports.tvar = void 0;
+exports.typeEq = typeEq;
+exports.isFunType = isFunType;
+exports.funDomain = funDomain;
+exports.funCodomain = funCodomain;
+exports.typeToString = typeToString;
+exports.substType = substType;
+exports.freeTypeVars = freeTypeVars;
+/** Construye una variable de tipo `α`, `β`, etc. */
+const tvar = (name) => ({ kind: 'tvar', name });
+exports.tvar = tvar;
+/** Constante de tipo: `bool`, `ind`, ... */
+const tconst = (name) => ({ kind: 'tconst', name });
+exports.tconst = tconst;
+/** Aplicación de constructor de tipo (e.g. `fun`, `prod`). */
+const tapp = (fn, args) => ({ kind: 'tapp', fn, args });
+exports.tapp = tapp;
+// Constantes predefinidas ------------------------------------
+exports.TyBool = (0, exports.tconst)('bool');
+exports.TyInd = (0, exports.tconst)('ind');
+/** `A → B` */
+const funTy = (from, to) => (0, exports.tapp)('fun', [from, to]);
+exports.funTy = funTy;
+/** Empareja `A → B → ...` de derecha a izquierda. */
+const funTyN = (...types) => {
+    if (types.length === 0) {
+        throw new Error('funTyN: necesita al menos un tipo');
+    }
+    if (types.length === 1) {
+        return types[0];
+    }
+    let acc = types[types.length - 1];
+    for (let i = types.length - 2; i >= 0; i--) {
+        acc = (0, exports.funTy)(types[i], acc);
+    }
+    return acc;
+};
+exports.funTyN = funTyN;
+/**
+ * Igualdad estructural de tipos. Las variables de tipo se
+ * comparan por nombre (no hay α-renaming sobre tipos en HOL).
+ */
+function typeEq(a, b) {
+    if (a.kind !== b.kind)
+        return false;
+    switch (a.kind) {
+        case 'tvar':
+            return a.name === b.name;
+        case 'tconst':
+            return a.name === b.name;
+        case 'tapp': {
+            const bb = b;
+            if (a.fn !== bb.fn)
+                return false;
+            if (a.args.length !== bb.args.length)
+                return false;
+            for (let i = 0; i < a.args.length; i++) {
+                if (!typeEq(a.args[i], bb.args[i]))
+                    return false;
+            }
+            return true;
+        }
+    }
+}
+/** Devuelve true si `t` es una flecha `A → B`. */
+function isFunType(t) {
+    return t.kind === 'tapp' && t.fn === 'fun' && t.args.length === 2;
+}
+/** Dominio de una flecha. Lanza si el tipo no es flecha. */
+function funDomain(t) {
+    if (!isFunType(t)) {
+        throw new Error(`funDomain: el tipo no es una función: ${typeToString(t)}`);
+    }
+    return t.args[0];
+}
+/** Codominio de una flecha. Lanza si el tipo no es flecha. */
+function funCodomain(t) {
+    if (!isFunType(t)) {
+        throw new Error(`funCodomain: el tipo no es una función: ${typeToString(t)}`);
+    }
+    return t.args[1];
+}
+/** Pretty-printer; útil para mensajes de error y tests. */
+function typeToString(t) {
+    switch (t.kind) {
+        case 'tvar':
+            return t.name;
+        case 'tconst':
+            return t.name;
+        case 'tapp':
+            if (t.fn === 'fun' && t.args.length === 2) {
+                return `(${typeToString(t.args[0])} → ${typeToString(t.args[1])})`;
+            }
+            return `${t.fn}(${t.args.map(typeToString).join(', ')})`;
+    }
+}
+/**
+ * Sustitución sobre variables de tipo. Aplica `subst` a `t`
+ * de manera capture-free (los tipos no tienen binders).
+ */
+function substType(subst, t) {
+    switch (t.kind) {
+        case 'tvar':
+            return Object.prototype.hasOwnProperty.call(subst, t.name) ? subst[t.name] : t;
+        case 'tconst':
+            return t;
+        case 'tapp':
+            return (0, exports.tapp)(t.fn, t.args.map((a) => substType(subst, a)));
+    }
+}
+/** Recolecta los nombres de las variables de tipo libres en `t`. */
+function freeTypeVars(t, out = new Set()) {
+    switch (t.kind) {
+        case 'tvar':
+            out.add(t.name);
+            return out;
+        case 'tconst':
+            return out;
+        case 'tapp':
+            for (const a of t.args)
+                freeTypeVars(a, out);
+            return out;
+    }
+}
+//# sourceMappingURL=type-system.js.map

package/dist/profiles/hol/type-system.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-system.js","sourceRoot":"","sources":["../../../src/profiles/hol/type-system.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yBAAyB;AACzB,+DAA+D;AAC/D,EAAE;AACF,8DAA8D;AAC9D,6DAA6D;;;AAwC7D,wBAiBC;AAGD,8BAEC;AAGD,8BAKC;AAGD,kCAKC;AAGD,oCAYC;AAMD,8BAYC;AAGD,oCAWC;AAzHD,oDAAoD;AAC7C,MAAM,IAAI,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAA3D,QAAA,IAAI,QAAuD;AAExE,4CAA4C;AACrC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;AAA/D,QAAA,MAAM,UAAyD;AAE5E,8DAA8D;AACvD,MAAM,IAAI,GAAG,CAAC,EAAU,EAAE,IAAe,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;AAA9E,QAAA,IAAI,QAA0E;AAE3F,+DAA+D;AAElD,QAAA,MAAM,GAAY,IAAA,cAAM,EAAC,MAAM,CAAC,CAAC;AACjC,QAAA,KAAK,GAAY,IAAA,cAAM,EAAC,KAAK,CAAC,CAAC;AAE5C,cAAc;AACP,MAAM,KAAK,GAAG,CAAC,IAAa,EAAE,EAAW,EAAW,EAAE,CAAC,IAAA,YAAI,EAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;AAAzE,QAAA,KAAK,SAAoE;AAEtF,qDAAqD;AAC9C,MAAM,MAAM,GAAG,CAAC,GAAG,KAAgB,EAAW,EAAE;IACrD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,GAAG,GAAY,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,GAAG,GAAG,IAAA,aAAK,EAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAZW,QAAA,MAAM,UAYjB;AAEF;;;GAGG;AACH,SAAgB,MAAM,CAAC,CAAU,EAAE,CAAU;IAC3C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAM,CAAoC,CAAC,IAAI,CAAC;QAC/D,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC,IAAI,KAAM,CAAsC,CAAC,IAAI,CAAC;QACjE,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,CAAkD,CAAC;YAC9D,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;gBAAE,OAAO,KAAK,CAAC;YACjC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;YACnD,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED,kDAAkD;AAClD,SAAgB,SAAS,CAAC,CAAU;IAClC,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;AACpE,CAAC;AAED,4DAA4D;AAC5D,SAAgB,SAAS,CAAC,CAAU;IAClC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAClB,MAAM,IAAI,KAAK,CAAC,yCAAyC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC9E,CAAC;IACD,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnB,CAAC;AAED,8DAA8D;AAC9D,SAAgB,WAAW,CAAC,CAAU;IACpC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAClB,MAAM,IAAI,KAAK,CAAC,2CAA2C,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnB,CAAC;AAED,2DAA2D;AAC3D,SAAgB,YAAY,CAAC,CAAU;IACrC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,MAAM;YACT,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1C,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YACrE,CAAC;YACD,OAAO,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IAC7D,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,SAAS,CAAC,KAA8B,EAAE,CAAU;IAClE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC;QACX,KAAK,MAAM;YACT,OAAO,IAAA,YAAI,EACT,CAAC,CAAC,EAAE,EACJ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CACvC,CAAC;IACN,CAAC;AACH,CAAC;AAED,oEAAoE;AACpE,SAAgB,YAAY,CAAC,CAAU,EAAE,MAAmB,IAAI,GAAG,EAAE;IACnE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO,GAAG,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,GAAG,CAAC;QACb,KAAK,MAAM;YACT,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;gBAAE,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC7C,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC"}

package/dist/profiles/hol/types.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Tipos en HOL: variables de tipo, constantes (`bool`, `ind`,
+ * ...) y aplicaciones de constructores de tipo (`fun(α, β)`,
+ * `prod(α, β)`, ...).
+ */
+export type HOLType = {
+    kind: 'tvar';
+    name: string;
+} | {
+    kind: 'tconst';
+    name: string;
+} | {
+    kind: 'tapp';
+    fn: string;
+    args: HOLType[];
+};
+/**
+ * Términos HOL. Polimorfismo via `tvar` en los tipos de
+ * variables/constantes. `comb` es aplicación; `abs` es
+ * λ-abstracción con el tipo del parámetro registrado.
+ */
+export type HOLTerm = {
+    kind: 'var';
+    name: string;
+    type: HOLType;
+} | {
+    kind: 'const';
+    name: string;
+    type: HOLType;
+} | {
+    kind: 'comb';
+    fn: HOLTerm;
+    arg: HOLTerm;
+} | {
+    kind: 'abs';
+    param: string;
+    paramType: HOLType;
+    body: HOLTerm;
+};
+/**
+ * Secuente abstracto. Las hipótesis son una multiset modelada
+ * como array; la igualdad se chequea por α-equivalencia.
+ */
+export interface HOLSequent {
+    hyps: HOLTerm[];
+    concl: HOLTerm;
+}
+/**
+ * Teorema HOL: hipótesis + conclusión + huella de la regla
+ * usada y los teoremas-premisa. Solo se obtiene aplicando una
+ * regla primitiva — no hay constructor público.
+ */
+export interface HOLTheorem {
+    readonly hyps: HOLTerm[];
+    readonly concl: HOLTerm;
+    readonly rule: string;
+    readonly derived?: HOLTheorem[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/profiles/hol/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/hol/types.ts"],"names":[],"mappings":"AAwBA;;;;GAIG;AACH,MAAM,MAAM,OAAO,GACf;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAChC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,OAAO,EAAE,CAAA;CAAE,CAAC;AAElD;;;;GAIG;AACH,MAAM,MAAM,OAAO,GACf;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAC5C;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAC9C;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GAC3C;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,CAAC;AAEtE;;;GAGG;AACH,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,OAAO,EAAE,CAAC;IAChB,KAAK,EAAE,OAAO,CAAC;CAChB;AAED;;;;GAIG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,CAAC,EAAE,UAAU,EAAE,CAAC;CACjC"}

package/dist/profiles/hol/types.js

@@ -0,0 +1,26 @@
+"use strict";
+// ============================================================
+// Higher-Order Logic (HOL Light style) — Tipos
+// ============================================================
+//
+// HOL = lógica de tipos simples + λ-binding + igualdad primitiva.
+// Inspirado en HOL Light / Isabelle/HOL: un núcleo deductivo
+// minimal con 10 reglas primitivas; el resto del aparato lógico
+// (conectivas, cuantificadores) se define en términos de la
+// igualdad polimórfica.
+//
+// Convención de typing: `bool` es el tipo de proposiciones,
+// `ind` el tipo de individuos. Los tipos compuestos se forman
+// con `fun(A, B)` que corresponde a `A → B`. Las variables de
+// tipo (`tvar`) permiten polimorfismo paramétrico (let-style).
+//
+// Convención de terms (siguiendo HOL Light):
+//   - `var`  variable libre de un tipo
+//   - `const` constante (igualdad, conectivas definidas, etc.)
+//   - `comb f x` aplicación de funciones (f x)
+//   - `abs x.t` λ-abstracción
+//
+// Nota sobre nombres de variables: dos `var` con el mismo
+// nombre PERO distinto tipo son variables distintas (HOL Light).
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/profiles/hol/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/profiles/hol/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+CAA+C;AAC/C,+DAA+D;AAC/D,EAAE;AACF,kEAAkE;AAClE,6DAA6D;AAC7D,gEAAgE;AAChE,4DAA4D;AAC5D,wBAAwB;AACxB,EAAE;AACF,4DAA4D;AAC5D,8DAA8D;AAC9D,8DAA8D;AAC9D,+DAA+D;AAC/D,EAAE;AACF,6CAA6C;AAC7C,uCAAuC;AACvC,+DAA+D;AAC/D,+CAA+C;AAC/C,8BAA8B;AAC9B,EAAE;AACF,0DAA0D;AAC1D,iEAAiE"}