@stevenvo780/st-lang 4.7.0 → 4.8.0

package/dist/reasoning/mechanism-design/vcg.d.ts

@@ -0,0 +1,29 @@
+import type { Agent, MechanismOutcome } from './types';
+/**
+ * VCG mechanism: allocation maximiza welfare; pago de cada agente =
+ * externalidad = (welfare óptimo de los demás cuando él NO participa)
+ *                - (welfare de los demás en la allocation elegida).
+ *
+ * Devuelve allocation y payments. Payments son ≥ 0 si valuations son
+ * monotónicas (las nuestras lo son).
+ */
+export declare function vcgMechanism(agents: Agent[], items: string[]): MechanismOutcome;
+/**
+ * Welfare social bajo una allocation: suma de valuations de los agentes
+ * por lo que recibieron.
+ */
+export declare function socialWelfare(outcome: MechanismOutcome, agents: Agent[]): number;
+/**
+ * Strategy-proofness empírica: tomamos `samples` reportes aleatorios de
+ * un agente (manteniendo a los demás truthful), corremos el mechanism,
+ * y verificamos que la utilidad del agente que miente no supere la
+ * utilidad reportando truthfully. Si para alguna sample el misreport
+ * mejora estrictamente, retornamos false.
+ *
+ * Utilidad cuasi-lineal: v(allocation_i) - payment_i.
+ *
+ * Esto es probabilístico: con `samples=0` no chequeamos nada y devolvemos
+ * true. Útil sobretodo para testing.
+ */
+export declare function isStrategyProof(mechanism: (agents: Agent[]) => MechanismOutcome, samples?: number): boolean;
+//# sourceMappingURL=vcg.d.ts.map

package/dist/reasoning/mechanism-design/vcg.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vcg.d.ts","sourceRoot":"","sources":["../../../src/reasoning/mechanism-design/vcg.ts"],"names":[],"mappings":"AAiCA,OAAO,KAAK,EAAE,KAAK,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AA4KvD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,gBAAgB,CA2B/E;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,gBAAgB,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAOhF;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAC7B,SAAS,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,gBAAgB,EAChD,OAAO,GAAE,MAAW,GACnB,OAAO,CAyDT"}

package/dist/reasoning/mechanism-design/vcg.js

@@ -0,0 +1,305 @@
+"use strict";
+// ============================================================
+// VCG mechanism (Vickrey-Clarke-Groves)
+// ============================================================
+//
+// El VCG mechanism elige la allocation que maximiza social welfare
+// (suma de valuations reportadas). Cobra a cada agente la
+// "externalidad" que impone sobre el resto: la diferencia entre el
+// welfare máximo de los OTROS agentes cuando él NO participa y el
+// welfare de los OTROS en la allocation elegida.
+//
+// Esta implementación cubre dos regímenes:
+//
+// 1. Single-item per agent (caso default): cada agente puede recibir
+//    a lo sumo 1 item, cada item se asigna a lo sumo 1 agente.
+//    Resolvemos el problema de asignación máxima por enumeración
+//    (Hungarian sería más eficiente pero alcanza para los tamaños
+//    de test, n ≤ ~8).
+//
+// 2. Combinatorial (bundles): si las valuations incluyen claves que
+//    representan combinaciones — convención: outcomes "*" significa
+//    "todos los items" — el algoritmo enumera particiones de items
+//    en agentes y elige la de mayor welfare. Por simplicidad y para
+//    los tests, asumimos que las claves del Map son subconjuntos de
+//    items separados por "+" o son items individuales.
+//
+// Para el caso combinatorial usamos enumeración exhaustiva de
+// asignaciones agente→bundle (cada item al primer agente que lo
+// quiera con mayor valor o sin asignar). Esto es exponencial en items
+// pero claro y suficiente para tests pequeños.
+//
+// Strategy-proof: VCG es DSIC (dominant-strategy incentive-compatible).
+// Verificamos esta propiedad empíricamente vía `isStrategyProof`.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.vcgMechanism = vcgMechanism;
+exports.socialWelfare = socialWelfare;
+exports.isStrategyProof = isStrategyProof;
+const EMPTY_BUNDLE = '';
+/** Junta items en una clave canónica ordenada. */
+function makeBundle(items) {
+    if (items.length === 0)
+        return EMPTY_BUNDLE;
+    return [...items].sort().join('+');
+}
+/** Lectura segura: 0 si el outcome no aparece en la valuation. */
+function vOf(a, outcome) {
+    return a.valuation.get(outcome) ?? 0;
+}
+/**
+ * Enumera todas las asignaciones agente→item para single-item case.
+ * Devuelve la asignación que maximiza la suma de valuations.
+ *
+ * - agentSubset = lista de agentes participantes.
+ * - items = lista de items disponibles.
+ *
+ * Cada agente puede quedarse sin item (item = EMPTY_BUNDLE). Cada item
+ * se asigna a 0 o 1 agente.
+ *
+ * Complejidad: O((|items|+1)^|agents|) en worst case; OK para tests.
+ */
+function bestSingleItemAssignment(agentSubset, items) {
+    let bestWelfare = -Infinity;
+    let bestAllocation = new Map();
+    // Asignamos recursivamente. choices[i] ∈ items ∪ {EMPTY_BUNDLE},
+    // con restricción de unicidad de item.
+    const n = agentSubset.length;
+    const taken = new Set();
+    const current = new Array(n).fill(EMPTY_BUNDLE);
+    function recurse(idx, welfareSoFar) {
+        if (idx === n) {
+            if (welfareSoFar > bestWelfare) {
+                bestWelfare = welfareSoFar;
+                const alloc = new Map();
+                for (let i = 0; i < n; i++) {
+                    if (current[i] !== EMPTY_BUNDLE) {
+                        alloc.set(agentSubset[i].id, current[i]);
+                    }
+                }
+                bestAllocation = alloc;
+            }
+            return;
+        }
+        const agent = agentSubset[idx];
+        // Opción A: agente no recibe nada.
+        current[idx] = EMPTY_BUNDLE;
+        recurse(idx + 1, welfareSoFar);
+        // Opción B: agente recibe alguno de los items libres.
+        for (const item of items) {
+            if (taken.has(item))
+                continue;
+            taken.add(item);
+            current[idx] = item;
+            recurse(idx + 1, welfareSoFar + vOf(agent, item));
+            taken.delete(item);
+        }
+        current[idx] = EMPTY_BUNDLE;
+    }
+    if (n === 0) {
+        return { allocation: new Map(), welfare: 0 };
+    }
+    recurse(0, 0);
+    if (bestWelfare === -Infinity)
+        bestWelfare = 0;
+    return { allocation: bestAllocation, welfare: bestWelfare };
+}
+/**
+ * Enumera particiones de items en bundles asignados a agentes (con
+ * agente "vacío" como opción) — usado cuando las valuations incluyen
+ * bundles compuestos ("A+B").
+ *
+ * Decisión por item: a qué agente va (o a ninguno). Luego cada agente
+ * obtiene el bundle canónico de los items que recibió y se consulta
+ * la valuation con esa clave (default 0).
+ */
+function bestCombinatorialAssignment(agentSubset, items) {
+    let bestWelfare = -Infinity;
+    let bestAssignment = new Array(items.length).fill(-1);
+    const assignment = new Array(items.length).fill(-1);
+    function evalWelfare() {
+        const bundlesPerAgent = agentSubset.map(() => []);
+        for (let i = 0; i < items.length; i++) {
+            const ai = assignment[i];
+            if (ai >= 0)
+                bundlesPerAgent[ai].push(items[i]);
+        }
+        let w = 0;
+        for (let a = 0; a < agentSubset.length; a++) {
+            const bundle = makeBundle(bundlesPerAgent[a]);
+            if (bundle === EMPTY_BUNDLE)
+                continue;
+            w += vOf(agentSubset[a], bundle);
+        }
+        return w;
+    }
+    function recurse(idx) {
+        if (idx === items.length) {
+            const w = evalWelfare();
+            if (w > bestWelfare) {
+                bestWelfare = w;
+                bestAssignment = assignment.slice();
+            }
+            return;
+        }
+        // Item no asignado.
+        assignment[idx] = -1;
+        recurse(idx + 1);
+        // Item a cada agente.
+        for (let a = 0; a < agentSubset.length; a++) {
+            assignment[idx] = a;
+            recurse(idx + 1);
+        }
+        assignment[idx] = -1;
+    }
+    if (agentSubset.length === 0 || items.length === 0) {
+        return { allocation: new Map(), welfare: 0 };
+    }
+    recurse(0);
+    if (bestWelfare === -Infinity)
+        bestWelfare = 0;
+    // Reconstruir allocation: mapAgentId → bundle.
+    const alloc = new Map();
+    const bundlesPerAgent = agentSubset.map(() => []);
+    for (let i = 0; i < items.length; i++) {
+        const ai = bestAssignment[i];
+        if (ai >= 0)
+            bundlesPerAgent[ai].push(items[i]);
+    }
+    for (let a = 0; a < agentSubset.length; a++) {
+        const bundle = makeBundle(bundlesPerAgent[a]);
+        if (bundle !== EMPTY_BUNDLE)
+            alloc.set(agentSubset[a].id, bundle);
+    }
+    return { allocation: alloc, welfare: bestWelfare };
+}
+/**
+ * Detecta si la valuation usa bundles compuestos (claves con "+").
+ */
+function hasCombinatorialValuations(agents) {
+    for (const a of agents) {
+        for (const key of a.valuation.keys()) {
+            if (key.includes('+'))
+                return true;
+        }
+    }
+    return false;
+}
+function bestAssignment(agentSubset, items) {
+    if (hasCombinatorialValuations(agentSubset)) {
+        return bestCombinatorialAssignment(agentSubset, items);
+    }
+    return bestSingleItemAssignment(agentSubset, items);
+}
+/**
+ * VCG mechanism: allocation maximiza welfare; pago de cada agente =
+ * externalidad = (welfare óptimo de los demás cuando él NO participa)
+ *                - (welfare de los demás en la allocation elegida).
+ *
+ * Devuelve allocation y payments. Payments son ≥ 0 si valuations son
+ * monotónicas (las nuestras lo son).
+ */
+function vcgMechanism(agents, items) {
+    if (agents.length === 0) {
+        return { allocation: new Map(), payments: new Map() };
+    }
+    const { allocation } = bestAssignment(agents, items);
+    // Welfare de los OTROS bajo la allocation elegida.
+    const payments = new Map();
+    for (const a of agents) {
+        const without = agents.filter((x) => x.id !== a.id);
+        // Welfare de los demás en la allocation actual.
+        let welfareOthersIn = 0;
+        for (const other of without) {
+            const got = allocation.get(other.id);
+            if (got !== undefined)
+                welfareOthersIn += vOf(other, got);
+        }
+        // Welfare óptimo si `a` no existiera (libera los items que tenía).
+        const { welfare: welfareOthersOut } = bestAssignment(without, items);
+        const payment = welfareOthersOut - welfareOthersIn;
+        payments.set(a.id, payment);
+    }
+    return { allocation, payments };
+}
+/**
+ * Welfare social bajo una allocation: suma de valuations de los agentes
+ * por lo que recibieron.
+ */
+function socialWelfare(outcome, agents) {
+    let w = 0;
+    for (const a of agents) {
+        const got = outcome.allocation.get(a.id);
+        if (got !== undefined)
+            w += vOf(a, got);
+    }
+    return w;
+}
+/**
+ * Strategy-proofness empírica: tomamos `samples` reportes aleatorios de
+ * un agente (manteniendo a los demás truthful), corremos el mechanism,
+ * y verificamos que la utilidad del agente que miente no supere la
+ * utilidad reportando truthfully. Si para alguna sample el misreport
+ * mejora estrictamente, retornamos false.
+ *
+ * Utilidad cuasi-lineal: v(allocation_i) - payment_i.
+ *
+ * Esto es probabilístico: con `samples=0` no chequeamos nada y devolvemos
+ * true. Útil sobretodo para testing.
+ */
+function isStrategyProof(mechanism, samples = 50) {
+    if (samples <= 0)
+        return true;
+    // Construimos un escenario base de 3 agentes y 2 items, con
+    // valuations enteras en [0, 10]. Para cada sample mutamos la
+    // valuation del primer agente y comparamos su utilidad con la
+    // reportada truthfully. El mechanism recibe solo agents (los items
+    // están implícitos en las valuations + closure del caller).
+    const baseAgents = [
+        {
+            id: 'a',
+            valuation: new Map([
+                ['x', 8],
+                ['y', 3],
+            ]),
+        },
+        {
+            id: 'b',
+            valuation: new Map([
+                ['x', 5],
+                ['y', 6],
+            ]),
+        },
+        {
+            id: 'c',
+            valuation: new Map([
+                ['x', 2],
+                ['y', 4],
+            ]),
+        },
+    ];
+    // Utilidad real del agente "a" si reporta `report` y los demás truthful.
+    function utilityOfA(report) {
+        const truthA = baseAgents[0].valuation;
+        const reported = [{ id: 'a', valuation: report }, baseAgents[1], baseAgents[2]];
+        const out = mechanism(reported);
+        const got = out.allocation.get('a');
+        const value = got !== undefined ? (truthA.get(got) ?? 0) : 0;
+        const pay = out.payments.get('a') ?? 0;
+        return value - pay;
+    }
+    const truthful = utilityOfA(baseAgents[0].valuation);
+    for (let s = 0; s < samples; s++) {
+        const fakeX = Math.floor(Math.random() * 11);
+        const fakeY = Math.floor(Math.random() * 11);
+        const fake = new Map([
+            ['x', fakeX],
+            ['y', fakeY],
+        ]);
+        const u = utilityOfA(fake);
+        // Permitimos empates (igualdad): DSIC requiere truthful ∈ argmax.
+        if (u > truthful + 1e-9)
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=vcg.js.map

package/dist/reasoning/mechanism-design/vcg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vcg.js","sourceRoot":"","sources":["../../../src/reasoning/mechanism-design/vcg.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wCAAwC;AACxC,+DAA+D;AAC/D,EAAE;AACF,mEAAmE;AACnE,0DAA0D;AAC1D,mEAAmE;AACnE,kEAAkE;AAClE,iDAAiD;AACjD,EAAE;AACF,2CAA2C;AAC3C,EAAE;AACF,qEAAqE;AACrE,+DAA+D;AAC/D,iEAAiE;AACjE,kEAAkE;AAClE,uBAAuB;AACvB,EAAE;AACF,oEAAoE;AACpE,oEAAoE;AACpE,mEAAmE;AACnE,oEAAoE;AACpE,oEAAoE;AACpE,uDAAuD;AACvD,EAAE;AACF,8DAA8D;AAC9D,gEAAgE;AAChE,sEAAsE;AACtE,+CAA+C;AAC/C,EAAE;AACF,wEAAwE;AACxE,kEAAkE;;AAsLlE,oCA2BC;AAMD,sCAOC;AAcD,0CA4DC;AApSD,MAAM,YAAY,GAAG,EAAE,CAAC;AAExB,kDAAkD;AAClD,SAAS,UAAU,CAAC,KAAe;IACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,YAAY,CAAC;IAC5C,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrC,CAAC;AAED,kEAAkE;AAClE,SAAS,GAAG,CAAC,CAAQ,EAAE,OAAe;IACpC,OAAO,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,wBAAwB,CAC/B,WAAoB,EACpB,KAAe;IAEf,IAAI,WAAW,GAAG,CAAC,QAAQ,CAAC;IAC5B,IAAI,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE/C,iEAAiE;IACjE,uCAAuC;IACvC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC;IAC7B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,OAAO,GAAa,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAElE,SAAS,OAAO,CAAC,GAAW,EAAE,YAAoB;QAChD,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACd,IAAI,YAAY,GAAG,WAAW,EAAE,CAAC;gBAC/B,WAAW,GAAG,YAAY,CAAC;gBAC3B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;gBACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,YAAY,EAAE,CAAC;wBAChC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3C,CAAC;gBACH,CAAC;gBACD,cAAc,GAAG,KAAK,CAAC;YACzB,CAAC;YACD,OAAO;QACT,CAAC;QACD,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAC/B,mCAAmC;QACnC,OAAO,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC;QAC5B,OAAO,CAAC,GAAG,GAAG,CAAC,EAAE,YAAY,CAAC,CAAC;QAC/B,sDAAsD;QACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC9B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;YACpB,OAAO,CAAC,GAAG,GAAG,CAAC,EAAE,YAAY,GAAG,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YAClD,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC;IAC9B,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,EAAE,UAAU,EAAE,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IAC/C,CAAC;IACD,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACd,IAAI,WAAW,KAAK,CAAC,QAAQ;QAAE,WAAW,GAAG,CAAC,CAAC;IAC/C,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;AAC9D,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,2BAA2B,CAClC,WAAoB,EACpB,KAAe;IAEf,IAAI,WAAW,GAAG,CAAC,QAAQ,CAAC;IAC5B,IAAI,cAAc,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9D,MAAM,UAAU,GAAa,IAAI,KAAK,CAAS,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtE,SAAS,WAAW;QAClB,MAAM,eAAe,GAAe,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,EAAE,IAAI,CAAC;gBAAE,eAAe,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAG,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,IAAI,MAAM,KAAK,YAAY;gBAAE,SAAS;YACtC,CAAC,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,SAAS,OAAO,CAAC,GAAW;QAC1B,IAAI,GAAG,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,WAAW,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC;gBACpB,WAAW,GAAG,CAAC,CAAC;gBAChB,cAAc,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;YACtC,CAAC;YACD,OAAO;QACT,CAAC;QACD,oBAAoB;QACpB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACrB,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACjB,sBAAsB;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACnB,CAAC;QACD,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnD,OAAO,EAAE,UAAU,EAAE,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IAC/C,CAAC;IACD,OAAO,CAAC,CAAC,CAAC,CAAC;IACX,IAAI,WAAW,KAAK,CAAC,QAAQ;QAAE,WAAW,GAAG,CAAC,CAAC;IAE/C,+CAA+C;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,eAAe,GAAe,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,EAAE,IAAI,CAAC;YAAE,eAAe,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,MAAM,GAAG,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,MAAM,KAAK,YAAY;YAAE,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;AACrD,CAAC;AAED;;GAEG;AACH,SAAS,0BAA0B,CAAC,MAAe;IACjD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;YACrC,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC;QACrC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,cAAc,CACrB,WAAoB,EACpB,KAAe;IAEf,IAAI,0BAA0B,CAAC,WAAW,CAAC,EAAE,CAAC;QAC5C,OAAO,2BAA2B,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,wBAAwB,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,YAAY,CAAC,MAAe,EAAE,KAAe;IAC3D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,UAAU,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;IACxD,CAAC;IAED,MAAM,EAAE,UAAU,EAAE,GAAG,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAErD,mDAAmD;IACnD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QAEpD,gDAAgD;QAChD,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,GAAG,KAAK,SAAS;gBAAE,eAAe,IAAI,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC5D,CAAC;QAED,mEAAmE;QACnE,MAAM,EAAE,OAAO,EAAE,gBAAgB,EAAE,GAAG,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAErE,MAAM,OAAO,GAAG,gBAAgB,GAAG,eAAe,CAAC;QACnD,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC9B,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,SAAgB,aAAa,CAAC,OAAyB,EAAE,MAAe;IACtE,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzC,IAAI,GAAG,KAAK,SAAS;YAAE,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,eAAe,CAC7B,SAAgD,EAChD,UAAkB,EAAE;IAEpB,IAAI,OAAO,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAE9B,4DAA4D;IAC5D,6DAA6D;IAC7D,8DAA8D;IAC9D,mEAAmE;IACnE,4DAA4D;IAC5D,MAAM,UAAU,GAAY;QAC1B;YACE,EAAE,EAAE,GAAG;YACP,SAAS,EAAE,IAAI,GAAG,CAAC;gBACjB,CAAC,GAAG,EAAE,CAAC,CAAC;gBACR,CAAC,GAAG,EAAE,CAAC,CAAC;aACT,CAAC;SACH;QACD;YACE,EAAE,EAAE,GAAG;YACP,SAAS,EAAE,IAAI,GAAG,CAAC;gBACjB,CAAC,GAAG,EAAE,CAAC,CAAC;gBACR,CAAC,GAAG,EAAE,CAAC,CAAC;aACT,CAAC;SACH;QACD;YACE,EAAE,EAAE,GAAG;YACP,SAAS,EAAE,IAAI,GAAG,CAAC;gBACjB,CAAC,GAAG,EAAE,CAAC,CAAC;gBACR,CAAC,GAAG,EAAE,CAAC,CAAC;aACT,CAAC;SACH;KACF,CAAC;IAEF,yEAAyE;IACzE,SAAS,UAAU,CAAC,MAA2B;QAC7C,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACvC,MAAM,QAAQ,GAAY,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,MAAM,GAAG,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvC,OAAO,KAAK,GAAG,GAAG,CAAC;IACrB,CAAC;IAED,MAAM,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAErD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAiB;YACnC,CAAC,GAAG,EAAE,KAAK,CAAC;YACZ,CAAC,GAAG,EAAE,KAAK,CAAC;SACb,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC3B,kEAAkE;QAClE,IAAI,CAAC,GAAG,QAAQ,GAAG,IAAI;YAAE,OAAO,KAAK,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

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

@@ -0,0 +1,44 @@
+import type { BernoulliDist, CategoricalDist, DiscreteDist, Distribution, NormalDist, PoissonDist, UniformDist } from './types';
+/**
+ * Saca un valor de `dist` usando `rng` (uniforme [0,1)).
+ *
+ * Para `categorical` y `discrete`, normaliza las probs internamente
+ * para tolerar entradas no exactamente sumadas a 1.
+ *
+ * Las firmas overloaded dan inferencia precisa por familia.
+ */
+export declare function sampleFrom(dist: BernoulliDist, rng: () => number): boolean;
+export declare function sampleFrom(dist: UniformDist, rng: () => number): number;
+export declare function sampleFrom(dist: NormalDist, rng: () => number): number;
+export declare function sampleFrom(dist: PoissonDist, rng: () => number): number;
+export declare function sampleFrom<T>(dist: CategoricalDist<T>, rng: () => number): T;
+export declare function sampleFrom<T>(dist: DiscreteDist<T>, rng: () => number): T;
+export declare function sampleFrom<T>(dist: Distribution<T>, rng: () => number): T;
+/**
+ * Log-densidad / log-masa de `value` bajo `dist`.
+ *
+ * Para distribuciones continuas (`uniform`, `normal`) es log-pdf;
+ * para discretas (`bernoulli`, `poisson`, `categorical`, `discrete`)
+ * es log-pmf. Valores fuera del soporte devuelven `-Infinity`.
+ */
+export declare function logPdf(dist: BernoulliDist, value: boolean): number;
+export declare function logPdf(dist: UniformDist, value: number): number;
+export declare function logPdf(dist: NormalDist, value: number): number;
+export declare function logPdf(dist: PoissonDist, value: number): number;
+export declare function logPdf<T>(dist: CategoricalDist<T>, value: T): number;
+export declare function logPdf<T>(dist: DiscreteDist<T>, value: T): number;
+export declare function logPdf<T>(dist: Distribution<T>, value: T): number;
+/**
+ * Enumera el soporte de una distribución discreta como pares
+ * `[valor, probabilidad]`. Para distribuciones continuas o de
+ * soporte infinito (poisson), lanza error: no se puede enumerar.
+ *
+ * Para `poisson` se podría truncar pero la enumeración exacta no
+ * lo soporta — el usuario debe usar `categorical` con un soporte
+ * acotado si quiere enumeración.
+ */
+export declare function enumerateSupport(dist: BernoulliDist): Array<[boolean, number]>;
+export declare function enumerateSupport<T>(dist: CategoricalDist<T>): Array<[T, number]>;
+export declare function enumerateSupport<T>(dist: DiscreteDist<T>): Array<[T, number]>;
+export declare function enumerateSupport<T>(dist: Distribution<T>): Array<[T, number]>;
+//# sourceMappingURL=distributions.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"distributions.d.ts","sourceRoot":"","sources":["../../../src/reasoning/probabilistic/distributions.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EACV,aAAa,EACb,eAAe,EACf,YAAY,EACZ,YAAY,EACZ,UAAU,EACV,WAAW,EACX,WAAW,EACZ,MAAM,SAAS,CAAC;AAKjB;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,MAAM,GAAG,OAAO,CAAC;AAC5E,wBAAgB,UAAU,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,MAAM,GAAG,MAAM,CAAC;AACzE,wBAAgB,UAAU,CAAC,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,MAAM,MAAM,GAAG,MAAM,CAAC;AACxE,wBAAgB,UAAU,CAAC,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,MAAM,GAAG,MAAM,CAAC;AACzE,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,MAAM,GAAG,CAAC,CAAC;AAC9E,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,MAAM,GAAG,CAAC,CAAC;AAC3E,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,MAAM,GAAG,CAAC,CAAC;AA6C3E;;;;;;GAMG;AACH,wBAAgB,MAAM,CAAC,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAAC;AACpE,wBAAgB,MAAM,CAAC,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;AACjE,wBAAgB,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;AAChE,wBAAgB,MAAM,CAAC,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC;AACjE,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC;AACtE,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC;AACnE,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC;AA8CnE;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,aAAa,GAAG,KAAK,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;AAChF,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAClF,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAC/E,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC"}

package/dist/reasoning/probabilistic/distributions.js

@@ -0,0 +1,207 @@
+"use strict";
+// ============================================================
+// Probabilistic Programming — Distributions
+// ============================================================
+//
+// Muestreo y log-density para las seis familias soportadas.
+// Todo función pura y RNG inyectable.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sampleFrom = sampleFrom;
+exports.logPdf = logPdf;
+exports.enumerateSupport = enumerateSupport;
+const TWO_PI = 2 * Math.PI;
+const LOG_2PI = Math.log(TWO_PI);
+function sampleFrom(dist, rng) {
+    switch (dist.kind) {
+        case 'bernoulli':
+            return (rng() < dist.p);
+        case 'uniform':
+            return (dist.low + rng() * (dist.high - dist.low));
+        case 'normal':
+            return sampleNormal(dist.mean, dist.std, rng);
+        case 'poisson':
+            return samplePoisson(dist.lambda, rng);
+        case 'categorical': {
+            const u = rng();
+            const total = dist.probs.reduce((s, x) => s + x, 0);
+            if (total <= 0) {
+                throw new Error('categorical: suma de probs <= 0');
+            }
+            let acc = 0;
+            for (let i = 0; i < dist.values.length; i++) {
+                acc += (dist.probs[i] ?? 0) / total;
+                if (u < acc)
+                    return dist.values[i];
+            }
+            // Borde por float: devolver el último.
+            return dist.values[dist.values.length - 1];
+        }
+        case 'discrete': {
+            const u = rng();
+            let total = 0;
+            for (const p of dist.pmf.values())
+                total += p;
+            if (total <= 0) {
+                throw new Error('discrete: suma de pmf <= 0');
+            }
+            let acc = 0;
+            let last;
+            for (const [v, p] of dist.pmf) {
+                last = v;
+                acc += p / total;
+                if (u < acc)
+                    return v;
+            }
+            if (last === undefined)
+                throw new Error('discrete: pmf vacío');
+            return last;
+        }
+    }
+}
+function logPdf(dist, value) {
+    switch (dist.kind) {
+        case 'bernoulli': {
+            const v = value;
+            if (typeof v !== 'boolean')
+                return -Infinity;
+            const p = clampProb(dist.p);
+            return v ? Math.log(p) : Math.log(1 - p);
+        }
+        case 'uniform': {
+            const x = value;
+            if (typeof x !== 'number' || !Number.isFinite(x))
+                return -Infinity;
+            if (x < dist.low || x >= dist.high)
+                return -Infinity;
+            if (dist.high <= dist.low)
+                return -Infinity;
+            return -Math.log(dist.high - dist.low);
+        }
+        case 'normal': {
+            const x = value;
+            if (typeof x !== 'number' || !Number.isFinite(x))
+                return -Infinity;
+            if (dist.std <= 0)
+                return -Infinity;
+            const z = (x - dist.mean) / dist.std;
+            return -0.5 * (z * z + LOG_2PI) - Math.log(dist.std);
+        }
+        case 'poisson': {
+            const k = value;
+            if (!Number.isInteger(k) || k < 0)
+                return -Infinity;
+            if (dist.lambda <= 0)
+                return k === 0 ? 0 : -Infinity;
+            return k * Math.log(dist.lambda) - dist.lambda - logFactorial(k);
+        }
+        case 'categorical': {
+            const idx = dist.values.indexOf(value);
+            if (idx < 0)
+                return -Infinity;
+            const total = dist.probs.reduce((s, x) => s + x, 0);
+            const p = (dist.probs[idx] ?? 0) / total;
+            return p > 0 ? Math.log(p) : -Infinity;
+        }
+        case 'discrete': {
+            const p = dist.pmf.get(value);
+            if (p === undefined || p <= 0)
+                return -Infinity;
+            let total = 0;
+            for (const x of dist.pmf.values())
+                total += x;
+            return Math.log(p / total);
+        }
+    }
+}
+function enumerateSupport(dist) {
+    switch (dist.kind) {
+        case 'bernoulli': {
+            const p = clampProb(dist.p);
+            return [
+                [true, p],
+                [false, 1 - p],
+            ];
+        }
+        case 'categorical': {
+            const total = dist.probs.reduce((s, x) => s + x, 0);
+            const out = [];
+            for (let i = 0; i < dist.values.length; i++) {
+                const p = (dist.probs[i] ?? 0) / total;
+                if (p > 0)
+                    out.push([dist.values[i], p]);
+            }
+            return out;
+        }
+        case 'discrete': {
+            let total = 0;
+            for (const x of dist.pmf.values())
+                total += x;
+            const out = [];
+            for (const [v, p] of dist.pmf) {
+                if (p > 0)
+                    out.push([v, p / total]);
+            }
+            return out;
+        }
+        case 'uniform':
+        case 'normal':
+        case 'poisson':
+            throw new Error(`enumerate: la distribución "${dist.kind}" tiene soporte continuo o infinito; ` +
+                'usá categorical/discrete o cambiá a rejection/importance/MH.');
+    }
+}
+// ── Helpers privados ─────────────────────────────────────────
+/**
+ * Box-Muller transform. Cachea el segundo gaussiano por llamada
+ * para no desperdiciar entropía — aunque la API permite dos
+ * llamadas separadas, en la práctica solo necesitamos una muestra
+ * por invocación, así que descartamos la segunda.
+ */
+function sampleNormal(mean, std, rng) {
+    if (std <= 0) {
+        throw new Error('normal: std debe ser > 0');
+    }
+    let u1 = rng();
+    // Evitar log(0) en el caso degenerado u1 == 0.
+    while (u1 <= 0)
+        u1 = rng();
+    const u2 = rng();
+    const z = Math.sqrt(-2 * Math.log(u1)) * Math.cos(TWO_PI * u2);
+    return mean + std * z;
+}
+/**
+ * Algoritmo de Knuth para Poisson — eficiente para lambda chicos
+ * (que es el caso típico en programas de tests). Para lambda > 30
+ * podría usarse aproximación normal, pero no lo necesitamos aquí.
+ */
+function samplePoisson(lambda, rng) {
+    if (lambda <= 0)
+        return 0;
+    const L = Math.exp(-lambda);
+    let k = 0;
+    let p = 1;
+    for (;;) {
+        k += 1;
+        p *= rng();
+        if (p <= L)
+            return k - 1;
+        // Salvaguarda anti-loop (lambda muy grande): truncar a 10 sigmas.
+        if (k > lambda + 50 * Math.sqrt(lambda) + 100)
+            return k - 1;
+    }
+}
+function logFactorial(n) {
+    // Tabulamos los primeros valores para precisión exacta.
+    let r = 0;
+    for (let i = 2; i <= n; i++)
+        r += Math.log(i);
+    return r;
+}
+function clampProb(p) {
+    if (p < 0)
+        return 0;
+    if (p > 1)
+        return 1;
+    return p;
+}
+//# sourceMappingURL=distributions.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"distributions.js","sourceRoot":"","sources":["../../../src/reasoning/probabilistic/distributions.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4CAA4C;AAC5C,+DAA+D;AAC/D,EAAE;AACF,4DAA4D;AAC5D,sCAAsC;;AA8BtC,gCA0CC;AAgBD,wBA2CC;AAeD,4CAmCC;AAzKD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;AAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAiBjC,SAAgB,UAAU,CAAI,IAAqB,EAAE,GAAiB;IACpE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,WAAW;YACd,OAAO,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,CAAiB,CAAC;QAC1C,KAAK,SAAS;YACZ,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAiB,CAAC;QACrE,KAAK,QAAQ;YACX,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAiB,CAAC;QAChE,KAAK,SAAS;YACZ,OAAO,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAiB,CAAC;QACzD,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;YAChB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACpD,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;gBACf,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;YACrD,CAAC;YACD,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;gBACpC,IAAI,CAAC,GAAG,GAAG;oBAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;YACD,uCAAuC;YACvC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;YAChB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE;gBAAE,KAAK,IAAI,CAAC,CAAC;YAC9C,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;gBACf,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;YAChD,CAAC;YACD,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,IAAI,IAAmB,CAAC;YACxB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC9B,IAAI,GAAG,CAAC,CAAC;gBACT,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC;gBACjB,IAAI,CAAC,GAAG,GAAG;oBAAE,OAAO,CAAC,CAAC;YACxB,CAAC;YACD,IAAI,IAAI,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;YAC/D,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAgBD,SAAgB,MAAM,CAAI,IAAqB,EAAE,KAAQ;IACvD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,GAAG,KAA2B,CAAC;YACtC,IAAI,OAAO,CAAC,KAAK,SAAS;gBAAE,OAAO,CAAC,QAAQ,CAAC;YAC7C,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,KAA0B,CAAC;YACrC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,QAAQ,CAAC;YACnE,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;gBAAE,OAAO,CAAC,QAAQ,CAAC;YACrD,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG;gBAAE,OAAO,CAAC,QAAQ,CAAC;YAC5C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACzC,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,KAA0B,CAAC;YACrC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,QAAQ,CAAC;YACnE,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC;gBAAE,OAAO,CAAC,QAAQ,CAAC;YACpC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;YACrC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvD,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,KAA0B,CAAC;YACrC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO,CAAC,QAAQ,CAAC;YACpD,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;gBAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YACrD,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACvC,IAAI,GAAG,GAAG,CAAC;gBAAE,OAAO,CAAC,QAAQ,CAAC;YAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACpD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;YACzC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QACzC,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,QAAQ,CAAC;YAChD,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE;gBAAE,KAAK,IAAI,CAAC,CAAC;YAC9C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;AACH,CAAC;AAeD,SAAgB,gBAAgB,CAAI,IAAqB;IACvD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,OAAO;gBACL,CAAC,IAAoB,EAAE,CAAC,CAAC;gBACzB,CAAC,KAAqB,EAAE,CAAC,GAAG,CAAC,CAAC;aAC/B,CAAC;QACJ,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACpD,MAAM,GAAG,GAAuB,EAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;gBACvC,IAAI,CAAC,GAAG,CAAC;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE;gBAAE,KAAK,IAAI,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAuB,EAAE,CAAC;YACnC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC9B,IAAI,CAAC,GAAG,CAAC;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YACtC,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,SAAS,CAAC;QACf,KAAK,QAAQ,CAAC;QACd,KAAK,SAAS;YACZ,MAAM,IAAI,KAAK,CACb,+BAA+B,IAAI,CAAC,IAAI,uCAAuC;gBAC7E,8DAA8D,CACjE,CAAC;IACN,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE;;;;;GAKG;AACH,SAAS,YAAY,CAAC,IAAY,EAAE,GAAW,EAAE,GAAiB;IAChE,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;IAC9C,CAAC;IACD,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;IACf,+CAA+C;IAC/C,OAAO,EAAE,IAAI,CAAC;QAAE,EAAE,GAAG,GAAG,EAAE,CAAC;IAC3B,MAAM,EAAE,GAAG,GAAG,EAAE,CAAC;IACjB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;IAC/D,OAAO,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;AACxB,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,MAAc,EAAE,GAAiB;IACtD,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,SAAS,CAAC;QACR,CAAC,IAAI,CAAC,CAAC;QACP,CAAC,IAAI,GAAG,EAAE,CAAC;QACX,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QACzB,kEAAkE;QAClE,IAAI,CAAC,GAAG,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IAC9D,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,CAAS;IAC7B,wDAAwD;IACxD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9C,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,SAAS,CAAC,CAAS;IAC1B,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACpB,OAAO,CAAC,CAAC;AACX,CAAC"}

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

@@ -0,0 +1,31 @@
+import { type PProgram } from './types';
+/** Bernoulli simétrica: prior trivial sobre {true, false}. */
+export declare function coinExample(): PProgram<boolean>;
+/** Bernoulli con bias arbitrario p ∈ [0,1]. */
+export declare function biasedCoinExample(p: number): PProgram<boolean>;
+/** AND de dos monedas Bernoulli(0.5): P(true) = 0.25 esperado. */
+export declare function twoCoinsExample(): PProgram<boolean>;
+/**
+ * Bayesian linear regression univariado:
+ *   slope ~ Normal(0, 5)
+ *   intercept ~ Normal(0, 5)
+ *   yᵢ | slope, intercept ~ Normal(slope·xᵢ + intercept, 1)
+ *
+ * Devuelve la pareja (slope, intercept). Las observaciones se
+ * codifican como factor(logPdf(...)) sobre el residuo — equivale
+ * a una likelihood gaussiana, suitable para importance/MH.
+ */
+export declare function bayesianLinearRegression(xs: number[], ys: number[]): PProgram<{
+    slope: number;
+    intercept: number;
+}>;
+/**
+ * Posterior sobre la media de una gaussiana con σ conocido.
+ *   mu ~ Normal(0, 10)
+ *   xᵢ | mu ~ Normal(mu, 1)
+ *
+ * Útil como caso de test analítico: el posterior verdadero es
+ * Normal((Σxᵢ) / (n + 1/100), 1/√(n + 1/100)).
+ */
+export declare function gaussianMeanModel(data: number[]): PProgram<number>;
+//# sourceMappingURL=examples.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"examples.d.ts","sourceRoot":"","sources":["../../../src/reasoning/probabilistic/examples.ts"],"names":[],"mappings":"AAeA,OAAO,EAAqB,KAAK,QAAQ,EAAE,MAAM,SAAS,CAAC;AAE3D,8DAA8D;AAC9D,wBAAgB,WAAW,IAAI,QAAQ,CAAC,OAAO,CAAC,CAE/C;AAED,+CAA+C;AAC/C,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,CAE9D;AAED,kEAAkE;AAClE,wBAAgB,eAAe,IAAI,QAAQ,CAAC,OAAO,CAAC,CAMnD;AAED;;;;;;;;;GASG;AACH,wBAAgB,wBAAwB,CACtC,EAAE,EAAE,MAAM,EAAE,EACZ,EAAE,EAAE,MAAM,EAAE,GACX,QAAQ,CAAC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC,CAkBhD;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,CAQlE"}