@stevenvo780/st-lang 4.5.2 → 4.6.0

package/dist/categorical/fin-set.d.ts

@@ -0,0 +1,39 @@
+import type { Category, MorId } from './types';
+/**
+ * Objeto FinSet = nombre + conjunto de elementos. El nombre actúa
+ * como identidad estable; los elementos viven como strings.
+ */
+export interface FinSetObj {
+    readonly name: string;
+    readonly elements: ReadonlyArray<string>;
+}
+/**
+ * Morfismo FinSet: función total entre los elementos de src y tgt.
+ * `id` es la clave única en `morphisms`. Construirla via
+ * `mkFinSetMor` garantiza coherencia con la categoría.
+ */
+export interface FinSetMor {
+    readonly id: MorId;
+    readonly src: string;
+    readonly tgt: string;
+    readonly fn: ReadonlyMap<string, string>;
+}
+/**
+ * Construye un morfismo en FinSet validando que `fn` cubra
+ * todos los elementos del dominio y que sus imágenes vivan en el
+ * codominio. Lanza si el cliente intenta crear una función parcial
+ * o con valores fuera de tgt.
+ */
+export declare function mkFinSetMor(name: string, src: FinSetObj, tgt: FinSetObj, table: Record<string, string> | ReadonlyMap<string, string>): FinSetMor;
+/**
+ * Construye FinSet sobre un conjunto explícito de objetos y morfismos.
+ * Cierra automáticamente bajo identidades y composiciones (transitive
+ * closure) para que `verifyAssociativity` no falle por morfismos
+ * intermedios faltantes.
+ *
+ * `maxClosureSteps` limita la expansión por seguridad cuando la
+ * categoría tiene ciclos densos; default 4 es suficiente para
+ * todos los tests del módulo.
+ */
+export declare function FinSet(objs: ReadonlyArray<FinSetObj>, generators?: ReadonlyArray<FinSetMor>, maxClosureSteps?: number): Category<FinSetObj, FinSetMor>;
+//# sourceMappingURL=fin-set.d.ts.map

package/dist/categorical/fin-set.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fin-set.d.ts","sourceRoot":"","sources":["../../src/categorical/fin-set.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAE/C;;;GAGG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;CAC1C;AAED;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IACnB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC1C;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE,SAAS,EACd,GAAG,EAAE,SAAS,EACd,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAC1D,SAAS,CAuBX;AAED;;;;;;;;;GASG;AACH,wBAAgB,MAAM,CACpB,IAAI,EAAE,aAAa,CAAC,SAAS,CAAC,EAC9B,UAAU,GAAE,aAAa,CAAC,SAAS,CAAM,EACzC,eAAe,SAAI,GAClB,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CA4JhC"}

package/dist/categorical/fin-set.js

@@ -0,0 +1,217 @@
+"use strict";
+// ============================================================
+// ST Categorical — FinSet
+// ============================================================
+// Categoría de conjuntos finitos (representados como objetos
+// nombrados con su carrier explícito) y funciones totales entre
+// ellos. Los morfismos llevan un mapa `fn: Map<string,string>`
+// para que la igualdad e identidad sean computables.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mkFinSetMor = mkFinSetMor;
+exports.FinSet = FinSet;
+/**
+ * Construye un morfismo en FinSet validando que `fn` cubra
+ * todos los elementos del dominio y que sus imágenes vivan en el
+ * codominio. Lanza si el cliente intenta crear una función parcial
+ * o con valores fuera de tgt.
+ */
+function mkFinSetMor(name, src, tgt, table) {
+    const fn = new Map();
+    const tgtSet = new Set(tgt.elements);
+    const tableMap = table instanceof Map
+        ? table
+        : new Map(Object.entries(table));
+    for (const x of src.elements) {
+        const y = tableMap.get(x);
+        if (y === undefined) {
+            throw new Error(`FinSet morphism ${name}: missing image for ${x} ∈ ${src.name}`);
+        }
+        if (!tgtSet.has(y)) {
+            throw new Error(`FinSet morphism ${name}: image ${y} of ${x} not in target ${tgt.name}`);
+        }
+        fn.set(x, y);
+    }
+    return {
+        id: `${src.name}→${tgt.name}:${name}`,
+        src: src.name,
+        tgt: tgt.name,
+        fn,
+    };
+}
+/**
+ * Construye FinSet sobre un conjunto explícito de objetos y morfismos.
+ * Cierra automáticamente bajo identidades y composiciones (transitive
+ * closure) para que `verifyAssociativity` no falle por morfismos
+ * intermedios faltantes.
+ *
+ * `maxClosureSteps` limita la expansión por seguridad cuando la
+ * categoría tiene ciclos densos; default 4 es suficiente para
+ * todos los tests del módulo.
+ */
+function FinSet(objs, generators = [], maxClosureSteps = 4) {
+    const objsByName = new Map(objs.map((o) => [o.name, o]));
+    const morphisms = new Map();
+    const objectsSet = new Set(objs);
+    function getObj(name) {
+        const o = objsByName.get(name);
+        if (!o)
+            throw new Error(`FinSet: unknown object ${name}`);
+        return o;
+    }
+    function addMor(m) {
+        const existing = morphisms.get(m.id);
+        if (existing)
+            return existing;
+        morphisms.set(m.id, m);
+        return m;
+    }
+    // identidades
+    for (const o of objs) {
+        const fn = new Map();
+        for (const x of o.elements)
+            fn.set(x, x);
+        addMor({ id: `${o.name}→${o.name}:id`, src: o.name, tgt: o.name, fn });
+    }
+    for (const g of generators)
+        addMor(g);
+    // composición concreta (no necesita la categoría)
+    function rawCompose(g, f) {
+        if (f.tgt !== g.src) {
+            throw new Error(`FinSet compose: dom mismatch ${f.id} ; ${g.id}`);
+        }
+        const src = getObj(f.src);
+        const tgt = getObj(g.tgt);
+        const fn = new Map();
+        for (const x of src.elements) {
+            const fx = f.fn.get(x);
+            const gfx = g.fn.get(fx);
+            fn.set(x, gfx);
+        }
+        // El nombre canónico de la composición es g∘f. Si ese morfismo
+        // ya está registrado con otro nombre y misma tabla, lo reusamos
+        // para que la igualdad sea robusta.
+        const candidate = {
+            id: `${src.name}→${tgt.name}:${g.id.split(':').pop()}∘${f.id.split(':').pop()}`,
+            src: src.name,
+            tgt: tgt.name,
+            fn,
+        };
+        // ¿Ya existe un morfismo con misma tabla? -> reutilizar id
+        for (const existing of morphisms.values()) {
+            if (existing.src === candidate.src &&
+                existing.tgt === candidate.tgt &&
+                tablesEqual(existing.fn, fn)) {
+                return existing;
+            }
+        }
+        morphisms.set(candidate.id, candidate);
+        return candidate;
+    }
+    // Cierre por composición acotado
+    for (let step = 0; step < maxClosureSteps; step++) {
+        const snapshot = Array.from(morphisms.values());
+        let added = false;
+        for (const f of snapshot) {
+            for (const g of snapshot) {
+                if (f.tgt !== g.src)
+                    continue;
+                const before = morphisms.size;
+                rawCompose(g, f);
+                if (morphisms.size > before)
+                    added = true;
+            }
+        }
+        if (!added)
+            break;
+    }
+    function identity(obj) {
+        return morphisms.get(`${obj.name}→${obj.name}:id`);
+    }
+    function compose(g, f) {
+        return rawCompose(g, f);
+    }
+    function source(m) {
+        return getObj(m.src);
+    }
+    function target(m) {
+        return getObj(m.tgt);
+    }
+    function eqMor(a, b) {
+        if (a.src !== b.src || a.tgt !== b.tgt)
+            return false;
+        return tablesEqual(a.fn, b.fn);
+    }
+    function eqObj(a, b) {
+        return a.name === b.name;
+    }
+    function hom(a, b) {
+        const out = [];
+        for (const m of morphisms.values()) {
+            if (m.src === a.name && m.tgt === b.name)
+                out.push(m);
+        }
+        return out;
+    }
+    function verifyAssociativity(sample = 50) {
+        const ms = Array.from(morphisms.values());
+        let checked = 0;
+        for (const f of ms) {
+            for (const g of ms) {
+                if (g.src !== f.tgt)
+                    continue;
+                for (const h of ms) {
+                    if (h.src !== g.tgt)
+                        continue;
+                    // (h∘g)∘f === h∘(g∘f)
+                    const left = compose(compose(h, g), f);
+                    const right = compose(h, compose(g, f));
+                    if (!eqMor(left, right))
+                        return false;
+                    if (++checked >= sample)
+                        return true;
+                }
+            }
+        }
+        return true;
+    }
+    function verifyIdentity(sample = 50) {
+        const ms = Array.from(morphisms.values());
+        let checked = 0;
+        for (const f of ms) {
+            const idSrc = identity(getObj(f.src));
+            const idTgt = identity(getObj(f.tgt));
+            if (!eqMor(compose(f, idSrc), f))
+                return false;
+            if (!eqMor(compose(idTgt, f), f))
+                return false;
+            if (++checked >= sample)
+                return true;
+        }
+        return true;
+    }
+    return {
+        name: 'FinSet',
+        objects: objectsSet,
+        morphisms,
+        identity,
+        compose,
+        source,
+        target,
+        eqMor,
+        eqObj,
+        hom,
+        verifyAssociativity,
+        verifyIdentity,
+    };
+}
+function tablesEqual(a, b) {
+    if (a.size !== b.size)
+        return false;
+    for (const [k, v] of a) {
+        if (b.get(k) !== v)
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=fin-set.js.map

package/dist/categorical/fin-set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fin-set.js","sourceRoot":"","sources":["../../src/categorical/fin-set.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,0BAA0B;AAC1B,+DAA+D;AAC/D,6DAA6D;AAC7D,gEAAgE;AAChE,+DAA+D;AAC/D,qDAAqD;AACrD,+DAA+D;;AA+B/D,kCA4BC;AAYD,wBAgKC;AA9MD;;;;;GAKG;AACH,SAAgB,WAAW,CACzB,IAAY,EACZ,GAAc,EACd,GAAc,EACd,KAA2D;IAE3D,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,QAAQ,GACZ,KAAK,YAAY,GAAG;QAClB,CAAC,CAAE,KAAqC;QACxC,CAAC,CAAC,IAAI,GAAG,CAAiB,MAAM,CAAC,OAAO,CAAC,KAA+B,CAAC,CAAC,CAAC;IAC/E,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,mBAAmB,IAAI,uBAAuB,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;QACnF,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,mBAAmB,IAAI,WAAW,CAAC,OAAO,CAAC,kBAAkB,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;QAC3F,CAAC;QACD,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACf,CAAC;IACD,OAAO;QACL,EAAE,EAAE,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,EAAE;QACrC,GAAG,EAAE,GAAG,CAAC,IAAI;QACb,GAAG,EAAE,GAAG,CAAC,IAAI;QACb,EAAE;KACH,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,MAAM,CACpB,IAA8B,EAC9B,aAAuC,EAAE,EACzC,eAAe,GAAG,CAAC;IAEnB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAoB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE9C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAY,IAAI,CAAC,CAAC;IAE5C,SAAS,MAAM,CAAC,IAAY;QAC1B,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,IAAI,EAAE,CAAC,CAAC;QAC1D,OAAO,CAAC,CAAC;IACX,CAAC;IAED,SAAS,MAAM,CAAC,CAAY;QAC1B,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;QAC9B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,cAAc;IACd,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ;YAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IACzE,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,UAAU;QAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAEtC,kDAAkD;IAClD,SAAS,UAAU,CAAC,CAAY,EAAE,CAAY;QAC5C,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACpE,CAAC;QACD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;YACxB,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAC1B,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACjB,CAAC;QACD,+DAA+D;QAC/D,gEAAgE;QAChE,oCAAoC;QACpC,MAAM,SAAS,GAAc;YAC3B,EAAE,EAAE,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;YAC/E,GAAG,EAAE,GAAG,CAAC,IAAI;YACb,GAAG,EAAE,GAAG,CAAC,IAAI;YACb,EAAE;SACH,CAAC;QACF,2DAA2D;QAC3D,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IACE,QAAQ,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG;gBAC9B,QAAQ,CAAC,GAAG,KAAK,SAAS,CAAC,GAAG;gBAC9B,WAAW,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,EAC5B,CAAC;gBACD,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QACvC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,iCAAiC;IACjC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,eAAe,EAAE,IAAI,EAAE,EAAE,CAAC;QAClD,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QAChD,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;oBAAE,SAAS;gBAC9B,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC;gBAC9B,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjB,IAAI,SAAS,CAAC,IAAI,GAAG,MAAM;oBAAE,KAAK,GAAG,IAAI,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK;YAAE,MAAM;IACpB,CAAC;IAED,SAAS,QAAQ,CAAC,GAAc;QAC9B,OAAO,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,CAAE,CAAC;IACtD,CAAC;IAED,SAAS,OAAO,CAAC,CAAY,EAAE,CAAY;QACzC,OAAO,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC;IAED,SAAS,MAAM,CAAC,CAAY;QAC1B,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IACD,SAAS,MAAM,CAAC,CAAY;QAC1B,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,SAAS,KAAK,CAAC,CAAY,EAAE,CAAY;QACvC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;YAAE,OAAO,KAAK,CAAC;QACrD,OAAO,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,SAAS,KAAK,CAAC,CAAY,EAAE,CAAY;QACvC,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED,SAAS,GAAG,CAAC,CAAY,EAAE,CAAY;QACrC,MAAM,GAAG,GAAgB,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,SAAS,mBAAmB,CAAC,MAAM,GAAG,EAAE;QACtC,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;oBAAE,SAAS;gBAC9B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;wBAAE,SAAS;oBAC9B,sBAAsB;oBACtB,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACxC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;wBAAE,OAAO,KAAK,CAAC;oBACtC,IAAI,EAAE,OAAO,IAAI,MAAM;wBAAE,OAAO,IAAI,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,cAAc,CAAC,MAAM,GAAG,EAAE;QACjC,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/C,IAAI,EAAE,OAAO,IAAI,MAAM;gBAAE,OAAO,IAAI,CAAC;QACvC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,UAAU;QACnB,SAAS;QACT,QAAQ;QACR,OAAO;QACP,MAAM;QACN,MAAM;QACN,KAAK;QACL,KAAK;QACL,GAAG;QACH,mBAAmB;QACnB,cAAc;KACf,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,CAA8B,EAAE,CAA8B;IACjF,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IACnC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/categorical/free.d.ts

@@ -0,0 +1,23 @@
+import type { Category, MorId } from './types';
+/**
+ * Morfismo de la categoría libre = path. Representamos un path
+ * como la lista de nombres de aristas (o vacío para la identidad)
+ * junto con su origen y destino.
+ */
+export interface FreeMor {
+    readonly id: MorId;
+    readonly src: string;
+    readonly tgt: string;
+    readonly path: ReadonlyArray<string>;
+}
+/**
+ * Construye la categoría libre. `generators` es una lista de tripletas
+ * `[from, to, name]` donde `name` debe ser único globalmente.
+ *
+ * `maxLength` acota la longitud máxima de paths considerados al
+ * "materializar" la categoría como `Map<MorId, FreeMor>`. Esto es
+ * inevitable: la categoría libre sobre un grafo con ciclos es
+ * infinita. Para tests usamos `maxLength=3`.
+ */
+export declare function Free(vertices: ReadonlyArray<string>, generators: ReadonlyArray<readonly [string, string, string]>, maxLength?: number): Category<string, FreeMor>;
+//# sourceMappingURL=free.d.ts.map

package/dist/categorical/free.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"free.d.ts","sourceRoot":"","sources":["../../src/categorical/free.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAE/C;;;;GAIG;AACH,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IACnB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC;CACtC;AAED;;;;;;;;GAQG;AACH,wBAAgB,IAAI,CAClB,QAAQ,EAAE,aAAa,CAAC,MAAM,CAAC,EAC/B,UAAU,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,EAC5D,SAAS,SAAI,GACZ,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAsI3B"}

package/dist/categorical/free.js

@@ -0,0 +1,168 @@
+"use strict";
+// ============================================================
+// ST Categorical — Categoría libre sobre un grafo
+// ============================================================
+// Dado un grafo dirigido (vertices + aristas con nombres),
+// construye la categoría libre cuyos morfismos son paths
+// (cadenas de aristas componibles), módulo la equivalencia
+// asociativa con la identidad como path vacío.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Free = Free;
+/**
+ * Construye la categoría libre. `generators` es una lista de tripletas
+ * `[from, to, name]` donde `name` debe ser único globalmente.
+ *
+ * `maxLength` acota la longitud máxima de paths considerados al
+ * "materializar" la categoría como `Map<MorId, FreeMor>`. Esto es
+ * inevitable: la categoría libre sobre un grafo con ciclos es
+ * infinita. Para tests usamos `maxLength=3`.
+ */
+function Free(vertices, generators, maxLength = 3) {
+    const edgesByName = new Map();
+    const edgesByFrom = new Map();
+    for (const v of vertices)
+        edgesByFrom.set(v, []);
+    for (const [from, to, name] of generators) {
+        if (edgesByName.has(name))
+            throw new Error(`Free: duplicate edge name ${name}`);
+        edgesByName.set(name, { from, to });
+        if (!edgesByFrom.has(from))
+            edgesByFrom.set(from, []);
+        edgesByFrom.get(from).push({ name, to });
+    }
+    const morphisms = new Map();
+    const objectsSet = new Set(vertices);
+    function pathId(src, tgt, path) {
+        return `${src}→${tgt}:[${path.join(',')}]`;
+    }
+    // Identidades
+    for (const v of vertices) {
+        const id = pathId(v, v, []);
+        morphisms.set(id, { id, src: v, tgt: v, path: [] });
+    }
+    // Generadores
+    for (const [from, to, name] of generators) {
+        const id = pathId(from, to, [name]);
+        morphisms.set(id, { id, src: from, tgt: to, path: [name] });
+    }
+    // Composiciones acotadas (paths hasta maxLength)
+    function enumerate(from, length) {
+        if (length === 0)
+            return [{ to: from, path: [] }];
+        const out = [];
+        for (const { name, to } of edgesByFrom.get(from) ?? []) {
+            for (const rest of enumerate(to, length - 1)) {
+                out.push({ to: rest.to, path: [name, ...rest.path] });
+            }
+        }
+        return out;
+    }
+    for (const v of vertices) {
+        for (let len = 2; len <= maxLength; len++) {
+            for (const { to, path } of enumerate(v, len)) {
+                const id = pathId(v, to, path);
+                if (!morphisms.has(id)) {
+                    morphisms.set(id, { id, src: v, tgt: to, path });
+                }
+            }
+        }
+    }
+    function identity(obj) {
+        return morphisms.get(pathId(obj, obj, []));
+    }
+    function compose(g, f) {
+        if (f.tgt !== g.src) {
+            throw new Error(`Free compose: dom mismatch ${f.id} ; ${g.id}`);
+        }
+        const path = [...f.path, ...g.path];
+        const id = pathId(f.src, g.tgt, path);
+        const cached = morphisms.get(id);
+        if (cached)
+            return cached;
+        // Si excede maxLength, lo registramos on-demand para que la
+        // categoría se comporte cerrada bajo composición; el cliente
+        // que pase tests pesados puede subir maxLength.
+        const m = { id, src: f.src, tgt: g.tgt, path };
+        morphisms.set(id, m);
+        return m;
+    }
+    function source(m) {
+        return m.src;
+    }
+    function target(m) {
+        return m.tgt;
+    }
+    function eqMor(a, b) {
+        if (a.src !== b.src || a.tgt !== b.tgt)
+            return false;
+        if (a.path.length !== b.path.length)
+            return false;
+        for (let i = 0; i < a.path.length; i++)
+            if (a.path[i] !== b.path[i])
+                return false;
+        return true;
+    }
+    function eqObj(a, b) {
+        return a === b;
+    }
+    function hom(a, b) {
+        const out = [];
+        for (const m of morphisms.values()) {
+            if (m.src === a && m.tgt === b)
+                out.push(m);
+        }
+        return out;
+    }
+    function verifyAssociativity(sample = 50) {
+        const ms = Array.from(morphisms.values());
+        let checked = 0;
+        for (const f of ms) {
+            for (const g of ms) {
+                if (g.src !== f.tgt)
+                    continue;
+                for (const h of ms) {
+                    if (h.src !== g.tgt)
+                        continue;
+                    const left = compose(compose(h, g), f);
+                    const right = compose(h, compose(g, f));
+                    if (!eqMor(left, right))
+                        return false;
+                    if (++checked >= sample)
+                        return true;
+                }
+            }
+        }
+        return true;
+    }
+    function verifyIdentity(sample = 50) {
+        const ms = Array.from(morphisms.values());
+        let checked = 0;
+        for (const f of ms) {
+            const idSrc = identity(f.src);
+            const idTgt = identity(f.tgt);
+            if (!eqMor(compose(f, idSrc), f))
+                return false;
+            if (!eqMor(compose(idTgt, f), f))
+                return false;
+            if (++checked >= sample)
+                return true;
+        }
+        return true;
+    }
+    return {
+        name: 'Free',
+        objects: objectsSet,
+        morphisms,
+        identity,
+        compose,
+        source,
+        target,
+        eqMor,
+        eqObj,
+        hom,
+        verifyAssociativity,
+        verifyIdentity,
+    };
+}
+//# sourceMappingURL=free.js.map

package/dist/categorical/free.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"free.js","sourceRoot":"","sources":["../../src/categorical/free.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kDAAkD;AAClD,+DAA+D;AAC/D,2DAA2D;AAC3D,yDAAyD;AACzD,2DAA2D;AAC3D,+CAA+C;AAC/C,+DAA+D;;AAyB/D,oBA0IC;AAnJD;;;;;;;;GAQG;AACH,SAAgB,IAAI,CAClB,QAA+B,EAC/B,UAA4D,EAC5D,SAAS,GAAG,CAAC;IAEb,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwC,CAAC;IACpE,MAAM,WAAW,GAAG,IAAI,GAAG,EAA+C,CAAC;IAC3E,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,UAAU,EAAE,CAAC;QAC1C,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,IAAI,EAAE,CAAC,CAAC;QAChF,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACtD,WAAW,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;IAE7C,SAAS,MAAM,CAAC,GAAW,EAAE,GAAW,EAAE,IAA2B;QACnE,OAAO,GAAG,GAAG,IAAI,GAAG,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAC7C,CAAC;IAED,cAAc;IACd,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,cAAc;IACd,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,UAAU,EAAE,CAAC;QAC1C,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACpC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9D,CAAC;IACD,iDAAiD;IACjD,SAAS,SAAS,CAAC,IAAY,EAAE,MAAc;QAC7C,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QAClD,MAAM,GAAG,GAA0C,EAAE,CAAC;QACtD,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACvD,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC7C,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC;YAC1C,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC7C,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;gBAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBACvB,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS,QAAQ,CAAC,GAAW;QAC3B,OAAO,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAE,CAAC;IAC9C,CAAC;IACD,SAAS,OAAO,CAAC,CAAU,EAAE,CAAU;QACrC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClE,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,4DAA4D;QAC5D,6DAA6D;QAC7D,gDAAgD;QAChD,MAAM,CAAC,GAAY,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;QACxD,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,SAAS,MAAM,CAAC,CAAU;QACxB,OAAO,CAAC,CAAC,GAAG,CAAC;IACf,CAAC;IACD,SAAS,MAAM,CAAC,CAAU;QACxB,OAAO,CAAC,CAAC,GAAG,CAAC;IACf,CAAC;IACD,SAAS,KAAK,CAAC,CAAU,EAAE,CAAU;QACnC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;YAAE,OAAO,KAAK,CAAC;QACrD,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAClF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;QACjC,OAAO,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IACD,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS;QAC/B,MAAM,GAAG,GAAc,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,SAAS,mBAAmB,CAAC,MAAM,GAAG,EAAE;QACtC,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;oBAAE,SAAS;gBAC9B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;wBAAE,SAAS;oBAC9B,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACxC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;wBAAE,OAAO,KAAK,CAAC;oBACtC,IAAI,EAAE,OAAO,IAAI,MAAM;wBAAE,OAAO,IAAI,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,SAAS,cAAc,CAAC,MAAM,GAAG,EAAE;QACjC,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/C,IAAI,EAAE,OAAO,IAAI,MAAM;gBAAE,OAAO,IAAI,CAAC;QACvC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,OAAO,EAAE,UAAU;QACnB,SAAS;QACT,QAAQ;QACR,OAAO;QACP,MAAM;QACN,MAAM;QACN,KAAK;QACL,KAAK;QACL,GAAG;QACH,mBAAmB;QACnB,cAAc;KACf,CAAC;AACJ,CAAC"}

package/dist/categorical/functor.d.ts

@@ -0,0 +1,40 @@
+import type { Category, Functor, NaturalTransformation } from './types';
+/**
+ * Crea un functor verificable. El cliente pasa los mapeos a
+ * objetos/morfismos; las verificaciones de leyes se derivan
+ * recorriendo los `morphisms` de la categoría fuente.
+ */
+export declare function mkFunctor<O1, M1, O2, M2>(opts: {
+    name: string;
+    source: Category<O1, M1>;
+    target: Category<O2, M2>;
+    onObjects: (o: O1) => O2;
+    onMorphisms: (m: M1) => M2;
+}): Functor<O1, M1, O2, M2>;
+/**
+ * Functor identidad `Id_C : C → C`. Útil para tests y como elemento
+ * neutro de la composición de functores.
+ */
+export declare function identityFunctor<O, M>(cat: Category<O, M>): Functor<O, M, O, M>;
+/**
+ * Composición de functores F ; G = G ∘ F. La firma respeta la
+ * categoría source/target original sin perder información de tipos.
+ */
+export declare function composeFunctors<O1, M1, O2, M2, O3, M3>(G: Functor<O2, M2, O3, M3>, F: Functor<O1, M1, O2, M2>): Functor<O1, M1, O3, M3>;
+/**
+ * Crea una transformación natural η : F ⇒ G verificando su
+ * naturalidad por muestreo. El cliente pasa la familia de
+ * componentes `component(a) : F(a) → G(a)`.
+ */
+export declare function mkNaturalTransformation<O1, M1, O2, M2>(opts: {
+    name: string;
+    source: Functor<O1, M1, O2, M2>;
+    target: Functor<O1, M1, O2, M2>;
+    component: (o: O1) => M2;
+}): NaturalTransformation<O1, M1, O2, M2>;
+/**
+ * Transformación natural identidad `id_F : F ⇒ F` con componentes
+ * `id_{F(a)}`. Sirve como elemento neutro de composición vertical.
+ */
+export declare function identityNT<O1, M1, O2, M2>(F: Functor<O1, M1, O2, M2>): NaturalTransformation<O1, M1, O2, M2>;
+//# sourceMappingURL=functor.d.ts.map

package/dist/categorical/functor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"functor.d.ts","sourceRoot":"","sources":["../../src/categorical/functor.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,qBAAqB,EAAE,MAAM,SAAS,CAAC;AAExE;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE;IAC9C,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACzB,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACzB,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC;IACzB,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC;CAC5B,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAwC1B;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAQ9E;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EACpD,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAC1B,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GACzB,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAazB;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE;IAC5D,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAChC,MAAM,EAAE,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAChC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC;CAC1B,GAAG,qBAAqB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CA4BxC;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EACvC,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GACzB,qBAAqB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAOvC"}

package/dist/categorical/functor.js

@@ -0,0 +1,139 @@
+"use strict";
+// ============================================================
+// ST Categorical — Functor y NaturalTransformation
+// ============================================================
+// Wrappers genéricos para construir functores entre categorías
+// arbitrarias y verificar sus leyes vía muestreo sobre los
+// morfismos del dominio.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mkFunctor = mkFunctor;
+exports.identityFunctor = identityFunctor;
+exports.composeFunctors = composeFunctors;
+exports.mkNaturalTransformation = mkNaturalTransformation;
+exports.identityNT = identityNT;
+/**
+ * Crea un functor verificable. El cliente pasa los mapeos a
+ * objetos/morfismos; las verificaciones de leyes se derivan
+ * recorriendo los `morphisms` de la categoría fuente.
+ */
+function mkFunctor(opts) {
+    const { name, source, target, onObjects, onMorphisms } = opts;
+    function verifyIdentityPreservation() {
+        for (const o of source.objects) {
+            const idC = source.identity(o);
+            const Fid = onMorphisms(idC);
+            const idDFo = target.identity(onObjects(o));
+            if (!target.eqMor(Fid, idDFo))
+                return false;
+        }
+        return true;
+    }
+    function verifyComposition(sample = 50) {
+        const ms = Array.from(source.morphisms.values());
+        let checked = 0;
+        for (const f of ms) {
+            for (const g of ms) {
+                if (!source.eqObj(source.target(f), source.source(g)))
+                    continue;
+                const gf = source.compose(g, f);
+                const Fgf = onMorphisms(gf);
+                const Fg = onMorphisms(g);
+                const Ff = onMorphisms(f);
+                const FgFf = target.compose(Fg, Ff);
+                if (!target.eqMor(Fgf, FgFf))
+                    return false;
+                if (++checked >= sample)
+                    return true;
+            }
+        }
+        return true;
+    }
+    return {
+        name,
+        source,
+        target,
+        onObjects,
+        onMorphisms,
+        verifyIdentityPreservation,
+        verifyComposition,
+    };
+}
+/**
+ * Functor identidad `Id_C : C → C`. Útil para tests y como elemento
+ * neutro de la composición de functores.
+ */
+function identityFunctor(cat) {
+    return mkFunctor({
+        name: `Id_${cat.name}`,
+        source: cat,
+        target: cat,
+        onObjects: (o) => o,
+        onMorphisms: (m) => m,
+    });
+}
+/**
+ * Composición de functores F ; G = G ∘ F. La firma respeta la
+ * categoría source/target original sin perder información de tipos.
+ */
+function composeFunctors(G, F) {
+    if (F.target !== G.source) {
+        // Permitido si son la misma categoría por valor; pero como las
+        // categorías son objetos, exigimos identidad referencial.
+        throw new Error(`composeFunctors: F.target (${F.target.name}) !== G.source (${G.source.name})`);
+    }
+    return mkFunctor({
+        name: `${G.name}∘${F.name}`,
+        source: F.source,
+        target: G.target,
+        onObjects: (o) => G.onObjects(F.onObjects(o)),
+        onMorphisms: (m) => G.onMorphisms(F.onMorphisms(m)),
+    });
+}
+/**
+ * Crea una transformación natural η : F ⇒ G verificando su
+ * naturalidad por muestreo. El cliente pasa la familia de
+ * componentes `component(a) : F(a) → G(a)`.
+ */
+function mkNaturalTransformation(opts) {
+    const { name, source: F, target: G, component } = opts;
+    if (F.source !== G.source || F.target !== G.target) {
+        throw new Error('mkNaturalTransformation: F and G must be parallel functors');
+    }
+    const C = F.source;
+    const D = F.target;
+    function verifyNaturality(sample = 50) {
+        const ms = Array.from(C.morphisms.values());
+        let checked = 0;
+        for (const f of ms) {
+            const a = C.source(f);
+            const b = C.target(f);
+            const etaA = component(a);
+            const etaB = component(b);
+            const Gf = G.onMorphisms(f);
+            const Ff = F.onMorphisms(f);
+            // G(f) ∘ η_a vs η_b ∘ F(f)
+            const left = D.compose(Gf, etaA);
+            const right = D.compose(etaB, Ff);
+            if (!D.eqMor(left, right))
+                return false;
+            if (++checked >= sample)
+                return true;
+        }
+        return true;
+    }
+    return { name, source: F, target: G, component, verifyNaturality };
+}
+/**
+ * Transformación natural identidad `id_F : F ⇒ F` con componentes
+ * `id_{F(a)}`. Sirve como elemento neutro de composición vertical.
+ */
+function identityNT(F) {
+    return mkNaturalTransformation({
+        name: `id_${F.name}`,
+        source: F,
+        target: F,
+        component: (a) => F.target.identity(F.onObjects(a)),
+    });
+}
+//# sourceMappingURL=functor.js.map