@stevenvo780/st-lang 4.7.0 → 4.8.0

package/dist/type-theory/cubical/infer.js

@@ -0,0 +1,241 @@
+"use strict";
+// ============================================================
+// Cubical — Inferencia / chequeo de tipos
+// ============================================================
+//
+// Reglas principales del subset CTT-Lite:
+//
+//   ── (I-form)     i0 : I    i1 : I    iVar i : I
+//
+//   Γ ⊢ r : I   Γ ⊢ s : I
+//   ── (∧, ∨)       r ∧ s : I    r ∨ s : I
+//
+//   Γ ⊢ r : I
+//   ── (~)          ~ r : I
+//
+//   Γ ⊢ A : I → Type   Γ ⊢ x : A i0   Γ ⊢ y : A i1
+//   ── (PathP)      PathP A x y : Type
+//
+//   Γ, i : I ⊢ t : A i
+//   ── (pLam)       λi. t : PathP (λi. A i) (t[i := i0]) (t[i := i1])
+//
+//   Γ ⊢ p : PathP A x y   Γ ⊢ r : I
+//   ── (pApp)       p @ r : A r
+//                   con (p @ i0) ≡ x y (p @ i1) ≡ y
+//
+//   Γ ⊢ e : A ≃ B (codificado como Σ)
+//   Γ ⊢ partial : algún término candidato
+//   ── (glue)       glue(e, partial) : PathP _ A B  (precursor de ua)
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cArrow = exports.intervalType = void 0;
+exports.isInferErrorCubical = isInferErrorCubical;
+exports.makeContext = makeContext;
+exports.inferType = inferType;
+exports.checkType = checkType;
+const types_1 = require("./types");
+Object.defineProperty(exports, "cArrow", { enumerable: true, get: function () { return types_1.cArrow; } });
+const substitute_1 = require("./substitute");
+const normalize_1 = require("./normalize");
+const equality_1 = require("./equality");
+const intervalType = () => ({ kind: 'var', name: '__I__' });
+exports.intervalType = intervalType;
+function isInferErrorCubical(r) {
+    return typeof r === 'object' && r !== null && 'error' in r && typeof r.error === 'string';
+}
+function makeContext() {
+    return { termVars: new Map(), intervalVars: new Set() };
+}
+function extendTerm(ctx, name, type) {
+    const next = {
+        termVars: new Map(ctx.termVars),
+        intervalVars: new Set(ctx.intervalVars),
+    };
+    next.termVars.set(name, type);
+    return next;
+}
+function extendInterval(ctx, name) {
+    const next = {
+        termVars: new Map(ctx.termVars),
+        intervalVars: new Set(ctx.intervalVars),
+    };
+    next.intervalVars.add(name);
+    return next;
+}
+function inferType(term, ctx = makeContext()) {
+    switch (term.kind) {
+        case 'i0':
+        case 'i1':
+            return (0, exports.intervalType)();
+        case 'iVar':
+            if (ctx.intervalVars.has(term.name))
+                return (0, exports.intervalType)();
+            return { error: `variable de intervalo libre: ${term.name}` };
+        case 'iNeg': {
+            if (!checkInterval(term.arg, ctx)) {
+                return { error: `~: argumento no es I: ${(0, types_1.termToStringCubical)(term.arg)}` };
+            }
+            return (0, exports.intervalType)();
+        }
+        case 'iMin':
+        case 'iMax': {
+            if (!checkInterval(term.left, ctx) || !checkInterval(term.right, ctx)) {
+                return { error: `${term.kind === 'iMin' ? '∧' : '∨'}: ambos lados deben ser I` };
+            }
+            return (0, exports.intervalType)();
+        }
+        case 'var': {
+            const t = ctx.termVars.get(term.name);
+            if (!t)
+                return { error: `variable libre sin tipo: ${term.name}` };
+            return t;
+        }
+        case 'universe':
+            return (0, types_1.cUniverse)(term.level + 1);
+        case 'pi': {
+            const domT = inferType(term.domain, ctx);
+            if (isInferErrorCubical(domT))
+                return domT;
+            const i = universeLevel(domT);
+            if (i === null) {
+                return {
+                    error: `dominio de Π no es universo: ${(0, types_1.termToStringCubical)(term.domain)}`,
+                };
+            }
+            const newCtx = extendTerm(ctx, term.bind, term.domain);
+            const codT = inferType(term.codomain, newCtx);
+            if (isInferErrorCubical(codT))
+                return codT;
+            const j = universeLevel(codT);
+            if (j === null) {
+                return {
+                    error: `codominio de Π no es universo: ${(0, types_1.termToStringCubical)(term.codomain)}`,
+                };
+            }
+            return (0, types_1.cUniverse)(Math.max(i, j));
+        }
+        case 'lam': {
+            const domT = inferType(term.domain, ctx);
+            if (isInferErrorCubical(domT))
+                return domT;
+            if (universeLevel(domT) === null) {
+                return {
+                    error: `anotación de λ no es un tipo: ${(0, types_1.termToStringCubical)(term.domain)}`,
+                };
+            }
+            const newCtx = extendTerm(ctx, term.bind, term.domain);
+            const bodyT = inferType(term.body, newCtx);
+            if (isInferErrorCubical(bodyT))
+                return bodyT;
+            return { kind: 'pi', bind: term.bind, domain: term.domain, codomain: bodyT };
+        }
+        case 'app': {
+            const fnT = inferType(term.fn, ctx);
+            if (isInferErrorCubical(fnT))
+                return fnT;
+            const fnTNorm = (0, normalize_1.normalizeCubical)(fnT);
+            if (fnTNorm.kind !== 'pi') {
+                return { error: `aplicación requiere Π, encontré: ${(0, types_1.termToStringCubical)(fnTNorm)}` };
+            }
+            const argT = inferType(term.arg, ctx);
+            if (isInferErrorCubical(argT))
+                return argT;
+            if (!(0, equality_1.alphaBetaEqCubical)(fnTNorm.domain, argT)) {
+                return {
+                    error: `tipo de argumento no coincide: esperaba ${(0, types_1.termToStringCubical)(fnTNorm.domain)}, obtuve ${(0, types_1.termToStringCubical)(argT)}`,
+                };
+            }
+            return (0, substitute_1.substituteCubical)(fnTNorm.codomain, fnTNorm.bind, term.arg);
+        }
+        case 'pathP': {
+            // family : I → Type
+            const famT = inferType(term.family, ctx);
+            if (isInferErrorCubical(famT))
+                return famT;
+            const famTNorm = (0, normalize_1.normalizeCubical)(famT);
+            if (famTNorm.kind !== 'pi' || !isIntervalTypeMark(famTNorm.domain)) {
+                return {
+                    error: `PathP: family debe ser I → Type, recibí: ${(0, types_1.termToStringCubical)(famTNorm)}`,
+                };
+            }
+            // left : A i0, right : A i1
+            const leftT = inferType(term.left, ctx);
+            if (isInferErrorCubical(leftT))
+                return leftT;
+            const rightT = inferType(term.right, ctx);
+            if (isInferErrorCubical(rightT))
+                return rightT;
+            const expectedLeft = (0, normalize_1.normalizeCubical)((0, types_1.cApp)(term.family, (0, types_1.cI0)()));
+            const expectedRight = (0, normalize_1.normalizeCubical)((0, types_1.cApp)(term.family, (0, types_1.cI1)()));
+            if (!(0, equality_1.alphaBetaEqCubical)(leftT, expectedLeft)) {
+                return {
+                    error: `PathP: left tiene tipo ${(0, types_1.termToStringCubical)(leftT)}, esperaba ${(0, types_1.termToStringCubical)(expectedLeft)}`,
+                };
+            }
+            if (!(0, equality_1.alphaBetaEqCubical)(rightT, expectedRight)) {
+                return {
+                    error: `PathP: right tiene tipo ${(0, types_1.termToStringCubical)(rightT)}, esperaba ${(0, types_1.termToStringCubical)(expectedRight)}`,
+                };
+            }
+            const codLevel = universeLevel(famTNorm.codomain);
+            return (0, types_1.cUniverse)(codLevel ?? 0);
+        }
+        case 'pLam': {
+            // λi. t : PathP (λi. infer(t)) (t[i:=i0]) (t[i:=i1])
+            const innerCtx = extendInterval(ctx, term.bind);
+            const bodyT = inferType(term.body, innerCtx);
+            if (isInferErrorCubical(bodyT))
+                return bodyT;
+            const left = (0, normalize_1.normalizeCubical)((0, substitute_1.substituteCubical)(term.body, term.bind, (0, types_1.cI0)()));
+            const right = (0, normalize_1.normalizeCubical)((0, substitute_1.substituteCubical)(term.body, term.bind, (0, types_1.cI1)()));
+            const family = (0, types_1.cPLam)(term.bind, bodyT);
+            return (0, types_1.cPathP)(family, left, right);
+        }
+        case 'pApp': {
+            const pT = inferType(term.path, ctx);
+            if (isInferErrorCubical(pT))
+                return pT;
+            const pTNorm = (0, normalize_1.normalizeCubical)(pT);
+            if (pTNorm.kind !== 'pathP') {
+                return { error: `p @ r requiere PathP, recibí: ${(0, types_1.termToStringCubical)(pTNorm)}` };
+            }
+            if (!checkInterval(term.arg, ctx)) {
+                return { error: `p @ r: r debe ser I, recibí: ${(0, types_1.termToStringCubical)(term.arg)}` };
+            }
+            // tipo resultado = family @ r (que puede ser pApp o app dependiendo de la forma)
+            return (0, normalize_1.normalizeCubical)({ kind: 'pApp', path: pTNorm.family, arg: term.arg });
+        }
+        case 'glue': {
+            // Sintáctica: aceptamos equiv : Σ_A,B y devolvemos un PathP universo
+            const eT = inferType(term.equiv, ctx);
+            if (isInferErrorCubical(eT))
+                return eT;
+            // partial: opcional, contribuye sólo al término
+            const pT = inferType(term.partial, ctx);
+            if (isInferErrorCubical(pT))
+                return pT;
+            // glue introduce un path en el universo entre el dominio y codominio
+            // del par de tipos codificado en equiv. Sin estructura formal en este
+            // subset, devolvemos una marca de PathP genérica.
+            const family = (0, types_1.cPLam)('i', (0, types_1.cUniverse)(0));
+            return (0, types_1.cPathP)(family, term.equiv, term.equiv);
+        }
+    }
+}
+function checkInterval(t, ctx) {
+    const r = inferType(t, ctx);
+    return !isInferErrorCubical(r) && isIntervalTypeMark(r);
+}
+function isIntervalTypeMark(t) {
+    return t.kind === 'var' && t.name === '__I__';
+}
+function universeLevel(t) {
+    const n = (0, normalize_1.normalizeCubical)(t);
+    return n.kind === 'universe' ? n.level : null;
+}
+function checkType(term, expected, ctx = makeContext()) {
+    const inferred = inferType(term, ctx);
+    if (isInferErrorCubical(inferred))
+        return false;
+    return (0, equality_1.alphaBetaEqCubical)(inferred, expected);
+}
+//# sourceMappingURL=infer.js.map

package/dist/type-theory/cubical/infer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"infer.js","sourceRoot":"","sources":["../../../src/type-theory/cubical/infer.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,0CAA0C;AAC1C,+DAA+D;AAC/D,EAAE;AACF,0CAA0C;AAC1C,EAAE;AACF,mDAAmD;AACnD,EAAE;AACF,0BAA0B;AAC1B,2CAA2C;AAC3C,EAAE;AACF,cAAc;AACd,4BAA4B;AAC5B,EAAE;AACF,mDAAmD;AACnD,uCAAuC;AACvC,EAAE;AACF,uBAAuB;AACvB,sEAAsE;AACtE,EAAE;AACF,oCAAoC;AACpC,gCAAgC;AAChC,oDAAoD;AACpD,EAAE;AACF,sCAAsC;AACtC,0CAA0C;AAC1C,sEAAsE;;;AAiBtE,kDAEC;AAED,kCAEC;AAoBD,8BAmJC;AAgBD,8BAQC;AAnND,mCAAgG;AAsNvF,uFAtNwD,cAAM,OAsNxD;AArNf,6CAAiD;AACjD,2CAA+C;AAC/C,yCAAgD;AASzC,MAAM,YAAY,GAAG,GAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;AAAnE,QAAA,YAAY,gBAAuD;AAEhF,SAAgB,mBAAmB,CAAC,CAAqB;IACvD,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,IAAI,CAAC,IAAI,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC;AAC5F,CAAC;AAED,SAAgB,WAAW;IACzB,OAAO,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;AAC1D,CAAC;AAED,SAAS,UAAU,CAAC,GAAmB,EAAE,IAAY,EAAE,IAAiB;IACtE,MAAM,IAAI,GAAmB;QAC3B,QAAQ,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC;QAC/B,YAAY,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC;KACxC,CAAC;IACF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC9B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,cAAc,CAAC,GAAmB,EAAE,IAAY;IACvD,MAAM,IAAI,GAAmB;QAC3B,QAAQ,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC;QAC/B,YAAY,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC;KACxC,CAAC;IACF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAgB,SAAS,CACvB,IAAiB,EACjB,MAAsB,WAAW,EAAE;IAEnC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC;QACV,KAAK,IAAI;YACP,OAAO,IAAA,oBAAY,GAAE,CAAC;QACxB,KAAK,MAAM;YACT,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAA,oBAAY,GAAE,CAAC;YAC3D,OAAO,EAAE,KAAK,EAAE,gCAAgC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QAChE,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAClC,OAAO,EAAE,KAAK,EAAE,yBAAyB,IAAA,2BAAmB,EAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YAC7E,CAAC;YACD,OAAO,IAAA,oBAAY,GAAE,CAAC;QACxB,CAAC;QACD,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;gBACtE,OAAO,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,2BAA2B,EAAE,CAAC;YACnF,CAAC;YACD,OAAO,IAAA,oBAAY,GAAE,CAAC;QACxB,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,CAAC,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,4BAA4B,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAClE,OAAO,CAAC,CAAC;QACX,CAAC;QACD,KAAK,UAAU;YACb,OAAO,IAAA,iBAAS,EAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACzC,IAAI,mBAAmB,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3C,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO;oBACL,KAAK,EAAE,gCAAgC,IAAA,2BAAmB,EAAC,IAAI,CAAC,MAAM,CAAC,EAAE;iBAC1E,CAAC;YACJ,CAAC;YACD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACvD,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC9C,IAAI,mBAAmB,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3C,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO;oBACL,KAAK,EAAE,kCAAkC,IAAA,2BAAmB,EAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;iBAC9E,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,iBAAS,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACzC,IAAI,mBAAmB,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3C,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACjC,OAAO;oBACL,KAAK,EAAE,iCAAiC,IAAA,2BAAmB,EAAC,IAAI,CAAC,MAAM,CAAC,EAAE;iBAC3E,CAAC;YACJ,CAAC;YACD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACvD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC3C,IAAI,mBAAmB,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC/E,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACpC,IAAI,mBAAmB,CAAC,GAAG,CAAC;gBAAE,OAAO,GAAG,CAAC;YACzC,MAAM,OAAO,GAAG,IAAA,4BAAgB,EAAC,GAAG,CAAC,CAAC;YACtC,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBAC1B,OAAO,EAAE,KAAK,EAAE,oCAAoC,IAAA,2BAAmB,EAAC,OAAO,CAAC,EAAE,EAAE,CAAC;YACvF,CAAC;YACD,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACtC,IAAI,mBAAmB,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3C,IAAI,CAAC,IAAA,6BAAkB,EAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC9C,OAAO;oBACL,KAAK,EAAE,2CAA2C,IAAA,2BAAmB,EAAC,OAAO,CAAC,MAAM,CAAC,YAAY,IAAA,2BAAmB,EAAC,IAAI,CAAC,EAAE;iBAC7H,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,8BAAiB,EAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QACrE,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,oBAAoB;YACpB,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACzC,IAAI,mBAAmB,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC3C,MAAM,QAAQ,GAAG,IAAA,4BAAgB,EAAC,IAAI,CAAC,CAAC;YACxC,IAAI,QAAQ,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnE,OAAO;oBACL,KAAK,EAAE,4CAA4C,IAAA,2BAAmB,EAAC,QAAQ,CAAC,EAAE;iBACnF,CAAC;YACJ,CAAC;YACD,4BAA4B;YAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACxC,IAAI,mBAAmB,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC1C,IAAI,mBAAmB,CAAC,MAAM,CAAC;gBAAE,OAAO,MAAM,CAAC;YAC/C,MAAM,YAAY,GAAG,IAAA,4BAAgB,EAAC,IAAA,YAAI,EAAC,IAAI,CAAC,MAAM,EAAE,IAAA,WAAG,GAAE,CAAC,CAAC,CAAC;YAChE,MAAM,aAAa,GAAG,IAAA,4BAAgB,EAAC,IAAA,YAAI,EAAC,IAAI,CAAC,MAAM,EAAE,IAAA,WAAG,GAAE,CAAC,CAAC,CAAC;YACjE,IAAI,CAAC,IAAA,6BAAkB,EAAC,KAAK,EAAE,YAAY,CAAC,EAAE,CAAC;gBAC7C,OAAO;oBACL,KAAK,EAAE,0BAA0B,IAAA,2BAAmB,EAAC,KAAK,CAAC,cAAc,IAAA,2BAAmB,EAAC,YAAY,CAAC,EAAE;iBAC7G,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,IAAA,6BAAkB,EAAC,MAAM,EAAE,aAAa,CAAC,EAAE,CAAC;gBAC/C,OAAO;oBACL,KAAK,EAAE,2BAA2B,IAAA,2BAAmB,EAAC,MAAM,CAAC,cAAc,IAAA,2BAAmB,EAAC,aAAa,CAAC,EAAE;iBAChH,CAAC;YACJ,CAAC;YACD,MAAM,QAAQ,GAAG,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAClD,OAAO,IAAA,iBAAS,EAAC,QAAQ,IAAI,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,qDAAqD;YACrD,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAChD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC7C,IAAI,mBAAmB,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC7C,MAAM,IAAI,GAAG,IAAA,4BAAgB,EAAC,IAAA,8BAAiB,EAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAA,WAAG,GAAE,CAAC,CAAC,CAAC;YAC9E,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,IAAA,8BAAiB,EAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAA,WAAG,GAAE,CAAC,CAAC,CAAC;YAC/E,MAAM,MAAM,GAAG,IAAA,aAAK,EAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACvC,OAAO,IAAA,cAAM,EAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACrC,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACrC,IAAI,mBAAmB,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YACvC,MAAM,MAAM,GAAG,IAAA,4BAAgB,EAAC,EAAE,CAAC,CAAC;YACpC,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC5B,OAAO,EAAE,KAAK,EAAE,iCAAiC,IAAA,2BAAmB,EAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACnF,CAAC;YACD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAClC,OAAO,EAAE,KAAK,EAAE,gCAAgC,IAAA,2BAAmB,EAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YACpF,CAAC;YACD,iFAAiF;YACjF,OAAO,IAAA,4BAAgB,EAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAChF,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,qEAAqE;YACrE,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACtC,IAAI,mBAAmB,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YACvC,gDAAgD;YAChD,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YACxC,IAAI,mBAAmB,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YACvC,qEAAqE;YACrE,sEAAsE;YACtE,kDAAkD;YAClD,MAAM,MAAM,GAAG,IAAA,aAAK,EAAC,GAAG,EAAE,IAAA,iBAAS,EAAC,CAAC,CAAC,CAAC,CAAC;YACxC,OAAO,IAAA,cAAM,EAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,CAAc,EAAE,GAAmB;IACxD,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC5B,OAAO,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,kBAAkB,CAAC,CAAc;IACxC,OAAO,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC;AAChD,CAAC;AAED,SAAS,aAAa,CAAC,CAAc;IACnC,MAAM,CAAC,GAAG,IAAA,4BAAgB,EAAC,CAAC,CAAC,CAAC;IAC9B,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAChD,CAAC;AAED,SAAgB,SAAS,CACvB,IAAiB,EACjB,QAAqB,EACrB,MAAsB,WAAW,EAAE;IAEnC,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACtC,IAAI,mBAAmB,CAAC,QAAQ,CAAC;QAAE,OAAO,KAAK,CAAC;IAChD,OAAO,IAAA,6BAAkB,EAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;AAChD,CAAC"}

package/dist/type-theory/cubical/interval.d.ts

@@ -0,0 +1,12 @@
+import type { CubicalTerm } from './types';
+export type IntervalValue = 0 | 1 | 'gen';
+export declare function evalInterval(t: CubicalTerm, env?: Map<string, 0 | 1>): IntervalValue;
+/**
+ * Normaliza algebraicamente una expresión de intervalo aplicando las
+ * leyes del retículo + involución. Si la expresión colapsa a un
+ * extremo, retorna i0 o i1; en caso contrario reescribe lo posible.
+ * No hace simplificaciones avanzadas (idempotencia, distributividad)
+ * para mantener el módulo predecible.
+ */
+export declare function normalizeInterval(t: CubicalTerm): CubicalTerm;
+//# sourceMappingURL=interval.d.ts.map

package/dist/type-theory/cubical/interval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"interval.d.ts","sourceRoot":"","sources":["../../../src/type-theory/cubical/interval.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAE3C,MAAM,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AAE1C,wBAAgB,YAAY,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,GAAE,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAa,GAAG,aAAa,CAwC/F;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,WAAW,GAAG,WAAW,CAiC7D"}

package/dist/type-theory/cubical/interval.js

@@ -0,0 +1,118 @@
+"use strict";
+// ============================================================
+// Cubical — Álgebra del intervalo I
+// ============================================================
+//
+// El intervalo formal I tiene dos extremos (i0, i1) y forma un
+// retículo distributivo con involución 1 - (·):
+//
+//   0 ∧ i ≡ 0       1 ∧ i ≡ i        i ∧ j ≡ j ∧ i
+//   0 ∨ i ≡ i       1 ∨ i ≡ 1        i ∨ j ≡ j ∨ i
+//   1 - 0 ≡ 1       1 - 1 ≡ 0        1 - (1 - i) ≡ i
+//
+// `evalInterval` interpreta una expresión bajo un environment de
+// asignaciones concretas {i ↦ 0 ó 1}. Cuando una variable libre del
+// intervalo no está en el environment, devolvemos 'gen' (genérico).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.evalInterval = evalInterval;
+exports.normalizeInterval = normalizeInterval;
+function evalInterval(t, env = new Map()) {
+    switch (t.kind) {
+        case 'i0':
+            return 0;
+        case 'i1':
+            return 1;
+        case 'iVar': {
+            const v = env.get(t.name);
+            return v === undefined ? 'gen' : v;
+        }
+        case 'iNeg': {
+            const a = evalInterval(t.arg, env);
+            if (a === 0)
+                return 1;
+            if (a === 1)
+                return 0;
+            return 'gen';
+        }
+        case 'iMin': {
+            const l = evalInterval(t.left, env);
+            const r = evalInterval(t.right, env);
+            // 0 ∧ x ≡ 0
+            if (l === 0 || r === 0)
+                return 0;
+            // 1 ∧ x ≡ x
+            if (l === 1)
+                return r;
+            if (r === 1)
+                return l;
+            return 'gen';
+        }
+        case 'iMax': {
+            const l = evalInterval(t.left, env);
+            const r = evalInterval(t.right, env);
+            // 1 ∨ x ≡ 1
+            if (l === 1 || r === 1)
+                return 1;
+            // 0 ∨ x ≡ x
+            if (l === 0)
+                return r;
+            if (r === 0)
+                return l;
+            return 'gen';
+        }
+        default:
+            // No es expresión de intervalo: tratamos como genérica.
+            return 'gen';
+    }
+}
+/**
+ * Normaliza algebraicamente una expresión de intervalo aplicando las
+ * leyes del retículo + involución. Si la expresión colapsa a un
+ * extremo, retorna i0 o i1; en caso contrario reescribe lo posible.
+ * No hace simplificaciones avanzadas (idempotencia, distributividad)
+ * para mantener el módulo predecible.
+ */
+function normalizeInterval(t) {
+    switch (t.kind) {
+        case 'i0':
+        case 'i1':
+        case 'iVar':
+            return t;
+        case 'iNeg': {
+            const a = normalizeInterval(t.arg);
+            if (a.kind === 'i0')
+                return { kind: 'i1' };
+            if (a.kind === 'i1')
+                return { kind: 'i0' };
+            // involución: ~ ~ x ≡ x
+            if (a.kind === 'iNeg')
+                return a.arg;
+            return { kind: 'iNeg', arg: a };
+        }
+        case 'iMin': {
+            const l = normalizeInterval(t.left);
+            const r = normalizeInterval(t.right);
+            if (l.kind === 'i0' || r.kind === 'i0')
+                return { kind: 'i0' };
+            if (l.kind === 'i1')
+                return r;
+            if (r.kind === 'i1')
+                return l;
+            return { kind: 'iMin', left: l, right: r };
+        }
+        case 'iMax': {
+            const l = normalizeInterval(t.left);
+            const r = normalizeInterval(t.right);
+            if (l.kind === 'i1' || r.kind === 'i1')
+                return { kind: 'i1' };
+            if (l.kind === 'i0')
+                return r;
+            if (r.kind === 'i0')
+                return l;
+            return { kind: 'iMax', left: l, right: r };
+        }
+        default:
+            return t;
+    }
+}
+//# sourceMappingURL=interval.js.map

package/dist/type-theory/cubical/interval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"interval.js","sourceRoot":"","sources":["../../../src/type-theory/cubical/interval.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oCAAoC;AACpC,+DAA+D;AAC/D,EAAE;AACF,+DAA+D;AAC/D,gDAAgD;AAChD,EAAE;AACF,mDAAmD;AACnD,mDAAmD;AACnD,qDAAqD;AACrD,EAAE;AACF,iEAAiE;AACjE,oEAAoE;AACpE,oEAAoE;;AAMpE,oCAwCC;AASD,8CAiCC;AAlFD,SAAgB,YAAY,CAAC,CAAc,EAAE,MAA0B,IAAI,GAAG,EAAE;IAC9E,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,IAAI;YACP,OAAO,CAAC,CAAC;QACX,KAAK,IAAI;YACP,OAAO,CAAC,CAAC;QACX,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC1B,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACtB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACpC,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACrC,YAAY;YACZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACjC,YAAY;YACZ,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACtB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACpC,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACrC,YAAY;YACZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACjC,YAAY;YACZ,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACtB,OAAO,KAAK,CAAC;QACf,CAAC;QACD;YACE,wDAAwD;YACxD,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,iBAAiB,CAAC,CAAc;IAC9C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,IAAI,CAAC;QACV,KAAK,IAAI,CAAC;QACV,KAAK,MAAM;YACT,OAAO,CAAC,CAAC;QACX,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAC3C,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAC3C,wBAAwB;YACxB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,CAAC,CAAC,GAAG,CAAC;YACpC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;QAClC,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,CAAC,CAAC;YAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,CAAC,CAAC;YAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAC7C,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,CAAC,CAAC;YAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,CAAC,CAAC;YAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAC7C,CAAC;QACD;YACE,OAAO,CAAC,CAAC;IACb,CAAC;AACH,CAAC"}

package/dist/type-theory/cubical/normalize.d.ts

@@ -0,0 +1,5 @@
+import type { CubicalTerm } from './types';
+export declare function reduceStepCubical(term: CubicalTerm): CubicalTerm;
+export declare function normalizeCubical(term: CubicalTerm, maxSteps?: number): CubicalTerm;
+export declare function isNormalCubical(term: CubicalTerm): boolean;
+//# sourceMappingURL=normalize.d.ts.map

package/dist/type-theory/cubical/normalize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["../../../src/type-theory/cubical/normalize.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAI3C,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,WAAW,GAAG,WAAW,CAoFhE;AAMD,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,WAAW,EAAE,QAAQ,SAAO,GAAG,WAAW,CAQhF;AAED,wBAAgB,eAAe,CAAC,IAAI,EAAE,WAAW,GAAG,OAAO,CAE1D"}

package/dist/type-theory/cubical/normalize.js

@@ -0,0 +1,191 @@
+"use strict";
+// ============================================================
+// Cubical — Reducción β + reglas computacionales del intervalo
+// ============================================================
+//
+// Reglas extendidas vs HoTT:
+//
+//   (λi. t) @ r           ↦ t[i := r]                  (β para path)
+//   ~0 ↦ 1   ~1 ↦ 0   ~(~i) ↦ i                       (involución)
+//   0 ∧ i ↦ 0   1 ∧ i ↦ i                              (min)
+//   0 ∨ i ↦ i   1 ∨ i ↦ 1                              (max)
+//
+// Las β estándar (app sobre lam) se heredan literalmente del fragment
+// MLTT embebido.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reduceStepCubical = reduceStepCubical;
+exports.normalizeCubical = normalizeCubical;
+exports.isNormalCubical = isNormalCubical;
+const substitute_1 = require("./substitute");
+const interval_1 = require("./interval");
+function reduceStepCubical(term) {
+    switch (term.kind) {
+        case 'i0':
+        case 'i1':
+        case 'iVar':
+        case 'var':
+        case 'universe':
+            return term;
+        case 'iNeg':
+        case 'iMin':
+        case 'iMax': {
+            const reduced = (0, interval_1.normalizeInterval)(term);
+            // normalizeInterval ya es la forma normal: si difiere estructuralmente
+            // del original, devolvemos la nueva forma; si no, intentamos reducir
+            // sub-componentes en uno de los sub-términos.
+            if (!sameKind(reduced, term))
+                return reduced;
+            if (term.kind === 'iNeg') {
+                const a2 = reduceStepCubical(term.arg);
+                if (a2 !== term.arg)
+                    return { kind: 'iNeg', arg: a2 };
+                return term;
+            }
+            const l2 = reduceStepCubical(term.left);
+            if (l2 !== term.left)
+                return { ...term, left: l2 };
+            const r2 = reduceStepCubical(term.right);
+            if (r2 !== term.right)
+                return { ...term, right: r2 };
+            return term;
+        }
+        case 'pathP': {
+            const f2 = reduceStepCubical(term.family);
+            if (f2 !== term.family)
+                return { ...term, family: f2 };
+            const l2 = reduceStepCubical(term.left);
+            if (l2 !== term.left)
+                return { ...term, left: l2 };
+            const r2 = reduceStepCubical(term.right);
+            if (r2 !== term.right)
+                return { ...term, right: r2 };
+            return term;
+        }
+        case 'pLam': {
+            const b2 = reduceStepCubical(term.body);
+            if (b2 !== term.body)
+                return { kind: 'pLam', bind: term.bind, body: b2 };
+            return term;
+        }
+        case 'pApp': {
+            // β del intervalo: (λi. t) @ r ↦ t[i := r]
+            if (term.path.kind === 'pLam') {
+                return (0, substitute_1.substituteCubical)(term.path.body, term.path.bind, term.arg);
+            }
+            const p2 = reduceStepCubical(term.path);
+            if (p2 !== term.path)
+                return { kind: 'pApp', path: p2, arg: term.arg };
+            const a2 = reduceStepCubical(term.arg);
+            if (a2 !== term.arg)
+                return { kind: 'pApp', path: term.path, arg: a2 };
+            return term;
+        }
+        case 'glue': {
+            const e2 = reduceStepCubical(term.equiv);
+            if (e2 !== term.equiv)
+                return { kind: 'glue', equiv: e2, partial: term.partial };
+            const p2 = reduceStepCubical(term.partial);
+            if (p2 !== term.partial)
+                return { kind: 'glue', equiv: term.equiv, partial: p2 };
+            return term;
+        }
+        case 'pi': {
+            const d2 = reduceStepCubical(term.domain);
+            if (d2 !== term.domain)
+                return { ...term, domain: d2 };
+            const c2 = reduceStepCubical(term.codomain);
+            if (c2 !== term.codomain)
+                return { ...term, codomain: c2 };
+            return term;
+        }
+        case 'lam': {
+            const d2 = reduceStepCubical(term.domain);
+            if (d2 !== term.domain)
+                return { ...term, domain: d2 };
+            const b2 = reduceStepCubical(term.body);
+            if (b2 !== term.body)
+                return { ...term, body: b2 };
+            return term;
+        }
+        case 'app': {
+            if (term.fn.kind === 'lam') {
+                return (0, substitute_1.substituteCubical)(term.fn.body, term.fn.bind, term.arg);
+            }
+            const fn2 = reduceStepCubical(term.fn);
+            if (fn2 !== term.fn)
+                return { kind: 'app', fn: fn2, arg: term.arg };
+            const arg2 = reduceStepCubical(term.arg);
+            if (arg2 !== term.arg)
+                return { kind: 'app', fn: term.fn, arg: arg2 };
+            return term;
+        }
+    }
+}
+function sameKind(a, b) {
+    return a.kind === b.kind;
+}
+function normalizeCubical(term, maxSteps = 1000) {
+    let current = term;
+    for (let i = 0; i < maxSteps; i++) {
+        const next = reduceStepCubical(current);
+        if (deepEqual(next, current))
+            return current;
+        current = next;
+    }
+    return current;
+}
+function isNormalCubical(term) {
+    return deepEqual(reduceStepCubical(term), term);
+}
+function deepEqual(a, b) {
+    if (a === b)
+        return true;
+    if (a.kind !== b.kind)
+        return false;
+    switch (a.kind) {
+        case 'i0':
+        case 'i1':
+            return true;
+        case 'universe':
+            return a.level === b.level;
+        case 'var':
+        case 'iVar':
+            return a.name === b.name;
+        case 'iNeg':
+            return deepEqual(a.arg, b.arg);
+        case 'iMin':
+        case 'iMax': {
+            const bb = b;
+            return deepEqual(a.left, bb.left) && deepEqual(a.right, bb.right);
+        }
+        case 'pathP': {
+            const bb = b;
+            return (deepEqual(a.family, bb.family) && deepEqual(a.left, bb.left) && deepEqual(a.right, bb.right));
+        }
+        case 'pLam': {
+            const bb = b;
+            return a.bind === bb.bind && deepEqual(a.body, bb.body);
+        }
+        case 'pApp': {
+            const bb = b;
+            return deepEqual(a.path, bb.path) && deepEqual(a.arg, bb.arg);
+        }
+        case 'glue': {
+            const bb = b;
+            return deepEqual(a.equiv, bb.equiv) && deepEqual(a.partial, bb.partial);
+        }
+        case 'pi': {
+            const bb = b;
+            return (a.bind === bb.bind && deepEqual(a.domain, bb.domain) && deepEqual(a.codomain, bb.codomain));
+        }
+        case 'lam': {
+            const bb = b;
+            return a.bind === bb.bind && deepEqual(a.domain, bb.domain) && deepEqual(a.body, bb.body);
+        }
+        case 'app': {
+            const bb = b;
+            return deepEqual(a.fn, bb.fn) && deepEqual(a.arg, bb.arg);
+        }
+    }
+}
+//# sourceMappingURL=normalize.js.map

package/dist/type-theory/cubical/normalize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.js","sourceRoot":"","sources":["../../../src/type-theory/cubical/normalize.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+DAA+D;AAC/D,+DAA+D;AAC/D,EAAE;AACF,6BAA6B;AAC7B,EAAE;AACF,qEAAqE;AACrE,mEAAmE;AACnE,6DAA6D;AAC7D,6DAA6D;AAC7D,EAAE;AACF,sEAAsE;AACtE,iBAAiB;;AAMjB,8CAoFC;AAMD,4CAQC;AAED,0CAEC;AAzGD,6CAAiD;AACjD,yCAA+C;AAE/C,SAAgB,iBAAiB,CAAC,IAAiB;IACjD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC;QACV,KAAK,IAAI,CAAC;QACV,KAAK,MAAM,CAAC;QACZ,KAAK,KAAK,CAAC;QACX,KAAK,UAAU;YACb,OAAO,IAAI,CAAC;QACd,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,OAAO,GAAG,IAAA,4BAAiB,EAAC,IAAI,CAAC,CAAC;YACxC,uEAAuE;YACvE,qEAAqE;YACrE,8CAA8C;YAC9C,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC;gBAAE,OAAO,OAAO,CAAC;YAC7C,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACvC,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG;oBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;gBACtD,OAAO,IAAI,CAAC;YACd,CAAC;YACD,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACnD,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,EAAE,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,EAAE,KAAK,IAAI,CAAC,MAAM;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YACvD,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACnD,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,EAAE,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACzE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,2CAA2C;YAC3C,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBAC9B,OAAO,IAAA,8BAAiB,EAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YACrE,CAAC;YACD,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;YACvE,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACvC,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG;gBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YACvE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,EAAE,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;YACjF,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3C,IAAI,EAAE,KAAK,IAAI,CAAC,OAAO;gBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YACjF,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,EAAE,KAAK,IAAI,CAAC,MAAM;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YACvD,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5C,IAAI,EAAE,KAAK,IAAI,CAAC,QAAQ;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;YAC3D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,EAAE,KAAK,IAAI,CAAC,MAAM;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YACvD,MAAM,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACnD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBAC3B,OAAO,IAAA,8BAAiB,EAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YACjE,CAAC;YACD,MAAM,GAAG,GAAG,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACvC,IAAI,GAAG,KAAK,IAAI,CAAC,EAAE;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;YACpE,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACzC,IAAI,IAAI,KAAK,IAAI,CAAC,GAAG;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;YACtE,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,CAAc,EAAE,CAAc;IAC9C,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC;AAC3B,CAAC;AAED,SAAgB,gBAAgB,CAAC,IAAiB,EAAE,QAAQ,GAAG,IAAI;IACjE,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC;QAC7C,OAAO,GAAG,IAAI,CAAC;IACjB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAgB,eAAe,CAAC,IAAiB;IAC/C,OAAO,SAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,SAAS,CAAC,CAAc,EAAE,CAAc;IAC/C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,IAAI,CAAC;QACV,KAAK,IAAI;YACP,OAAO,IAAI,CAAC;QACd,KAAK,UAAU;YACb,OAAO,CAAC,CAAC,KAAK,KAAM,CAAc,CAAC,KAAK,CAAC;QAC3C,KAAK,KAAK,CAAC;QACX,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,KAAM,CAAc,CAAC,IAAI,CAAC;QACzC,KAAK,MAAM;YACT,OAAO,SAAS,CAAC,CAAC,CAAC,GAAG,EAAG,CAAc,CAAC,GAAG,CAAC,CAAC;QAC/C,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QACpE,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,CACL,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAC7F,CAAC;QACJ,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAC1D,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAChE,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC;QAC1E,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,CACL,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,CAC3F,CAAC;QACJ,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAC5F,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/type-theory/cubical/path-algebra.d.ts

@@ -0,0 +1,12 @@
+import type { CubicalTerm } from './types';
+export declare function reflPath(x: CubicalTerm): CubicalTerm;
+export declare function pathInverse(p: CubicalTerm): CubicalTerm;
+export declare function pathCompose(p: CubicalTerm, q: CubicalTerm): CubicalTerm;
+/**
+ * Glue: convierte una equivalencia A ≃ B (codificada como par Σ con
+ * dominio y codominio) en un Path en el universo. Es el precursor
+ * sintáctico de la computación de ua en CTT — aquí no implementamos
+ * la regla de cómputo full, sólo la introducción del término.
+ */
+export declare function glue(equiv: CubicalTerm, partial: CubicalTerm): CubicalTerm;
+//# sourceMappingURL=path-algebra.d.ts.map

package/dist/type-theory/cubical/path-algebra.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-algebra.d.ts","sourceRoot":"","sources":["../../../src/type-theory/cubical/path-algebra.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAG3C,wBAAgB,QAAQ,CAAC,CAAC,EAAE,WAAW,GAAG,WAAW,CAGpD;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,WAAW,GAAG,WAAW,CAOvD;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,WAAW,GAAG,WAAW,CAkBvE;AAED;;;;;GAKG;AACH,wBAAgB,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,GAAG,WAAW,CAE1E"}