@stevenvo780/st-lang 4.5.1 → 4.5.2

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

@@ -0,0 +1,46 @@
+import { HOLTerm, HOLType } from './types';
+/** Constante `T : bool`. */
+export declare const True: HOLTerm;
+/** Constante `⊥ : bool`. */
+export declare const Bottom: HOLTerm;
+/** Constante `∧ : bool → bool → bool`. */
+export declare const And: HOLTerm;
+/** Constante `∨ : bool → bool → bool`. */
+export declare const Or: HOLTerm;
+/** Constante `¬ : bool → bool`. */
+export declare const Not: HOLTerm;
+/** Constante `⇒ : bool → bool → bool`. */
+export declare const Implies: HOLTerm;
+/**
+ * Constante `∀ : (α → bool) → bool`. Polimórfica vía la tvar `α`.
+ * El consumidor debe usar `mkForall` para instanciar al tipo
+ * correcto antes de aplicar.
+ */
+export declare const Forall: HOLTerm;
+/**
+ * Constante `∃ : (α → bool) → bool`. Igual que `∀`, polimórfica.
+ */
+export declare const Exists: HOLTerm;
+/** Construye `p ∧ q`. */
+export declare function mkAnd(p: HOLTerm, q: HOLTerm): HOLTerm;
+/** Construye `p ∨ q`. */
+export declare function mkOr(p: HOLTerm, q: HOLTerm): HOLTerm;
+/** Construye `¬ p`. */
+export declare function mkNot(p: HOLTerm): HOLTerm;
+/** Construye `p ⇒ q`. */
+export declare function mkImplies(p: HOLTerm, q: HOLTerm): HOLTerm;
+/**
+ * Construye `∀x:α. body`. Internamente: `(∀ : (α→bool)→bool) (λx:α. body)`
+ * con el `∀` instanciado al tipo correcto.
+ */
+export declare function mkForall(param: string, paramType: HOLType, body: HOLTerm): HOLTerm;
+/**
+ * Construye `∃x:α. body`. Análogo a `mkForall`.
+ */
+export declare function mkExists(param: string, paramType: HOLType, body: HOLTerm): HOLTerm;
+/**
+ * Validador: lanza si `t` no tiene tipo `bool`. Útil para checks
+ * externos antes de pasarle a `assume` o construir conectivas.
+ */
+export declare function assertBool(t: HOLTerm): void;
+//# sourceMappingURL=connectives.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"connectives.d.ts","sourceRoot":"","sources":["../../../src/profiles/hol/connectives.ts"],"names":[],"mappings":"AAqBA,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAM3C,4BAA4B;AAC5B,eAAO,MAAM,IAAI,EAAE,OAA8B,CAAC;AAElD,4BAA4B;AAC5B,eAAO,MAAM,MAAM,EAAE,OAA8B,CAAC;AAEpD,0CAA0C;AAC1C,eAAO,MAAM,GAAG,EAAE,OAA4D,CAAC;AAE/E,0CAA0C;AAC1C,eAAO,MAAM,EAAE,EAAE,OAA4D,CAAC;AAE9E,mCAAmC;AACnC,eAAO,MAAM,GAAG,EAAE,OAA6C,CAAC;AAEhE,0CAA0C;AAC1C,eAAO,MAAM,OAAO,EAAE,OAA4D,CAAC;AAEnF;;;;GAIG;AACH,eAAO,MAAM,MAAM,EAAE,OAA+D,CAAC;AAErF;;GAEG;AACH,eAAO,MAAM,MAAM,EAAE,OAA+D,CAAC;AAIrF,yBAAyB;AACzB,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAErD;AAED,yBAAyB;AACzB,wBAAgB,IAAI,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAEpD;AAED,uBAAuB;AACvB,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAEzC;AAED,yBAAyB;AACzB,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAEzD;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAMlF;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAKlF;AAID;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,OAAO,GAAG,IAAI,CAK3C"}

package/dist/profiles/hol/connectives.js

@@ -0,0 +1,104 @@
+"use strict";
+// ============================================================
+// HOL — Conectivas y cuantificadores definidos
+// ============================================================
+//
+// Siguiendo HOL Light, todo se define a partir de la igualdad
+// primitiva (`=`) y λ-binding. Cada conectiva es un `const`
+// con un tipo polimórfico fijo; las definiciones internas
+// (qué λ-término representa) se documentan pero el núcleo no
+// las usa directamente — son referencias para constructores
+// ergonómicos.
+//
+// Definiciones canónicas:
+//   T            = (λp:bool. p) = (λp:bool. p)
+//   ∧ p q        = (λf. f p q) = (λf. f T T)
+//   ⇒ p q        = (p ∧ q) = p
+//   ∀ (P : α→bool) = P = (λx:α. T)
+//   ∃ (P : α→bool) = ∀ q. (∀ x. P x ⇒ q) ⇒ q
+//   ∨ p q        = ∀ r. (p ⇒ r) ⇒ (q ⇒ r) ⇒ r
+//   ⊥            = ∀ p:bool. p
+//   ¬ p          = p ⇒ ⊥
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Exists = exports.Forall = exports.Implies = exports.Not = exports.Or = exports.And = exports.Bottom = exports.True = void 0;
+exports.mkAnd = mkAnd;
+exports.mkOr = mkOr;
+exports.mkNot = mkNot;
+exports.mkImplies = mkImplies;
+exports.mkForall = mkForall;
+exports.mkExists = mkExists;
+exports.assertBool = assertBool;
+const type_system_1 = require("./type-system");
+const term_1 = require("./term");
+// Constantes -------------------------------------------------
+/** Constante `T : bool`. */
+exports.True = (0, term_1.mkConst)('T', type_system_1.TyBool);
+/** Constante `⊥ : bool`. */
+exports.Bottom = (0, term_1.mkConst)('F', type_system_1.TyBool);
+/** Constante `∧ : bool → bool → bool`. */
+exports.And = (0, term_1.mkConst)('∧', (0, type_system_1.funTy)(type_system_1.TyBool, (0, type_system_1.funTy)(type_system_1.TyBool, type_system_1.TyBool)));
+/** Constante `∨ : bool → bool → bool`. */
+exports.Or = (0, term_1.mkConst)('∨', (0, type_system_1.funTy)(type_system_1.TyBool, (0, type_system_1.funTy)(type_system_1.TyBool, type_system_1.TyBool)));
+/** Constante `¬ : bool → bool`. */
+exports.Not = (0, term_1.mkConst)('¬', (0, type_system_1.funTy)(type_system_1.TyBool, type_system_1.TyBool));
+/** Constante `⇒ : bool → bool → bool`. */
+exports.Implies = (0, term_1.mkConst)('⇒', (0, type_system_1.funTy)(type_system_1.TyBool, (0, type_system_1.funTy)(type_system_1.TyBool, type_system_1.TyBool)));
+/**
+ * Constante `∀ : (α → bool) → bool`. Polimórfica vía la tvar `α`.
+ * El consumidor debe usar `mkForall` para instanciar al tipo
+ * correcto antes de aplicar.
+ */
+exports.Forall = (0, term_1.mkConst)('∀', (0, type_system_1.funTy)((0, type_system_1.funTy)((0, type_system_1.tvar)('α'), type_system_1.TyBool), type_system_1.TyBool));
+/**
+ * Constante `∃ : (α → bool) → bool`. Igual que `∀`, polimórfica.
+ */
+exports.Exists = (0, term_1.mkConst)('∃', (0, type_system_1.funTy)((0, type_system_1.funTy)((0, type_system_1.tvar)('α'), type_system_1.TyBool), type_system_1.TyBool));
+// Constructores ergonómicos ---------------------------------
+/** Construye `p ∧ q`. */
+function mkAnd(p, q) {
+    return (0, term_1.mkComb)((0, term_1.mkComb)(exports.And, p), q);
+}
+/** Construye `p ∨ q`. */
+function mkOr(p, q) {
+    return (0, term_1.mkComb)((0, term_1.mkComb)(exports.Or, p), q);
+}
+/** Construye `¬ p`. */
+function mkNot(p) {
+    return (0, term_1.mkComb)(exports.Not, p);
+}
+/** Construye `p ⇒ q`. */
+function mkImplies(p, q) {
+    return (0, term_1.mkComb)((0, term_1.mkComb)(exports.Implies, p), q);
+}
+/**
+ * Construye `∀x:α. body`. Internamente: `(∀ : (α→bool)→bool) (λx:α. body)`
+ * con el `∀` instanciado al tipo correcto.
+ */
+function mkForall(param, paramType, body) {
+    // Instancia el ∀ al tipo del parámetro.
+    const forallTy = (0, type_system_1.funTy)((0, type_system_1.funTy)(paramType, type_system_1.TyBool), type_system_1.TyBool);
+    const forallInst = (0, term_1.mkConst)('∀', forallTy);
+    const lambda = { kind: 'abs', param, paramType, body };
+    return (0, term_1.mkComb)(forallInst, lambda);
+}
+/**
+ * Construye `∃x:α. body`. Análogo a `mkForall`.
+ */
+function mkExists(param, paramType, body) {
+    const existsTy = (0, type_system_1.funTy)((0, type_system_1.funTy)(paramType, type_system_1.TyBool), type_system_1.TyBool);
+    const existsInst = (0, term_1.mkConst)('∃', existsTy);
+    const lambda = { kind: 'abs', param, paramType, body };
+    return (0, term_1.mkComb)(existsInst, lambda);
+}
+// Helpers para asegurar que un término es bool ---------------
+/**
+ * Validador: lanza si `t` no tiene tipo `bool`. Útil para checks
+ * externos antes de pasarle a `assume` o construir conectivas.
+ */
+function assertBool(t) {
+    const ty = (0, term_1.typeOf)(t);
+    if (ty.kind !== 'tconst' || ty.name !== 'bool') {
+        throw new Error(`Se esperaba bool, recibido ${ty.kind === 'tconst' ? ty.name : ty.kind}`);
+    }
+}
+//# sourceMappingURL=connectives.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"connectives.js","sourceRoot":"","sources":["../../../src/profiles/hol/connectives.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+CAA+C;AAC/C,+DAA+D;AAC/D,EAAE;AACF,8DAA8D;AAC9D,4DAA4D;AAC5D,0DAA0D;AAC1D,6DAA6D;AAC7D,4DAA4D;AAC5D,eAAe;AACf,EAAE;AACF,0BAA0B;AAC1B,+CAA+C;AAC/C,6CAA6C;AAC7C,+BAA+B;AAC/B,mCAAmC;AACnC,6CAA6C;AAC7C,8CAA8C;AAC9C,+BAA+B;AAC/B,yBAAyB;;;AAyCzB,sBAEC;AAGD,oBAEC;AAGD,sBAEC;AAGD,8BAEC;AAMD,4BAMC;AAKD,4BAKC;AAQD,gCAKC;AA1FD,+CAAoD;AACpD,iCAAiD;AAEjD,+DAA+D;AAE/D,4BAA4B;AACf,QAAA,IAAI,GAAY,IAAA,cAAO,EAAC,GAAG,EAAE,oBAAM,CAAC,CAAC;AAElD,4BAA4B;AACf,QAAA,MAAM,GAAY,IAAA,cAAO,EAAC,GAAG,EAAE,oBAAM,CAAC,CAAC;AAEpD,0CAA0C;AAC7B,QAAA,GAAG,GAAY,IAAA,cAAO,EAAC,GAAG,EAAE,IAAA,mBAAK,EAAC,oBAAM,EAAE,IAAA,mBAAK,EAAC,oBAAM,EAAE,oBAAM,CAAC,CAAC,CAAC,CAAC;AAE/E,0CAA0C;AAC7B,QAAA,EAAE,GAAY,IAAA,cAAO,EAAC,GAAG,EAAE,IAAA,mBAAK,EAAC,oBAAM,EAAE,IAAA,mBAAK,EAAC,oBAAM,EAAE,oBAAM,CAAC,CAAC,CAAC,CAAC;AAE9E,mCAAmC;AACtB,QAAA,GAAG,GAAY,IAAA,cAAO,EAAC,GAAG,EAAE,IAAA,mBAAK,EAAC,oBAAM,EAAE,oBAAM,CAAC,CAAC,CAAC;AAEhE,0CAA0C;AAC7B,QAAA,OAAO,GAAY,IAAA,cAAO,EAAC,GAAG,EAAE,IAAA,mBAAK,EAAC,oBAAM,EAAE,IAAA,mBAAK,EAAC,oBAAM,EAAE,oBAAM,CAAC,CAAC,CAAC,CAAC;AAEnF;;;;GAIG;AACU,QAAA,MAAM,GAAY,IAAA,cAAO,EAAC,GAAG,EAAE,IAAA,mBAAK,EAAC,IAAA,mBAAK,EAAC,IAAA,kBAAI,EAAC,GAAG,CAAC,EAAE,oBAAM,CAAC,EAAE,oBAAM,CAAC,CAAC,CAAC;AAErF;;GAEG;AACU,QAAA,MAAM,GAAY,IAAA,cAAO,EAAC,GAAG,EAAE,IAAA,mBAAK,EAAC,IAAA,mBAAK,EAAC,IAAA,kBAAI,EAAC,GAAG,CAAC,EAAE,oBAAM,CAAC,EAAE,oBAAM,CAAC,CAAC,CAAC;AAErF,8DAA8D;AAE9D,yBAAyB;AACzB,SAAgB,KAAK,CAAC,CAAU,EAAE,CAAU;IAC1C,OAAO,IAAA,aAAM,EAAC,IAAA,aAAM,EAAC,WAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,yBAAyB;AACzB,SAAgB,IAAI,CAAC,CAAU,EAAE,CAAU;IACzC,OAAO,IAAA,aAAM,EAAC,IAAA,aAAM,EAAC,UAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,uBAAuB;AACvB,SAAgB,KAAK,CAAC,CAAU;IAC9B,OAAO,IAAA,aAAM,EAAC,WAAG,EAAE,CAAC,CAAC,CAAC;AACxB,CAAC;AAED,yBAAyB;AACzB,SAAgB,SAAS,CAAC,CAAU,EAAE,CAAU;IAC9C,OAAO,IAAA,aAAM,EAAC,IAAA,aAAM,EAAC,eAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACvC,CAAC;AAED;;;GAGG;AACH,SAAgB,QAAQ,CAAC,KAAa,EAAE,SAAkB,EAAE,IAAa;IACvE,wCAAwC;IACxC,MAAM,QAAQ,GAAG,IAAA,mBAAK,EAAC,IAAA,mBAAK,EAAC,SAAS,EAAE,oBAAM,CAAC,EAAE,oBAAM,CAAC,CAAC;IACzD,MAAM,UAAU,GAAG,IAAA,cAAO,EAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAY,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IAChE,OAAO,IAAA,aAAM,EAAC,UAAU,EAAE,MAAM,CAAC,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,SAAgB,QAAQ,CAAC,KAAa,EAAE,SAAkB,EAAE,IAAa;IACvE,MAAM,QAAQ,GAAG,IAAA,mBAAK,EAAC,IAAA,mBAAK,EAAC,SAAS,EAAE,oBAAM,CAAC,EAAE,oBAAM,CAAC,CAAC;IACzD,MAAM,UAAU,GAAG,IAAA,cAAO,EAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAY,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IAChE,OAAO,IAAA,aAAM,EAAC,UAAU,EAAE,MAAM,CAAC,CAAC;AACpC,CAAC;AAED,+DAA+D;AAE/D;;;GAGG;AACH,SAAgB,UAAU,CAAC,CAAU;IACnC,MAAM,EAAE,GAAG,IAAA,aAAM,EAAC,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC/C,MAAM,IAAI,KAAK,CAAC,8BAA8B,EAAE,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5F,CAAC;AACH,CAAC"}

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

@@ -0,0 +1,7 @@
+export type { HOLType, HOLTerm, HOLTheorem, HOLSequent } from './types';
+export { tvar, tconst, tapp, TyBool, TyInd, funTy, funTyN, typeEq, isFunType, funDomain, funCodomain, typeToString, substType, freeTypeVars, } from './type-system';
+export { mkVar, mkConst, mkAbs, typeOf, alphaEq, freeVars, occursFree, freshName, substTerm, instTypeInTerm, termToString, eqConst, mkEq, destEq, isEq, isIff, } from './term';
+export { mkComb as mkCombTerm } from './term';
+export { refl, trans, mkComb, abs, beta, assume, eqMp, deductAntisymRule, instType, inst, instTyped, } from './rules';
+export { True, Bottom, And, Or, Not, Implies, Forall, Exists, mkAnd, mkOr, mkNot, mkImplies, mkForall, mkExists, assertBool, } from './connectives';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/profiles/hol/index.ts"],"names":[],"mappings":"AAIA,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAGxE,OAAO,EACL,IAAI,EACJ,MAAM,EACN,IAAI,EACJ,MAAM,EACN,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,SAAS,EACT,SAAS,EACT,WAAW,EACX,YAAY,EACZ,SAAS,EACT,YAAY,GACb,MAAM,eAAe,CAAC;AAGvB,OAAO,EACL,KAAK,EACL,OAAO,EACP,KAAK,EACL,MAAM,EACN,OAAO,EACP,QAAQ,EACR,UAAU,EACV,SAAS,EACT,SAAS,EACT,cAAc,EACd,YAAY,EACZ,OAAO,EACP,IAAI,EACJ,MAAM,EACN,IAAI,EACJ,KAAK,GACN,MAAM,QAAQ,CAAC;AAKhB,OAAO,EAAE,MAAM,IAAI,UAAU,EAAE,MAAM,QAAQ,CAAC;AAG9C,OAAO,EACL,IAAI,EACJ,KAAK,EACL,MAAM,EACN,GAAG,EACH,IAAI,EACJ,MAAM,EACN,IAAI,EACJ,iBAAiB,EACjB,QAAQ,EACR,IAAI,EACJ,SAAS,GACV,MAAM,SAAS,CAAC;AAGjB,OAAO,EACL,IAAI,EACJ,MAAM,EACN,GAAG,EACH,EAAE,EACF,GAAG,EACH,OAAO,EACP,MAAM,EACN,MAAM,EACN,KAAK,EACL,IAAI,EACJ,KAAK,EACL,SAAS,EACT,QAAQ,EACR,QAAQ,EACR,UAAU,GACX,MAAM,eAAe,CAAC"}

package/dist/profiles/hol/index.js

@@ -0,0 +1,77 @@
+"use strict";
+// ============================================================
+// Higher-Order Logic (HOL Light style) — Entrada pública
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Exists = exports.Forall = exports.Implies = exports.Not = exports.Or = exports.And = exports.Bottom = exports.True = exports.instTyped = exports.inst = exports.instType = exports.deductAntisymRule = exports.eqMp = exports.assume = exports.beta = exports.abs = exports.mkComb = exports.trans = exports.refl = exports.mkCombTerm = exports.isIff = exports.isEq = exports.destEq = exports.mkEq = exports.eqConst = exports.termToString = exports.instTypeInTerm = exports.substTerm = exports.freshName = exports.occursFree = exports.freeVars = exports.alphaEq = exports.typeOf = exports.mkAbs = exports.mkConst = exports.mkVar = exports.freeTypeVars = exports.substType = exports.typeToString = exports.funCodomain = exports.funDomain = exports.isFunType = exports.typeEq = exports.funTyN = exports.funTy = exports.TyInd = exports.TyBool = exports.tapp = exports.tconst = exports.tvar = void 0;
+exports.assertBool = exports.mkExists = exports.mkForall = exports.mkImplies = exports.mkNot = exports.mkOr = exports.mkAnd = void 0;
+// Sistema de tipos
+var type_system_1 = require("./type-system");
+Object.defineProperty(exports, "tvar", { enumerable: true, get: function () { return type_system_1.tvar; } });
+Object.defineProperty(exports, "tconst", { enumerable: true, get: function () { return type_system_1.tconst; } });
+Object.defineProperty(exports, "tapp", { enumerable: true, get: function () { return type_system_1.tapp; } });
+Object.defineProperty(exports, "TyBool", { enumerable: true, get: function () { return type_system_1.TyBool; } });
+Object.defineProperty(exports, "TyInd", { enumerable: true, get: function () { return type_system_1.TyInd; } });
+Object.defineProperty(exports, "funTy", { enumerable: true, get: function () { return type_system_1.funTy; } });
+Object.defineProperty(exports, "funTyN", { enumerable: true, get: function () { return type_system_1.funTyN; } });
+Object.defineProperty(exports, "typeEq", { enumerable: true, get: function () { return type_system_1.typeEq; } });
+Object.defineProperty(exports, "isFunType", { enumerable: true, get: function () { return type_system_1.isFunType; } });
+Object.defineProperty(exports, "funDomain", { enumerable: true, get: function () { return type_system_1.funDomain; } });
+Object.defineProperty(exports, "funCodomain", { enumerable: true, get: function () { return type_system_1.funCodomain; } });
+Object.defineProperty(exports, "typeToString", { enumerable: true, get: function () { return type_system_1.typeToString; } });
+Object.defineProperty(exports, "substType", { enumerable: true, get: function () { return type_system_1.substType; } });
+Object.defineProperty(exports, "freeTypeVars", { enumerable: true, get: function () { return type_system_1.freeTypeVars; } });
+// Términos
+var term_1 = require("./term");
+Object.defineProperty(exports, "mkVar", { enumerable: true, get: function () { return term_1.mkVar; } });
+Object.defineProperty(exports, "mkConst", { enumerable: true, get: function () { return term_1.mkConst; } });
+Object.defineProperty(exports, "mkAbs", { enumerable: true, get: function () { return term_1.mkAbs; } });
+Object.defineProperty(exports, "typeOf", { enumerable: true, get: function () { return term_1.typeOf; } });
+Object.defineProperty(exports, "alphaEq", { enumerable: true, get: function () { return term_1.alphaEq; } });
+Object.defineProperty(exports, "freeVars", { enumerable: true, get: function () { return term_1.freeVars; } });
+Object.defineProperty(exports, "occursFree", { enumerable: true, get: function () { return term_1.occursFree; } });
+Object.defineProperty(exports, "freshName", { enumerable: true, get: function () { return term_1.freshName; } });
+Object.defineProperty(exports, "substTerm", { enumerable: true, get: function () { return term_1.substTerm; } });
+Object.defineProperty(exports, "instTypeInTerm", { enumerable: true, get: function () { return term_1.instTypeInTerm; } });
+Object.defineProperty(exports, "termToString", { enumerable: true, get: function () { return term_1.termToString; } });
+Object.defineProperty(exports, "eqConst", { enumerable: true, get: function () { return term_1.eqConst; } });
+Object.defineProperty(exports, "mkEq", { enumerable: true, get: function () { return term_1.mkEq; } });
+Object.defineProperty(exports, "destEq", { enumerable: true, get: function () { return term_1.destEq; } });
+Object.defineProperty(exports, "isEq", { enumerable: true, get: function () { return term_1.isEq; } });
+Object.defineProperty(exports, "isIff", { enumerable: true, get: function () { return term_1.isIff; } });
+// mkComb se expone desde rules.ts (que reexporta) para que el
+// "mkComb regla" (sobre teoremas) sea el público, mientras que
+// el constructor de términos vive como `mkCombTerm`.
+var term_2 = require("./term");
+Object.defineProperty(exports, "mkCombTerm", { enumerable: true, get: function () { return term_2.mkComb; } });
+// Reglas primitivas
+var rules_1 = require("./rules");
+Object.defineProperty(exports, "refl", { enumerable: true, get: function () { return rules_1.refl; } });
+Object.defineProperty(exports, "trans", { enumerable: true, get: function () { return rules_1.trans; } });
+Object.defineProperty(exports, "mkComb", { enumerable: true, get: function () { return rules_1.mkComb; } });
+Object.defineProperty(exports, "abs", { enumerable: true, get: function () { return rules_1.abs; } });
+Object.defineProperty(exports, "beta", { enumerable: true, get: function () { return rules_1.beta; } });
+Object.defineProperty(exports, "assume", { enumerable: true, get: function () { return rules_1.assume; } });
+Object.defineProperty(exports, "eqMp", { enumerable: true, get: function () { return rules_1.eqMp; } });
+Object.defineProperty(exports, "deductAntisymRule", { enumerable: true, get: function () { return rules_1.deductAntisymRule; } });
+Object.defineProperty(exports, "instType", { enumerable: true, get: function () { return rules_1.instType; } });
+Object.defineProperty(exports, "inst", { enumerable: true, get: function () { return rules_1.inst; } });
+Object.defineProperty(exports, "instTyped", { enumerable: true, get: function () { return rules_1.instTyped; } });
+// Conectivas y cuantificadores definidos
+var connectives_1 = require("./connectives");
+Object.defineProperty(exports, "True", { enumerable: true, get: function () { return connectives_1.True; } });
+Object.defineProperty(exports, "Bottom", { enumerable: true, get: function () { return connectives_1.Bottom; } });
+Object.defineProperty(exports, "And", { enumerable: true, get: function () { return connectives_1.And; } });
+Object.defineProperty(exports, "Or", { enumerable: true, get: function () { return connectives_1.Or; } });
+Object.defineProperty(exports, "Not", { enumerable: true, get: function () { return connectives_1.Not; } });
+Object.defineProperty(exports, "Implies", { enumerable: true, get: function () { return connectives_1.Implies; } });
+Object.defineProperty(exports, "Forall", { enumerable: true, get: function () { return connectives_1.Forall; } });
+Object.defineProperty(exports, "Exists", { enumerable: true, get: function () { return connectives_1.Exists; } });
+Object.defineProperty(exports, "mkAnd", { enumerable: true, get: function () { return connectives_1.mkAnd; } });
+Object.defineProperty(exports, "mkOr", { enumerable: true, get: function () { return connectives_1.mkOr; } });
+Object.defineProperty(exports, "mkNot", { enumerable: true, get: function () { return connectives_1.mkNot; } });
+Object.defineProperty(exports, "mkImplies", { enumerable: true, get: function () { return connectives_1.mkImplies; } });
+Object.defineProperty(exports, "mkForall", { enumerable: true, get: function () { return connectives_1.mkForall; } });
+Object.defineProperty(exports, "mkExists", { enumerable: true, get: function () { return connectives_1.mkExists; } });
+Object.defineProperty(exports, "assertBool", { enumerable: true, get: function () { return connectives_1.assertBool; } });
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/hol/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yDAAyD;AACzD,+DAA+D;;;;AAI/D,mBAAmB;AACnB,6CAeuB;AAdrB,mGAAA,IAAI,OAAA;AACJ,qGAAA,MAAM,OAAA;AACN,mGAAA,IAAI,OAAA;AACJ,qGAAA,MAAM,OAAA;AACN,oGAAA,KAAK,OAAA;AACL,oGAAA,KAAK,OAAA;AACL,qGAAA,MAAM,OAAA;AACN,qGAAA,MAAM,OAAA;AACN,wGAAA,SAAS,OAAA;AACT,wGAAA,SAAS,OAAA;AACT,0GAAA,WAAW,OAAA;AACX,2GAAA,YAAY,OAAA;AACZ,wGAAA,SAAS,OAAA;AACT,2GAAA,YAAY,OAAA;AAGd,WAAW;AACX,+BAiBgB;AAhBd,6FAAA,KAAK,OAAA;AACL,+FAAA,OAAO,OAAA;AACP,6FAAA,KAAK,OAAA;AACL,8FAAA,MAAM,OAAA;AACN,+FAAA,OAAO,OAAA;AACP,gGAAA,QAAQ,OAAA;AACR,kGAAA,UAAU,OAAA;AACV,iGAAA,SAAS,OAAA;AACT,iGAAA,SAAS,OAAA;AACT,sGAAA,cAAc,OAAA;AACd,oGAAA,YAAY,OAAA;AACZ,+FAAA,OAAO,OAAA;AACP,4FAAA,IAAI,OAAA;AACJ,8FAAA,MAAM,OAAA;AACN,4FAAA,IAAI,OAAA;AACJ,6FAAA,KAAK,OAAA;AAGP,8DAA8D;AAC9D,+DAA+D;AAC/D,qDAAqD;AACrD,+BAA8C;AAArC,kGAAA,MAAM,OAAc;AAE7B,oBAAoB;AACpB,iCAYiB;AAXf,6FAAA,IAAI,OAAA;AACJ,8FAAA,KAAK,OAAA;AACL,+FAAA,MAAM,OAAA;AACN,4FAAA,GAAG,OAAA;AACH,6FAAA,IAAI,OAAA;AACJ,+FAAA,MAAM,OAAA;AACN,6FAAA,IAAI,OAAA;AACJ,0GAAA,iBAAiB,OAAA;AACjB,iGAAA,QAAQ,OAAA;AACR,6FAAA,IAAI,OAAA;AACJ,kGAAA,SAAS,OAAA;AAGX,yCAAyC;AACzC,6CAgBuB;AAfrB,mGAAA,IAAI,OAAA;AACJ,qGAAA,MAAM,OAAA;AACN,kGAAA,GAAG,OAAA;AACH,iGAAA,EAAE,OAAA;AACF,kGAAA,GAAG,OAAA;AACH,sGAAA,OAAO,OAAA;AACP,qGAAA,MAAM,OAAA;AACN,qGAAA,MAAM,OAAA;AACN,oGAAA,KAAK,OAAA;AACL,mGAAA,IAAI,OAAA;AACJ,oGAAA,KAAK,OAAA;AACL,wGAAA,SAAS,OAAA;AACT,uGAAA,QAAQ,OAAA;AACR,uGAAA,QAAQ,OAAA;AACR,yGAAA,UAAU,OAAA"}

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

@@ -0,0 +1,31 @@
+import { HOLTerm, HOLTheorem, HOLType } from './types';
+import { funTy } from './type-system';
+import { freeVars } from './term';
+export declare function refl(t: HOLTerm): HOLTheorem;
+export declare function trans(thm1: HOLTheorem, thm2: HOLTheorem): HOLTheorem;
+export declare function mkCombRule(thm1: HOLTheorem, thm2: HOLTheorem): HOLTheorem;
+export declare function abs(v: HOLTerm, thm1: HOLTheorem): HOLTheorem;
+export declare function beta(t: HOLTerm): HOLTheorem;
+export declare function assume(p: HOLTerm): HOLTheorem;
+export declare function eqMp(thm1: HOLTheorem, thm2: HOLTheorem): HOLTheorem;
+export declare function deductAntisymRule(thm1: HOLTheorem, thm2: HOLTheorem): HOLTheorem;
+export declare function instType(subst: Record<string, HOLType>, thm1: HOLTheorem): HOLTheorem;
+interface InstEntry {
+    name: string;
+    type: HOLType;
+    value: HOLTerm;
+}
+/**
+ * Sustituye variables libres en `thm1` según `subst`. El mapa
+ * usa keys `name::typeString` para distinguir variables con
+ * mismo nombre y distinto tipo.
+ */
+export declare function inst(subst: Record<string, HOLTerm>, thm1: HOLTheorem): HOLTheorem;
+/**
+ * Variante explícita: cada entrada especifica `{ name, type, value }`.
+ * Necesaria si dos variables comparten nombre pero distinto tipo.
+ */
+export declare function instTyped(entries: InstEntry[], thm1: HOLTheorem): HOLTheorem;
+export { mkCombRule as mkComb };
+export { freeVars, funTy };
+//# sourceMappingURL=rules.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rules.d.ts","sourceRoot":"","sources":["../../../src/profiles/hol/rules.ts"],"names":[],"mappings":"AAoBA,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AACvD,OAAO,EAAU,KAAK,EAAmC,MAAM,eAAe,CAAC;AAC/E,OAAO,EAGL,QAAQ,EAUT,MAAM,QAAQ,CAAC;AAiChB,wBAAgB,IAAI,CAAC,CAAC,EAAE,OAAO,GAAG,UAAU,CAI3C;AAID,wBAAgB,KAAK,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,GAAG,UAAU,CAepE;AAID,wBAAgB,UAAU,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,GAAG,UAAU,CAoBzE;AAID,wBAAgB,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,GAAG,UAAU,CAmB5D;AAMD,wBAAgB,IAAI,CAAC,CAAC,EAAE,OAAO,GAAG,UAAU,CAc3C;AAID,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,GAAG,UAAU,CAM7C;AAID,wBAAgB,IAAI,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,GAAG,UAAU,CAcnE;AAQD,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,GAAG,UAAU,CAWhF;AAID,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,GAAG,UAAU,CAUrF;AAID,UAAU,SAAS;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,CAAC;IACd,KAAK,EAAE,OAAO,CAAC;CAChB;AAED;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,GAAG,UAAU,CAajF;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,GAAG,UAAU,CA8C5E;AAID,OAAO,EAAE,UAAU,IAAI,MAAM,EAAE,CAAC;AAGhC,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC"}

package/dist/profiles/hol/rules.js

@@ -0,0 +1,258 @@
+"use strict";
+// ============================================================
+// HOL — Reglas primitivas de inferencia
+// ============================================================
+//
+// Núcleo deductivo estilo HOL Light. 10 reglas primitivas:
+//
+//   REFL                 : |- t = t
+//   TRANS                : |- a = b, |- b = c  ⇒  |- a = c
+//   MK_COMB              : |- f = g, |- x = y  ⇒  |- f x = g y
+//   ABS                  : |- s = t            ⇒  |- (λv.s) = (λv.t)
+//   BETA                 : |- (λv.t) v = t
+//   ASSUME(p)            : p |- p
+//   EQ_MP                : |- p ↔ q, |- p     ⇒  |- q
+//   DEDUCT_ANTISYM_RULE  : A |- p, B |- q      ⇒  (A\{q}) ∪ (B\{p}) |- p ↔ q
+//   INST_TYPE            : sustitución de tipos
+//   INST                 : sustitución de términos en variables libres
+//
+// Las hipótesis son una multiset modelada como array; al unir
+// hipótesis deduplicamos por α-equivalencia.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.funTy = exports.freeVars = void 0;
+exports.refl = refl;
+exports.trans = trans;
+exports.mkCombRule = mkCombRule;
+exports.mkComb = mkCombRule;
+exports.abs = abs;
+exports.beta = beta;
+exports.assume = assume;
+exports.eqMp = eqMp;
+exports.deductAntisymRule = deductAntisymRule;
+exports.instType = instType;
+exports.inst = inst;
+exports.instTyped = instTyped;
+const type_system_1 = require("./type-system");
+Object.defineProperty(exports, "funTy", { enumerable: true, get: function () { return type_system_1.funTy; } });
+const term_1 = require("./term");
+Object.defineProperty(exports, "freeVars", { enumerable: true, get: function () { return term_1.freeVars; } });
+// Helpers ----------------------------------------------------
+function unionHyps(a, b) {
+    const out = [...a];
+    for (const h of b) {
+        if (!out.some((existing) => (0, term_1.alphaEq)(existing, h))) {
+            out.push(h);
+        }
+    }
+    return out;
+}
+function removeHyp(hyps, target) {
+    let removed = false;
+    const out = [];
+    for (const h of hyps) {
+        if (!removed && (0, term_1.alphaEq)(h, target)) {
+            removed = true;
+            continue;
+        }
+        out.push(h);
+    }
+    return out;
+}
+function thm(rule, hyps, concl, derived) {
+    return Object.freeze({ rule, hyps, concl, derived });
+}
+// REFL : |- t = t ---------------------------------------------
+function refl(t) {
+    // typeOf valida bien-formación.
+    (0, term_1.typeOf)(t);
+    return thm('REFL', [], (0, term_1.mkEq)(t, t));
+}
+// TRANS : |- a = b, |- b = c -> |- a = c ----------------------
+function trans(thm1, thm2) {
+    const eq1 = (0, term_1.destEq)(thm1.concl);
+    const eq2 = (0, term_1.destEq)(thm2.concl);
+    if (eq1 === null) {
+        throw new Error(`TRANS: la primera premisa no es una igualdad: ${(0, term_1.termToString)(thm1.concl)}`);
+    }
+    if (eq2 === null) {
+        throw new Error(`TRANS: la segunda premisa no es una igualdad: ${(0, term_1.termToString)(thm2.concl)}`);
+    }
+    if (!(0, term_1.alphaEq)(eq1[1], eq2[0])) {
+        throw new Error(`TRANS: las premisas no encajan: ${(0, term_1.termToString)(eq1[1])} ≠ ${(0, term_1.termToString)(eq2[0])}`);
+    }
+    return thm('TRANS', unionHyps(thm1.hyps, thm2.hyps), (0, term_1.mkEq)(eq1[0], eq2[1]), [thm1, thm2]);
+}
+// MK_COMB : |- f = g, |- x = y -> |- f x = g y ----------------
+function mkCombRule(thm1, thm2) {
+    const fg = (0, term_1.destEq)(thm1.concl);
+    const xy = (0, term_1.destEq)(thm2.concl);
+    if (fg === null) {
+        throw new Error(`MK_COMB: la primera premisa no es igualdad: ${(0, term_1.termToString)(thm1.concl)}`);
+    }
+    if (xy === null) {
+        throw new Error(`MK_COMB: la segunda premisa no es igualdad: ${(0, term_1.termToString)(thm2.concl)}`);
+    }
+    // mkComb validará compatibilidad de tipos; lo hacemos en orden para
+    // dar un mensaje claro si fuesen incompatibles.
+    const fxType = (0, term_1.typeOf)(fg[0]);
+    if (!(0, type_system_1.isFunType)(fxType)) {
+        throw new Error(`MK_COMB: lado izquierdo no es función: ${(0, term_1.termToString)(fg[0])} : ${(0, type_system_1.typeToString)(fxType)}`);
+    }
+    const left = (0, term_1.mkComb)(fg[0], xy[0]);
+    const right = (0, term_1.mkComb)(fg[1], xy[1]);
+    return thm('MK_COMB', unionHyps(thm1.hyps, thm2.hyps), (0, term_1.mkEq)(left, right), [thm1, thm2]);
+}
+// ABS : |- s = t -> |- (λv.s) = (λv.t) ------------------------
+function abs(v, thm1) {
+    if (v.kind !== 'var') {
+        throw new Error(`ABS: el binder debe ser una variable, no ${v.kind}`);
+    }
+    const eq = (0, term_1.destEq)(thm1.concl);
+    if (eq === null) {
+        throw new Error(`ABS: la premisa no es una igualdad: ${(0, term_1.termToString)(thm1.concl)}`);
+    }
+    // La variable abstraida no puede aparecer libre en las hipótesis.
+    for (const h of thm1.hyps) {
+        if ((0, term_1.occursFree)(v.name, v.type, h)) {
+            throw new Error(`ABS: la variable ${v.name} aparece libre en una hipótesis: ${(0, term_1.termToString)(h)}`);
+        }
+    }
+    const lhs = (0, term_1.mkAbs)(v.name, v.type, eq[0]);
+    const rhs = (0, term_1.mkAbs)(v.name, v.type, eq[1]);
+    return thm('ABS', thm1.hyps.slice(), (0, term_1.mkEq)(lhs, rhs), [thm1]);
+}
+// BETA : |- (λv.t) v = t --------------------------------------
+// HOL Light original: BETA solo acepta el término exacto `(λx.t) x`.
+// Para usar β a forma `(λx.t) y` se compone con INST.
+function beta(t) {
+    if (t.kind !== 'comb' || t.fn.kind !== 'abs') {
+        throw new Error(`BETA: necesita una aplicación de λ: ${(0, term_1.termToString)(t)}`);
+    }
+    const lambda = t.fn;
+    const arg = t.arg;
+    if (arg.kind !== 'var' || arg.name !== lambda.param || !(0, type_system_1.typeEq)(arg.type, lambda.paramType)) {
+        throw new Error(`BETA: el argumento debe ser exactamente el binder; usa INST para argumentos arbitrarios. ` +
+            `Recibido: ${(0, term_1.termToString)(arg)}`);
+    }
+    // Resultado: (λv.body) v = body
+    return thm('BETA', [], (0, term_1.mkEq)(t, lambda.body), []);
+}
+// ASSUME(p) : p |- p ------------------------------------------
+function assume(p) {
+    const ty = (0, term_1.typeOf)(p);
+    if (!(0, type_system_1.typeEq)(ty, type_system_1.TyBool)) {
+        throw new Error(`ASSUME: la hipótesis debe ser de tipo bool, tiene tipo ${(0, type_system_1.typeToString)(ty)}`);
+    }
+    return thm('ASSUME', [p], p);
+}
+// EQ_MP : |- p = q (bool), |- p -> |- q -----------------------
+function eqMp(thm1, thm2) {
+    const eq = (0, term_1.destEq)(thm1.concl);
+    if (eq === null) {
+        throw new Error(`EQ_MP: la primera premisa no es igualdad: ${(0, term_1.termToString)(thm1.concl)}`);
+    }
+    if (!(0, type_system_1.typeEq)((0, term_1.typeOf)(eq[0]), type_system_1.TyBool)) {
+        throw new Error(`EQ_MP: la igualdad no es entre booleanos: ${(0, term_1.termToString)(thm1.concl)}`);
+    }
+    if (!(0, term_1.alphaEq)(eq[0], thm2.concl)) {
+        throw new Error(`EQ_MP: la segunda premisa no es α-igual al LHS: ${(0, term_1.termToString)(thm2.concl)} vs ${(0, term_1.termToString)(eq[0])}`);
+    }
+    return thm('EQ_MP', unionHyps(thm1.hyps, thm2.hyps), eq[1], [thm1, thm2]);
+}
+// DEDUCT_ANTISYM_RULE -----------------------------------------
+//   A |- p, B |- q -> (A - {q}) ∪ (B - {p}) |- p ↔ q
+//
+// Equivalente: deriva la bi-implicación a partir de dos
+// teoremas que se "implican" via descarga de hipótesis.
+function deductAntisymRule(thm1, thm2) {
+    if (!(0, type_system_1.typeEq)((0, term_1.typeOf)(thm1.concl), type_system_1.TyBool)) {
+        throw new Error(`DEDUCT_ANTISYM_RULE: thm1 no es bool: ${(0, term_1.termToString)(thm1.concl)}`);
+    }
+    if (!(0, type_system_1.typeEq)((0, term_1.typeOf)(thm2.concl), type_system_1.TyBool)) {
+        throw new Error(`DEDUCT_ANTISYM_RULE: thm2 no es bool: ${(0, term_1.termToString)(thm2.concl)}`);
+    }
+    const p = thm1.concl;
+    const q = thm2.concl;
+    const hyps = unionHyps(removeHyp(thm1.hyps, q), removeHyp(thm2.hyps, p));
+    return thm('DEDUCT_ANTISYM_RULE', hyps, (0, term_1.mkEq)(p, q), [thm1, thm2]);
+}
+// INST_TYPE : sustitución de variables de tipo ----------------
+function instType(subst, thm1) {
+    const newHyps = thm1.hyps.map((h) => (0, term_1.instTypeInTerm)(subst, h));
+    const newConcl = (0, term_1.instTypeInTerm)(subst, thm1.concl);
+    // Deduplicamos hipótesis tras la sustitución porque pueden
+    // colapsar (e.g. P[α] y P[β] con α↦β).
+    const dedup = [];
+    for (const h of newHyps) {
+        if (!dedup.some((existing) => (0, term_1.alphaEq)(existing, h)))
+            dedup.push(h);
+    }
+    return thm('INST_TYPE', dedup, newConcl, [thm1]);
+}
+/**
+ * Sustituye variables libres en `thm1` según `subst`. El mapa
+ * usa keys `name::typeString` para distinguir variables con
+ * mismo nombre y distinto tipo.
+ */
+function inst(subst, thm1) {
+    // El usuario provee `Record<string, HOLTerm>`: las keys son
+    // los nombres de variables. Inferimos el tipo de la variable
+    // a partir del valor (debe coincidir con el de la ocurrencia
+    // libre). Si una variable libre tiene mismo nombre pero
+    // distintos tipos en distintos lugares, esta API es ambigua;
+    // recomendamos pasar `instTyped` (más abajo) en ese caso.
+    const entries = Object.entries(subst).map(([name, value]) => ({
+        name,
+        type: (0, term_1.typeOf)(value),
+        value,
+    }));
+    return instTyped(entries, thm1);
+}
+/**
+ * Variante explícita: cada entrada especifica `{ name, type, value }`.
+ * Necesaria si dos variables comparten nombre pero distinto tipo.
+ */
+function instTyped(entries, thm1) {
+    // Validación: cada `value` debe tener el tipo declarado.
+    for (const e of entries) {
+        if (!(0, type_system_1.typeEq)((0, term_1.typeOf)(e.value), e.type)) {
+            throw new Error(`INST: tipo del valor no coincide con la variable ${e.name}: ` +
+                `${(0, type_system_1.typeToString)((0, term_1.typeOf)(e.value))} vs ${(0, type_system_1.typeToString)(e.type)}`);
+        }
+    }
+    // Sustituimos en paralelo: para evitar interferencia con
+    // sustituciones encadenadas, primero renombramos las variables
+    // a fresh y luego instanciamos. En la práctica, HOL Light hace
+    // una sustitución secuencial usando un mapeo y reescribiendo
+    // los binders cuando hace falta para evitar captura. Nuestra
+    // `substTerm` ya es capture-free, así que sustituimos en orden,
+    // pero con un truco para "paralelismo": renombramos cada var
+    // a un nombre intermedio único antes de aplicar los valores.
+    const intermediate = entries.map((e, i) => ({
+        name: e.name,
+        type: e.type,
+        intermediateName: `__inst${i}__`,
+        value: e.value,
+    }));
+    let curHyps = thm1.hyps.slice();
+    let curConcl = thm1.concl;
+    // Fase 1: renombrar var(name, type) → var(intermediateName, type)
+    for (const e of intermediate) {
+        const intermediateVar = (0, term_1.mkVar)(e.intermediateName, e.type);
+        curHyps = curHyps.map((h) => (0, term_1.substTerm)(e.name, e.type, intermediateVar, h));
+        curConcl = (0, term_1.substTerm)(e.name, e.type, intermediateVar, curConcl);
+    }
+    // Fase 2: reemplazar intermediateName → value real.
+    for (const e of intermediate) {
+        curHyps = curHyps.map((h) => (0, term_1.substTerm)(e.intermediateName, e.type, e.value, h));
+        curConcl = (0, term_1.substTerm)(e.intermediateName, e.type, e.value, curConcl);
+    }
+    // Dedup tras sustitución.
+    const dedup = [];
+    for (const h of curHyps) {
+        if (!dedup.some((existing) => (0, term_1.alphaEq)(existing, h)))
+            dedup.push(h);
+    }
+    return thm('INST', dedup, curConcl, [thm1]);
+}
+//# sourceMappingURL=rules.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rules.js","sourceRoot":"","sources":["../../../src/profiles/hol/rules.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wCAAwC;AACxC,+DAA+D;AAC/D,EAAE;AACF,2DAA2D;AAC3D,EAAE;AACF,oCAAoC;AACpC,2DAA2D;AAC3D,+DAA+D;AAC/D,qEAAqE;AACrE,2CAA2C;AAC3C,kCAAkC;AAClC,sDAAsD;AACtD,6EAA6E;AAC7E,gDAAgD;AAChD,uEAAuE;AACvE,EAAE;AACF,8DAA8D;AAC9D,6CAA6C;;;AAkD7C,oBAIC;AAID,sBAeC;AAID,gCAoBC;AA4LsB,4BAAM;AAxL7B,kBAmBC;AAMD,oBAcC;AAID,wBAMC;AAID,oBAcC;AAQD,8CAWC;AAID,4BAUC;AAeD,oBAaC;AAMD,8BA8CC;AAtRD,+CAA+E;AA6R5D,sFA7RF,mBAAK,OA6RE;AA5RxB,iCAagB;AA+QP,yFAzRP,eAAQ,OAyRO;AA7QjB,+DAA+D;AAE/D,SAAS,SAAS,CAAC,CAAY,EAAE,CAAY;IAC3C,MAAM,GAAG,GAAc,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAA,cAAO,EAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAClD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAAC,IAAe,EAAE,MAAe;IACjD,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,OAAO,IAAI,IAAA,cAAO,EAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC;YACnC,OAAO,GAAG,IAAI,CAAC;YACf,SAAS;QACX,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,GAAG,CAAC,IAAY,EAAE,IAAe,EAAE,KAAc,EAAE,OAAsB;IAChF,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;AACvD,CAAC;AAED,gEAAgE;AAEhE,SAAgB,IAAI,CAAC,CAAU;IAC7B,gCAAgC;IAChC,IAAA,aAAM,EAAC,CAAC,CAAC,CAAC;IACV,OAAO,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,IAAA,WAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,gEAAgE;AAEhE,SAAgB,KAAK,CAAC,IAAgB,EAAE,IAAgB;IACtD,MAAM,GAAG,GAAG,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,iDAAiD,IAAA,mBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,iDAAiD,IAAA,mBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,IAAI,CAAC,IAAA,cAAO,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CACb,mCAAmC,IAAA,mBAAY,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,IAAA,mBAAY,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CACpF,CAAC;IACJ,CAAC;IACD,OAAO,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAA,WAAI,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAC3F,CAAC;AAED,gEAAgE;AAEhE,SAAgB,UAAU,CAAC,IAAgB,EAAE,IAAgB;IAC3D,MAAM,EAAE,GAAG,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,+CAA+C,IAAA,mBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC7F,CAAC;IACD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,+CAA+C,IAAA,mBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC7F,CAAC;IACD,oEAAoE;IACpE,gDAAgD;IAChD,MAAM,MAAM,GAAG,IAAA,aAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,CAAC,IAAA,uBAAS,EAAC,MAAM,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CACb,0CAA0C,IAAA,mBAAY,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAA,0BAAY,EAAC,MAAM,CAAC,EAAE,CAC1F,CAAC;IACJ,CAAC;IACD,MAAM,IAAI,GAAG,IAAA,aAAM,EAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,IAAA,aAAM,EAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,OAAO,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAA,WAAI,EAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAC1F,CAAC;AAED,gEAAgE;AAEhE,SAAgB,GAAG,CAAC,CAAU,EAAE,IAAgB;IAC9C,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACrB,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACxE,CAAC;IACD,MAAM,EAAE,GAAG,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,uCAAuC,IAAA,mBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACrF,CAAC;IACD,kEAAkE;IAClE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,IAAI,IAAA,iBAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CACb,oBAAoB,CAAC,CAAC,IAAI,oCAAoC,IAAA,mBAAY,EAAC,CAAC,CAAC,EAAE,CAChF,CAAC;QACJ,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAAG,IAAA,YAAK,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,IAAA,YAAK,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,OAAO,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,IAAA,WAAI,EAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED,gEAAgE;AAChE,qEAAqE;AACrE,sDAAsD;AAEtD,SAAgB,IAAI,CAAC,CAAU;IAC7B,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC7C,MAAM,IAAI,KAAK,CAAC,uCAAuC,IAAA,mBAAY,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5E,CAAC;IACD,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;IACpB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;IAClB,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,KAAK,IAAI,CAAC,IAAA,oBAAM,EAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;QAC3F,MAAM,IAAI,KAAK,CACb,2FAA2F;YACzF,aAAa,IAAA,mBAAY,EAAC,GAAG,CAAC,EAAE,CACnC,CAAC;IACJ,CAAC;IACD,gCAAgC;IAChC,OAAO,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,IAAA,WAAI,EAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;AACnD,CAAC;AAED,gEAAgE;AAEhE,SAAgB,MAAM,CAAC,CAAU;IAC/B,MAAM,EAAE,GAAG,IAAA,aAAM,EAAC,CAAC,CAAC,CAAC;IACrB,IAAI,CAAC,IAAA,oBAAM,EAAC,EAAE,EAAE,oBAAM,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,0DAA0D,IAAA,0BAAY,EAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAChG,CAAC;IACD,OAAO,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED,gEAAgE;AAEhE,SAAgB,IAAI,CAAC,IAAgB,EAAE,IAAgB;IACrD,MAAM,EAAE,GAAG,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,6CAA6C,IAAA,mBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC3F,CAAC;IACD,IAAI,CAAC,IAAA,oBAAM,EAAC,IAAA,aAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAM,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,KAAK,CAAC,6CAA6C,IAAA,mBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC3F,CAAC;IACD,IAAI,CAAC,IAAA,cAAO,EAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,KAAK,CACb,mDAAmD,IAAA,mBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,OAAO,IAAA,mBAAY,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CACxG,CAAC;IACJ,CAAC;IACD,OAAO,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED,gEAAgE;AAChE,qDAAqD;AACrD,EAAE;AACF,wDAAwD;AACxD,wDAAwD;AAExD,SAAgB,iBAAiB,CAAC,IAAgB,EAAE,IAAgB;IAClE,IAAI,CAAC,IAAA,oBAAM,EAAC,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,oBAAM,CAAC,EAAE,CAAC;QACxC,MAAM,IAAI,KAAK,CAAC,yCAAyC,IAAA,mBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACvF,CAAC;IACD,IAAI,CAAC,IAAA,oBAAM,EAAC,IAAA,aAAM,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,oBAAM,CAAC,EAAE,CAAC;QACxC,MAAM,IAAI,KAAK,CAAC,yCAAyC,IAAA,mBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACvF,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;IACrB,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACzE,OAAO,GAAG,CAAC,qBAAqB,EAAE,IAAI,EAAE,IAAA,WAAI,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AACpE,CAAC;AAED,gEAAgE;AAEhE,SAAgB,QAAQ,CAAC,KAA8B,EAAE,IAAgB;IACvE,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,qBAAc,EAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAM,QAAQ,GAAG,IAAA,qBAAc,EAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACnD,2DAA2D;IAC3D,uCAAuC;IACvC,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAA,cAAO,EAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,GAAG,CAAC,WAAW,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AACnD,CAAC;AAUD;;;;GAIG;AACH,SAAgB,IAAI,CAAC,KAA8B,EAAE,IAAgB;IACnE,4DAA4D;IAC5D,6DAA6D;IAC7D,6DAA6D;IAC7D,wDAAwD;IACxD,6DAA6D;IAC7D,0DAA0D;IAC1D,MAAM,OAAO,GAAgB,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QACzE,IAAI;QACJ,IAAI,EAAE,IAAA,aAAM,EAAC,KAAK,CAAC;QACnB,KAAK;KACN,CAAC,CAAC,CAAC;IACJ,OAAO,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,SAAgB,SAAS,CAAC,OAAoB,EAAE,IAAgB;IAC9D,yDAAyD;IACzD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,IAAA,oBAAM,EAAC,IAAA,aAAM,EAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CACb,oDAAoD,CAAC,CAAC,IAAI,IAAI;gBAC5D,GAAG,IAAA,0BAAY,EAAC,IAAA,aAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,IAAA,0BAAY,EAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAChE,CAAC;QACJ,CAAC;IACH,CAAC;IACD,yDAAyD;IACzD,+DAA+D;IAC/D,+DAA+D;IAC/D,6DAA6D;IAC7D,6DAA6D;IAC7D,gEAAgE;IAChE,6DAA6D;IAC7D,6DAA6D;IAC7D,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1C,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,gBAAgB,EAAE,SAAS,CAAC,IAAI;QAChC,KAAK,EAAE,CAAC,CAAC,KAAK;KACf,CAAC,CAAC,CAAC;IAEJ,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IAChC,IAAI,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;IAE1B,kEAAkE;IAClE,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,MAAM,eAAe,GAAG,IAAA,YAAK,EAAC,CAAC,CAAC,gBAAgB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1D,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,gBAAS,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5E,QAAQ,GAAG,IAAA,gBAAS,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,eAAe,EAAE,QAAQ,CAAC,CAAC;IAClE,CAAC;IACD,oDAAoD;IACpD,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7B,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,gBAAS,EAAC,CAAC,CAAC,gBAAgB,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QAChF,QAAQ,GAAG,IAAA,gBAAS,EAAC,CAAC,CAAC,gBAAgB,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IACtE,CAAC;IAED,0BAA0B;IAC1B,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAA,cAAO,EAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AAC9C,CAAC"}

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

@@ -0,0 +1,52 @@
+import { HOLTerm, HOLType } from './types';
+export declare const mkVar: (name: string, type: HOLType) => HOLTerm;
+export declare const mkConst: (name: string, type: HOLType) => HOLTerm;
+export declare const mkComb: (fn: HOLTerm, arg: HOLTerm) => HOLTerm;
+export declare const mkAbs: (param: string, paramType: HOLType, body: HOLTerm) => HOLTerm;
+/**
+ * Calcula el tipo de un término bien formado. Lanza si el
+ * término está mal tipado (combinación con dominios disjuntos).
+ */
+export declare function typeOf(t: HOLTerm): HOLType;
+/**
+ * Igualdad estructural módulo α-renaming. Implementación con
+ * dos mapas de profundidad (de Bruijn implícito sobre nombres).
+ */
+export declare function alphaEq(a: HOLTerm, b: HOLTerm): boolean;
+interface VarEntry {
+    name: string;
+    type: HOLType;
+}
+/**
+ * Devuelve las variables libres de `t` con su tipo. Una variable
+ * con mismo nombre pero distinto tipo aparece dos veces.
+ */
+export declare function freeVars(t: HOLTerm, out?: VarEntry[]): VarEntry[];
+/**
+ * Devuelve true si `name` aparece libre en `term` con tipo `ty`.
+ */
+export declare function occursFree(name: string, ty: HOLType, term: HOLTerm): boolean;
+/** Genera un nombre fresco respecto a un conjunto de nombres prohibidos. */
+export declare function freshName(base: string, forbidden: Set<string>): string;
+/**
+ * Sustituye [v := value] en `term`. Renombra binders si haría
+ * falta para evitar captura. `v` se identifica por nombre + tipo.
+ */
+export declare function substTerm(name: string, ty: HOLType, value: HOLTerm, term: HOLTerm): HOLTerm;
+export declare function instTypeInTerm(subst: Record<string, HOLType>, term: HOLTerm): HOLTerm;
+export declare function termToString(t: HOLTerm): string;
+/**
+ * Constructor de igualdad polimórfica `= : α → α → bool`.
+ * Devuelve la `const` `=` instanciada al tipo del término.
+ */
+export declare function eqConst(ty: HOLType): HOLTerm;
+/** Construye el término `l = r` (chequea que sus tipos coincidan). */
+export declare function mkEq(l: HOLTerm, r: HOLTerm): HOLTerm;
+/** Descompone `l = r` en `[l, r]` o null si no es igualdad. */
+export declare function destEq(t: HOLTerm): [HOLTerm, HOLTerm] | null;
+/** True si `t` es una igualdad de la forma `l = r`. */
+export declare function isEq(t: HOLTerm): boolean;
+/** True si `t` es una bi-implicación bool ↔ bool (sintácticamente `=` sobre bool). */
+export declare function isIff(t: HOLTerm): boolean;
+export {};
+//# sourceMappingURL=term.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"term.d.ts","sourceRoot":"","sources":["../../../src/profiles/hol/term.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAc3C,eAAO,MAAM,KAAK,GAAI,MAAM,MAAM,EAAE,MAAM,OAAO,KAAG,OAAwC,CAAC;AAE7F,eAAO,MAAM,OAAO,GAAI,MAAM,MAAM,EAAE,MAAM,OAAO,KAAG,OAA0C,CAAC;AAEjG,eAAO,MAAM,MAAM,GAAI,IAAI,OAAO,EAAE,KAAK,OAAO,KAAG,OAiBlD,CAAC;AAEF,eAAO,MAAM,KAAK,GAAI,OAAO,MAAM,EAAE,WAAW,OAAO,EAAE,MAAM,OAAO,KAAG,OAKvE,CAAC;AAIH;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAwB1C;AAID;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAEvD;AAmDD,UAAU,QAAQ;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,CAAC;CACf;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,GAAE,QAAQ,EAAO,GAAG,QAAQ,EAAE,CA6BrE;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAE5E;AAED,4EAA4E;AAC5E,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAKtE;AAID;;;GAGG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAO3F;AA6FD,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAoBrF;AAID,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,CAW/C;AAID;;;GAGG;AACH,wBAAgB,OAAO,CAAC,EAAE,EAAE,OAAO,GAAG,OAAO,CAE5C;AAED,sEAAsE;AACtE,wBAAgB,IAAI,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAMpD;AAED,+DAA+D;AAC/D,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,IAAI,CAO5D;AAED,uDAAuD;AACvD,wBAAgB,IAAI,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAExC;AAED,sFAAsF;AACtF,wBAAgB,KAAK,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAKzC"}