@stevenvo780/st-lang 4.4.0 → 4.5.0

package/dist/nbe/types.js

@@ -0,0 +1,117 @@
+"use strict";
+// ============================================================
+// NbE para STLC — Tipos sintácticos y dominio semántico
+// ============================================================
+//
+// Términos del λ-cálculo simplemente tipado (STLC) y los valores
+// semánticos sobre los que evaluamos. La separación entre sintaxis
+// (Term, Type) y semántica (Value, Neutral) es lo que hace al
+// algoritmo NbE limpio: evaluar produce valores; reificar los baja
+// otra vez a términos en forma normal η-larga.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.vClosure = exports.vNeutral = exports.vNeutralVar = exports.apN = exports.ap = exports.lam = exports.v = exports.tArr = exports.tBase = void 0;
+exports.alphaEq = alphaEq;
+exports.typeEq = typeEq;
+exports.typeToString = typeToString;
+exports.termToString = termToString;
+// ---------- Constructores sintácticos ----------
+const tBase = (name) => ({ kind: 'base', name });
+exports.tBase = tBase;
+const tArr = (from, to) => ({ kind: 'arrow', from, to });
+exports.tArr = tArr;
+const v = (name) => ({ kind: 'var', name });
+exports.v = v;
+const lam = (param, paramType, body) => ({
+    kind: 'abs',
+    param,
+    paramType,
+    body,
+});
+exports.lam = lam;
+const ap = (fn, arg) => ({ kind: 'app', fn, arg });
+exports.ap = ap;
+const apN = (head, ...args) => args.reduce(exports.ap, head);
+exports.apN = apN;
+// ---------- Constructores semánticos ----------
+const vNeutralVar = (name) => ({
+    kind: 'neutral',
+    head: { kind: 'var', name },
+});
+exports.vNeutralVar = vNeutralVar;
+const vNeutral = (head) => ({ kind: 'neutral', head });
+exports.vNeutral = vNeutral;
+const vClosure = (env, param, paramType, body) => ({
+    kind: 'closure',
+    env,
+    param,
+    paramType,
+    body,
+});
+exports.vClosure = vClosure;
+// ---------- Igualdad estructural módulo α ----------
+// Renombra binders a posiciones canónicas para comparar.
+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;
+            if (!typeEq(a.paramType, bb.paramType))
+                return false;
+            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));
+        }
+    }
+}
+function typeEq(a, b) {
+    if (a.kind !== b.kind)
+        return false;
+    if (a.kind === 'base' && b.kind === 'base')
+        return a.name === b.name;
+    if (a.kind === 'arrow' && b.kind === 'arrow') {
+        return typeEq(a.from, b.from) && typeEq(a.to, b.to);
+    }
+    return false;
+}
+// Pretty-printer mínimo para términos y tipos (útil en tests/debug).
+function typeToString(t) {
+    if (t.kind === 'base')
+        return t.name;
+    // arrow es asociativo a la derecha: A → B → C  ≡  A → (B → C)
+    const from = t.from.kind === 'arrow' ? `(${typeToString(t.from)})` : typeToString(t.from);
+    return `${from} → ${typeToString(t.to)}`;
+}
+function termToString(t) {
+    switch (t.kind) {
+        case 'var':
+            return t.name;
+        case 'abs':
+            return `(λ${t.param}:${typeToString(t.paramType)}.${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/nbe/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/nbe/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wDAAwD;AACxD,+DAA+D;AAC/D,EAAE;AACF,iEAAiE;AACjE,mEAAmE;AACnE,8DAA8D;AAC9D,mEAAmE;AACnE,+CAA+C;;;AAmD/C,0BAEC;AAsCD,wBAOC;AAGD,oCAKC;AAED,oCAYC;AAnGD,kDAAkD;AAC3C,MAAM,KAAK,GAAG,CAAC,IAAY,EAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAAzD,QAAA,KAAK,SAAoD;AAC/D,MAAM,IAAI,GAAG,CAAC,IAAU,EAAE,EAAQ,EAAQ,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;AAArE,QAAA,IAAI,QAAiE;AAE3E,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,SAAe,EAAE,IAAU,EAAQ,EAAE,CAAC,CAAC;IACxE,IAAI,EAAE,KAAK;IACX,KAAK;IACL,SAAS;IACT,IAAI;CACL,CAAC,CAAC;AALU,QAAA,GAAG,OAKb;AACI,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;AACrE,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,iDAAiD;AAC1C,MAAM,WAAW,GAAG,CAAC,IAAY,EAAS,EAAE,CAAC,CAAC;IACnD,IAAI,EAAE,SAAS;IACf,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE;CAC5B,CAAC,CAAC;AAHU,QAAA,WAAW,eAGrB;AACI,MAAM,QAAQ,GAAG,CAAC,IAAa,EAAS,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;AAAjE,QAAA,QAAQ,YAAyD;AACvE,MAAM,QAAQ,GAAG,CAAC,GAAQ,EAAE,KAAa,EAAE,SAAe,EAAE,IAAU,EAAS,EAAE,CAAC,CAAC;IACxF,IAAI,EAAE,SAAS;IACf,GAAG;IACH,KAAK;IACL,SAAS;IACT,IAAI;CACL,CAAC,CAAC;AANU,QAAA,QAAQ,YAMlB;AAEH,sDAAsD;AACtD,yDAAyD;AACzD,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,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrD,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,SAAgB,MAAM,CAAC,CAAO,EAAE,CAAO;IACrC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC;IACrE,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC7C,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,qEAAqE;AACrE,SAAgB,YAAY,CAAC,CAAO;IAClC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,CAAC,CAAC,IAAI,CAAC;IACrC,8DAA8D;IAC9D,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC1F,OAAO,GAAG,IAAI,MAAM,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC3C,CAAC;AAED,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,SAAS,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QAC9E,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/profile-bridge/index.d.ts

@@ -0,0 +1,64 @@
+import type { Formula } from '../types';
+import type { LTLFormula } from '../profiles/ltl-sat/types';
+import type { CTLFormula } from '../profiles/ctl/types';
+export type Profile = 'classical' | 'intuitionistic' | 'S4' | 'LTL' | 'CTL' | 'fuzzy';
+export interface GenericFormula {
+    profile: Profile;
+    ast: unknown;
+}
+export type Validity = 'preserved' | 'one-way' | 'partial';
+export interface Translation {
+    source: Profile;
+    target: Profile;
+    translate(formula: unknown): unknown;
+    validity: Validity;
+}
+/** Aplica la traducción ¬¬ de Glivenko recursivamente.
+ *
+ * Reglas (Glivenko 1929):
+ *   atom p         → ¬¬p
+ *   ¬φ             → ¬¬(¬φ')        = ¬φ'     (¬¬¬ ≡ ¬)
+ *   φ ∧ ψ          → ¬¬(φ' ∧ ψ')
+ *   φ ∨ ψ          → ¬¬(φ' ∨ ψ')
+ *   φ → ψ          → ¬¬(φ' → ψ')
+ *   φ ↔ ψ          → ¬¬(φ' ↔ ψ')
+ *   ⊤              → ⊤
+ *   ⊥              → ⊥
+ *
+ * Resultado: clásicamente válido si y solo si el original lo es en IPC.
+ */
+export declare function glivenkoTranslation(intuitFormula: unknown): Formula;
+/** Aplica la traducción de Gödel-McKinsey-Tarski: clasical → S4.
+ *
+ * Reglas (Gödel 1933):
+ *   atom p         → □p
+ *   ¬φ             → □¬φ'
+ *   φ ∧ ψ          → φ' ∧ ψ'
+ *   φ ∨ ψ          → φ' ∨ ψ'
+ *   φ → ψ          → □(φ' → ψ')
+ *   φ ↔ ψ          → □(φ' ↔ ψ')
+ *   ⊤              → ⊤
+ *   ⊥              → ⊥
+ *
+ * Corrección: φ es tautología clásica sii godelTranslation(φ) es
+ * tautología S4 (Gödel 1933, McKinsey-Tarski 1948).
+ */
+export declare function godelTranslation(classicalFormula: unknown): Formula;
+export declare function ltlToCTL(ltlFormula: unknown): CTLFormula;
+export declare function ctlToLTL(ctlFormula: unknown): LTLFormula;
+export declare const TRANSLATIONS: Translation[];
+/**
+ * Encuentra la ruta más corta desde `from` hasta `to` en el grafo
+ * de traducciones disponibles (BFS).
+ *
+ * Devuelve la secuencia de perfiles [from, ..., to] o null si no hay ruta.
+ */
+export declare function findTranslationPath(from: Profile, to: Profile): Profile[] | null;
+/**
+ * Traduce una fórmula genérica al perfil `target` siguiendo el camino
+ * de traducciones más corto disponible.
+ *
+ * Devuelve null si no existe ruta desde `formula.profile` hasta `target`.
+ */
+export declare function translateFormula(formula: GenericFormula, target: Profile): GenericFormula | null;
+//# sourceMappingURL=index.d.ts.map

package/dist/profile-bridge/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/profile-bridge/index.ts"],"names":[],"mappings":"AAmBA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AACxC,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAC5D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAIxD,MAAM,MAAM,OAAO,GAAG,WAAW,GAAG,gBAAgB,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,OAAO,CAAC;AAEtF,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,OAAO,CAAC;IACjB,GAAG,EAAE,OAAO,CAAC;CACd;AAED,MAAM,MAAM,QAAQ,GAAG,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;AAE3D,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,OAAO,CAAC;IAChB,MAAM,EAAE,OAAO,CAAC;IAChB,SAAS,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC;IACrC,QAAQ,EAAE,QAAQ,CAAC;CACpB;AASD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,mBAAmB,CAAC,aAAa,EAAE,OAAO,GAAG,OAAO,CAGnE;AA+BD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,gBAAgB,CAAC,gBAAgB,EAAE,OAAO,GAAG,OAAO,CAGnE;AAmDD,wBAAgB,QAAQ,CAAC,UAAU,EAAE,OAAO,GAAG,UAAU,CAGxD;AA4DD,wBAAgB,QAAQ,CAAC,UAAU,EAAE,OAAO,GAAG,UAAU,CAGxD;AA2DD,eAAO,MAAM,YAAY,EAAE,WAAW,EAqCrC,CAAC;AASF;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,GAAG,OAAO,EAAE,GAAG,IAAI,CAoBhF;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,OAAO,GAAG,cAAc,GAAG,IAAI,CAkBhG"}

package/dist/profile-bridge/index.js

@@ -0,0 +1,328 @@
+"use strict";
+// ============================================================
+// ST Profile Bridge — traducciones cross-profile
+// ============================================================
+// Implementa las traducciones clásicas entre perfiles lógicos:
+//
+//   intuitionistic → classical  (Glivenko ¬¬-translation)
+//   classical      → S4         (Gödel-McKinsey-Tarski □-embedding)
+//   LTL            → CTL        (embedding conservativo uno-a-uno)
+//   CTL            → LTL        (aproximación parcial, paths existenciales)
+//   fuzzy          → classical  (aproximación por umbral 0.5)
+//
+// Grafo de traducciones:
+//
+//   intuitionistic ──(Glivenko)──→ classical ──(Gödel)──→ S4
+//                                                             ↑
+//   LTL ──(ltlToCTL)──→ CTL ─────────────────────────────────┘
+//   CTL ──(ctlToLTL)──→ LTL  (partial, one-way)
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TRANSLATIONS = void 0;
+exports.glivenkoTranslation = glivenkoTranslation;
+exports.godelTranslation = godelTranslation;
+exports.ltlToCTL = ltlToCTL;
+exports.ctlToLTL = ctlToLTL;
+exports.findTranslationPath = findTranslationPath;
+exports.translateFormula = translateFormula;
+// ── Utilidades internas ──────────────────────────────────────
+/** Envuelve una Formula en doble negación: φ → ¬¬φ */
+function doubleNeg(f) {
+    return { kind: 'not', args: [{ kind: 'not', args: [f] }] };
+}
+/** Aplica la traducción ¬¬ de Glivenko recursivamente.
+ *
+ * Reglas (Glivenko 1929):
+ *   atom p         → ¬¬p
+ *   ¬φ             → ¬¬(¬φ')        = ¬φ'     (¬¬¬ ≡ ¬)
+ *   φ ∧ ψ          → ¬¬(φ' ∧ ψ')
+ *   φ ∨ ψ          → ¬¬(φ' ∨ ψ')
+ *   φ → ψ          → ¬¬(φ' → ψ')
+ *   φ ↔ ψ          → ¬¬(φ' ↔ ψ')
+ *   ⊤              → ⊤
+ *   ⊥              → ⊥
+ *
+ * Resultado: clásicamente válido si y solo si el original lo es en IPC.
+ */
+function glivenkoTranslation(intuitFormula) {
+    const f = intuitFormula;
+    return applyGlivenko(f);
+}
+function applyGlivenko(f) {
+    switch (f.kind) {
+        case 'true':
+        case 'false':
+            return f;
+        case 'atom':
+            return doubleNeg(f);
+        case 'not': {
+            const inner = (f.args ?? [])[0];
+            if (!inner)
+                return doubleNeg(f);
+            // ¬φ' — la doble negación de una negación colapsa: ¬¬¬φ ≡ ¬φ
+            return { kind: 'not', args: [applyGlivenko(inner)] };
+        }
+        case 'and':
+        case 'or':
+        case 'implies':
+        case 'biconditional': {
+            const translatedArgs = (f.args ?? []).map(applyGlivenko);
+            return doubleNeg({ ...f, args: translatedArgs });
+        }
+        default:
+            return doubleNeg(f);
+    }
+}
+/** Aplica la traducción de Gödel-McKinsey-Tarski: clasical → S4.
+ *
+ * Reglas (Gödel 1933):
+ *   atom p         → □p
+ *   ¬φ             → □¬φ'
+ *   φ ∧ ψ          → φ' ∧ ψ'
+ *   φ ∨ ψ          → φ' ∨ ψ'
+ *   φ → ψ          → □(φ' → ψ')
+ *   φ ↔ ψ          → □(φ' ↔ ψ')
+ *   ⊤              → ⊤
+ *   ⊥              → ⊥
+ *
+ * Corrección: φ es tautología clásica sii godelTranslation(φ) es
+ * tautología S4 (Gödel 1933, McKinsey-Tarski 1948).
+ */
+function godelTranslation(classicalFormula) {
+    const f = classicalFormula;
+    return applyGodel(f);
+}
+function box(f) {
+    return { kind: 'modal_necessity', args: [f] };
+}
+function applyGodel(f) {
+    switch (f.kind) {
+        case 'true':
+        case 'false':
+            return f;
+        case 'atom':
+            return box(f);
+        case 'not': {
+            const inner = (f.args ?? [])[0];
+            if (!inner)
+                return box(f);
+            return box({ kind: 'not', args: [applyGodel(inner)] });
+        }
+        case 'and':
+        case 'or': {
+            const translatedArgs = (f.args ?? []).map(applyGodel);
+            return { ...f, args: translatedArgs };
+        }
+        case 'implies':
+        case 'biconditional': {
+            const translatedArgs = (f.args ?? []).map(applyGodel);
+            return box({ ...f, args: translatedArgs });
+        }
+        default:
+            return box(f);
+    }
+}
+// ── LTL → CTL ───────────────────────────────────────────────
+// Embedding conservativo: operadores path-existencial de LTL
+// se mapean a sus contrapartes existenciales de CTL.
+//
+//   X φ   → EX φ'    (existe un sucesor)
+//   F φ   → EF φ'    (existe un camino que eventualmente alcanza)
+//   G φ   → EG φ'    (existe un camino siempre φ)
+//   φ U ψ → E[φ' U ψ'] (existe un camino con until)
+//   φ R ψ → E[ψ' R φ'] (release: E[ψ U (ψ∧φ)] aproximado)
+//
+// validity: 'one-way' — LTL-valid ⇒ imagen CTL-valid en E-paths,
+// pero no viceversa (CTL tiene más poder expresivo sobre branching).
+function ltlToCTL(ltlFormula) {
+    const f = ltlFormula;
+    return ltlToCTLRec(f);
+}
+function ltlToCTLRec(f) {
+    switch (f.kind) {
+        case 'atom':
+            return { kind: 'atom', name: f.name };
+        case 'not':
+            return { kind: 'not', arg: ltlToCTLRec(f.arg) };
+        case 'and':
+            return { kind: 'and', args: f.args.map(ltlToCTLRec) };
+        case 'or':
+            return { kind: 'or', args: f.args.map(ltlToCTLRec) };
+        case 'X':
+            return { kind: 'EX', arg: ltlToCTLRec(f.arg) };
+        case 'F':
+            return { kind: 'EF', arg: ltlToCTLRec(f.arg) };
+        case 'G':
+            return { kind: 'EG', arg: ltlToCTLRec(f.arg) };
+        case 'U':
+            return { kind: 'EU', left: ltlToCTLRec(f.left), right: ltlToCTLRec(f.right) };
+        case 'R': {
+            // Release φ R ψ ≡ ψ W (ψ∧φ): no hay operador R nativo en CTL.
+            // Traducimos como ¬(¬ψ U ¬φ) vía dualidad, representado con EU.
+            // Para la traducción conservativa one-way usamos:
+            //   φ R ψ ≡ ¬(¬ψ U ¬φ) → CTL: ¬E[¬ψ' U ¬φ']
+            const notLeft = { kind: 'not', arg: ltlToCTLRec(f.left) };
+            const notRight = { kind: 'not', arg: ltlToCTLRec(f.right) };
+            return {
+                kind: 'not',
+                arg: { kind: 'EU', left: notRight, right: notLeft },
+            };
+        }
+    }
+}
+// ── CTL → LTL ───────────────────────────────────────────────
+// Aproximación parcial. Los operadores A (universal-path) de CTL
+// no tienen equivalente directo en LTL (Vardi 1988). Los E
+// (existencial) se traducen fielmente en el fragmento linear.
+//
+//   EX φ  → X φ'
+//   AX φ  → X φ'     (aproximación: LTL no distingue branching)
+//   EF φ  → F φ'
+//   AF φ  → F φ'
+//   EG φ  → G φ'
+//   AG φ  → G φ'
+//   E[φUψ] → φ' U ψ'
+//   A[φUψ] → φ' U ψ'
+//
+// validity: 'partial' — la imagen LTL es más débil; sólo preserva
+// semántica lineal, no branching. No apta para model checking exacto.
+function ctlToLTL(ctlFormula) {
+    const f = ctlFormula;
+    return ctlToLTLRec(f);
+}
+function ctlToLTLRec(f) {
+    switch (f.kind) {
+        case 'atom':
+            return { kind: 'atom', name: f.name };
+        case 'true':
+            return { kind: 'or', args: [{ kind: 'atom', name: '__true__' }, { kind: 'not', arg: { kind: 'atom', name: '__true__' } }] };
+        case 'false':
+            return { kind: 'and', args: [{ kind: 'atom', name: '__false__' }, { kind: 'not', arg: { kind: 'atom', name: '__false__' } }] };
+        case 'not':
+            return { kind: 'not', arg: ctlToLTLRec(f.arg) };
+        case 'and':
+            return { kind: 'and', args: f.args.map(ctlToLTLRec) };
+        case 'or':
+            return { kind: 'or', args: f.args.map(ctlToLTLRec) };
+        case 'implies':
+            return { kind: 'or', args: [{ kind: 'not', arg: ctlToLTLRec(f.left) }, ctlToLTLRec(f.right)] };
+        case 'EX':
+        case 'AX':
+            return { kind: 'X', arg: ctlToLTLRec(f.arg) };
+        case 'EF':
+        case 'AF':
+            return { kind: 'F', arg: ctlToLTLRec(f.arg) };
+        case 'EG':
+        case 'AG':
+            return { kind: 'G', arg: ctlToLTLRec(f.arg) };
+        case 'EU':
+        case 'AU':
+            return { kind: 'U', left: ctlToLTLRec(f.left), right: ctlToLTLRec(f.right) };
+    }
+}
+// ── fuzzy → classical ────────────────────────────────────────
+// Umbral crisp: valores ≥ 0.5 → true; < 0.5 → false.
+// Formula de fuzzy se asume como una Formula con valores numéricos
+// codificados como kind:'number'. Aproximación heurística.
+function fuzzyCrisp(f) {
+    if (f.kind === 'number') {
+        const v = f.value ?? 0;
+        return { kind: v >= 0.5 ? 'true' : 'false' };
+    }
+    const newArgs = (f.args ?? []).map(fuzzyCrisp);
+    return { ...f, args: newArgs.length > 0 ? newArgs : undefined };
+}
+// ── Registro de traducciones ────────────────────────────────
+exports.TRANSLATIONS = [
+    {
+        source: 'intuitionistic',
+        target: 'classical',
+        translate: glivenkoTranslation,
+        validity: 'preserved',
+    },
+    {
+        source: 'classical',
+        target: 'S4',
+        translate: godelTranslation,
+        validity: 'preserved',
+    },
+    {
+        source: 'LTL',
+        target: 'CTL',
+        translate: ltlToCTL,
+        validity: 'one-way',
+    },
+    {
+        source: 'CTL',
+        target: 'LTL',
+        translate: ctlToLTL,
+        validity: 'partial',
+    },
+    {
+        source: 'fuzzy',
+        target: 'classical',
+        translate: (f) => fuzzyCrisp(f),
+        validity: 'partial',
+    },
+    {
+        source: 'intuitionistic',
+        target: 'S4',
+        translate: (f) => godelTranslation(glivenkoTranslation(f)),
+        validity: 'preserved',
+    },
+];
+// ── Grafo de rutas de traducción ────────────────────────────
+/** Retorna los vecinos directos de un perfil en el grafo de traducciones. */
+function neighbours(from) {
+    return exports.TRANSLATIONS.filter((t) => t.source === from).map((t) => t.target);
+}
+/**
+ * Encuentra la ruta más corta desde `from` hasta `to` en el grafo
+ * de traducciones disponibles (BFS).
+ *
+ * Devuelve la secuencia de perfiles [from, ..., to] o null si no hay ruta.
+ */
+function findTranslationPath(from, to) {
+    if (from === to)
+        return [from];
+    const visited = new Set([from]);
+    const queue = [[from]];
+    while (queue.length > 0) {
+        const path = queue.shift();
+        const current = path[path.length - 1];
+        for (const next of neighbours(current)) {
+            if (next === to)
+                return [...path, next];
+            if (!visited.has(next)) {
+                visited.add(next);
+                queue.push([...path, next]);
+            }
+        }
+    }
+    return null;
+}
+/**
+ * Traduce una fórmula genérica al perfil `target` siguiendo el camino
+ * de traducciones más corto disponible.
+ *
+ * Devuelve null si no existe ruta desde `formula.profile` hasta `target`.
+ */
+function translateFormula(formula, target) {
+    const path = findTranslationPath(formula.profile, target);
+    if (!path)
+        return null;
+    let current = formula;
+    for (let i = 0; i < path.length - 1; i++) {
+        const src = path[i];
+        const dst = path[i + 1];
+        const translation = exports.TRANSLATIONS.find((t) => t.source === src && t.target === dst);
+        if (!translation)
+            return null;
+        current = {
+            profile: dst,
+            ast: translation.translate(current.ast),
+        };
+    }
+    return current;
+}
+//# sourceMappingURL=index.js.map

package/dist/profile-bridge/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/profile-bridge/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,iDAAiD;AACjD,+DAA+D;AAC/D,+DAA+D;AAC/D,EAAE;AACF,0DAA0D;AAC1D,oEAAoE;AACpE,mEAAmE;AACnE,4EAA4E;AAC5E,8DAA8D;AAC9D,EAAE;AACF,yBAAyB;AACzB,EAAE;AACF,6DAA6D;AAC7D,gEAAgE;AAChE,+DAA+D;AAC/D,gDAAgD;AAChD,+DAA+D;;;AA6C/D,kDAGC;AA8CD,4CAGC;AAmDD,4BAGC;AA4DD,4BAGC;AA+GD,kDAoBC;AAQD,4CAkBC;AA3VD,gEAAgE;AAEhE,sDAAsD;AACtD,SAAS,SAAS,CAAC,CAAU;IAC3B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAC7D,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,mBAAmB,CAAC,aAAsB;IACxD,MAAM,CAAC,GAAG,aAAwB,CAAC;IACnC,OAAO,aAAa,CAAC,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,aAAa,CAAC,CAAU;IAC/B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM,CAAC;QACZ,KAAK,OAAO;YACV,OAAO,CAAC,CAAC;QAEX,KAAK,MAAM;YACT,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;QAEtB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK;gBAAE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YAChC,6DAA6D;YAC7D,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QACvD,CAAC;QAED,KAAK,KAAK,CAAC;QACX,KAAK,IAAI,CAAC;QACV,KAAK,SAAS,CAAC;QACf,KAAK,eAAe,CAAC,CAAC,CAAC;YACrB,MAAM,cAAc,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YACzD,OAAO,SAAS,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAC;QACnD,CAAC;QAED;YACE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAgB,gBAAgB,CAAC,gBAAyB;IACxD,MAAM,CAAC,GAAG,gBAA2B,CAAC;IACtC,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED,SAAS,GAAG,CAAC,CAAU;IACrB,OAAO,EAAE,IAAI,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;AAChD,CAAC;AAED,SAAS,UAAU,CAAC,CAAU;IAC5B,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM,CAAC;QACZ,KAAK,OAAO;YACV,OAAO,CAAC,CAAC;QAEX,KAAK,MAAM;YACT,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;QAEhB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK;gBAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,OAAO,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QACzD,CAAC;QAED,KAAK,KAAK,CAAC;QACX,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,cAAc,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACtD,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;QACxC,CAAC;QAED,KAAK,SAAS,CAAC;QACf,KAAK,eAAe,CAAC,CAAC,CAAC;YACrB,MAAM,cAAc,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACtD,OAAO,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAC;QAC7C,CAAC;QAED;YACE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,6DAA6D;AAC7D,qDAAqD;AACrD,EAAE;AACF,yCAAyC;AACzC,kEAAkE;AAClE,kDAAkD;AAClD,oDAAoD;AACpD,0DAA0D;AAC1D,EAAE;AACF,iEAAiE;AACjE,qEAAqE;AAErE,SAAgB,QAAQ,CAAC,UAAmB;IAC1C,MAAM,CAAC,GAAG,UAAwB,CAAC;IACnC,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAED,SAAS,WAAW,CAAC,CAAa;IAChC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAExC,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAElD,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;QAExD,KAAK,IAAI;YACP,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;QAEvD,KAAK,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAEjD,KAAK,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAEjD,KAAK,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAEjD,KAAK,GAAG;YACN,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QAEhF,KAAK,GAAG,CAAC,CAAC,CAAC;YACT,8DAA8D;YAC9D,gEAAgE;YAChE,kDAAkD;YAClD,4CAA4C;YAC5C,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACtE,MAAM,QAAQ,GAAe,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACxE,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE;aACpD,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,iEAAiE;AACjE,2DAA2D;AAC3D,8DAA8D;AAC9D,EAAE;AACF,iBAAiB;AACjB,gEAAgE;AAChE,iBAAiB;AACjB,iBAAiB;AACjB,iBAAiB;AACjB,iBAAiB;AACjB,qBAAqB;AACrB,qBAAqB;AACrB,EAAE;AACF,kEAAkE;AAClE,sEAAsE;AAEtE,SAAgB,QAAQ,CAAC,UAAmB;IAC1C,MAAM,CAAC,GAAG,UAAwB,CAAC;IACnC,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAED,SAAS,WAAW,CAAC,CAAa;IAChC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAExC,KAAK,MAAM;YACT,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC;QAE9H,KAAK,OAAO;YACV,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,CAAC,EAAE,CAAC;QAEjI,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAElD,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;QAExD,KAAK,IAAI;YACP,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;QAEvD,KAAK,SAAS;YACZ,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QAEjG,KAAK,IAAI,CAAC;QACV,KAAK,IAAI;YACP,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAEhD,KAAK,IAAI,CAAC;QACV,KAAK,IAAI;YACP,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAEhD,KAAK,IAAI,CAAC;QACV,KAAK,IAAI;YACP,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAEhD,KAAK,IAAI,CAAC;QACV,KAAK,IAAI;YACP,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;IACjF,CAAC;AACH,CAAC;AAED,gEAAgE;AAChE,qDAAqD;AACrD,mEAAmE;AACnE,2DAA2D;AAE3D,SAAS,UAAU,CAAC,CAAU;IAC5B,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC/C,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC/C,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;AAClE,CAAC;AAED,+DAA+D;AAElD,QAAA,YAAY,GAAkB;IACzC;QACE,MAAM,EAAE,gBAAgB;QACxB,MAAM,EAAE,WAAW;QACnB,SAAS,EAAE,mBAAmB;QAC9B,QAAQ,EAAE,WAAW;KACtB;IACD;QACE,MAAM,EAAE,WAAW;QACnB,MAAM,EAAE,IAAI;QACZ,SAAS,EAAE,gBAAgB;QAC3B,QAAQ,EAAE,WAAW;KACtB;IACD;QACE,MAAM,EAAE,KAAK;QACb,MAAM,EAAE,KAAK;QACb,SAAS,EAAE,QAAQ;QACnB,QAAQ,EAAE,SAAS;KACpB;IACD;QACE,MAAM,EAAE,KAAK;QACb,MAAM,EAAE,KAAK;QACb,SAAS,EAAE,QAAQ;QACnB,QAAQ,EAAE,SAAS;KACpB;IACD;QACE,MAAM,EAAE,OAAO;QACf,MAAM,EAAE,WAAW;QACnB,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAY,CAAC;QAC1C,QAAQ,EAAE,SAAS;KACpB;IACD;QACE,MAAM,EAAE,gBAAgB;QACxB,MAAM,EAAE,IAAI;QACZ,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC1D,QAAQ,EAAE,WAAW;KACtB;CACF,CAAC;AAEF,+DAA+D;AAE/D,6EAA6E;AAC7E,SAAS,UAAU,CAAC,IAAa;IAC/B,OAAO,oBAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAC,IAAa,EAAE,EAAW;IAC5D,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAE/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IACzC,MAAM,KAAK,GAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAEpC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QAEvC,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YACvC,IAAI,IAAI,KAAK,EAAE;gBAAE,OAAO,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClB,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAC,OAAuB,EAAE,MAAe;IACvE,MAAM,IAAI,GAAG,mBAAmB,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC1D,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,IAAI,OAAO,GAAmB,OAAO,CAAC;IAEtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAY,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAY,CAAC;QACnC,MAAM,WAAW,GAAG,oBAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,MAAM,KAAK,GAAG,CAAC,CAAC;QACnF,IAAI,CAAC,WAAW;YAAE,OAAO,IAAI,CAAC;QAC9B,OAAO,GAAG;YACR,OAAO,EAAE,GAAG;YACZ,GAAG,EAAE,WAAW,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC;SACxC,CAAC;IACJ,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/proof-nets/construct.d.ts

@@ -0,0 +1,3 @@
+import { type MLLFormula, type ProofNet } from './types';
+export declare function constructFromSequent(formulas: MLLFormula[]): ProofNet;
+//# sourceMappingURL=construct.d.ts.map

package/dist/proof-nets/construct.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"construct.d.ts","sourceRoot":"","sources":["../../src/proof-nets/construct.ts"],"names":[],"mappings":"AAmBA,OAAO,EACL,KAAK,UAAU,EACf,KAAK,QAAQ,EAKd,MAAM,SAAS,CAAC;AAmCjB,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG,QAAQ,CAqCrE"}

package/dist/proof-nets/construct.js

@@ -0,0 +1,85 @@
+"use strict";
+// ============================================================
+// Proof Nets — Construcción a partir de un secuente
+// ============================================================
+//
+// Dado ⊢ Γ con Γ una lista de fórmulas MLL, esta construcción
+// produce un net candidato:
+//
+//   1. Para cada fórmula F_i de Γ se construye recursivamente su
+//      "árbol de descomposición": cada nodo interno se cablea con
+//      el link correspondiente (⊗ o ⅋), terminando en hojas que
+//      son átomos.
+//   2. Los átomos hoja se emparejan por pares duales (A con A⊥)
+//      vía axiom links. El pairing es greedy: para cada átomo
+//      libre busca su primer dual libre.
+//
+// El net producido puede o no ser correcto: si Γ no es probable
+// en MLL la correctitud Danos-Regnier fallará. Las conclusiones
+// son las raíces de los árboles de descomposición.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.constructFromSequent = constructFromSequent;
+const types_1 = require("./types");
+function freshNode(b, formula) {
+    const id = b.nextId++;
+    b.nodes.push({ id, formula });
+    return id;
+}
+// Construye el árbol de descomposición de `f`. Devuelve el id del
+// nodo raíz y la lista de ids de las hojas-átomo en orden de
+// recorrido en profundidad por la izquierda.
+function buildFormulaTree(b, f) {
+    if (f.kind === 'atom') {
+        const id = freshNode(b, f);
+        return { root: id, atomLeaves: [id] };
+    }
+    const left = buildFormulaTree(b, f.left);
+    const right = buildFormulaTree(b, f.right);
+    const root = freshNode(b, f);
+    b.links.push({
+        kind: f.kind === 'tensor' ? 'tensor' : 'par',
+        ports: [left.root, right.root, root],
+    });
+    return {
+        root,
+        atomLeaves: [...left.atomLeaves, ...right.atomLeaves],
+    };
+}
+function constructFromSequent(formulas) {
+    const b = { nodes: [], links: [], nextId: 0 };
+    const conclusions = [];
+    const atomLeaves = [];
+    for (const f of formulas) {
+        const tree = buildFormulaTree(b, f);
+        conclusions.push(tree.root);
+        atomLeaves.push(...tree.atomLeaves);
+    }
+    // Pairing greedy: para cada hoja sin asignar, busca la primera
+    // hoja dual sin asignar y crea un axiom link entre ambas.
+    const taken = new Set();
+    for (const i of atomLeaves) {
+        if (taken.has(i))
+            continue;
+        const fi = b.nodes[i].formula;
+        let partner = null;
+        for (const j of atomLeaves) {
+            if (j === i || taken.has(j))
+                continue;
+            const fj = b.nodes[j].formula;
+            if ((0, types_1.formulaEquals)(fj, (0, types_1.dual)(fi))) {
+                partner = j;
+                break;
+            }
+        }
+        if (partner === null) {
+            // Átomo sin par: se deja libre. El criterio de corrección
+            // detectará la inconsistencia (componente desconexa).
+            continue;
+        }
+        taken.add(i);
+        taken.add(partner);
+        b.links.push({ kind: 'axiom', ports: [i, partner] });
+    }
+    return { nodes: b.nodes, links: b.links, conclusions };
+}
+//# sourceMappingURL=construct.js.map

package/dist/proof-nets/construct.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"construct.js","sourceRoot":"","sources":["../../src/proof-nets/construct.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oDAAoD;AACpD,+DAA+D;AAC/D,EAAE;AACF,8DAA8D;AAC9D,4BAA4B;AAC5B,EAAE;AACF,iEAAiE;AACjE,kEAAkE;AAClE,gEAAgE;AAChE,mBAAmB;AACnB,gEAAgE;AAChE,8DAA8D;AAC9D,yCAAyC;AACzC,EAAE;AACF,gEAAgE;AAChE,gEAAgE;AAChE,mDAAmD;;AA4CnD,oDAqCC;AA/ED,mCAOiB;AAQjB,SAAS,SAAS,CAAC,CAAU,EAAE,OAAmB;IAChD,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;IACtB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;IAC9B,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,kEAAkE;AAClE,6DAA6D;AAC7D,6CAA6C;AAC7C,SAAS,gBAAgB,CAAC,CAAU,EAAE,CAAa;IACjD,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACxC,CAAC;IACD,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;QACX,IAAI,EAAE,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK;QAC5C,KAAK,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC;KACrC,CAAC,CAAC;IACH,OAAO;QACL,IAAI;QACJ,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC;KACtD,CAAC;AACJ,CAAC;AAED,SAAgB,oBAAoB,CAAC,QAAsB;IACzD,MAAM,CAAC,GAAY,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACvD,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;IACtC,CAAC;IAED,+DAA+D;IAC/D,0DAA0D;IAC1D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC3B,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QAC9B,IAAI,OAAO,GAAkB,IAAI,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YACtC,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YAC9B,IAAI,IAAA,qBAAa,EAAC,EAAE,EAAE,IAAA,YAAI,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAChC,OAAO,GAAG,CAAC,CAAC;gBACZ,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACrB,0DAA0D;YAC1D,sDAAsD;YACtD,SAAS;QACX,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,CAAC;AACzD,CAAC"}

package/dist/proof-nets/correctness.d.ts

@@ -0,0 +1,3 @@
+import { type ProofNet } from './types';
+export declare function isCorrect(net: ProofNet): boolean;
+//# sourceMappingURL=correctness.d.ts.map

package/dist/proof-nets/correctness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"correctness.d.ts","sourceRoot":"","sources":["../../src/proof-nets/correctness.ts"],"names":[],"mappings":"AA+BA,OAAO,EAAmB,KAAK,QAAQ,EAAuB,MAAM,SAAS,CAAC;AA+J9E,wBAAgB,SAAS,CAAC,GAAG,EAAE,QAAQ,GAAG,OAAO,CAmBhD"}