@stevenvo780/st-lang 4.7.0 → 4.8.0

package/dist/reasoning/probabilistic/types.d.ts

@@ -0,0 +1,153 @@
+/**
+ * Distribución de probabilidad sobre valores de tipo T.
+ *
+ * Cinco familias paramétricas comunes + `discrete` (PMF arbitraria
+ * sobre claves T) y `categorical` (lista paralela de valores y probs).
+ *
+ * Convenciones:
+ *   - `uniform`: continua sobre `[low, high)`.
+ *   - `normal`: gaussiana con `std > 0`.
+ *   - `poisson`: discreta sobre {0, 1, 2, ...}.
+ *   - `bernoulli`: discreta sobre {true, false} con `P(true) = p`.
+ *   - `categorical`/`discrete`: las probs deben sumar 1 (se normaliza).
+ */
+/** Bernoulli sobre {true, false}. */
+export interface BernoulliDist {
+    readonly kind: 'bernoulli';
+    readonly p: number;
+    /** Phantom: liga T = boolean en sample(). Runtime: undefined. */
+    readonly __t?: boolean;
+}
+/** Uniforme continua sobre [low, high). */
+export interface UniformDist {
+    readonly kind: 'uniform';
+    readonly low: number;
+    readonly high: number;
+    readonly __t?: number;
+}
+/** Gaussiana con media y desviación. */
+export interface NormalDist {
+    readonly kind: 'normal';
+    readonly mean: number;
+    readonly std: number;
+    readonly __t?: number;
+}
+/** Poisson sobre {0, 1, 2, ...}. */
+export interface PoissonDist {
+    readonly kind: 'poisson';
+    readonly lambda: number;
+    readonly __t?: number;
+}
+/** Categorical con lista de valores paralelos a sus probabilidades. */
+export interface CategoricalDist<T> {
+    readonly kind: 'categorical';
+    readonly values: T[];
+    readonly probs: number[];
+    readonly __t?: T;
+}
+/** Discrete con PMF (Map de valor → masa). */
+export interface DiscreteDist<T> {
+    readonly kind: 'discrete';
+    readonly pmf: Map<T, number>;
+    readonly __t?: T;
+}
+/**
+ * Distribución sobre valores de tipo T.
+ *
+ * En la práctica usá los constructores (`bernoulli`, `uniform`,
+ * `normal`, `poisson`, `categorical`, `discrete`) que devuelven
+ * el tipo Distribution<T> ya tipado.
+ */
+export type Distribution<T> = BernoulliDist | UniformDist | NormalDist | PoissonDist | CategoricalDist<T> | DiscreteDist<T>;
+/**
+ * Helpers de construcción. Cada uno devuelve la `Distribution<T>`
+ * adecuada con T inferido (boolean / number / genérico).
+ */
+export declare function bernoulli(p: number): BernoulliDist;
+export declare function uniform(low: number, high: number): UniformDist;
+export declare function normal(mean: number, std: number): NormalDist;
+export declare function poisson(lambda: number): PoissonDist;
+export declare function categorical<T>(values: T[], probs: number[]): CategoricalDist<T>;
+export declare function discrete<T>(pmf: Map<T, number>): DiscreteDist<T>;
+/**
+ * Sampler: interface que recibe el programa probabilístico para
+ * (a) muestrear de distribuciones, (b) condicionar con observaciones
+ * que descartan ejecuciones inconsistentes, y (c) ajustar el peso
+ * de la traza con un log-factor arbitrario.
+ *
+ * Cada motor de inferencia implementa este interface de manera
+ * distinta (enumeración exacta, rejection, importance, MH).
+ *
+ * Las firmas overloaded permiten que `sample(bernoulli(p))` infiera
+ * `boolean`, `sample(normal(...))` infiera `number`, etc.
+ */
+export interface Sampler {
+    sample(dist: BernoulliDist): boolean;
+    sample(dist: UniformDist): number;
+    sample(dist: NormalDist): number;
+    sample(dist: PoissonDist): number;
+    sample<T>(dist: CategoricalDist<T>): T;
+    sample<T>(dist: DiscreteDist<T>): T;
+    sample<T>(dist: Distribution<T>): T;
+    /**
+     * Condiciona la traza: si `condition` es false, la traza tiene
+     * peso 0 (será descartada o re-muestreada según el backend).
+     */
+    observe(condition: boolean): void;
+    /**
+     * Suma `logWeight` al log-peso de la traza. Útil para likelihoods
+     * con densidad continua que no se pueden expresar como observe
+     * booleano (p.ej. observe gaussiano vs valor real).
+     */
+    factor(logWeight: number): void;
+}
+/**
+ * Programa probabilístico: función que, dado un sampler, produce
+ * un valor de retorno (la query). Las llamadas a `sampler.sample`
+ * dentro del programa definen el prior; las llamadas a `observe`
+ * y `factor` definen el conditioning.
+ */
+export type PProgram<T> = (sampler: Sampler) => T;
+/**
+ * Opciones de inferencia genéricas. Defaults razonables por motor.
+ *   - `numSamples`: tamaño objetivo del posterior.
+ *   - `burnIn`: descartar las primeras N iteraciones (solo MCMC).
+ *   - `thin`: tomar 1 de cada N (solo MCMC, para reducir autocorr).
+ *   - `maxAttempts`: tope global de intentos (rejection); evita loops
+ *     infinitos cuando la observación es demasiado restrictiva.
+ *   - `rng`: generador inyectable para tests deterministas.
+ *   - `proposalStd`: desviación para propuestas gaussianas en MH.
+ */
+export interface InferenceOptions {
+    numSamples?: number;
+    burnIn?: number;
+    thin?: number;
+    maxAttempts?: number;
+    rng?: () => number;
+    proposalStd?: number;
+}
+/**
+ * Resumen del posterior sobre el valor de retorno del programa.
+ *
+ * Campos numéricos (`mean`, `std`, `quantiles`) solo se rellenan
+ * cuando los samples son finitamente numéricos (incluye booleanos
+ * tratados como 0/1). El histograma siempre se computa: agrupa por
+ * igualdad estructural (JSON-serializable) y reporta la masa
+ * estimada por valor.
+ */
+export interface PosteriorSummary<T> {
+    samples: T[];
+    mean?: number;
+    std?: number;
+    quantiles?: Record<number, number>;
+    histogram?: Map<T, number>;
+    /** Effective sample size aproximado (importance sampling). */
+    ess?: number;
+    /** Tasa de aceptación (solo MH). */
+    acceptanceRate?: number;
+    /** Fracción de propuestas aceptadas con respecto a las totales. */
+    numAccepted?: number;
+    /** Intentos totales (rejection / importance) — útil para diagnóstico. */
+    totalAttempts?: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/reasoning/probabilistic/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/reasoning/probabilistic/types.ts"],"names":[],"mappings":"AAOA;;;;;;;;;;;;GAYG;AAMH,qCAAqC;AACrC,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,iEAAiE;IACjE,QAAQ,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC;CACxB;AAED,2CAA2C;AAC3C,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,wCAAwC;AACxC,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,oCAAoC;AACpC,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,uEAAuE;AACvE,MAAM,WAAW,eAAe,CAAC,CAAC;IAChC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC;IACzB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;CAClB;AAED,8CAA8C;AAC9C,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC7B,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;CAClB;AAED;;;;;;GAMG;AACH,MAAM,MAAM,YAAY,CAAC,CAAC,IACtB,aAAa,GACb,WAAW,GACX,UAAU,GACV,WAAW,GACX,eAAe,CAAC,CAAC,CAAC,GAClB,YAAY,CAAC,CAAC,CAAC,CAAC;AAEpB;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,aAAa,CAElD;AAED,wBAAgB,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,WAAW,CAE9D;AAED,wBAAgB,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,UAAU,CAE5D;AAED,wBAAgB,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,CAEnD;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAE/E;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAEhE;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,OAAO;IACtB,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC;IACrC,MAAM,CAAC,IAAI,EAAE,WAAW,GAAG,MAAM,CAAC;IAClC,MAAM,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAAC;IACjC,MAAM,CAAC,IAAI,EAAE,WAAW,GAAG,MAAM,CAAC;IAClC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACvC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEpC;;;OAGG;IACH,OAAO,CAAC,SAAS,EAAE,OAAO,GAAG,IAAI,CAAC;IAElC;;;;OAIG;IACH,MAAM,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;CACjC;AAED;;;;;GAKG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;AAElD;;;;;;;;;GASG;AACH,MAAM,WAAW,gBAAgB;IAC/B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,gBAAgB,CAAC,CAAC;IACjC,OAAO,EAAE,CAAC,EAAE,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3B,8DAA8D;IAC9D,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,oCAAoC;IACpC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,mEAAmE;IACnE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,yEAAyE;IACzE,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB"}

package/dist/reasoning/probabilistic/types.js

@@ -0,0 +1,37 @@
+"use strict";
+// ============================================================
+// Probabilistic Programming — Types
+// ============================================================
+//
+// Tipos de datos para un PPL minimal: distribuciones, programas
+// probabilísticos, sampler y resumen de posterior.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.bernoulli = bernoulli;
+exports.uniform = uniform;
+exports.normal = normal;
+exports.poisson = poisson;
+exports.categorical = categorical;
+exports.discrete = discrete;
+/**
+ * Helpers de construcción. Cada uno devuelve la `Distribution<T>`
+ * adecuada con T inferido (boolean / number / genérico).
+ */
+function bernoulli(p) {
+    return { kind: 'bernoulli', p };
+}
+function uniform(low, high) {
+    return { kind: 'uniform', low, high };
+}
+function normal(mean, std) {
+    return { kind: 'normal', mean, std };
+}
+function poisson(lambda) {
+    return { kind: 'poisson', lambda };
+}
+function categorical(values, probs) {
+    return { kind: 'categorical', values, probs };
+}
+function discrete(pmf) {
+    return { kind: 'discrete', pmf };
+}
+//# sourceMappingURL=types.js.map

package/dist/reasoning/probabilistic/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/reasoning/probabilistic/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oCAAoC;AACpC,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,mDAAmD;;AAqFnD,8BAEC;AAED,0BAEC;AAED,wBAEC;AAED,0BAEC;AAED,kCAEC;AAED,4BAEC;AA1BD;;;GAGG;AACH,SAAgB,SAAS,CAAC,CAAS;IACjC,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;AAClC,CAAC;AAED,SAAgB,OAAO,CAAC,GAAW,EAAE,IAAY;IAC/C,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;AACxC,CAAC;AAED,SAAgB,MAAM,CAAC,IAAY,EAAE,GAAW;IAC9C,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AACvC,CAAC;AAED,SAAgB,OAAO,CAAC,MAAc;IACpC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;AACrC,CAAC;AAED,SAAgB,WAAW,CAAI,MAAW,EAAE,KAAe;IACzD,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAChD,CAAC;AAED,SAAgB,QAAQ,CAAI,GAAmB;IAC7C,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;AACnC,CAAC"}

package/dist/solver/smt-z3/index.d.ts

@@ -0,0 +1,3 @@
+export { Z3WasmBackend, isZ3Available, detectAvailableSMT } from './z3-wasm-backend';
+export type { AsyncSMTBackend, AvailableSMTRuntime, Z3WasmBackendOptions, Z3Scope, Z3ScopedAssertion, Z3ScopedDecl, } from './types';
+//# sourceMappingURL=index.d.ts.map

package/dist/solver/smt-z3/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/solver/smt-z3/index.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACrF,YAAY,EACV,eAAe,EACf,mBAAmB,EACnB,oBAAoB,EACpB,OAAO,EACP,iBAAiB,EACjB,YAAY,GACb,MAAM,SAAS,CAAC"}

package/dist/solver/smt-z3/index.js

@@ -0,0 +1,11 @@
+"use strict";
+// ============================================================
+// ST SMT-Z3 — Barrel del backend WASM real (z3-solver)
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.detectAvailableSMT = exports.isZ3Available = exports.Z3WasmBackend = void 0;
+var z3_wasm_backend_1 = require("./z3-wasm-backend");
+Object.defineProperty(exports, "Z3WasmBackend", { enumerable: true, get: function () { return z3_wasm_backend_1.Z3WasmBackend; } });
+Object.defineProperty(exports, "isZ3Available", { enumerable: true, get: function () { return z3_wasm_backend_1.isZ3Available; } });
+Object.defineProperty(exports, "detectAvailableSMT", { enumerable: true, get: function () { return z3_wasm_backend_1.detectAvailableSMT; } });
+//# sourceMappingURL=index.js.map

package/dist/solver/smt-z3/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/solver/smt-z3/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uDAAuD;AACvD,+DAA+D;;;AAE/D,qDAAqF;AAA5E,gHAAA,aAAa,OAAA;AAAE,gHAAA,aAAa,OAAA;AAAE,qHAAA,kBAAkB,OAAA"}

package/dist/solver/smt-z3/types.d.ts

@@ -0,0 +1,52 @@
+import type { SMTLogic, SMTModel, SMTResult, SMTSort } from '../smt/types';
+/**
+ * AsyncSMTBackend es la versión async del SMTBackend de `../smt/types`.
+ *
+ * Z3 corre como WASM via Emscripten y su `check()` es inherentemente async
+ * (event loop interno + workers). Por eso no podemos implementar el
+ * `SMTBackend` síncrono del bridge histórico — exponemos en su lugar
+ * `Promise<SMTResult>` para `checkSat()`.
+ */
+export interface AsyncSMTBackend {
+    readonly name: string;
+    reset(): void;
+    push(): void;
+    pop(levels?: number): void;
+    declareConst(name: string, sort: SMTSort, bvWidth?: number): void;
+    assertFormula(smtlib: string): void;
+    checkSat(): Promise<SMTResult>;
+    getModel(): SMTModel | undefined;
+    getUnsatCore(): string[];
+}
+/** Solver detectado disponible para uso real (no mock). */
+export type AvailableSMTRuntime = 'z3-wasm' | 'z3-subprocess' | 'cvc5-subprocess' | 'none';
+/** Opciones de creación del backend Z3 WASM. */
+export interface Z3WasmBackendOptions {
+    /** Lógica SMT-LIB a aplicar con `(set-logic ...)`. Default: omitida. */
+    logic?: SMTLogic;
+    /** Timeout por checkSat en ms (Z3 param `timeout`). Default: omitida. */
+    timeoutMs?: number;
+    /** Si true, activa `unsat_core` en el solver. Default: true. */
+    produceUnsatCore?: boolean;
+    /** Si true, activa `produce-models` en el solver. Default: true. */
+    produceModels?: boolean;
+}
+/** Una aserción registrada para reproducir scopes al rehidratar. */
+export interface Z3ScopedAssertion {
+    /** Cuerpo SMT-LIB sin envolver en `(assert ...)`. */
+    body: string;
+    /** Nombre del literal asumido si la aserción participa de unsat-core. */
+    trackName?: string;
+}
+/** Declaración registrada por nivel del stack. */
+export interface Z3ScopedDecl {
+    name: string;
+    sort: SMTSort;
+    bvWidth?: number;
+}
+/** Un nivel del stack push/pop reflejado en el host. */
+export interface Z3Scope {
+    decls: Z3ScopedDecl[];
+    assertions: Z3ScopedAssertion[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/solver/smt-z3/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/solver/smt-z3/types.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAE3E;;;;;;;GAOG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,KAAK,IAAI,IAAI,CAAC;IACd,IAAI,IAAI,IAAI,CAAC;IACb,GAAG,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAClE,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACpC,QAAQ,IAAI,OAAO,CAAC,SAAS,CAAC,CAAC;IAC/B,QAAQ,IAAI,QAAQ,GAAG,SAAS,CAAC;IACjC,YAAY,IAAI,MAAM,EAAE,CAAC;CAC1B;AAED,2DAA2D;AAC3D,MAAM,MAAM,mBAAmB,GAAG,SAAS,GAAG,eAAe,GAAG,iBAAiB,GAAG,MAAM,CAAC;AAE3F,gDAAgD;AAChD,MAAM,WAAW,oBAAoB;IACnC,wEAAwE;IACxE,KAAK,CAAC,EAAE,QAAQ,CAAC;IACjB,yEAAyE;IACzE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gEAAgE;IAChE,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,oEAAoE;IACpE,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAED,oEAAoE;AACpE,MAAM,WAAW,iBAAiB;IAChC,qDAAqD;IACrD,IAAI,EAAE,MAAM,CAAC;IACb,yEAAyE;IACzE,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,kDAAkD;AAClD,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,OAAO,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,wDAAwD;AACxD,MAAM,WAAW,OAAO;IACtB,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,UAAU,EAAE,iBAAiB,EAAE,CAAC;CACjC"}

package/dist/solver/smt-z3/types.js

@@ -0,0 +1,6 @@
+"use strict";
+// ============================================================
+// ST SMT-Z3 — Tipos del backend WASM real
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/solver/smt-z3/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/solver/smt-z3/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,0CAA0C;AAC1C,+DAA+D"}

package/dist/solver/smt-z3/z3-wasm-backend.d.ts

@@ -0,0 +1,88 @@
+import type { SMTLogic, SMTModel, SMTResult, SMTSort } from '../smt/types';
+import type { AsyncSMTBackend, AvailableSMTRuntime, Z3WasmBackendOptions } from './types';
+/**
+ * `isZ3Available()` intenta inicializar z3-solver y devuelve true si
+ * obtiene un Context utilizable. No lanza. Útil para skip de tests y
+ * detección de runtime.
+ */
+export declare function isZ3Available(): Promise<boolean>;
+/**
+ * Detector unificado de runtime SMT con preferencia por el WASM in-process.
+ * - z3-wasm si la WASM bind carga.
+ * - z3-subprocess o cvc5-subprocess si hay binario en PATH.
+ * - 'none' si no hay nada.
+ */
+export declare function detectAvailableSMT(): Promise<AvailableSMTRuntime>;
+/**
+ * Z3WasmBackend — wrapper sobre z3-solver con interfaz AsyncSMTBackend.
+ *
+ * Modelo de estado:
+ *  - Mantiene un único `Solver` Z3 cuyo stack push/pop se sincroniza con
+ *    `scopes[]` del host (espejo). Esto permite re-hidratar el solver con
+ *    `solver.reset()` + replay de scopes si fuera necesario (no se hace
+ *    en el flujo normal, sólo en `reset()`).
+ *  - `assertFormula(body)` mete `(assert body)` en el solver actual,
+ *    pero también lo registra en `scopes[top].assertions` por trazabilidad.
+ *  - `getUnsatCore()` requiere haber usado `assertNamed(name, body)`:
+ *    estos asserts se envuelven en `(=> <track> <body>)` y se pasan como
+ *    assumption literals al check(). El core devuelto es la lista de
+ *    nombres `track`.
+ */
+export declare class Z3WasmBackend implements AsyncSMTBackend {
+    readonly name = "z3-wasm";
+    private readonly z3;
+    private readonly ctx;
+    private solver;
+    private readonly logic;
+    private readonly produceUnsatCore;
+    private readonly produceModels;
+    private readonly timeoutMs;
+    private scopes;
+    /** Tracks declarados como Bool y usados como assumption literals. */
+    private trackNames;
+    private lastModel;
+    private lastUnsatCore;
+    private lastStatistics;
+    private constructor();
+    /** Crea un backend nuevo. Falla si z3-solver no puede inicializarse. */
+    static create(logicOrOptions?: SMTLogic | Z3WasmBackendOptions): Promise<Z3WasmBackend>;
+    /** Resetea el solver (drop all asserts y scopes). */
+    reset(): void;
+    push(): void;
+    pop(levels?: number): void;
+    declareConst(name: string, sort: SMTSort, bvWidth?: number): void;
+    /**
+     * Inserta una aserción directa (sin tracking). El cuerpo es SMT-LIB v2
+     * SIN envolver en `(assert ...)`.
+     */
+    assertFormula(smtlib: string): void;
+    /**
+     * Aserción nombrada para participar de unsat core. El `trackName` se
+     * declara como Bool fresco y la aserción real se mete como
+     * `(=> trackName body)`. En checkSat() esos tracks se pasan como
+     * assumption literals.
+     */
+    assertNamed(trackName: string, smtlib: string): void;
+    checkSat(): Promise<SMTResult>;
+    getModel(): SMTModel | undefined;
+    getUnsatCore(): string[];
+    /**
+     * `setOption` envuelve `solver.set(key, value)`. Acepta los nombres
+     * estándar Z3 (ej. `timeout`, `random_seed`).
+     */
+    setOption(key: string, value: string | number | boolean): void;
+    /** Devuelve la última snapshot de stats Z3 capturada en checkSat(). */
+    getStatistics(): Record<string, number>;
+    /**
+     * Cierra el solver liberando memoria WASM. Después de close() el
+     * backend no debe usarse.
+     */
+    close(): void;
+    private buildSolver;
+    private currentScope;
+    private formatDecl;
+    private extractModel;
+    private extractUnsatCore;
+    private extractStatistics;
+}
+//# sourceMappingURL=z3-wasm-backend.d.ts.map

package/dist/solver/smt-z3/z3-wasm-backend.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"z3-wasm-backend.d.ts","sourceRoot":"","sources":["../../../src/solver/smt-z3/z3-wasm-backend.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC3E,OAAO,KAAK,EACV,eAAe,EACf,mBAAmB,EAInB,oBAAoB,EACrB,MAAM,SAAS,CAAC;AAoEjB;;;;GAIG;AACH,wBAAsB,aAAa,IAAI,OAAO,CAAC,OAAO,CAAC,CAWtD;AAED;;;;;GAKG;AACH,wBAAsB,kBAAkB,IAAI,OAAO,CAAC,mBAAmB,CAAC,CAYvE;AAID;;;;;;;;;;;;;;GAcG;AACH,qBAAa,aAAc,YAAW,eAAe;IACnD,QAAQ,CAAC,IAAI,aAAa;IAE1B,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAW;IAC9B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAY;IAChC,OAAO,CAAC,MAAM,CAAW;IACzB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAuB;IAC7C,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAU;IAC3C,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAU;IACxC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAqB;IAE/C,OAAO,CAAC,MAAM,CAA8C;IAC5D,qEAAqE;IACrE,OAAO,CAAC,UAAU,CAA0B;IAC5C,OAAO,CAAC,SAAS,CAAuB;IACxC,OAAO,CAAC,aAAa,CAAgB;IACrC,OAAO,CAAC,cAAc,CAA8B;IAEpD,OAAO;IAUP,wEAAwE;WAC3D,MAAM,CACjB,cAAc,CAAC,EAAE,QAAQ,GAAG,oBAAoB,GAC/C,OAAO,CAAC,aAAa,CAAC;IAUzB,qDAAqD;IACrD,KAAK,IAAI,IAAI;IAcb,IAAI,IAAI,IAAI;IAKZ,GAAG,CAAC,MAAM,SAAI,GAAG,IAAI;IASrB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI;IAOjE;;;OAGG;IACH,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAOnC;;;;;OAKG;IACH,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAiB9C,QAAQ,IAAI,OAAO,CAAC,SAAS,CAAC;IAsCpC,QAAQ,IAAI,QAAQ,GAAG,SAAS;IAIhC,YAAY,IAAI,MAAM,EAAE;IAIxB;;;OAGG;IACH,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI;IAI9D,uEAAuE;IACvE,aAAa,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAIvC;;;OAGG;IACH,KAAK,IAAI,IAAI;IAYb,OAAO,CAAC,WAAW;IAcnB,OAAO,CAAC,YAAY;IAUpB,OAAO,CAAC,UAAU;IAOlB,OAAO,CAAC,YAAY;IAyBpB,OAAO,CAAC,gBAAgB;IAoBxB,OAAO,CAAC,iBAAiB;CAuB1B"}