@stevenvo780/st-lang 4.1.0 → 4.3.0

package/dist/lambda-calc/reduce.d.ts

@@ -0,0 +1,18 @@
+import type { Term } from './types';
+export type BetaStrategy = 'leftmost-outermost' | 'leftmost-innermost';
+export type NormalStrategy = 'normal' | 'cbn' | 'cbv';
+export declare function betaStep(t: Term, strategy?: BetaStrategy): Term | null;
+export declare function etaStep(t: Term): Term | null;
+export declare function isNormalForm(t: Term): boolean;
+export declare function isWeakHeadNormalForm(t: Term): boolean;
+export interface NormalizeResult {
+    result: Term;
+    steps: number;
+    terminated: boolean;
+}
+export interface NormalizeOpts {
+    maxSteps?: number;
+    strategy?: NormalStrategy;
+}
+export declare function normalize(t: Term, opts?: NormalizeOpts): NormalizeResult;
+//# sourceMappingURL=reduce.d.ts.map

package/dist/lambda-calc/reduce.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce.d.ts","sourceRoot":"","sources":["../../src/lambda-calc/reduce.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAGpC,MAAM,MAAM,YAAY,GAAG,oBAAoB,GAAG,oBAAoB,CAAC;AACvE,MAAM,MAAM,cAAc,GAAG,QAAQ,GAAG,KAAK,GAAG,KAAK,CAAC;AAItD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,GAAE,YAAmC,GAAG,IAAI,GAAG,IAAI,CAE5F;AAgDD,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,CAuB5C;AAGD,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAE7C;AAID,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAWrD;AAED,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,IAAI,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,OAAO,CAAC;CACrB;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,cAAc,CAAC;CAC3B;AAKD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,GAAE,aAAkB,GAAG,eAAe,CAW5E"}

package/dist/lambda-calc/reduce.js

@@ -0,0 +1,174 @@
+"use strict";
+// ============================================================
+// λ-cálculo untyped — β/η reducción y estrategias de normalización
+// ============================================================
+//
+// Estrategias soportadas:
+//   - 'normal'        leftmost-outermost; corresponde a normalización
+//                      teórica (encuentra forma normal si existe).
+//   - 'cbn'           call-by-name: reduce la cabeza, no entra bajo
+//                      lambdas (devuelve weak-head-normal form).
+//   - 'cbv'           call-by-value (applicative order): argumentos
+//                      reducidos a valor antes que la aplicación.
+//
+// Estrategias de paso simple (betaStep):
+//   - 'leftmost-outermost' (default) — normaliza términos como SKK→I.
+//   - 'leftmost-innermost'           — reduce dentro de los args primero.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.betaStep = betaStep;
+exports.etaStep = etaStep;
+exports.isNormalForm = isNormalForm;
+exports.isWeakHeadNormalForm = isWeakHeadNormalForm;
+exports.normalize = normalize;
+const substitution_1 = require("./substitution");
+// Devuelve el término reducido en UN paso, o `null` si no hay redex
+// aplicable bajo la estrategia.
+function betaStep(t, strategy = 'leftmost-outermost') {
+    return strategy === 'leftmost-outermost' ? stepLO(t) : stepLI(t);
+}
+// Leftmost-outermost: redex más a la izquierda y más superficial.
+function stepLO(t) {
+    switch (t.kind) {
+        case 'var':
+            return null;
+        case 'abs': {
+            const b2 = stepLO(t.body);
+            return b2 === null ? null : { kind: 'abs', param: t.param, body: b2 };
+        }
+        case 'app': {
+            if (t.fn.kind === 'abs') {
+                return (0, substitution_1.substitute)(t.fn.body, t.fn.param, t.arg);
+            }
+            const fn2 = stepLO(t.fn);
+            if (fn2 !== null)
+                return { kind: 'app', fn: fn2, arg: t.arg };
+            const arg2 = stepLO(t.arg);
+            if (arg2 !== null)
+                return { kind: 'app', fn: t.fn, arg: arg2 };
+            return null;
+        }
+    }
+}
+// Leftmost-innermost: reduce primero los redex dentro de los args.
+function stepLI(t) {
+    switch (t.kind) {
+        case 'var':
+            return null;
+        case 'abs': {
+            const b2 = stepLI(t.body);
+            return b2 === null ? null : { kind: 'abs', param: t.param, body: b2 };
+        }
+        case 'app': {
+            const fn2 = stepLI(t.fn);
+            if (fn2 !== null)
+                return { kind: 'app', fn: fn2, arg: t.arg };
+            const arg2 = stepLI(t.arg);
+            if (arg2 !== null)
+                return { kind: 'app', fn: t.fn, arg: arg2 };
+            if (t.fn.kind === 'abs') {
+                return (0, substitution_1.substitute)(t.fn.body, t.fn.param, t.arg);
+            }
+            return null;
+        }
+    }
+}
+// η-reducción: (λx. f x) → f cuando x ∉ FV(f).
+// Sólo un paso; busca en orden leftmost-outermost.
+function etaStep(t) {
+    switch (t.kind) {
+        case 'var':
+            return null;
+        case 'abs': {
+            if (t.body.kind === 'app' &&
+                t.body.arg.kind === 'var' &&
+                t.body.arg.name === t.param &&
+                !(0, substitution_1.freeVars)(t.body.fn).has(t.param)) {
+                return t.body.fn;
+            }
+            const b2 = etaStep(t.body);
+            return b2 === null ? null : { kind: 'abs', param: t.param, body: b2 };
+        }
+        case 'app': {
+            const fn2 = etaStep(t.fn);
+            if (fn2 !== null)
+                return { kind: 'app', fn: fn2, arg: t.arg };
+            const arg2 = etaStep(t.arg);
+            return arg2 === null ? null : { kind: 'app', fn: t.fn, arg: arg2 };
+        }
+    }
+}
+// ¿No hay redex β bajo la estrategia leftmost-outermost?
+function isNormalForm(t) {
+    return stepLO(t) === null;
+}
+// Weak-head normal form: no hay redex en posición de cabeza.
+// (λx. M) es WHNF; una aplicación es WHNF si su cabeza es variable.
+function isWeakHeadNormalForm(t) {
+    switch (t.kind) {
+        case 'var':
+        case 'abs':
+            return true;
+        case 'app': {
+            let head = t;
+            while (head.kind === 'app')
+                head = head.fn;
+            return head.kind === 'var';
+        }
+    }
+}
+// Itera reducciones hasta forma normal (o WHNF según estrategia).
+// `terminated=true` significa que no quedan redex; `false` indica que
+// agotó `maxSteps` (típico para términos divergentes como Ω).
+function normalize(t, opts = {}) {
+    const maxSteps = opts.maxSteps ?? 1000;
+    const strategy = opts.strategy ?? 'normal';
+    let current = t;
+    let steps = 0;
+    for (; steps < maxSteps; steps += 1) {
+        const next = oneStep(current, strategy);
+        if (next === null)
+            return { result: current, steps, terminated: true };
+        current = next;
+    }
+    return { result: current, steps, terminated: false };
+}
+function oneStep(t, strategy) {
+    switch (strategy) {
+        case 'normal':
+            return stepLO(t);
+        case 'cbn':
+            return stepCBN(t);
+        case 'cbv':
+            return stepCBV(t);
+    }
+}
+// Call-by-name: sólo reduce el redex en la posición de cabeza, sin
+// bajar bajo lambdas. Termina en WHNF.
+function stepCBN(t) {
+    if (t.kind === 'app') {
+        if (t.fn.kind === 'abs') {
+            return (0, substitution_1.substitute)(t.fn.body, t.fn.param, t.arg);
+        }
+        const fn2 = stepCBN(t.fn);
+        return fn2 === null ? null : { kind: 'app', fn: fn2, arg: t.arg };
+    }
+    return null;
+}
+// Call-by-value (applicative order): reduce función a valor, luego
+// arg a valor, luego β. Tampoco entra bajo λ. Termina en WHNF.
+function stepCBV(t) {
+    if (t.kind === 'app') {
+        const fn2 = stepCBV(t.fn);
+        if (fn2 !== null)
+            return { kind: 'app', fn: fn2, arg: t.arg };
+        const arg2 = stepCBV(t.arg);
+        if (arg2 !== null)
+            return { kind: 'app', fn: t.fn, arg: arg2 };
+        if (t.fn.kind === 'abs') {
+            return (0, substitution_1.substitute)(t.fn.body, t.fn.param, t.arg);
+        }
+        return null;
+    }
+    return null;
+}
+//# sourceMappingURL=reduce.js.map

package/dist/lambda-calc/reduce.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduce.js","sourceRoot":"","sources":["../../src/lambda-calc/reduce.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mEAAmE;AACnE,+DAA+D;AAC/D,EAAE;AACF,0BAA0B;AAC1B,sEAAsE;AACtE,mEAAmE;AACnE,oEAAoE;AACpE,iEAAiE;AACjE,oEAAoE;AACpE,kEAAkE;AAClE,EAAE;AACF,yCAAyC;AACzC,sEAAsE;AACtE,0EAA0E;;AAU1E,4BAEC;AAgDD,0BAuBC;AAGD,oCAEC;AAID,oDAWC;AAgBD,8BAWC;AA/HD,iDAAsD;AAKtD,oEAAoE;AACpE,gCAAgC;AAChC,SAAgB,QAAQ,CAAC,CAAO,EAAE,WAAyB,oBAAoB;IAC7E,OAAO,QAAQ,KAAK,oBAAoB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,kEAAkE;AAClE,SAAS,MAAM,CAAC,CAAO;IACrB,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,IAAI,CAAC;QACd,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC1B,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QACxE,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACxB,OAAO,IAAA,yBAAU,EAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAClD,CAAC;YACD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,GAAG,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;YAC9D,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;YAC/D,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED,mEAAmE;AACnE,SAAS,MAAM,CAAC,CAAO;IACrB,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,IAAI,CAAC;QACd,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC1B,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QACxE,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,GAAG,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;YAC9D,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;YAC/D,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACxB,OAAO,IAAA,yBAAU,EAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAClD,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED,+CAA+C;AAC/C,mDAAmD;AACnD,SAAgB,OAAO,CAAC,CAAO;IAC7B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,IAAI,CAAC;QACd,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IACE,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,KAAK;gBACrB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK;gBACzB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK;gBAC3B,CAAC,IAAA,uBAAQ,EAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EACjC,CAAC;gBACD,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,CAAC;YACD,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC3B,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QACxE,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC1B,IAAI,GAAG,KAAK,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;YAC9D,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5B,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QACrE,CAAC;IACH,CAAC;AACH,CAAC;AAED,yDAAyD;AACzD,SAAgB,YAAY,CAAC,CAAO;IAClC,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;AAC5B,CAAC;AAED,6DAA6D;AAC7D,oEAAoE;AACpE,SAAgB,oBAAoB,CAAC,CAAO;IAC1C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC;QACX,KAAK,KAAK;YACR,OAAO,IAAI,CAAC;QACd,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,IAAI,GAAS,CAAC,CAAC;YACnB,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK;gBAAE,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC;QAC7B,CAAC;IACH,CAAC;AACH,CAAC;AAaD,kEAAkE;AAClE,sEAAsE;AACtE,8DAA8D;AAC9D,SAAgB,SAAS,CAAC,CAAO,EAAE,OAAsB,EAAE;IACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC;IACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;IAC3C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACxC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QACvE,OAAO,GAAG,IAAI,CAAC;IACjB,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;AACvD,CAAC;AAED,SAAS,OAAO,CAAC,CAAO,EAAE,QAAwB;IAChD,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,QAAQ;YACX,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,KAAK;YACR,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;QACpB,KAAK,KAAK;YACR,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;AACH,CAAC;AAED,mEAAmE;AACnE,uCAAuC;AACvC,SAAS,OAAO,CAAC,CAAO;IACtB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACxB,OAAO,IAAA,yBAAU,EAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;IACpE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,mEAAmE;AACnE,+DAA+D;AAC/D,SAAS,OAAO,CAAC,CAAO;IACtB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,GAAG,KAAK,IAAI;YAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;QAC9D,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QAC/D,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACxB,OAAO,IAAA,yBAAU,EAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/lambda-calc/substitution.d.ts

@@ -0,0 +1,6 @@
+import type { Term } from './types';
+export declare function freeVars(t: Term): Set<string>;
+export declare function makeFreshSupply(seed?: number): () => string;
+export declare function alphaRename(t: Term, freshSupply: () => string): Term;
+export declare function substitute(t: Term, varName: string, replacement: Term): Term;
+//# sourceMappingURL=substitution.d.ts.map

package/dist/lambda-calc/substitution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"substitution.d.ts","sourceRoot":"","sources":["../../src/lambda-calc/substitution.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAGpC,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAI7C;AAwCD,wBAAgB,eAAe,CAAC,IAAI,SAAI,GAAG,MAAM,MAAM,CAGtD;AAgBD,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,MAAM,GAAG,IAAI,CAEpE;AAoBD,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,GAAG,IAAI,CAG5E"}

package/dist/lambda-calc/substitution.js

@@ -0,0 +1,120 @@
+"use strict";
+// ============================================================
+// λ-cálculo untyped — Variables libres, α-renombrado, sustitución
+// capture-avoiding
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.freeVars = freeVars;
+exports.makeFreshSupply = makeFreshSupply;
+exports.alphaRename = alphaRename;
+exports.substitute = substitute;
+// Free variables del término.
+function freeVars(t) {
+    const acc = new Set();
+    collectFree(t, acc);
+    return acc;
+}
+function collectFree(t, acc) {
+    switch (t.kind) {
+        case 'var':
+            acc.add(t.name);
+            return;
+        case 'app':
+            collectFree(t.fn, acc);
+            collectFree(t.arg, acc);
+            return;
+        case 'abs': {
+            const inner = new Set();
+            collectFree(t.body, inner);
+            inner.delete(t.param);
+            for (const x of inner)
+                acc.add(x);
+            return;
+        }
+    }
+}
+// Conjunto de todos los nombres mencionados (libres o ligados).
+function allNames(t, acc = new Set()) {
+    switch (t.kind) {
+        case 'var':
+            acc.add(t.name);
+            return acc;
+        case 'app':
+            allNames(t.fn, acc);
+            allNames(t.arg, acc);
+            return acc;
+        case 'abs':
+            acc.add(t.param);
+            allNames(t.body, acc);
+            return acc;
+    }
+}
+// Generador de nombres frescos. Mantiene un contador local para
+// reproducibilidad — el patrón es `<base>#<n>`.
+function makeFreshSupply(seed = 0) {
+    let n = seed;
+    return () => `_x${n++}`;
+}
+function freshName(base, avoid) {
+    // Quita un sufijo `#N` previo para no acumular hashes.
+    const stripped = base.replace(/#\d+$/, '');
+    let i = 0;
+    let candidate = `${stripped}#${i}`;
+    while (avoid.has(candidate)) {
+        i += 1;
+        candidate = `${stripped}#${i}`;
+    }
+    return candidate;
+}
+// α-renombra todos los binders del término usando `freshSupply`. Útil
+// para canonicalizar términos sin ambigüedad de nombres.
+function alphaRename(t, freshSupply) {
+    return rename(t, new Map(), freshSupply);
+}
+function rename(t, env, supply) {
+    switch (t.kind) {
+        case 'var':
+            return { kind: 'var', name: env.get(t.name) ?? t.name };
+        case 'app':
+            return { kind: 'app', fn: rename(t.fn, env, supply), arg: rename(t.arg, env, supply) };
+        case 'abs': {
+            const fresh = supply();
+            const newEnv = new Map(env);
+            newEnv.set(t.param, fresh);
+            return { kind: 'abs', param: fresh, body: rename(t.body, newEnv, supply) };
+        }
+    }
+}
+// Sustitución capture-avoiding: t[varName := replacement].
+// Cuando un binder choca con FV(replacement), α-renombra el binder a
+// un nombre fresco antes de descender — evita captura silenciosa.
+function substitute(t, varName, replacement) {
+    const fvRep = freeVars(replacement);
+    return subst(t, varName, replacement, fvRep);
+}
+function subst(t, name, value, fvValue) {
+    switch (t.kind) {
+        case 'var':
+            return t.name === name ? value : t;
+        case 'app':
+            return {
+                kind: 'app',
+                fn: subst(t.fn, name, value, fvValue),
+                arg: subst(t.arg, name, value, fvValue),
+            };
+        case 'abs': {
+            if (t.param === name)
+                return t; // ligado: la sustitución se detiene
+            if (!fvValue.has(t.param)) {
+                return { kind: 'abs', param: t.param, body: subst(t.body, name, value, fvValue) };
+            }
+            // Captura inminente: renombra el binder.
+            const avoid = new Set([...fvValue, ...allNames(t.body)]);
+            avoid.add(name);
+            const fresh = freshName(t.param, avoid);
+            const renamedBody = subst(t.body, t.param, { kind: 'var', name: fresh }, new Set([fresh]));
+            return { kind: 'abs', param: fresh, body: subst(renamedBody, name, value, fvValue) };
+        }
+    }
+}
+//# sourceMappingURL=substitution.js.map

package/dist/lambda-calc/substitution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"substitution.js","sourceRoot":"","sources":["../../src/lambda-calc/substitution.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kEAAkE;AAClE,mBAAmB;AACnB,+DAA+D;;AAK/D,4BAIC;AAwCD,0CAGC;AAgBD,kCAEC;AAoBD,gCAGC;AAzFD,8BAA8B;AAC9B,SAAgB,QAAQ,CAAC,CAAO;IAC9B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACpB,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,WAAW,CAAC,CAAO,EAAE,GAAgB;IAC5C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO;QACT,KAAK,KAAK;YACR,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACvB,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,OAAO;QACT,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;YAChC,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC3B,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACtB,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,OAAO;QACT,CAAC;IACH,CAAC;AACH,CAAC;AAED,gEAAgE;AAChE,SAAS,QAAQ,CAAC,CAAO,EAAE,MAAmB,IAAI,GAAG,EAAE;IACrD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO,GAAG,CAAC;QACb,KAAK,KAAK;YACR,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACpB,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACrB,OAAO,GAAG,CAAC;QACb,KAAK,KAAK;YACR,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjB,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACtB,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAED,gEAAgE;AAChE,gDAAgD;AAChD,SAAgB,eAAe,CAAC,IAAI,GAAG,CAAC;IACtC,IAAI,CAAC,GAAG,IAAI,CAAC;IACb,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;AAC1B,CAAC;AAED,SAAS,SAAS,CAAC,IAAY,EAAE,KAAkB;IACjD,uDAAuD;IACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IAC3C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,SAAS,GAAG,GAAG,QAAQ,IAAI,CAAC,EAAE,CAAC;IACnC,OAAO,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;QAC5B,CAAC,IAAI,CAAC,CAAC;QACP,SAAS,GAAG,GAAG,QAAQ,IAAI,CAAC,EAAE,CAAC;IACjC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,sEAAsE;AACtE,yDAAyD;AACzD,SAAgB,WAAW,CAAC,CAAO,EAAE,WAAyB;IAC5D,OAAO,MAAM,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,WAAW,CAAC,CAAC;AAC3C,CAAC;AAED,SAAS,MAAM,CAAC,CAAO,EAAE,GAAwB,EAAE,MAAoB;IACrE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC1D,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC;QACzF,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;QAC7E,CAAC;IACH,CAAC;AACH,CAAC;AAED,2DAA2D;AAC3D,qEAAqE;AACrE,kEAAkE;AAClE,SAAgB,UAAU,CAAC,CAAO,EAAE,OAAe,EAAE,WAAiB;IACpE,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC;IACpC,OAAO,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;AAC/C,CAAC;AAED,SAAS,KAAK,CAAC,CAAO,EAAE,IAAY,EAAE,KAAW,EAAE,OAAoB;IACrE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,KAAK,KAAK;YACR,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC;gBACrC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC;aACxC,CAAC;QACJ,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI;gBAAE,OAAO,CAAC,CAAC,CAAC,oCAAoC;YACpE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;YACpF,CAAC;YACD,yCAAyC;YACzC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,OAAO,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACxC,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3F,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;QACvF,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/lambda-calc/types.d.ts

@@ -0,0 +1,19 @@
+export type Term = {
+    kind: 'var';
+    name: string;
+} | {
+    kind: 'abs';
+    param: string;
+    body: Term;
+} | {
+    kind: 'app';
+    fn: Term;
+    arg: Term;
+};
+export declare const v: (name: string) => Term;
+export declare const lam: (param: string, body: Term) => Term;
+export declare const ap: (fn: Term, arg: Term) => Term;
+export declare const apN: (head: Term, ...args: Term[]) => Term;
+export declare function alphaEq(a: Term, b: Term): boolean;
+export declare function termToString(t: Term): string;
+//# sourceMappingURL=types.d.ts.map

package/dist/lambda-calc/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/lambda-calc/types.ts"],"names":[],"mappings":"AASA,MAAM,MAAM,IAAI,GACZ;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC7B;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE,GAC1C;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,EAAE,EAAE,IAAI,CAAC;IAAC,GAAG,EAAE,IAAI,CAAA;CAAE,CAAC;AAGzC,eAAO,MAAM,CAAC,GAAI,MAAM,MAAM,KAAG,IAA+B,CAAC;AACjE,eAAO,MAAM,GAAG,GAAI,OAAO,MAAM,EAAE,MAAM,IAAI,KAAG,IAAsC,CAAC;AACvF,eAAO,MAAM,EAAE,GAAI,IAAI,IAAI,EAAE,KAAK,IAAI,KAAG,IAAkC,CAAC;AAG5E,eAAO,MAAM,GAAG,GAAI,MAAM,IAAI,EAAE,GAAG,MAAM,IAAI,EAAE,KAAG,IAA6B,CAAC;AAIhF,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAEjD;AAuCD,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAY5C"}

package/dist/lambda-calc/types.js

@@ -0,0 +1,72 @@
+"use strict";
+// ============================================================
+// λ-cálculo untyped — Términos, constructores y serialización
+// ============================================================
+//
+// Distinto al módulo curry-howard (typed λ-cálculo con conexión a
+// deducción natural): aquí trabajamos λ puro, sin tipos, con
+// β/η-reducción, varias estrategias de normalización y los
+// combinadores clásicos (I, K, S, Y) + Church numerals.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.apN = exports.ap = exports.lam = exports.v = void 0;
+exports.alphaEq = alphaEq;
+exports.termToString = termToString;
+// ---------- Constructores convenientes ----------
+const v = (name) => ({ kind: 'var', name });
+exports.v = v;
+const lam = (param, body) => ({ kind: 'abs', param, body });
+exports.lam = lam;
+const ap = (fn, arg) => ({ kind: 'app', fn, arg });
+exports.ap = ap;
+// Aplicación n-aria por la izquierda: apN(f, a, b, c) = ((f a) b) c
+const apN = (head, ...args) => args.reduce(exports.ap, head);
+exports.apN = apN;
+// Igualdad estructural módulo α (alpha-equivalencia).
+// Compara términos renombrando binders a posiciones canónicas.
+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; // free vars
+            return ia === ib;
+        }
+        case 'abs': {
+            const bb = b;
+            const idx = counter.n++;
+            const newA = new Map(envA);
+            newA.set(a.param, idx);
+            const newB = new Map(envB);
+            newB.set(bb.param, idx);
+            return alphaEqEnv(a.body, bb.body, 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));
+        }
+    }
+}
+// Pretty-printer minimalista. Aplicación es asociativa a la izquierda,
+// abstracción se extiende lo más posible a la derecha.
+function termToString(t) {
+    switch (t.kind) {
+        case 'var':
+            return t.name;
+        case 'abs':
+            return `(λ${t.param}.${termToString(t.body)})`;
+        case 'app': {
+            const fn = termToString(t.fn);
+            const arg = t.arg.kind === 'app' ? `(${termToString(t.arg)})` : termToString(t.arg);
+            return `(${fn} ${arg})`;
+        }
+    }
+}
+//# sourceMappingURL=types.js.map

package/dist/lambda-calc/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/lambda-calc/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,8DAA8D;AAC9D,+DAA+D;AAC/D,EAAE;AACF,kEAAkE;AAClE,6DAA6D;AAC7D,2DAA2D;AAC3D,wDAAwD;;;AAiBxD,0BAEC;AAuCD,oCAYC;AA/DD,mDAAmD;AAC5C,MAAM,CAAC,GAAG,CAAC,IAAY,EAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AAApD,QAAA,CAAC,KAAmD;AAC1D,MAAM,GAAG,GAAG,CAAC,KAAa,EAAE,IAAU,EAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AAA1E,QAAA,GAAG,OAAuE;AAChF,MAAM,EAAE,GAAG,CAAC,EAAQ,EAAE,GAAS,EAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;AAA/D,QAAA,EAAE,MAA6D;AAE5E,oEAAoE;AAC7D,MAAM,GAAG,GAAG,CAAC,IAAU,EAAE,GAAG,IAAY,EAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,UAAE,EAAE,IAAI,CAAC,CAAC;AAAnE,QAAA,GAAG,OAAgE;AAEhF,sDAAsD;AACtD,+DAA+D;AAC/D,SAAgB,OAAO,CAAC,CAAO,EAAE,CAAO;IACtC,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,CAAO,EACP,CAAO,EACP,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,CAAC,YAAY;YACjF,OAAO,EAAE,KAAK,EAAE,CAAC;QACnB,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,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,KAAK,EAAE,GAAG,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACxB,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1D,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;AAED,uEAAuE;AACvE,uDAAuD;AACvD,SAAgB,YAAY,CAAC,CAAO;IAClC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,KAAK;YACR,OAAO,KAAK,CAAC,CAAC,KAAK,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QACjD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC9B,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACpF,OAAO,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC;QAC1B,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/profiles/ctl/check.d.ts

@@ -0,0 +1,13 @@
+import type { CTLFormula, KripkeStructure } from './types';
+/**
+ * Model checking de Computation Tree Logic.
+ * Devuelve un mapa `stateId → φ se cumple en ese estado`.
+ */
+export declare function modelCheckCTL(M: KripkeStructure, phi: CTLFormula): Map<string, boolean>;
+/**
+ * `M ⊨ φ` cuando φ se cumple en todos los estados iniciales.
+ * Si `initial` está vacío, devuelve `true` por vacuidad (consistente con
+ * la lectura "no hay contraejemplo en S0").
+ */
+export declare function satisfiesCTL(M: KripkeStructure, phi: CTLFormula): boolean;
+//# sourceMappingURL=check.d.ts.map

package/dist/profiles/ctl/check.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"check.d.ts","sourceRoot":"","sources":["../../../src/profiles/ctl/check.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAkU3D;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,eAAe,EAAE,GAAG,EAAE,UAAU,GAAG,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAGvF;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,eAAe,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO,CAMzE"}