@stevenvo780/st-lang 4.12.0 → 4.13.0

package/dist/type-theory/lambda-cube/typecheck.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"typecheck.d.ts","sourceRoot":"","sources":["../../../src/type-theory/lambda-cube/typecheck.ts"],"names":[],"mappings":"AAkCA,OAAO,EACL,KAAK,QAAQ,EACb,KAAK,WAAW,EAMjB,MAAM,SAAS,CAAC;AACjB,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAI1C,MAAM,MAAM,UAAU,GAAG;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAC3C,MAAM,MAAM,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;AAEhD,wBAAgB,YAAY,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,IAAI,UAAU,CAE5D;AAWD;;;GAGG;AACH,wBAAgB,SAAS,CACvB,IAAI,EAAE,QAAQ,EACd,GAAG,GAAE,WAAuB,EAC5B,MAAM,GAAE,UAAuB,GAC9B,WAAW,CAoFb;AAED;;;GAGG;AACH,wBAAgB,SAAS,CACvB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,QAAQ,EAClB,GAAG,GAAE,WAAuB,EAC5B,MAAM,GAAE,UAAuB,GAC9B,OAAO,CAIT;AAED,0EAA0E;AAC1E,wBAAgB,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,WAAW,GAAG,OAAO,CAKvE"}

package/dist/type-theory/lambda-cube/typecheck.js

@@ -0,0 +1,168 @@
+"use strict";
+// ============================================================
+// Lambda Cube — Pure Type System type-checker
+// ============================================================
+//
+// Algoritmo bidireccional uniforme para los 8 vértices del cubo. El
+// sistema activo se pasa como parámetro y restringe qué Π / λ son
+// legales mediante sus reglas de formación.
+//
+// Reglas PTS (versión cubo de Barendregt):
+//
+//   AX:       ⊢ * : ◻
+//   VAR:      Γ, x:A ⊢ x : A                  (si A está bien formado)
+//   APP:      Γ ⊢ f : (Π x:A. B)
+//             Γ ⊢ a : A
+//             ───────────────────
+//             Γ ⊢ f a : B[a/x]
+//
+//   LAM:      Γ, x:A ⊢ b : B
+//             Γ ⊢ (Π x:A. B) : s                (well-formed)
+//             ───────────────────────────
+//             Γ ⊢ (λ x:A. b) : (Π x:A. B)
+//
+//   PI:       Γ ⊢ A : s1
+//             Γ, x:A ⊢ B : s2
+//             (s1, s2) ∈ R(system)
+//             ───────────────────────
+//             Γ ⊢ (Π x:A. B) : s2
+//
+//   CONV:     Γ ⊢ t : A,  A =βη B,  Γ ⊢ B : s
+//             ──────────────────────────────────
+//             Γ ⊢ t : B
+//
+// Sin η, sin universos jerárquicos.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isInferError = isInferError;
+exports.inferType = inferType;
+exports.checkType = checkType;
+exports.isClosedUnder = isClosedUnder;
+const types_1 = require("./types");
+const rules_1 = require("./rules");
+const normalize_1 = require("./normalize");
+function isInferError(r) {
+    return typeof r === 'object' && r !== null && 'error' in r && typeof r.error === 'string';
+}
+/** Whnf parcial: normaliza solo lo necesario para revelar el head. */
+function whnf(term, system) {
+    return (0, normalize_1.normalize)(term, system);
+}
+function getSort(term) {
+    return term.kind === 'sort' ? term.sort : undefined;
+}
+/**
+ * Infiere el tipo de `term` bajo `ctx` en el sistema dado. Devuelve
+ * el tipo, o `{ error }` si no es tipable.
+ */
+function inferType(term, ctx = new Map(), system = 'lambda-C') {
+    switch (term.kind) {
+        case 'sort': {
+            const axiom = (0, rules_1.axiomFor)(term.sort);
+            if (axiom === undefined) {
+                return { error: `sort '${term.sort}' no tiene axioma de tipado` };
+            }
+            return (0, types_1.cSort)(axiom);
+        }
+        case 'var': {
+            const t = ctx.get(term.name);
+            if (!t)
+                return { error: `variable libre sin tipo: ${term.name}` };
+            return t;
+        }
+        case 'pi': {
+            // (PI) Γ ⊢ A : s1 ; Γ, x:A ⊢ B : s2 ; (s1,s2) ∈ R
+            const domType = inferType(term.domain, ctx, system);
+            if (isInferError(domType))
+                return domType;
+            const s1 = getSort(whnf(domType, system));
+            if (!s1) {
+                return {
+                    error: `dominio de Π debe ser un sort, pero ${(0, types_1.termToString)(term.domain)} : ${(0, types_1.termToString)(domType)}`,
+                };
+            }
+            const ctx2 = (0, types_1.extendContext)(ctx, term.bind, term.domain);
+            const codType = inferType(term.codomain, ctx2, system);
+            if (isInferError(codType))
+                return codType;
+            const s2 = getSort(whnf(codType, system));
+            if (!s2) {
+                return {
+                    error: `codominio de Π debe ser un sort, pero ${(0, types_1.termToString)(term.codomain)} : ${(0, types_1.termToString)(codType)}`,
+                };
+            }
+            if (!(0, rules_1.hasRule)(system, s1, s2)) {
+                return {
+                    error: `regla de formación (${s1}, ${s2}) no disponible en el sistema ${system}`,
+                };
+            }
+            return (0, types_1.cSort)(s2);
+        }
+        case 'lam': {
+            // (LAM) Γ, x:A ⊢ b : B ; Γ ⊢ Π x:A. B : s
+            const domType = inferType(term.domain, ctx, system);
+            if (isInferError(domType))
+                return domType;
+            const s1 = getSort(whnf(domType, system));
+            if (!s1) {
+                return {
+                    error: `parámetro de λ debe tener un tipo (sort), pero ${(0, types_1.termToString)(term.domain)} : ${(0, types_1.termToString)(domType)}`,
+                };
+            }
+            const ctx2 = (0, types_1.extendContext)(ctx, term.bind, term.domain);
+            const bodyType = inferType(term.body, ctx2, system);
+            if (isInferError(bodyType))
+                return bodyType;
+            // El Π reconstruido debe ser bien-formado en el sistema activo.
+            const piType = {
+                kind: 'pi',
+                bind: term.bind,
+                domain: term.domain,
+                codomain: bodyType,
+            };
+            const piSort = inferType(piType, ctx, system);
+            if (isInferError(piSort))
+                return piSort;
+            return piType;
+        }
+        case 'app': {
+            // (APP) f : (Π x:A. B) ; a : A ⟹ f a : B[a/x]
+            const fnType = inferType(term.fn, ctx, system);
+            if (isInferError(fnType))
+                return fnType;
+            const fnWhnf = whnf(fnType, system);
+            if (fnWhnf.kind !== 'pi') {
+                return {
+                    error: `aplicación requiere función Π, pero ${(0, types_1.termToString)(term.fn)} : ${(0, types_1.termToString)(fnType)}`,
+                };
+            }
+            const argType = inferType(term.arg, ctx, system);
+            if (isInferError(argType))
+                return argType;
+            if (!(0, normalize_1.alphaBetaEq)(argType, fnWhnf.domain, system)) {
+                return {
+                    error: `argumento incompatible: esperaba ${(0, types_1.termToString)(fnWhnf.domain)}, recibió ${(0, types_1.termToString)(argType)}`,
+                };
+            }
+            return (0, normalize_1.substitute)(fnWhnf.codomain, fnWhnf.bind, term.arg);
+        }
+    }
+}
+/**
+ * Verifica que `term` tiene tipo `expected` bajo `ctx` en `system`.
+ * Igualdad de tipos: módulo α y β.
+ */
+function checkType(term, expected, ctx = new Map(), system = 'lambda-C') {
+    const actual = inferType(term, ctx, system);
+    if (isInferError(actual))
+        return false;
+    return (0, normalize_1.alphaBetaEq)(actual, expected, system);
+}
+/** ¿Las variables libres del término tienen todas un binding en `ctx`? */
+function isClosedUnder(term, ctx) {
+    for (const fv of (0, types_1.freeVars)(term)) {
+        if (!ctx.has(fv))
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=typecheck.js.map

package/dist/type-theory/lambda-cube/typecheck.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"typecheck.js","sourceRoot":"","sources":["../../../src/type-theory/lambda-cube/typecheck.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,8CAA8C;AAC9C,+DAA+D;AAC/D,EAAE;AACF,oEAAoE;AACpE,kEAAkE;AAClE,4CAA4C;AAC5C,EAAE;AACF,2CAA2C;AAC3C,EAAE;AACF,sBAAsB;AACtB,uEAAuE;AACvE,iCAAiC;AACjC,wBAAwB;AACxB,kCAAkC;AAClC,+BAA+B;AAC/B,EAAE;AACF,6BAA6B;AAC7B,8DAA8D;AAC9D,0CAA0C;AAC1C,0CAA0C;AAC1C,EAAE;AACF,yBAAyB;AACzB,8BAA8B;AAC9B,mCAAmC;AACnC,sCAAsC;AACtC,kCAAkC;AAClC,EAAE;AACF,8CAA8C;AAC9C,iDAAiD;AACjD,wBAAwB;AACxB,EAAE;AACF,oCAAoC;;AAkBpC,oCAEC;AAeD,8BAwFC;AAMD,8BASC;AAGD,sCAKC;AAhJD,mCAQiB;AAEjB,mCAA4C;AAC5C,2CAAiE;AAKjE,SAAgB,YAAY,CAAC,CAAc;IACzC,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,IAAI,CAAC,IAAI,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC;AAC5F,CAAC;AAED,sEAAsE;AACtE,SAAS,IAAI,CAAC,IAAc,EAAE,MAAkB;IAC9C,OAAO,IAAA,qBAAS,EAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,OAAO,CAAC,IAAc;IAC7B,OAAO,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;AACtD,CAAC;AAED;;;GAGG;AACH,SAAgB,SAAS,CACvB,IAAc,EACd,MAAmB,IAAI,GAAG,EAAE,EAC5B,SAAqB,UAAU;IAE/B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,KAAK,GAAG,IAAA,gBAAQ,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,OAAO,EAAE,KAAK,EAAE,SAAS,IAAI,CAAC,IAAI,6BAA6B,EAAE,CAAC;YACpE,CAAC;YACD,OAAO,IAAA,aAAK,EAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,CAAC,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,4BAA4B,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAClE,OAAO,CAAC,CAAC;QACX,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,kDAAkD;YAClD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YACpD,IAAI,YAAY,CAAC,OAAO,CAAC;gBAAE,OAAO,OAAO,CAAC;YAC1C,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,EAAE,EAAE,CAAC;gBACR,OAAO;oBACL,KAAK,EAAE,uCAAuC,IAAA,oBAAY,EAAC,IAAI,CAAC,MAAM,CAAC,MAAM,IAAA,oBAAY,EAAC,OAAO,CAAC,EAAE;iBACrG,CAAC;YACJ,CAAC;YACD,MAAM,IAAI,GAAG,IAAA,qBAAa,EAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACxD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YACvD,IAAI,YAAY,CAAC,OAAO,CAAC;gBAAE,OAAO,OAAO,CAAC;YAC1C,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,EAAE,EAAE,CAAC;gBACR,OAAO;oBACL,KAAK,EAAE,yCAAyC,IAAA,oBAAY,EAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAA,oBAAY,EAAC,OAAO,CAAC,EAAE;iBACzG,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,IAAA,eAAO,EAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC7B,OAAO;oBACL,KAAK,EAAE,uBAAuB,EAAE,KAAK,EAAE,iCAAiC,MAAM,EAAE;iBACjF,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,aAAK,EAAC,EAAE,CAAC,CAAC;QACnB,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,0CAA0C;YAC1C,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YACpD,IAAI,YAAY,CAAC,OAAO,CAAC;gBAAE,OAAO,OAAO,CAAC;YAC1C,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,EAAE,EAAE,CAAC;gBACR,OAAO;oBACL,KAAK,EAAE,kDAAkD,IAAA,oBAAY,EAAC,IAAI,CAAC,MAAM,CAAC,MAAM,IAAA,oBAAY,EAAC,OAAO,CAAC,EAAE;iBAChH,CAAC;YACJ,CAAC;YACD,MAAM,IAAI,GAAG,IAAA,qBAAa,EAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACxD,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YACpD,IAAI,YAAY,CAAC,QAAQ,CAAC;gBAAE,OAAO,QAAQ,CAAC;YAC5C,gEAAgE;YAChE,MAAM,MAAM,GAAa;gBACvB,IAAI,EAAE,IAAI;gBACV,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,QAAQ,EAAE,QAAQ;aACnB,CAAC;YACF,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YAC9C,IAAI,YAAY,CAAC,MAAM,CAAC;gBAAE,OAAO,MAAM,CAAC;YACxC,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,8CAA8C;YAC9C,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YAC/C,IAAI,YAAY,CAAC,MAAM,CAAC;gBAAE,OAAO,MAAM,CAAC;YACxC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACpC,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACzB,OAAO;oBACL,KAAK,EAAE,uCAAuC,IAAA,oBAAY,EAAC,IAAI,CAAC,EAAE,CAAC,MAAM,IAAA,oBAAY,EAAC,MAAM,CAAC,EAAE;iBAChG,CAAC;YACJ,CAAC;YACD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YACjD,IAAI,YAAY,CAAC,OAAO,CAAC;gBAAE,OAAO,OAAO,CAAC;YAC1C,IAAI,CAAC,IAAA,uBAAW,EAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gBACjD,OAAO;oBACL,KAAK,EAAE,oCAAoC,IAAA,oBAAY,EAAC,MAAM,CAAC,MAAM,CAAC,aAAa,IAAA,oBAAY,EAAC,OAAO,CAAC,EAAE;iBAC3G,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,sBAAU,EAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,SAAS,CACvB,IAAc,EACd,QAAkB,EAClB,MAAmB,IAAI,GAAG,EAAE,EAC5B,SAAqB,UAAU;IAE/B,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IAC5C,IAAI,YAAY,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IACvC,OAAO,IAAA,uBAAW,EAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;AAC/C,CAAC;AAED,0EAA0E;AAC1E,SAAgB,aAAa,CAAC,IAAc,EAAE,GAAgB;IAC5D,KAAK,MAAM,EAAE,IAAI,IAAA,gBAAQ,EAAC,IAAI,CAAC,EAAE,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;IACjC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/type-theory/lambda-cube/types.d.ts

@@ -0,0 +1,40 @@
+export type Sort = '*' | '◻';
+export type CubeSystem = 'lambda' | 'lambda2' | 'lambda-omega-bar' | 'lambda-omega' | 'lambda-P' | 'lambda-P2' | 'lambda-P-omega' | 'lambda-C';
+export type CubeTerm = {
+    kind: 'var';
+    name: string;
+} | {
+    kind: 'sort';
+    sort: Sort;
+} | {
+    kind: 'pi';
+    bind: string;
+    domain: CubeTerm;
+    codomain: CubeTerm;
+} | {
+    kind: 'lam';
+    bind: string;
+    domain: CubeTerm;
+    body: CubeTerm;
+} | {
+    kind: 'app';
+    fn: CubeTerm;
+    arg: CubeTerm;
+};
+export declare const cVar: (name: string) => CubeTerm;
+export declare const cSort: (sort: Sort) => CubeTerm;
+export declare const cStar: CubeTerm;
+export declare const cBox: CubeTerm;
+export declare const cPi: (bind: string, domain: CubeTerm, codomain: CubeTerm) => CubeTerm;
+export declare const cLam: (bind: string, domain: CubeTerm, body: CubeTerm) => CubeTerm;
+export declare const cApp: (fn: CubeTerm, arg: CubeTerm) => CubeTerm;
+/** Flecha no-dependiente: Π (_ : A). B, cuando B no menciona el binder. */
+export declare const cArrow: (from: CubeTerm, to: CubeTerm) => CubeTerm;
+export declare function occursFree(name: string, term: CubeTerm): boolean;
+export declare function freeVars(term: CubeTerm, acc?: Set<string>): Set<string>;
+export declare function termToString(t: CubeTerm): string;
+export declare function alphaEq(a: CubeTerm, b: CubeTerm): boolean;
+export type CubeContext = Map<string, CubeTerm>;
+export declare function emptyContext(): CubeContext;
+export declare function extendContext(ctx: CubeContext, name: string, type: CubeTerm): CubeContext;
+//# sourceMappingURL=types.d.ts.map

package/dist/type-theory/lambda-cube/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/type-theory/lambda-cube/types.ts"],"names":[],"mappings":"AAsCA,MAAM,MAAM,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;AAE7B,MAAM,MAAM,UAAU,GAClB,QAAQ,GACR,SAAS,GACT,kBAAkB,GAClB,cAAc,GACd,UAAU,GACV,WAAW,GACX,gBAAgB,GAChB,UAAU,CAAC;AAEf,MAAM,MAAM,QAAQ,GAChB;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC7B;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE,GAC5B;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAA;CAAE,GAClE;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,GAC/D;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,EAAE,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAA;CAAE,CAAC;AAIjD,eAAO,MAAM,IAAI,GAAI,MAAM,MAAM,KAAG,QAAmC,CAAC;AACxE,eAAO,MAAM,KAAK,GAAI,MAAM,IAAI,KAAG,QAAoC,CAAC;AACxE,eAAO,MAAM,KAAK,EAAE,QAAsC,CAAC;AAC3D,eAAO,MAAM,IAAI,EAAE,QAAsC,CAAC;AAC1D,eAAO,MAAM,GAAG,GAAI,MAAM,MAAM,EAAE,QAAQ,QAAQ,EAAE,UAAU,QAAQ,KAAG,QAKvE,CAAC;AACH,eAAO,MAAM,IAAI,GAAI,MAAM,MAAM,EAAE,QAAQ,QAAQ,EAAE,MAAM,QAAQ,KAAG,QAKpE,CAAC;AACH,eAAO,MAAM,IAAI,GAAI,IAAI,QAAQ,EAAE,KAAK,QAAQ,KAAG,QAAsC,CAAC;AAE1F,2EAA2E;AAC3E,eAAO,MAAM,MAAM,GAAI,MAAM,QAAQ,EAAE,IAAI,QAAQ,KAAG,QAA8B,CAAC;AAIrF,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,OAAO,CAgBhE;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,GAAE,GAAG,CAAC,MAAM,CAAa,GAAG,GAAG,CAAC,MAAM,CAAC,CAqBlF;AAID,wBAAgB,YAAY,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CA4BhD;AAID,wBAAgB,OAAO,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,GAAG,OAAO,CAEzD;AAiDD,MAAM,MAAM,WAAW,GAAG,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AAEhD,wBAAgB,YAAY,IAAI,WAAW,CAE1C;AAED,wBAAgB,aAAa,CAAC,GAAG,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,WAAW,CAIzF"}

package/dist/type-theory/lambda-cube/types.js

@@ -0,0 +1,192 @@
+"use strict";
+// ============================================================
+// Lambda Cube (Barendregt) — Términos como Pure Type System (PTS)
+// ============================================================
+//
+// El cubo λ de Barendregt presenta 8 sistemas de tipos puros como
+// activaciones de 3 ejes ortogonales sobre el λ-cálculo simplemente
+// tipado:
+//
+//        polymorphism             ──   ∀ sobre términos     (λ2, λω, λC ...)
+//        type operators           ──   funciones a nivel tipo (λω, λC ...)
+//        dependent types          ──   tipos que dependen de términos (λP, λC ...)
+//
+// Cada combinación es un PTS con dos sorts:
+//
+//        * (Set / Prop)     y     ◻ (Type / Kind)
+//
+// y un conjunto de reglas de formación (s1, s2) para Π.
+//
+// La sintaxis unificada usada en este módulo:
+//
+//        t ::= x
+//            | s                 sort (* | ◻)
+//            | Π x:t. t          producto dependiente
+//            | λ x:t. t          abstracción
+//            | t t               aplicación
+//
+// Las reglas de formación de cada vértice del cubo deciden qué
+// abstracciones son legales. Por ejemplo:
+//
+//   λ→         (*, *)                              STLC
+//   λ2         (*, *) (◻, *)                       System F
+//   λω̄         (*, *) (◻, ◻)                       λω débil
+//   λω         (*, *) (◻, *) (◻, ◻)                System Fω
+//   λP         (*, *) (*, ◻)                       LF / λΠ
+//   λP2        (*, *) (◻, *) (*, ◻)
+//   λPω̄        (*, *) (*, ◻) (◻, ◻)
+//   λC         (*, *) (◻, *) (*, ◻) (◻, ◻)         Calculus of Constructions
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cArrow = exports.cApp = exports.cLam = exports.cPi = exports.cBox = exports.cStar = exports.cSort = exports.cVar = void 0;
+exports.occursFree = occursFree;
+exports.freeVars = freeVars;
+exports.termToString = termToString;
+exports.alphaEq = alphaEq;
+exports.emptyContext = emptyContext;
+exports.extendContext = extendContext;
+// ---------- Constructores convenientes ----------
+const cVar = (name) => ({ kind: 'var', name });
+exports.cVar = cVar;
+const cSort = (sort) => ({ kind: 'sort', sort });
+exports.cSort = cSort;
+exports.cStar = { kind: 'sort', sort: '*' };
+exports.cBox = { kind: 'sort', sort: '◻' };
+const cPi = (bind, domain, codomain) => ({
+    kind: 'pi',
+    bind,
+    domain,
+    codomain,
+});
+exports.cPi = cPi;
+const cLam = (bind, domain, body) => ({
+    kind: 'lam',
+    bind,
+    domain,
+    body,
+});
+exports.cLam = cLam;
+const cApp = (fn, arg) => ({ kind: 'app', fn, arg });
+exports.cApp = cApp;
+/** Flecha no-dependiente: Π (_ : A). B, cuando B no menciona el binder. */
+const cArrow = (from, to) => (0, exports.cPi)('_', from, to);
+exports.cArrow = cArrow;
+// ---------- Variables libres ----------
+function occursFree(name, term) {
+    switch (term.kind) {
+        case 'var':
+            return term.name === name;
+        case 'sort':
+            return false;
+        case 'pi':
+        case 'lam': {
+            if (occursFree(name, term.domain))
+                return true;
+            if (term.bind === name)
+                return false;
+            const body = term.kind === 'pi' ? term.codomain : term.body;
+            return occursFree(name, body);
+        }
+        case 'app':
+            return occursFree(name, term.fn) || occursFree(name, term.arg);
+    }
+}
+function freeVars(term, acc = new Set()) {
+    switch (term.kind) {
+        case 'var':
+            acc.add(term.name);
+            return acc;
+        case 'sort':
+            return acc;
+        case 'pi':
+        case 'lam': {
+            freeVars(term.domain, acc);
+            const body = term.kind === 'pi' ? term.codomain : term.body;
+            const inner = freeVars(body);
+            inner.delete(term.bind);
+            for (const v of inner)
+                acc.add(v);
+            return acc;
+        }
+        case 'app':
+            freeVars(term.fn, acc);
+            freeVars(term.arg, acc);
+            return acc;
+    }
+}
+// ---------- Serialización legible ----------
+function termToString(t) {
+    switch (t.kind) {
+        case 'var':
+            return t.name;
+        case 'sort':
+            return t.sort;
+        case 'pi': {
+            if (t.bind === '_' || !occursFree(t.bind, t.codomain)) {
+                const lhs = t.domain.kind === 'pi' || t.domain.kind === 'lam'
+                    ? `(${termToString(t.domain)})`
+                    : termToString(t.domain);
+                return `${lhs} → ${termToString(t.codomain)}`;
+            }
+            return `Π ${t.bind}:${termToString(t.domain)}. ${termToString(t.codomain)}`;
+        }
+        case 'lam':
+            return `λ ${t.bind}:${termToString(t.domain)}. ${termToString(t.body)}`;
+        case 'app': {
+            const fn = t.fn.kind === 'lam' || t.fn.kind === 'pi' ? `(${termToString(t.fn)})` : termToString(t.fn);
+            const arg = t.arg.kind === 'app' || t.arg.kind === 'lam' || t.arg.kind === 'pi'
+                ? `(${termToString(t.arg)})`
+                : termToString(t.arg);
+            return `${fn} ${arg}`;
+        }
+    }
+}
+// ---------- α-equivalencia ----------
+function alphaEq(a, b) {
+    return alphaEqEnv(a, b, new Map(), new Map(), { n: 0 });
+}
+function alphaEqEnv(a, b, envA, envB, counter) {
+    if (a.kind !== b.kind)
+        return false;
+    switch (a.kind) {
+        case 'var': {
+            const bb = b;
+            const ia = envA.get(a.name);
+            const ib = envB.get(bb.name);
+            if (ia === undefined && ib === undefined)
+                return a.name === bb.name;
+            return ia === ib;
+        }
+        case 'sort':
+            return a.sort === b.sort;
+        case 'pi':
+        case 'lam': {
+            const bb = b;
+            const aDom = a.domain;
+            const bDom = bb.domain;
+            if (!alphaEqEnv(aDom, bDom, envA, envB, counter))
+                return false;
+            const idx = counter.n++;
+            const newA = new Map(envA);
+            newA.set(a.bind, idx);
+            const newB = new Map(envB);
+            newB.set(bb.bind, idx);
+            const aBody = a.kind === 'pi' ? a.codomain : a.body;
+            const bBody = bb.kind === 'pi' ? bb.codomain : bb.body;
+            return alphaEqEnv(aBody, bBody, newA, newB, counter);
+        }
+        case 'app': {
+            const bb = b;
+            return (alphaEqEnv(a.fn, bb.fn, envA, envB, counter) &&
+                alphaEqEnv(a.arg, bb.arg, envA, envB, counter));
+        }
+    }
+}
+function emptyContext() {
+    return new Map();
+}
+function extendContext(ctx, name, type) {
+    const next = new Map(ctx);
+    next.set(name, type);
+    return next;
+}
+//# sourceMappingURL=types.js.map

package/dist/type-theory/lambda-cube/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/type-theory/lambda-cube/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kEAAkE;AAClE,+DAA+D;AAC/D,EAAE;AACF,kEAAkE;AAClE,oEAAoE;AACpE,UAAU;AACV,EAAE;AACF,6EAA6E;AAC7E,2EAA2E;AAC3E,mFAAmF;AACnF,EAAE;AACF,4CAA4C;AAC5C,EAAE;AACF,kDAAkD;AAClD,EAAE;AACF,wDAAwD;AACxD,EAAE;AACF,8CAA8C;AAC9C,EAAE;AACF,iBAAiB;AACjB,8CAA8C;AAC9C,sDAAsD;AACtD,6CAA6C;AAC7C,4CAA4C;AAC5C,EAAE;AACF,+DAA+D;AAC/D,0CAA0C;AAC1C,EAAE;AACF,wDAAwD;AACxD,4DAA4D;AAC5D,6DAA6D;AAC7D,6DAA6D;AAC7D,2DAA2D;AAC3D,oCAAoC;AACpC,qCAAqC;AACrC,6EAA6E;;;AA8C7E,gCAgBC;AAED,4BAqBC;AAID,oCA4BC;AAID,0BAEC;AAmDD,oCAEC;AAED,sCAIC;AAjKD,mDAAmD;AAE5C,MAAM,IAAI,GAAG,CAAC,IAAY,EAAY,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AAA3D,QAAA,IAAI,QAAuD;AACjE,MAAM,KAAK,GAAG,CAAC,IAAU,EAAY,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAA3D,QAAA,KAAK,SAAsD;AAC3D,QAAA,KAAK,GAAa,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AAC9C,QAAA,IAAI,GAAa,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AACnD,MAAM,GAAG,GAAG,CAAC,IAAY,EAAE,MAAgB,EAAE,QAAkB,EAAY,EAAE,CAAC,CAAC;IACpF,IAAI,EAAE,IAAI;IACV,IAAI;IACJ,MAAM;IACN,QAAQ;CACT,CAAC,CAAC;AALU,QAAA,GAAG,OAKb;AACI,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,MAAgB,EAAE,IAAc,EAAY,EAAE,CAAC,CAAC;IACjF,IAAI,EAAE,KAAK;IACX,IAAI;IACJ,MAAM;IACN,IAAI;CACL,CAAC,CAAC;AALU,QAAA,IAAI,QAKd;AACI,MAAM,IAAI,GAAG,CAAC,EAAY,EAAE,GAAa,EAAY,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;AAA7E,QAAA,IAAI,QAAyE;AAE1F,2EAA2E;AACpE,MAAM,MAAM,GAAG,CAAC,IAAc,EAAE,EAAY,EAAY,EAAE,CAAC,IAAA,WAAG,EAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;AAAxE,QAAA,MAAM,UAAkE;AAErF,yCAAyC;AAEzC,SAAgB,UAAU,CAAC,IAAY,EAAE,IAAc;IACrD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;QAC5B,KAAK,MAAM;YACT,OAAO,KAAK,CAAC;QACf,KAAK,IAAI,CAAC;QACV,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;YAC5D,OAAO,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,KAAK;YACR,OAAO,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IACnE,CAAC;AACH,CAAC;AAED,SAAgB,QAAQ,CAAC,IAAc,EAAE,MAAmB,IAAI,GAAG,EAAE;IACnE,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,MAAM;YACT,OAAO,GAAG,CAAC;QACb,KAAK,IAAI,CAAC;QACV,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;YAC5D,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC7B,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,KAAK;YACR,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACvB,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAED,8CAA8C;AAE9C,SAAgB,YAAY,CAAC,CAAW;IACtC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACtD,MAAM,GAAG,GACP,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,KAAK;oBAC/C,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG;oBAC/B,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAC7B,OAAO,GAAG,GAAG,MAAM,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChD,CAAC;YACD,OAAO,KAAK,CAAC,CAAC,IAAI,IAAI,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC9E,CAAC;QACD,KAAK,KAAK;YACR,OAAO,KAAK,CAAC,CAAC,IAAI,IAAI,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1E,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GACN,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7F,MAAM,GAAG,GACP,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI;gBACjE,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG;gBAC5B,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1B,OAAO,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACxB,CAAC;IACH,CAAC;AACH,CAAC;AAED,uCAAuC;AAEvC,SAAgB,OAAO,CAAC,CAAW,EAAE,CAAW;IAC9C,OAAO,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,UAAU,CACjB,CAAW,EACX,CAAW,EACX,IAAyB,EACzB,IAAyB,EACzB,OAAsB;IAEtB,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,CAAa,CAAC;YACzB,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;gBAAE,OAAO,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,CAAC;YACpE,OAAO,EAAE,KAAK,EAAE,CAAC;QACnB,CAAC;QACD,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAM,CAAc,CAAC,IAAI,CAAC;QACzC,KAAK,IAAI,CAAC;QACV,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC;YACtB,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC;YACvB,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/D,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACtB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACpD,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;YACvD,OAAO,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACvD,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,CACL,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC;gBAC5C,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAC/C,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAQD,SAAgB,YAAY;IAC1B,OAAO,IAAI,GAAG,EAAE,CAAC;AACnB,CAAC;AAED,SAAgB,aAAa,CAAC,GAAgB,EAAE,IAAY,EAAE,IAAc;IAC1E,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC;AACd,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stevenvo780/st-lang",
-  "version": "4.12.0",
+  "version": "4.13.0",
   "description": "ST — Lenguaje ejecutable con nucleo logico y capa textual. Motor multi-perfil (11 lógicas), derivaciones, tablas de verdad, contramodelos, aliases modales, Belnap 4-valores y capa textual para formalización de documentos.",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",