@stevenvo780/st-lang 4.5.1 → 4.5.2

package/dist/information-theory/index.d.ts

@@ -0,0 +1,29 @@
+export type Distribution<T> = Map<T, number>;
+export type Joint<X, Y> = Map<[X, Y], number>;
+export declare function support<T>(p: Distribution<T>): T[];
+export declare function isValidDistribution<T>(p: Distribution<T>, eps?: number): boolean;
+export declare function normalize<T>(p: Distribution<T>): Distribution<T>;
+export type LogBase = 'log' | 'e' | 2 | 10;
+export declare function shannonEntropy<T>(p: Distribution<T>, base?: LogBase): number;
+export declare function renyiEntropy<T>(p: Distribution<T>, alpha: number, base?: LogBase): number;
+export declare function minEntropy<T>(p: Distribution<T>, base?: LogBase): number;
+export declare function maxEntropy<T>(p: Distribution<T>, base?: LogBase): number;
+export declare function collisionEntropy<T>(p: Distribution<T>, base?: LogBase): number;
+export declare function klDivergence<T>(p: Distribution<T>, q: Distribution<T>, base?: LogBase): number;
+export declare function jsDivergence<T>(p: Distribution<T>, q: Distribution<T>, base?: LogBase): number;
+export declare function tvDistance<T>(p: Distribution<T>, q: Distribution<T>): number;
+export declare function hellingerDistance<T>(p: Distribution<T>, q: Distribution<T>): number;
+export declare function crossEntropy<T>(p: Distribution<T>, q: Distribution<T>, base?: LogBase): number;
+export declare function jointToMarginals<X, Y>(j: Joint<X, Y>): {
+    X: Distribution<X>;
+    Y: Distribution<Y>;
+};
+export declare function mutualInformation<X, Y>(j: Joint<X, Y>, base?: LogBase): number;
+export declare function conditionalEntropy<X, Y>(j: Joint<X, Y>, condOn: 'X' | 'Y', base?: LogBase): number;
+export declare function chainRule<X, Y>(j: Joint<X, Y>, base?: LogBase): {
+    hX: number;
+    hY: number;
+    hXY: number;
+    iXY: number;
+};
+//# sourceMappingURL=index.d.ts.map

package/dist/information-theory/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/information-theory/index.ts"],"names":[],"mappings":"AAsBA,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAM7C,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAW9C,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAMlD;AAID,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,GAAE,MAAoB,GAAG,OAAO,CAO7F;AAID,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAgBhE;AAOD,MAAM,MAAM,OAAO,GAAG,KAAK,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;AAqB3C,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAS/E;AAaD,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAc5F;AAGD,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAQ3E;AAGD,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAK3E;AAGD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAQjF;AASD,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAUjG;AAID,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAQjG;AAGD,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,CAS5E;AAID,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,CAYnF;AAQD,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAUjG;AAUD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG;IAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAA;CAAE,CAUjG;AAgBD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAcjF;AAID,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,CAAC,EACrC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,MAAM,EAAE,GAAG,GAAG,GAAG,EACjB,IAAI,GAAE,OAAW,GAChB,MAAM,CAOR;AAID,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAC5B,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,IAAI,GAAE,OAAW,GAChB;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAQtD"}

package/dist/information-theory/index.js

@@ -0,0 +1,323 @@
+"use strict";
+// ============================================================
+// ST Information Theory — Toolkit de entropías y divergencias
+// ============================================================
+//
+// Sobre distribuciones simbólicas discretas (`Map<T, number>` con masa
+// total ≈ 1) provee:
+//
+//   • Entropías: Shannon, Rényi(α), min, max, colisión.
+//   • Divergencias: KL, JS, total-variation, Hellinger.
+//   • Información mutua a partir de distribución conjunta.
+//   • Cross-entropy y la relación H(p,q) = H(p) + KL(p ‖ q).
+//
+// Convenciones de borde:
+//   • La probabilidad 0 contribuye 0 a la entropía (lim x·log x = 0).
+//   • KL(p ‖ q) es +∞ si existe x con p(x) > 0 y q(x) = 0.
+//   • La base por defecto del logaritmo es 2 (bits). También se aceptan
+//     'e' (nats), 10 (hartleys/dits) y el alias 'log' = 2.
+//   • Validamos con tolerancia EPS_DEFAULT antes de cualquier cómputo
+//     que asuma normalización. `normalize` no se llama implícitamente
+//     porque queremos que el usuario decida cuándo reescalar.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.support = support;
+exports.isValidDistribution = isValidDistribution;
+exports.normalize = normalize;
+exports.shannonEntropy = shannonEntropy;
+exports.renyiEntropy = renyiEntropy;
+exports.minEntropy = minEntropy;
+exports.maxEntropy = maxEntropy;
+exports.collisionEntropy = collisionEntropy;
+exports.klDivergence = klDivergence;
+exports.jsDivergence = jsDivergence;
+exports.tvDistance = tvDistance;
+exports.hellingerDistance = hellingerDistance;
+exports.crossEntropy = crossEntropy;
+exports.jointToMarginals = jointToMarginals;
+exports.mutualInformation = mutualInformation;
+exports.conditionalEntropy = conditionalEntropy;
+exports.chainRule = chainRule;
+// Tolerancia por defecto para "suma ≈ 1" y comparaciones simétricas.
+const EPS_DEFAULT = 1e-9;
+// ------------------------------------------------------------
+// Soporte y validación
+// ------------------------------------------------------------
+// Devuelve los símbolos con probabilidad estrictamente positiva, en el
+// orden en que aparecen en el Map (orden de inserción, estable).
+function support(p) {
+    const out = [];
+    for (const [k, v] of p) {
+        if (v > 0)
+            out.push(k);
+    }
+    return out;
+}
+// True si todas las probabilidades son finitas y ≥ 0, y la suma está a
+// menos de `eps` de 1. Probabilidades negativas o NaN ⇒ false.
+function isValidDistribution(p, eps = EPS_DEFAULT) {
+    let sum = 0;
+    for (const v of p.values()) {
+        if (!Number.isFinite(v) || v < 0)
+            return false;
+        sum += v;
+    }
+    return Math.abs(sum - 1) <= eps;
+}
+// Reescala la distribución a masa 1. Si la suma actual es 0, lanza:
+// no hay forma canónica de "normalizar" la distribución nula.
+function normalize(p) {
+    let sum = 0;
+    for (const v of p.values()) {
+        if (!Number.isFinite(v) || v < 0) {
+            throw new Error('normalize: probabilidad inválida (negativa, NaN o infinita)');
+        }
+        sum += v;
+    }
+    if (sum === 0) {
+        throw new Error('normalize: distribución con masa total 0');
+    }
+    const out = new Map();
+    for (const [k, v] of p) {
+        out.set(k, v / sum);
+    }
+    return out;
+}
+function logIn(base) {
+    switch (base) {
+        case 'e':
+            return Math.log;
+        case 10:
+            return Math.log10;
+        case 2:
+        case 'log':
+        default:
+            return Math.log2;
+    }
+}
+// ------------------------------------------------------------
+// Entropías
+// ------------------------------------------------------------
+// Shannon: H(p) = -Σ p(x) · log p(x).
+// Convención lim_{x→0} x·log x = 0 ⇒ los símbolos con masa 0 no aportan.
+function shannonEntropy(p, base = 2) {
+    const log = logIn(base);
+    let h = 0;
+    for (const v of p.values()) {
+        if (v > 0) {
+            h -= v * log(v);
+        }
+    }
+    return h;
+}
+// Rényi de orden α (α ≥ 0, α ≠ 1):
+//   H_α(p) = 1/(1-α) · log Σ p(x)^α
+//
+// Casos especiales:
+//   α = 0 → log |sop(p)|       (Hartley / max-entropy del soporte)
+//   α = 1 → Shannon            (límite L'Hôpital — devolvemos Shannon)
+//   α = 2 → -log Σ p(x)^2      (entropía de colisión)
+//   α → ∞ → -log max p(x)      (min-entropy)
+//
+// `alpha` debe ser un número real finito y ≥ 0. α negativos no son
+// entropías de Rényi estándar y no se aceptan.
+function renyiEntropy(p, alpha, base = 2) {
+    if (!Number.isFinite(alpha) || alpha < 0) {
+        throw new Error('renyiEntropy: α debe ser finito y ≥ 0');
+    }
+    if (alpha === 1)
+        return shannonEntropy(p, base);
+    if (alpha === 0)
+        return maxEntropy(p, base);
+    const log = logIn(base);
+    let s = 0;
+    for (const v of p.values()) {
+        if (v > 0)
+            s += Math.pow(v, alpha);
+    }
+    if (s === 0)
+        return 0;
+    return log(s) / (1 - alpha);
+}
+// Min-entropy: -log max_x p(x). Mide la peor predictibilidad single-guess.
+function minEntropy(p, base = 2) {
+    const log = logIn(base);
+    let max = 0;
+    for (const v of p.values()) {
+        if (v > max)
+            max = v;
+    }
+    if (max === 0)
+        return 0;
+    return -log(max);
+}
+// Max-entropy: log|soporte(p)|. Hartley sobre el soporte estricto.
+function maxEntropy(p, base = 2) {
+    const log = logIn(base);
+    const n = support(p).length;
+    if (n === 0)
+        return 0;
+    return log(n);
+}
+// Entropía de colisión: Rényi α=2 = -log Σ p(x)^2.
+function collisionEntropy(p, base = 2) {
+    const log = logIn(base);
+    let s = 0;
+    for (const v of p.values()) {
+        if (v > 0)
+            s += v * v;
+    }
+    if (s === 0)
+        return 0;
+    return -log(s);
+}
+// ------------------------------------------------------------
+// Divergencias y distancias
+// ------------------------------------------------------------
+// KL(p ‖ q) = Σ p(x) · log(p(x)/q(x)).
+// Convención: p(x)=0 aporta 0; p(x)>0 y q(x)=0 ⇒ +Infinity.
+// Soporte sobre la unión de claves de p y q.
+function klDivergence(p, q, base = 2) {
+    const log = logIn(base);
+    let d = 0;
+    for (const [k, px] of p) {
+        if (px === 0)
+            continue;
+        const qx = q.get(k) ?? 0;
+        if (qx === 0)
+            return Number.POSITIVE_INFINITY;
+        d += px * log(px / qx);
+    }
+    return d;
+}
+// Jensen-Shannon: JS(p,q) = ½ KL(p ‖ m) + ½ KL(q ‖ m), m = ½(p+q).
+// Simétrica y siempre finita en [0, log 2] (base 2 ⇒ [0, 1]).
+function jsDivergence(p, q, base = 2) {
+    const m = new Map();
+    for (const [k, v] of p)
+        m.set(k, (m.get(k) ?? 0) + v);
+    for (const [k, v] of q)
+        m.set(k, (m.get(k) ?? 0) + v);
+    // m = p + q; dividimos por 2 para obtener la mezcla.
+    for (const [k, v] of m)
+        m.set(k, v / 2);
+    return 0.5 * klDivergence(p, m, base) + 0.5 * klDivergence(q, m, base);
+}
+// Distancia de variación total: TV(p,q) = ½ Σ |p(x) - q(x)|. ∈ [0, 1].
+function tvDistance(p, q) {
+    const keys = new Set();
+    for (const k of p.keys())
+        keys.add(k);
+    for (const k of q.keys())
+        keys.add(k);
+    let s = 0;
+    for (const k of keys) {
+        s += Math.abs((p.get(k) ?? 0) - (q.get(k) ?? 0));
+    }
+    return s / 2;
+}
+// Distancia de Hellinger: H(p,q) = (1/√2) · sqrt(Σ (√p(x) - √q(x))²).
+// ∈ [0, 1]; 0 sii p=q; 1 sii soportes disjuntos.
+function hellingerDistance(p, q) {
+    const keys = new Set();
+    for (const k of p.keys())
+        keys.add(k);
+    for (const k of q.keys())
+        keys.add(k);
+    let s = 0;
+    for (const k of keys) {
+        const a = Math.sqrt(p.get(k) ?? 0);
+        const b = Math.sqrt(q.get(k) ?? 0);
+        const d = a - b;
+        s += d * d;
+    }
+    return Math.sqrt(s) / Math.SQRT2;
+}
+// ------------------------------------------------------------
+// Cross-entropy
+// ------------------------------------------------------------
+// H(p, q) = -Σ p(x) · log q(x) = H(p) + KL(p ‖ q).
+// Devuelve +∞ si existe x con p(x) > 0 y q(x) = 0.
+function crossEntropy(p, q, base = 2) {
+    const log = logIn(base);
+    let h = 0;
+    for (const [k, px] of p) {
+        if (px === 0)
+            continue;
+        const qx = q.get(k) ?? 0;
+        if (qx === 0)
+            return Number.POSITIVE_INFINITY;
+        h -= px * log(qx);
+    }
+    return h;
+}
+// ------------------------------------------------------------
+// Distribuciones conjuntas e información mutua
+// ------------------------------------------------------------
+// Proyecta la conjunta sobre cada eje. Devuelve dos distribuciones
+// (marginales) tal que Σ joint(x,y) = X(x) = Σ_y joint(x,y), etc.
+// Si dos claves de la conjunta tienen el mismo par lógico (mismas X y
+// Y por referencia/valor), sus masas se suman en las marginales.
+function jointToMarginals(j) {
+    const mX = new Map();
+    const mY = new Map();
+    for (const [pair, v] of j) {
+        const x = pair[0];
+        const y = pair[1];
+        mX.set(x, (mX.get(x) ?? 0) + v);
+        mY.set(y, (mY.get(y) ?? 0) + v);
+    }
+    return { X: mX, Y: mY };
+}
+// H(X, Y): entropía conjunta directa sobre la distribución del par.
+function jointEntropy(j, base) {
+    const log = logIn(base);
+    let h = 0;
+    for (const v of j.values()) {
+        if (v > 0)
+            h -= v * log(v);
+    }
+    return h;
+}
+// I(X; Y) = Σ_xy p(x,y) · log( p(x,y) / (p(x)·p(y)) ).
+// Equivalentemente: I(X;Y) = H(X) + H(Y) − H(X,Y).
+// Usamos la forma sumatoria directa para mantener invariancia ante
+// reordenamiento numérico de los marginales y evitar restas catastróficas.
+function mutualInformation(j, base = 2) {
+    const log = logIn(base);
+    const { X: mX, Y: mY } = jointToMarginals(j);
+    let mi = 0;
+    for (const [pair, pxy] of j) {
+        if (pxy <= 0)
+            continue;
+        const px = mX.get(pair[0]) ?? 0;
+        const py = mY.get(pair[1]) ?? 0;
+        if (px === 0 || py === 0)
+            continue;
+        mi += pxy * log(pxy / (px * py));
+    }
+    // Por estabilidad numérica forzamos no-negatividad estricta (puede
+    // dar -1e-16 por redondeo en distribuciones independientes).
+    return mi < 0 && mi > -1e-12 ? 0 : mi;
+}
+// H(X|Y) o H(Y|X) según `condOn`.
+// H(X|Y) = H(X,Y) − H(Y); H(Y|X) = H(X,Y) − H(X). Ambas ≥ 0.
+function conditionalEntropy(j, condOn, base = 2) {
+    const hXY = jointEntropy(j, base);
+    const { X: mX, Y: mY } = jointToMarginals(j);
+    const hX = shannonEntropy(mX, base);
+    const hY = shannonEntropy(mY, base);
+    const out = condOn === 'X' ? hXY - hY : hXY - hX;
+    return out < 0 && out > -1e-12 ? 0 : out;
+}
+// Cuatro escalares clásicos: H(X), H(Y), H(X,Y), I(X;Y). Útil para
+// verificar la regla de la cadena: H(X,Y) = H(X) + H(Y) − I(X;Y).
+function chainRule(j, base = 2) {
+    const { X: mX, Y: mY } = jointToMarginals(j);
+    return {
+        hX: shannonEntropy(mX, base),
+        hY: shannonEntropy(mY, base),
+        hXY: jointEntropy(j, base),
+        iXY: mutualInformation(j, base),
+    };
+}
+//# sourceMappingURL=index.js.map

package/dist/information-theory/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/information-theory/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,8DAA8D;AAC9D,+DAA+D;AAC/D,EAAE;AACF,uEAAuE;AACvE,qBAAqB;AACrB,EAAE;AACF,wDAAwD;AACxD,wDAAwD;AACxD,2DAA2D;AAC3D,6DAA6D;AAC7D,EAAE;AACF,yBAAyB;AACzB,sEAAsE;AACtE,2DAA2D;AAC3D,wEAAwE;AACxE,2DAA2D;AAC3D,sEAAsE;AACtE,sEAAsE;AACtE,8DAA8D;;AAoB9D,0BAMC;AAID,kDAOC;AAID,8BAgBC;AA4BD,wCASC;AAaD,oCAcC;AAGD,gCAQC;AAGD,gCAKC;AAGD,4CAQC;AASD,oCAUC;AAID,oCAQC;AAGD,gCASC;AAID,8CAYC;AAQD,oCAUC;AAUD,4CAUC;AAgBD,8CAcC;AAID,gDAWC;AAID,8BAWC;AAzSD,qEAAqE;AACrE,MAAM,WAAW,GAAG,IAAI,CAAC;AAEzB,+DAA+D;AAC/D,uBAAuB;AACvB,+DAA+D;AAE/D,uEAAuE;AACvE,iEAAiE;AACjE,SAAgB,OAAO,CAAI,CAAkB;IAC3C,MAAM,GAAG,GAAQ,EAAE,CAAC;IACpB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,uEAAuE;AACvE,+DAA+D;AAC/D,SAAgB,mBAAmB,CAAI,CAAkB,EAAE,MAAc,WAAW;IAClF,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/C,GAAG,IAAI,CAAC,CAAC;IACX,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC;AAClC,CAAC;AAED,oEAAoE;AACpE,8DAA8D;AAC9D,SAAgB,SAAS,CAAI,CAAkB;IAC7C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;QACjF,CAAC;QACD,GAAG,IAAI,CAAC,CAAC;IACX,CAAC;IACD,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAa,CAAC;IACjC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACvB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AASD,SAAS,KAAK,CAAC,IAAa;IAC1B,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,GAAG;YACN,OAAO,IAAI,CAAC,GAAG,CAAC;QAClB,KAAK,EAAE;YACL,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,KAAK,CAAC,CAAC;QACP,KAAK,KAAK,CAAC;QACX;YACE,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,YAAY;AACZ,+DAA+D;AAE/D,sCAAsC;AACtC,yEAAyE;AACzE,SAAgB,cAAc,CAAI,CAAkB,EAAE,OAAgB,CAAC;IACrE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,mCAAmC;AACnC,oCAAoC;AACpC,EAAE;AACF,oBAAoB;AACpB,mEAAmE;AACnE,uEAAuE;AACvE,sDAAsD;AACtD,6CAA6C;AAC7C,EAAE;AACF,mEAAmE;AACnE,+CAA+C;AAC/C,SAAgB,YAAY,CAAI,CAAkB,EAAE,KAAa,EAAE,OAAgB,CAAC;IAClF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IAC3D,CAAC;IACD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAChD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAE5C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED,2EAA2E;AAC3E,SAAgB,UAAU,CAAI,CAAkB,EAAE,OAAgB,CAAC;IACjE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACxB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACnB,CAAC;AAED,mEAAmE;AACnE,SAAgB,UAAU,CAAI,CAAkB,EAAE,OAAgB,CAAC;IACjE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC5B,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;AAChB,CAAC;AAED,mDAAmD;AACnD,SAAgB,gBAAgB,CAAI,CAAkB,EAAE,OAAgB,CAAC;IACvE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,+DAA+D;AAC/D,4BAA4B;AAC5B,+DAA+D;AAE/D,uCAAuC;AACvC,4DAA4D;AAC5D,6CAA6C;AAC7C,SAAgB,YAAY,CAAI,CAAkB,EAAE,CAAkB,EAAE,OAAgB,CAAC;IACvF,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;QACvB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,iBAAiB,CAAC;QAC9C,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,mEAAmE;AACnE,8DAA8D;AAC9D,SAAgB,YAAY,CAAI,CAAkB,EAAE,CAAkB,EAAE,OAAgB,CAAC;IACvF,MAAM,CAAC,GAAG,IAAI,GAAG,EAAa,CAAC;IAC/B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,qDAAqD;IACrD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAExC,OAAO,GAAG,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,GAAG,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACzE,CAAC;AAED,uEAAuE;AACvE,SAAgB,UAAU,CAAI,CAAkB,EAAE,CAAkB;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,CAAC;AACf,CAAC;AAED,sEAAsE;AACtE,iDAAiD;AACjD,SAAgB,iBAAiB,CAAI,CAAkB,EAAE,CAAkB;IACzE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;AACnC,CAAC;AAED,+DAA+D;AAC/D,gBAAgB;AAChB,+DAA+D;AAE/D,mDAAmD;AACnD,mDAAmD;AACnD,SAAgB,YAAY,CAAI,CAAkB,EAAE,CAAkB,EAAE,OAAgB,CAAC;IACvF,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;QACvB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,iBAAiB,CAAC;QAC9C,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,+DAA+D;AAC/D,+CAA+C;AAC/C,+DAA+D;AAE/D,mEAAmE;AACnE,kEAAkE;AAClE,sEAAsE;AACtE,iEAAiE;AACjE,SAAgB,gBAAgB,CAAO,CAAc;IACnD,MAAM,EAAE,GAAG,IAAI,GAAG,EAAa,CAAC;IAChC,MAAM,EAAE,GAAG,IAAI,GAAG,EAAa,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;AAC1B,CAAC;AAED,oEAAoE;AACpE,SAAS,YAAY,CAAO,CAAc,EAAE,IAAa;IACvD,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,uDAAuD;AACvD,mDAAmD;AACnD,mEAAmE;AACnE,2EAA2E;AAC3E,SAAgB,iBAAiB,CAAO,CAAc,EAAE,OAAgB,CAAC;IACvE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC7C,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,CAAC;YAAE,SAAS;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;QACnC,EAAE,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,mEAAmE;IACnE,6DAA6D;IAC7D,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACxC,CAAC;AAED,kCAAkC;AAClC,6DAA6D;AAC7D,SAAgB,kBAAkB,CAChC,CAAc,EACd,MAAiB,EACjB,OAAgB,CAAC;IAEjB,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAClC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,GAAG,GAAG,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;IACjD,OAAO,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAC3C,CAAC;AAED,mEAAmE;AACnE,kEAAkE;AAClE,SAAgB,SAAS,CACvB,CAAc,EACd,OAAgB,CAAC;IAEjB,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC7C,OAAO;QACL,EAAE,EAAE,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC;QAC5B,EAAE,EAAE,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC;QAC5B,GAAG,EAAE,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC;QAC1B,GAAG,EAAE,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC;KAChC,CAAC;AACJ,CAAC"}

package/dist/namespaces/logic.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Namespace: Logic
+ *
+ * Agrupa los perfiles lógicos disponibles en ST. Cada sub-namespace expone
+ * los símbolos del módulo correspondiente sin colisiones de nombres entre
+ * lógicas (CTL.Formula vs LTL.Formula, etc).
+ *
+ * Importa así:
+ *   import { Logic } from '@stevenvo780/st-lang';
+ *   Logic.modal.s5.isValid(formula);
+ *   Logic.ctl.modelCheckCTL(kripke, formula);
+ */
+export { LogicProfile, ProfileRegistry, registry } from '../profiles/interface';
+export { ClassicalPropositional, formulaToString } from '../profiles/classical/propositional';
+export { ClassicalFirstOrder } from '../profiles/classical/first-order';
+export { ModalK } from '../profiles/modal/k';
+export { ParaconsistentBelnap } from '../profiles/paraconsistent/belnap';
+export { IntuitionisticPropositional } from '../profiles/intuitionistic/propositional';
+export { TemporalLTL } from '../profiles/temporal/ltl';
+export { EpistemicS5 } from '../profiles/epistemic/s5';
+export { DeonticStandard } from '../profiles/deontic/standard';
+export { AristotelianSyllogistic } from '../profiles/aristotelian/syllogistic';
+export { ProbabilisticBasic } from '../profiles/probabilistic/basic';
+import * as ctl from '../profiles/ctl';
+import * as ltl from '../profiles/ltl-sat';
+import * as muCalculus from '../profiles/mu-calculus';
+import * as hybrid from '../profiles/hybrid-logic';
+import * as descriptionLogic from '../profiles/description-logic';
+import * as modalAxioms from '../profiles/modal-frame-axioms';
+import * as sequentG3 from '../profiles/sequent-g3';
+import * as sequentLK from '../profiles/sequent-lk';
+import * as intuitNJ from '../profiles/intuitionistic-nj';
+import * as defaultLogic from '../profiles/default-logic';
+import * as manyValued from '../profiles/many-valued';
+import * as substructural from '../profiles/substructural';
+import * as arithmetic from '../profiles/arithmetic';
+export { ctl, ltl, muCalculus, hybrid, descriptionLogic, modalAxioms, sequentG3, sequentLK, intuitNJ, defaultLogic, manyValued, substructural, arithmetic, };
+export { cdcl, cdclAsync } from '../profiles/classical/cdcl';
+export type { CDCLResult } from '../profiles/classical/cdcl';
+export { dpll, dpllAsync } from '../profiles/classical/dpll';
+export { workersAvailable, PARALLEL_THRESHOLD } from '../profiles/classical/parallel-sat';
+//# sourceMappingURL=logic.d.ts.map

package/dist/namespaces/logic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logic.d.ts","sourceRoot":"","sources":["../../src/namespaces/logic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAE,YAAY,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAGhF,OAAO,EAAE,sBAAsB,EAAE,eAAe,EAAE,MAAM,qCAAqC,CAAC;AAC9F,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,oBAAoB,EAAE,MAAM,mCAAmC,CAAC;AACzE,OAAO,EAAE,2BAA2B,EAAE,MAAM,0CAA0C,CAAC;AACvF,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,EAAE,uBAAuB,EAAE,MAAM,sCAAsC,CAAC;AAC/E,OAAO,EAAE,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AAGrE,OAAO,KAAK,GAAG,MAAM,iBAAiB,CAAC;AACvC,OAAO,KAAK,GAAG,MAAM,qBAAqB,CAAC;AAC3C,OAAO,KAAK,UAAU,MAAM,yBAAyB,CAAC;AACtD,OAAO,KAAK,MAAM,MAAM,0BAA0B,CAAC;AACnD,OAAO,KAAK,gBAAgB,MAAM,+BAA+B,CAAC;AAClE,OAAO,KAAK,WAAW,MAAM,gCAAgC,CAAC;AAC9D,OAAO,KAAK,SAAS,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,SAAS,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,QAAQ,MAAM,+BAA+B,CAAC;AAC1D,OAAO,KAAK,YAAY,MAAM,2BAA2B,CAAC;AAC1D,OAAO,KAAK,UAAU,MAAM,yBAAyB,CAAC;AACtD,OAAO,KAAK,aAAa,MAAM,2BAA2B,CAAC;AAC3D,OAAO,KAAK,UAAU,MAAM,wBAAwB,CAAC;AAErD,OAAO,EACL,GAAG,EACH,GAAG,EACH,UAAU,EACV,MAAM,EACN,gBAAgB,EAChB,WAAW,EACX,SAAS,EACT,SAAS,EACT,QAAQ,EACR,YAAY,EACZ,UAAU,EACV,aAAa,EACb,UAAU,GACX,CAAC;AAGF,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAC7D,YAAY,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,oCAAoC,CAAC"}

package/dist/namespaces/logic.js

@@ -0,0 +1,112 @@
+"use strict";
+/**
+ * Namespace: Logic
+ *
+ * Agrupa los perfiles lógicos disponibles en ST. Cada sub-namespace expone
+ * los símbolos del módulo correspondiente sin colisiones de nombres entre
+ * lógicas (CTL.Formula vs LTL.Formula, etc).
+ *
+ * Importa así:
+ *   import { Logic } from '@stevenvo780/st-lang';
+ *   Logic.modal.s5.isValid(formula);
+ *   Logic.ctl.modelCheckCTL(kripke, formula);
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PARALLEL_THRESHOLD = exports.workersAvailable = exports.dpllAsync = exports.dpll = exports.cdclAsync = exports.cdcl = exports.arithmetic = exports.substructural = exports.manyValued = exports.defaultLogic = exports.intuitNJ = exports.sequentLK = exports.sequentG3 = exports.modalAxioms = exports.descriptionLogic = exports.hybrid = exports.muCalculus = exports.ltl = exports.ctl = exports.ProbabilisticBasic = exports.AristotelianSyllogistic = exports.DeonticStandard = exports.EpistemicS5 = exports.TemporalLTL = exports.IntuitionisticPropositional = exports.ParaconsistentBelnap = exports.ModalK = exports.ClassicalFirstOrder = exports.formulaToString = exports.ClassicalPropositional = exports.registry = exports.ProfileRegistry = void 0;
+// Perfil registry + interfaces compartidas
+var interface_1 = require("../profiles/interface");
+Object.defineProperty(exports, "ProfileRegistry", { enumerable: true, get: function () { return interface_1.ProfileRegistry; } });
+Object.defineProperty(exports, "registry", { enumerable: true, get: function () { return interface_1.registry; } });
+// Perfiles "clase suelta" (un solo símbolo)
+var propositional_1 = require("../profiles/classical/propositional");
+Object.defineProperty(exports, "ClassicalPropositional", { enumerable: true, get: function () { return propositional_1.ClassicalPropositional; } });
+Object.defineProperty(exports, "formulaToString", { enumerable: true, get: function () { return propositional_1.formulaToString; } });
+var first_order_1 = require("../profiles/classical/first-order");
+Object.defineProperty(exports, "ClassicalFirstOrder", { enumerable: true, get: function () { return first_order_1.ClassicalFirstOrder; } });
+var k_1 = require("../profiles/modal/k");
+Object.defineProperty(exports, "ModalK", { enumerable: true, get: function () { return k_1.ModalK; } });
+var belnap_1 = require("../profiles/paraconsistent/belnap");
+Object.defineProperty(exports, "ParaconsistentBelnap", { enumerable: true, get: function () { return belnap_1.ParaconsistentBelnap; } });
+var propositional_2 = require("../profiles/intuitionistic/propositional");
+Object.defineProperty(exports, "IntuitionisticPropositional", { enumerable: true, get: function () { return propositional_2.IntuitionisticPropositional; } });
+var ltl_1 = require("../profiles/temporal/ltl");
+Object.defineProperty(exports, "TemporalLTL", { enumerable: true, get: function () { return ltl_1.TemporalLTL; } });
+var s5_1 = require("../profiles/epistemic/s5");
+Object.defineProperty(exports, "EpistemicS5", { enumerable: true, get: function () { return s5_1.EpistemicS5; } });
+var standard_1 = require("../profiles/deontic/standard");
+Object.defineProperty(exports, "DeonticStandard", { enumerable: true, get: function () { return standard_1.DeonticStandard; } });
+var syllogistic_1 = require("../profiles/aristotelian/syllogistic");
+Object.defineProperty(exports, "AristotelianSyllogistic", { enumerable: true, get: function () { return syllogistic_1.AristotelianSyllogistic; } });
+var basic_1 = require("../profiles/probabilistic/basic");
+Object.defineProperty(exports, "ProbabilisticBasic", { enumerable: true, get: function () { return basic_1.ProbabilisticBasic; } });
+// Sub-namespaces (cada perfil con barrel propio)
+const ctl = __importStar(require("../profiles/ctl"));
+exports.ctl = ctl;
+const ltl = __importStar(require("../profiles/ltl-sat"));
+exports.ltl = ltl;
+const muCalculus = __importStar(require("../profiles/mu-calculus"));
+exports.muCalculus = muCalculus;
+const hybrid = __importStar(require("../profiles/hybrid-logic"));
+exports.hybrid = hybrid;
+const descriptionLogic = __importStar(require("../profiles/description-logic"));
+exports.descriptionLogic = descriptionLogic;
+const modalAxioms = __importStar(require("../profiles/modal-frame-axioms"));
+exports.modalAxioms = modalAxioms;
+const sequentG3 = __importStar(require("../profiles/sequent-g3"));
+exports.sequentG3 = sequentG3;
+const sequentLK = __importStar(require("../profiles/sequent-lk"));
+exports.sequentLK = sequentLK;
+const intuitNJ = __importStar(require("../profiles/intuitionistic-nj"));
+exports.intuitNJ = intuitNJ;
+const defaultLogic = __importStar(require("../profiles/default-logic"));
+exports.defaultLogic = defaultLogic;
+const manyValued = __importStar(require("../profiles/many-valued"));
+exports.manyValued = manyValued;
+const substructural = __importStar(require("../profiles/substructural"));
+exports.substructural = substructural;
+const arithmetic = __importStar(require("../profiles/arithmetic"));
+exports.arithmetic = arithmetic;
+// SAT solving (algoritmos clásicos para evaluación de fórmulas)
+var cdcl_1 = require("../profiles/classical/cdcl");
+Object.defineProperty(exports, "cdcl", { enumerable: true, get: function () { return cdcl_1.cdcl; } });
+Object.defineProperty(exports, "cdclAsync", { enumerable: true, get: function () { return cdcl_1.cdclAsync; } });
+var dpll_1 = require("../profiles/classical/dpll");
+Object.defineProperty(exports, "dpll", { enumerable: true, get: function () { return dpll_1.dpll; } });
+Object.defineProperty(exports, "dpllAsync", { enumerable: true, get: function () { return dpll_1.dpllAsync; } });
+var parallel_sat_1 = require("../profiles/classical/parallel-sat");
+Object.defineProperty(exports, "workersAvailable", { enumerable: true, get: function () { return parallel_sat_1.workersAvailable; } });
+Object.defineProperty(exports, "PARALLEL_THRESHOLD", { enumerable: true, get: function () { return parallel_sat_1.PARALLEL_THRESHOLD; } });
+//# sourceMappingURL=logic.js.map

package/dist/namespaces/logic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"logic.js","sourceRoot":"","sources":["../../src/namespaces/logic.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;GAWG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,2CAA2C;AAC3C,mDAAgF;AAAzD,4GAAA,eAAe,OAAA;AAAE,qGAAA,QAAQ,OAAA;AAEhD,4CAA4C;AAC5C,qEAA8F;AAArF,uHAAA,sBAAsB,OAAA;AAAE,gHAAA,eAAe,OAAA;AAChD,iEAAwE;AAA/D,kHAAA,mBAAmB,OAAA;AAC5B,yCAA6C;AAApC,2FAAA,MAAM,OAAA;AACf,4DAAyE;AAAhE,8GAAA,oBAAoB,OAAA;AAC7B,0EAAuF;AAA9E,4HAAA,2BAA2B,OAAA;AACpC,gDAAuD;AAA9C,kGAAA,WAAW,OAAA;AACpB,+CAAuD;AAA9C,iGAAA,WAAW,OAAA;AACpB,yDAA+D;AAAtD,2GAAA,eAAe,OAAA;AACxB,oEAA+E;AAAtE,sHAAA,uBAAuB,OAAA;AAChC,yDAAqE;AAA5D,2GAAA,kBAAkB,OAAA;AAE3B,iDAAiD;AACjD,qDAAuC;AAerC,kBAAG;AAdL,yDAA2C;AAezC,kBAAG;AAdL,oEAAsD;AAepD,gCAAU;AAdZ,iEAAmD;AAejD,wBAAM;AAdR,gFAAkE;AAehE,4CAAgB;AAdlB,4EAA8D;AAe5D,kCAAW;AAdb,kEAAoD;AAelD,8BAAS;AAdX,kEAAoD;AAelD,8BAAS;AAdX,wEAA0D;AAexD,4BAAQ;AAdV,wEAA0D;AAexD,oCAAY;AAdd,oEAAsD;AAepD,gCAAU;AAdZ,yEAA2D;AAezD,sCAAa;AAdf,mEAAqD;AAenD,gCAAU;AAGZ,gEAAgE;AAChE,mDAA6D;AAApD,4FAAA,IAAI,OAAA;AAAE,iGAAA,SAAS,OAAA;AAExB,mDAA6D;AAApD,4FAAA,IAAI,OAAA;AAAE,iGAAA,SAAS,OAAA;AACxB,mEAA0F;AAAjF,gHAAA,gBAAgB,OAAA;AAAE,kHAAA,kBAAkB,OAAA"}

package/dist/namespaces/proof-systems.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Namespace: ProofSystems
+ *
+ * Probadores formales y mecanismos de intercambio/manipulación de pruebas.
+ *
+ * Importa así:
+ *   import { ProofSystems } from '@stevenvo780/st-lang';
+ *   ProofSystems.folProver.proveFOL(theory);
+ *   ProofSystems.proofExchange.signProof(pkg, key);
+ */
+import * as folProver from '../fol-prover';
+import * as folProverEquality from '../fol-prover-equality';
+import * as proofExchange from '../proof-exchange';
+import * as proofMinify from '../runtime/proof-minify';
+import * as tableauFramework from '../tableau-framework';
+import * as proofNets from '../proof-nets';
+export { folProver, folProverEquality, proofExchange, proofMinify, tableauFramework, proofNets, };
+//# sourceMappingURL=proof-systems.d.ts.map

package/dist/namespaces/proof-systems.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proof-systems.d.ts","sourceRoot":"","sources":["../../src/namespaces/proof-systems.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,SAAS,MAAM,eAAe,CAAC;AAC3C,OAAO,KAAK,iBAAiB,MAAM,wBAAwB,CAAC;AAC5D,OAAO,KAAK,aAAa,MAAM,mBAAmB,CAAC;AACnD,OAAO,KAAK,WAAW,MAAM,yBAAyB,CAAC;AACvD,OAAO,KAAK,gBAAgB,MAAM,sBAAsB,CAAC;AACzD,OAAO,KAAK,SAAS,MAAM,eAAe,CAAC;AAE3C,OAAO,EACL,SAAS,EACT,iBAAiB,EACjB,aAAa,EACb,WAAW,EACX,gBAAgB,EAChB,SAAS,GACV,CAAC"}

package/dist/namespaces/proof-systems.js

@@ -0,0 +1,59 @@
+"use strict";
+/**
+ * Namespace: ProofSystems
+ *
+ * Probadores formales y mecanismos de intercambio/manipulación de pruebas.
+ *
+ * Importa así:
+ *   import { ProofSystems } from '@stevenvo780/st-lang';
+ *   ProofSystems.folProver.proveFOL(theory);
+ *   ProofSystems.proofExchange.signProof(pkg, key);
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.proofNets = exports.tableauFramework = exports.proofMinify = exports.proofExchange = exports.folProverEquality = exports.folProver = void 0;
+const folProver = __importStar(require("../fol-prover"));
+exports.folProver = folProver;
+const folProverEquality = __importStar(require("../fol-prover-equality"));
+exports.folProverEquality = folProverEquality;
+const proofExchange = __importStar(require("../proof-exchange"));
+exports.proofExchange = proofExchange;
+const proofMinify = __importStar(require("../runtime/proof-minify"));
+exports.proofMinify = proofMinify;
+const tableauFramework = __importStar(require("../tableau-framework"));
+exports.tableauFramework = tableauFramework;
+const proofNets = __importStar(require("../proof-nets"));
+exports.proofNets = proofNets;
+//# sourceMappingURL=proof-systems.js.map

package/dist/namespaces/proof-systems.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"proof-systems.js","sourceRoot":"","sources":["../../src/namespaces/proof-systems.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,yDAA2C;AAQzC,8BAAS;AAPX,0EAA4D;AAQ1D,8CAAiB;AAPnB,iEAAmD;AAQjD,sCAAa;AAPf,qEAAuD;AAQrD,kCAAW;AAPb,uEAAyD;AAQvD,4CAAgB;AAPlB,yDAA2C;AAQzC,8BAAS"}