@stevenvo780/st-lang 4.8.0 → 4.10.0

package/dist/reasoning/ban-logic/terms.js

@@ -0,0 +1,262 @@
+"use strict";
+// ============================================================
+// BAN Logic — Constructores y equality de términos/fórmulas
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.formulaAnd = exports.controls = exports.sharedSecret = exports.publicKey = exports.sharedKey = exports.fresh = exports.jurisdiction = exports.saidMessage = exports.said = exports.sees = exports.believes = exports.compound = exports.hashed = exports.encrypted = exports.message = exports.atom = exports.nonce = exports.key = exports.principal = void 0;
+exports.termEquals = termEquals;
+exports.formulaEquals = formulaEquals;
+exports.hasFormula = hasFormula;
+exports.termToString = termToString;
+exports.formulaToString = formulaToString;
+/* ── Constructores de términos ── */
+const principal = (name) => ({ kind: 'principal', name });
+exports.principal = principal;
+const key = (name, shared) => shared ? { kind: 'key', name, shared } : { kind: 'key', name };
+exports.key = key;
+const nonce = (name) => ({ kind: 'nonce', name });
+exports.nonce = nonce;
+const atom = (name) => ({ kind: 'atom', name });
+exports.atom = atom;
+const message = (...content) => ({ kind: 'message', content });
+exports.message = message;
+const encrypted = (msg, k) => ({
+    kind: 'encrypted',
+    message: msg,
+    key: k,
+});
+exports.encrypted = encrypted;
+const hashed = (msg) => ({ kind: 'hashed', message: msg });
+exports.hashed = hashed;
+const compound = (...parts) => ({ kind: 'compound', parts });
+exports.compound = compound;
+/* ── Constructores de fórmulas ── */
+const believes = (p, f) => ({
+    kind: 'believes',
+    principal: p,
+    about: f,
+});
+exports.believes = believes;
+const sees = (p, w) => ({
+    kind: 'sees',
+    principal: p,
+    what: w,
+});
+exports.sees = sees;
+const said = (p, f) => ({
+    kind: 'said',
+    principal: p,
+    what: f,
+});
+exports.said = said;
+const saidMessage = (p, w) => ({
+    kind: 'said-message',
+    principal: p,
+    what: w,
+});
+exports.saidMessage = saidMessage;
+const jurisdiction = (p, f) => ({
+    kind: 'jurisdiction',
+    principal: p,
+    over: f,
+});
+exports.jurisdiction = jurisdiction;
+const fresh = (w) => ({ kind: 'fresh', what: w });
+exports.fresh = fresh;
+const sharedKey = (a, b, k) => ({
+    kind: 'sharedKey',
+    a,
+    b,
+    key: k,
+});
+exports.sharedKey = sharedKey;
+const publicKey = (p, k) => ({
+    kind: 'publicKey',
+    principal: p,
+    key: k,
+});
+exports.publicKey = publicKey;
+const sharedSecret = (a, b, s) => ({
+    kind: 'sharedSecret',
+    a,
+    b,
+    secret: s,
+});
+exports.sharedSecret = sharedSecret;
+const controls = (p, f) => ({
+    kind: 'controls',
+    principal: p,
+    statement: f,
+});
+exports.controls = controls;
+const formulaAnd = (left, right) => ({
+    kind: 'formula-and',
+    left,
+    right,
+});
+exports.formulaAnd = formulaAnd;
+/* ── Igualdad estructural ── */
+function termEquals(a, b) {
+    if (a.kind !== b.kind)
+        return false;
+    switch (a.kind) {
+        case 'principal':
+        case 'nonce':
+        case 'atom':
+            // narrow b to a kind with .name
+            return b.name === a.name;
+        case 'key': {
+            const bk = b;
+            if (bk.name !== a.name)
+                return false;
+            const as = a.shared;
+            const bs = bk.shared;
+            if (!as && !bs)
+                return true;
+            if (!as || !bs)
+                return false;
+            // Shared pair es bi-direccional: {A,B} == {B,A}.
+            return (as[0] === bs[0] && as[1] === bs[1]) || (as[0] === bs[1] && as[1] === bs[0]);
+        }
+        case 'message': {
+            const bm = b;
+            if (a.content.length !== bm.content.length)
+                return false;
+            for (let i = 0; i < a.content.length; i++) {
+                const ai = a.content[i];
+                const bi = bm.content[i];
+                if (!ai || !bi)
+                    return false;
+                if (!termEquals(ai, bi))
+                    return false;
+            }
+            return true;
+        }
+        case 'compound': {
+            const bc = b;
+            if (a.parts.length !== bc.parts.length)
+                return false;
+            for (let i = 0; i < a.parts.length; i++) {
+                const ai = a.parts[i];
+                const bi = bc.parts[i];
+                if (!ai || !bi)
+                    return false;
+                if (!termEquals(ai, bi))
+                    return false;
+            }
+            return true;
+        }
+        case 'encrypted': {
+            const be = b;
+            return termEquals(a.message, be.message) && termEquals(a.key, be.key);
+        }
+        case 'hashed': {
+            const bh = b;
+            return termEquals(a.message, bh.message);
+        }
+    }
+}
+function formulaEquals(a, b) {
+    if (a.kind !== b.kind)
+        return false;
+    switch (a.kind) {
+        case 'believes': {
+            const bb = b;
+            return termEquals(a.principal, bb.principal) && formulaEquals(a.about, bb.about);
+        }
+        case 'sees': {
+            const bs = b;
+            return termEquals(a.principal, bs.principal) && termEquals(a.what, bs.what);
+        }
+        case 'said': {
+            const bs = b;
+            return termEquals(a.principal, bs.principal) && formulaEquals(a.what, bs.what);
+        }
+        case 'said-message': {
+            const bs = b;
+            return termEquals(a.principal, bs.principal) && termEquals(a.what, bs.what);
+        }
+        case 'jurisdiction': {
+            const bj = b;
+            return termEquals(a.principal, bj.principal) && formulaEquals(a.over, bj.over);
+        }
+        case 'fresh': {
+            const bf = b;
+            return termEquals(a.what, bf.what);
+        }
+        case 'sharedKey': {
+            const bs = b;
+            // El predicado "A ↔K B" es simétrico en (A,B).
+            const ab = termEquals(a.a, bs.a) && termEquals(a.b, bs.b);
+            const ba = termEquals(a.a, bs.b) && termEquals(a.b, bs.a);
+            return (ab || ba) && termEquals(a.key, bs.key);
+        }
+        case 'publicKey': {
+            const bp = b;
+            return termEquals(a.principal, bp.principal) && termEquals(a.key, bp.key);
+        }
+        case 'sharedSecret': {
+            const bs = b;
+            const ab = termEquals(a.a, bs.a) && termEquals(a.b, bs.b);
+            const ba = termEquals(a.a, bs.b) && termEquals(a.b, bs.a);
+            return (ab || ba) && termEquals(a.secret, bs.secret);
+        }
+        case 'controls': {
+            const bc = b;
+            return termEquals(a.principal, bc.principal) && formulaEquals(a.statement, bc.statement);
+        }
+        case 'formula-and': {
+            const ba = b;
+            return formulaEquals(a.left, ba.left) && formulaEquals(a.right, ba.right);
+        }
+    }
+}
+function hasFormula(state, target) {
+    return state.some((f) => formulaEquals(f, target));
+}
+/* ── Pretty printing ── */
+function termToString(t) {
+    switch (t.kind) {
+        case 'principal':
+        case 'nonce':
+        case 'atom':
+            return t.name;
+        case 'key':
+            return t.shared ? `K_${t.shared[0]}${t.shared[1]}` : t.name;
+        case 'message':
+            return `<${t.content.map(termToString).join(', ')}>`;
+        case 'compound':
+            return `(${t.parts.map(termToString).join(' · ')})`;
+        case 'encrypted':
+            return `{${termToString(t.message)}}_${termToString(t.key)}`;
+        case 'hashed':
+            return `H(${termToString(t.message)})`;
+    }
+}
+function formulaToString(f) {
+    switch (f.kind) {
+        case 'believes':
+            return `${termToString(f.principal)} |≡ ${formulaToString(f.about)}`;
+        case 'sees':
+            return `${termToString(f.principal)} ◁ ${termToString(f.what)}`;
+        case 'said':
+            return `${termToString(f.principal)} |~ ${formulaToString(f.what)}`;
+        case 'said-message':
+            return `${termToString(f.principal)} |~ ${termToString(f.what)}`;
+        case 'jurisdiction':
+            return `${termToString(f.principal)} |⇒ ${formulaToString(f.over)}`;
+        case 'fresh':
+            return `#(${termToString(f.what)})`;
+        case 'sharedKey':
+            return `${termToString(f.a)} ↔${termToString(f.key)} ${termToString(f.b)}`;
+        case 'publicKey':
+            return `|→${termToString(f.key)} ${termToString(f.principal)}`;
+        case 'sharedSecret':
+            return `${termToString(f.a)} ⇌${termToString(f.secret)} ${termToString(f.b)}`;
+        case 'controls':
+            return `${termToString(f.principal)} |⇒ ${formulaToString(f.statement)}`;
+        case 'formula-and':
+            return `(${formulaToString(f.left)}) ∧ (${formulaToString(f.right)})`;
+    }
+}
+//# sourceMappingURL=terms.js.map

package/dist/reasoning/ban-logic/terms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"terms.js","sourceRoot":"","sources":["../../../src/reasoning/ban-logic/terms.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4DAA4D;AAC5D,+DAA+D;;;AA+F/D,gCAiDC;AAED,sCAqDC;AAED,gCAEC;AAID,oCAiBC;AAED,0CAyBC;AAvPD,qCAAqC;AAE9B,MAAM,SAAS,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;AAArE,QAAA,SAAS,aAA4D;AAE3E,MAAM,GAAG,GAAG,CAAC,IAAY,EAAE,MAAyB,EAAW,EAAE,CACtE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AADpD,QAAA,GAAG,OACiD;AAE1D,MAAM,KAAK,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;AAA7D,QAAA,KAAK,SAAwD;AAEnE,MAAM,IAAI,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAA3D,QAAA,IAAI,QAAuD;AAEjE,MAAM,OAAO,GAAG,CAAC,GAAG,OAAkB,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC;AAA7E,QAAA,OAAO,WAAsE;AAEnF,MAAM,SAAS,GAAG,CAAC,GAAY,EAAE,CAAU,EAAW,EAAE,CAAC,CAAC;IAC/D,IAAI,EAAE,WAAW;IACjB,OAAO,EAAE,GAAG;IACZ,GAAG,EAAE,CAAC;CACP,CAAC,CAAC;AAJU,QAAA,SAAS,aAInB;AAEI,MAAM,MAAM,GAAG,CAAC,GAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;AAAvE,QAAA,MAAM,UAAiE;AAE7E,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAgB,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AAA3E,QAAA,QAAQ,YAAmE;AAExF,qCAAqC;AAE9B,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAE,CAAa,EAAc,EAAE,CAAC,CAAC;IAClE,IAAI,EAAE,UAAU;IAChB,SAAS,EAAE,CAAC;IACZ,KAAK,EAAE,CAAC;CACT,CAAC,CAAC;AAJU,QAAA,QAAQ,YAIlB;AAEI,MAAM,IAAI,GAAG,CAAC,CAAU,EAAE,CAAU,EAAc,EAAE,CAAC,CAAC;IAC3D,IAAI,EAAE,MAAM;IACZ,SAAS,EAAE,CAAC;IACZ,IAAI,EAAE,CAAC;CACR,CAAC,CAAC;AAJU,QAAA,IAAI,QAId;AAEI,MAAM,IAAI,GAAG,CAAC,CAAU,EAAE,CAAa,EAAc,EAAE,CAAC,CAAC;IAC9D,IAAI,EAAE,MAAM;IACZ,SAAS,EAAE,CAAC;IACZ,IAAI,EAAE,CAAC;CACR,CAAC,CAAC;AAJU,QAAA,IAAI,QAId;AAEI,MAAM,WAAW,GAAG,CAAC,CAAU,EAAE,CAAU,EAAc,EAAE,CAAC,CAAC;IAClE,IAAI,EAAE,cAAc;IACpB,SAAS,EAAE,CAAC;IACZ,IAAI,EAAE,CAAC;CACR,CAAC,CAAC;AAJU,QAAA,WAAW,eAIrB;AAEI,MAAM,YAAY,GAAG,CAAC,CAAU,EAAE,CAAa,EAAc,EAAE,CAAC,CAAC;IACtE,IAAI,EAAE,cAAc;IACpB,SAAS,EAAE,CAAC;IACZ,IAAI,EAAE,CAAC;CACR,CAAC,CAAC;AAJU,QAAA,YAAY,gBAItB;AAEI,MAAM,KAAK,GAAG,CAAC,CAAU,EAAc,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;AAAjE,QAAA,KAAK,SAA4D;AAEvE,MAAM,SAAS,GAAG,CAAC,CAAU,EAAE,CAAU,EAAE,CAAU,EAAc,EAAE,CAAC,CAAC;IAC5E,IAAI,EAAE,WAAW;IACjB,CAAC;IACD,CAAC;IACD,GAAG,EAAE,CAAC;CACP,CAAC,CAAC;AALU,QAAA,SAAS,aAKnB;AAEI,MAAM,SAAS,GAAG,CAAC,CAAU,EAAE,CAAU,EAAc,EAAE,CAAC,CAAC;IAChE,IAAI,EAAE,WAAW;IACjB,SAAS,EAAE,CAAC;IACZ,GAAG,EAAE,CAAC;CACP,CAAC,CAAC;AAJU,QAAA,SAAS,aAInB;AAEI,MAAM,YAAY,GAAG,CAAC,CAAU,EAAE,CAAU,EAAE,CAAU,EAAc,EAAE,CAAC,CAAC;IAC/E,IAAI,EAAE,cAAc;IACpB,CAAC;IACD,CAAC;IACD,MAAM,EAAE,CAAC;CACV,CAAC,CAAC;AALU,QAAA,YAAY,gBAKtB;AAEI,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAE,CAAa,EAAc,EAAE,CAAC,CAAC;IAClE,IAAI,EAAE,UAAU;IAChB,SAAS,EAAE,CAAC;IACZ,SAAS,EAAE,CAAC;CACb,CAAC,CAAC;AAJU,QAAA,QAAQ,YAIlB;AAEI,MAAM,UAAU,GAAG,CAAC,IAAgB,EAAE,KAAiB,EAAc,EAAE,CAAC,CAAC;IAC9E,IAAI,EAAE,aAAa;IACnB,IAAI;IACJ,KAAK;CACN,CAAC,CAAC;AAJU,QAAA,UAAU,cAIpB;AAEH,gCAAgC;AAEhC,SAAgB,UAAU,CAAC,CAAU,EAAE,CAAU;IAC/C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,WAAW,CAAC;QACjB,KAAK,OAAO,CAAC;QACb,KAAK,MAAM;YACT,gCAAgC;YAChC,OAAQ,CAAsB,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC;QACjD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,CAAsC,CAAC;YAClD,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;YACrC,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;YACpB,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC;YACrB,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,OAAO,IAAI,CAAC;YAC5B,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,OAAO,KAAK,CAAC;YAC7B,iDAAiD;YACjD,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,EAAE,GAAG,CAA0C,CAAC;YACtD,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,EAAE,CAAC,OAAO,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACxB,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;oBAAE,OAAO,KAAK,CAAC;gBAC7B,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;oBAAE,OAAO,KAAK,CAAC;YACxC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,EAAE,GAAG,CAA2C,CAAC;YACvD,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtB,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;oBAAE,OAAO,KAAK,CAAC;gBAC7B,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;oBAAE,OAAO,KAAK,CAAC;YACxC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAA4C,CAAC;YACxD,OAAO,UAAU,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACxE,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,EAAE,GAAG,CAAyC,CAAC;YACrD,OAAO,UAAU,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAgB,aAAa,CAAC,CAAa,EAAE,CAAa;IACxD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,EAAE,GAAG,CAA8C,CAAC;YAC1D,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QACnF,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,CAA0C,CAAC;YACtD,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAC9E,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,CAA0C,CAAC;YACtD,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACjF,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,CAAkD,CAAC;YAC9D,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAC9E,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,CAAkD,CAAC;YAC9D,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACjF,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,EAAE,GAAG,CAA2C,CAAC;YACvD,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAA+C,CAAC;YAC3D,+CAA+C;YAC/C,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1D,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACjD,CAAC;QACD,KAAK,WAAW,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAA+C,CAAC;YAC3D,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAC5E,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,CAAkD,CAAC;YAC9D,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1D,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;QACvD,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,EAAE,GAAG,CAA8C,CAAC;YAC1D,OAAO,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;QAC3F,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,CAAiD,CAAC;YAC7D,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAgB,UAAU,CAAC,KAAgC,EAAE,MAAkB;IAC7E,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACrD,CAAC;AAED,2BAA2B;AAE3B,SAAgB,YAAY,CAAC,CAAU;IACrC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,WAAW,CAAC;QACjB,KAAK,OAAO,CAAC;QACb,KAAK,MAAM;YACT,OAAO,CAAC,CAAC,IAAI,CAAC;QAChB,KAAK,KAAK;YACR,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9D,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QACvD,KAAK,UAAU;YACb,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QACtD,KAAK,WAAW;YACd,OAAO,IAAI,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/D,KAAK,QAAQ;YACX,OAAO,KAAK,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC;IAC3C,CAAC;AACH,CAAC;AAED,SAAgB,eAAe,CAAC,CAAa;IAC3C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,UAAU;YACb,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QACvE,KAAK,MAAM;YACT,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAClE,KAAK,MAAM;YACT,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACtE,KAAK,cAAc;YACjB,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACnE,KAAK,cAAc;YACjB,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACtE,KAAK,OAAO;YACV,OAAO,KAAK,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QACtC,KAAK,WAAW;YACd,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7E,KAAK,WAAW;YACd,OAAO,KAAK,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;QACjE,KAAK,cAAc;YACjB,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAChF,KAAK,UAAU;YACb,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;QAC3E,KAAK,aAAa;YAChB,OAAO,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;IAC1E,CAAC;AACH,CAAC"}

package/dist/reasoning/ban-logic/types.d.ts

@@ -0,0 +1,107 @@
+/**
+ * Un término BAN es un objeto del dominio: principal (agente), clave,
+ * nonce, mensaje compuesto, mensaje cifrado, hash o término genérico.
+ */
+export type BANTerm = {
+    kind: 'principal';
+    name: string;
+} | {
+    kind: 'key';
+    name: string;
+    shared?: [string, string];
+} | {
+    kind: 'nonce';
+    name: string;
+} | {
+    kind: 'message';
+    content: BANTerm[];
+} | {
+    kind: 'encrypted';
+    message: BANTerm;
+    key: BANTerm;
+} | {
+    kind: 'hashed';
+    message: BANTerm;
+} | {
+    kind: 'compound';
+    parts: BANTerm[];
+} | {
+    kind: 'atom';
+    name: string;
+};
+/**
+ * Una fórmula BAN es una proposición sobre creencias, posesión o
+ * propiedades de términos. Es lo que las reglas manipulan.
+ *
+ * Nota: tratamos `said` y `said-message` por separado porque BAN distingue
+ * entre "P dijo una fórmula completa" (raro) y "P dijo un término"
+ * (caso usual; lo que aparece en mensajes ciphered).
+ */
+export type BANFormula = {
+    kind: 'believes';
+    principal: BANTerm;
+    about: BANFormula;
+} | {
+    kind: 'sees';
+    principal: BANTerm;
+    what: BANTerm;
+} | {
+    kind: 'said';
+    principal: BANTerm;
+    what: BANFormula;
+} | {
+    kind: 'said-message';
+    principal: BANTerm;
+    what: BANTerm;
+} | {
+    kind: 'jurisdiction';
+    principal: BANTerm;
+    over: BANFormula;
+} | {
+    kind: 'fresh';
+    what: BANTerm;
+} | {
+    kind: 'sharedKey';
+    a: BANTerm;
+    b: BANTerm;
+    key: BANTerm;
+} | {
+    kind: 'publicKey';
+    principal: BANTerm;
+    key: BANTerm;
+} | {
+    kind: 'sharedSecret';
+    a: BANTerm;
+    b: BANTerm;
+    secret: BANTerm;
+} | {
+    kind: 'controls';
+    principal: BANTerm;
+    statement: BANFormula;
+} | {
+    kind: 'formula-and';
+    left: BANFormula;
+    right: BANFormula;
+};
+export interface BANRule {
+    name: string;
+    description: string;
+}
+export interface ProtocolStep {
+    from: string;
+    to: string;
+    message: BANTerm;
+}
+export interface Protocol {
+    name: string;
+    participants: string[];
+    initialAssumptions: BANFormula[];
+    steps: ProtocolStep[];
+    goals: BANFormula[];
+}
+export interface ProtocolAnalysis {
+    satisfied: BANFormula[];
+    unsatisfied: BANFormula[];
+    trace: BANFormula[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/reasoning/ban-logic/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/reasoning/ban-logic/types.ts"],"names":[],"mappings":"AA2BA;;;GAGG;AACH,MAAM,MAAM,OAAO,GACf;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACnC;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,GACxD;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,OAAO,EAAE,OAAO,EAAE,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,OAAO,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GACrD;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,GACpC;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,OAAO,EAAE,CAAA;CAAE,GACtC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAInC;;;;;;;GAOG;AACH,MAAM,MAAM,UAAU,GAClB;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GAC3D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GACnD;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,UAAU,CAAA;CAAE,GACtD;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAC3D;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,UAAU,CAAA;CAAE,GAC9D;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAChC;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,CAAC,EAAE,OAAO,CAAC;IAAC,CAAC,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GAC3D;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,GACvD;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,CAAC,EAAE,OAAO,CAAC;IAAC,CAAC,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,OAAO,CAAA;CAAE,GACjE;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,SAAS,EAAE,UAAU,CAAA;CAAE,GAC/D;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,CAAC;AAIjE,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;CACrB;AAID,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,OAAO,CAAC;CAClB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,kBAAkB,EAAE,UAAU,EAAE,CAAC;IACjC,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,KAAK,EAAE,UAAU,EAAE,CAAC;CACrB;AAED,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,UAAU,EAAE,CAAC;IACxB,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,KAAK,EAAE,UAAU,EAAE,CAAC;CACrB"}

package/dist/reasoning/ban-logic/types.js

@@ -0,0 +1,27 @@
+"use strict";
+// ============================================================
+// BAN Logic — Tipos públicos
+// ============================================================
+//
+// Burrows-Abadi-Needham logic (1989): cálculo modal de creencias para
+// análisis de protocolos criptográficos de autenticación.
+//
+// Símbolos (notación estándar BAN):
+//
+//   P |≡ X      "P believes X"               P cree X
+//   P ◁  X      "P sees X"                   P ve X (recibió un mensaje con X)
+//   P |~ X      "P once said X"              P dijo X alguna vez
+//   P |⇒ X      "P has jurisdiction over X"  P es autoridad sobre X
+//   #(X)        "fresh X"                    X es fresco (nonce reciente)
+//   P ↔K Q      "K is shared between P, Q"   K es clave compartida
+//   |→K P       "K is public key for P"      K es la clave pública de P
+//   P ⇌X Q      "X is shared secret"         X es un secreto compartido
+//   {X}_K       "X encrypted with K"         X cifrado con K
+//   <X>_Y       "X combined with secret Y"   X concatenado con secreto Y
+//   H(X)        "hash of X"                  hash de X
+//
+// Reglas de inferencia clásicas (10): message-meaning (3 variantes:
+// shared-key, public-key, shared-secret), nonce-verification,
+// jurisdiction, freshness propagation, belief conjunction, seeing rules.
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/reasoning/ban-logic/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/reasoning/ban-logic/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6BAA6B;AAC7B,+DAA+D;AAC/D,EAAE;AACF,sEAAsE;AACtE,0DAA0D;AAC1D,EAAE;AACF,oCAAoC;AACpC,EAAE;AACF,sDAAsD;AACtD,+EAA+E;AAC/E,iEAAiE;AACjE,oEAAoE;AACpE,0EAA0E;AAC1E,mEAAmE;AACnE,wEAAwE;AACxE,wEAAwE;AACxE,6DAA6D;AAC7D,yEAAyE;AACzE,uDAAuD;AACvD,EAAE;AACF,oEAAoE;AACpE,8DAA8D;AAC9D,yEAAyE"}

package/dist/reasoning/computability/index.d.ts

@@ -0,0 +1,239 @@
+export type TMState = string;
+export type TMSymbol = string;
+export type Direction = 'L' | 'R' | 'S';
+export interface TMTransition {
+    readonly fromState: TMState;
+    readonly readSymbol: TMSymbol;
+    readonly toState: TMState;
+    readonly writeSymbol: TMSymbol;
+    readonly direction: Direction;
+}
+export interface TuringMachine {
+    readonly states: Set<TMState>;
+    readonly alphabet: Set<TMSymbol>;
+    readonly tapeAlphabet: Set<TMSymbol>;
+    readonly transitions: TMTransition[];
+    readonly initialState: TMState;
+    readonly acceptStates: Set<TMState>;
+    readonly rejectStates?: Set<TMState>;
+    readonly blank: TMSymbol;
+}
+export interface TMConfig {
+    readonly state: TMState;
+    readonly tape: TMSymbol[];
+    readonly head: number;
+    readonly step: number;
+}
+export type StepResult = TMConfig | 'halted-accept' | 'halted-reject' | 'no-transition';
+/**
+ * Inicializa una configuración a partir de la entrada. La cinta arranca
+ * con los símbolos de `input`, cabeza en 0. Si la entrada es vacía la
+ * cinta arranca con un blank.
+ */
+export declare function initialConfig(M: TuringMachine, input: string): TMConfig;
+/**
+ * Un paso de la TM. Devuelve la próxima configuración o un terminal.
+ *   • Si el estado actual ya es de aceptación → 'halted-accept'.
+ *   • Si es de rechazo → 'halted-reject'.
+ *   • Si no hay transición desde (state, leído) → 'no-transition'.
+ */
+export declare function step(M: TuringMachine, config: TMConfig): StepResult;
+export interface RunResult {
+    readonly result: 'accept' | 'reject' | 'timeout' | 'no-transition';
+    readonly steps: number;
+    readonly finalConfig: TMConfig;
+}
+/**
+ * Corre la TM hasta aceptar, rechazar, agotarse o quedar sin transición.
+ * `maxSteps` defaultea a 10_000.
+ */
+export declare function run(M: TuringMachine, input: string, maxSteps?: number): RunResult;
+/**
+ * Lista todas las configuraciones generadas, hasta `maxSteps`.
+ * Incluye la configuración inicial. No incluye un sentinel para terminal.
+ */
+export declare function trace(M: TuringMachine, input: string, maxSteps: number): TMConfig[];
+/**
+ * Lectura útil de la cinta: la subcadena no-blank más larga centrada en
+ * la región explorada. Sirve para validar máquinas que escriben output
+ * en la cinta (binary increment, reverse, copy, etc.).
+ */
+export declare function readTape(M: TuringMachine, config: TMConfig): string;
+/**
+ * Halting acotado: ¿la TM para en ≤ `maxSteps` pasos?
+ *   • `true` si para por aceptación, rechazo o falta de transición.
+ *   • `false` técnicamente nunca se devuelve aquí — para devolver
+ *     `false` con certeza haría falta resolver el halting problem, que
+ *     es indecidible. Cuando agotamos el budget devolvemos `'unknown'`.
+ * Esta función es semi-decidible: reconoce las máquinas que paran,
+ * pero no decide el lenguaje complemento (las que no paran).
+ */
+export declare function boundedHalts(M: TuringMachine, input: string, maxSteps: number): boolean | 'unknown';
+/**
+ * Incrementa un número binario (MSB first) en la cinta.
+ * Algoritmo: ir al final, retroceder convirtiendo 1→0 mientras haya
+ * acarreo; al primer 0 escribir 1 y aceptar. Si todo era 1, escribir
+ * 1 al borde izquierdo y aceptar.
+ */
+export declare function tmBinaryIncrement(): TuringMachine;
+/**
+ * Acepta sii la cantidad de 1s en la entrada (sobre alfabeto {1}) es par.
+ * Estados q0 = par hasta ahora, q1 = impar.
+ */
+export declare function tmUnaryParity(): TuringMachine;
+/**
+ * Revierte una cadena sobre {a, b}. Algoritmo:
+ *   1. Marcar inicio (Sa, Sb) con un símbolo distintivo.
+ *   2. Encontrar el final y desplazar el símbolo del frente al fondo.
+ *   3. Repetir hasta agotar.
+ * Output: la cinta termina con el reverso de la entrada original.
+ *
+ * Implementación con cinta auxiliar a la derecha (más simple):
+ *   Caminar a la derecha mientras se copian símbolos en orden inverso
+ *   tras un separador. Al terminar borrar la entrada original.
+ *
+ * Para evitar complicaciones, esta versión usa una técnica de
+ * "shift left after marking": tras leer un símbolo, lo borra y lo
+ * reescribe al final del bloque restante.
+ *
+ * Nota: este algoritmo es O(n²) en pasos pero correcto.
+ */
+export declare function tmReverseString(): TuringMachine;
+/**
+ * Copia w → w#w sobre {a, b}. El '#' se inserta automáticamente y la
+ * copia queda a la derecha. Algoritmo análogo a reverse pero copiando
+ * en orden directo (marcamos cada símbolo procesado con mayúscula).
+ */
+export declare function tmCopy(): TuringMachine;
+/**
+ * Suma con `a` en binario y `b` en unario, formato "<a>+<b>" donde
+ *   a ∈ {0,1}* (MSB-first), b ∈ {1}*.
+ *
+ * Mantener `b` unario evita la coreografía de decremento binario (que
+ * agrega ~10 estados sin enseñar nada nuevo) y muestra claramente la
+ * técnica de "incrementar `a` una vez por cada token de `b`".
+ *
+ * Algoritmo:
+ *   1. Ir al final.
+ *   2. Si la última posición es '1' (un token de b), borrarlo y entrar
+ *      en `incA`: incrementar `a` y luego volver al final.
+ *   3. Si la última posición es '+' (b vacío), borrarlo: la cinta queda
+ *      con sólo `a` (el resultado).
+ */
+export declare function tmAddBinary(): TuringMachine;
+export type PRFn = {
+    kind: 'zero';
+} | {
+    kind: 'succ';
+} | {
+    kind: 'proj';
+    n: number;
+    i: number;
+} | {
+    kind: 'comp';
+    outer: PRFn;
+    inner: PRFn[];
+} | {
+    kind: 'rec';
+    base: PRFn;
+    step: PRFn;
+};
+/**
+ * Semántica de PRF:
+ *   • zero()           = 0
+ *   • succ(x)          = x + 1
+ *   • U^n_i(x1..xn)    = x_i
+ *   • comp(h, g1..gk)(x1..xn) = h(g1(x1..xn), ..., gk(x1..xn))
+ *   • rec(base, step):
+ *       f(0, x1..xn)     = base(x1..xn)
+ *       f(y+1, x1..xn)   = step(y, f(y, x1..xn), x1..xn)
+ *
+ * El argumento "iterado" es el primero (convención común). `args[0]` es
+ * el contador en `rec`.
+ */
+export declare function evalPR(f: PRFn, args: number[]): number;
+/**
+ * Suma: add(0, y) = y, add(x+1, y) = succ(add(x, y))
+ *   base = U^1_1 (identidad en y)
+ *   step = succ ∘ U^3_2 (toma f(x,y) y le aplica succ)
+ *
+ * En nuestra convención args[0] es el contador → add(x, y).
+ */
+export declare const PR_ADD: PRFn;
+/**
+ * Multiplicación: mul(0, y) = 0, mul(x+1, y) = add(mul(x,y), y)
+ *   base = zero (después de proyectar y fuera)
+ *   step = add(f(x,y), y)
+ *
+ * base: el caso 0 → 0. Es la función constante 0 sobre 1 argumento:
+ *   const0(y) = zero ∘ U^1_1, pero zero ignora sus argumentos.
+ *   En este eval, zero retorna 0 sin importar args.
+ */
+export declare const PR_MUL: PRFn;
+export declare const PR_POW: PRFn;
+/**
+ * Predecesor: pred(0) = 0, pred(x+1) = x.
+ *   rec con base = zero, step = U^2_1 (devuelve y, el contador previo).
+ */
+export declare const PR_PREDECESSOR: PRFn;
+/**
+ * Factorial: fact(0) = 1, fact(x+1) = mul(succ(x), fact(x)).
+ *
+ * En recursión: contador y, acumulador f(y), sin args extra. Step recibe
+ * (y, f(y)) y debe devolver mul(succ(y), f(y)).
+ *
+ * Cuidado: aquí args[0]=y es el "k" del bucle (0-indexed), por lo que
+ * succ(y) = y+1 = el siguiente número a multiplicar.
+ */
+export declare const PR_FACT: PRFn;
+/**
+ * Función de Ackermann (Peter):
+ *   A(0, n) = n + 1
+ *   A(m+1, 0) = A(m, 1)
+ *   A(m+1, n+1) = A(m, A(m+1, n))
+ *
+ * Crece más rápido que toda PRF: A(m, n) es la prueba canónica de que
+ * existen funciones recursivas totales no primitivas recursivas.
+ *
+ * Implementación iterativa por stack para esquivar el call-stack JS.
+ */
+export declare function ackermann(m: number, n: number): number;
+/**
+ * Test heurístico de "esta función podría ser PR": evalúa la función
+ * sobre `samples` puntos pequeños y la compara con el patrón de
+ * crecimiento de Ackermann (que escapa a PR). Es estrictamente una
+ * heurística — no es un decisor.
+ *
+ *   • Si la función supera a A(samples, samples) en algún punto pequeño
+ *     → likely = false (probablemente no es PR).
+ *   • Si nunca crece más rápido que cuadrático/exponencial moderado →
+ *     likely = true.
+ */
+export declare function isInPR(f: (n: number) => number, samples?: number): {
+    likely: boolean;
+    estimate?: number;
+};
+/**
+ * Rice (1953): toda propiedad **no trivial** sobre el lenguaje aceptado
+ * por una TM (es decir, sobre el comportamiento input/output observable)
+ * es **indecidible**.
+ *
+ * No podemos *decidir* la propiedad — eso es justo lo que el teorema
+ * niega. Lo que sí podemos es **verificar el predicado de Rice**: la
+ * propiedad debe ser
+ *
+ *   1. extensional (depende sólo del lenguaje, no del código),
+ *   2. no vacía (alguna TM la satisface),
+ *   3. no total (alguna TM no la satisface).
+ *
+ * Esta función toma el predicado, lo evalúa sobre un muestreo finito de
+ * TMs conocidas y, si encuentra una `M0` que la satisface y una `M1`
+ * que no, devuelve `undecidable = true` con explicación. Si todas las
+ * TMs de la muestra dan la misma respuesta no podemos concluir nada
+ * (la propiedad podría ser trivial, o la muestra puede ser muy chica).
+ */
+export declare function riceWitness(property: (m: TuringMachine) => boolean, sampleSize?: number): {
+    undecidable: boolean;
+    explanation: string;
+};
+//# sourceMappingURL=index.d.ts.map

package/dist/reasoning/computability/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reasoning/computability/index.ts"],"names":[],"mappings":"AA6CA,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC;AAC7B,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC;AAC9B,MAAM,MAAM,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAExC,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC;IAC9B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC;IAC/B,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;CAC/B;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IAC9B,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;IACjC,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;IACrC,QAAQ,CAAC,WAAW,EAAE,YAAY,EAAE,CAAC;IACrC,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC;IAC/B,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IACpC,QAAQ,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IACrC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;CAC1B;AAED,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,eAAe,GAAG,eAAe,GAAG,eAAe,CAAC;AAExF;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,GAAG,QAAQ,CAGvE;AAUD;;;;;GAKG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,GAAG,UAAU,CAkCnE;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,MAAM,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,eAAe,CAAC;IACnE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC;CAChC;AAED;;;GAGG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,SAAS,GAAG,SAAS,CAWjF;AAED;;;GAGG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,QAAQ,EAAE,CAWnF;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,GAAG,MAAM,CAMnE;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAC1B,CAAC,EAAE,aAAa,EAChB,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,GACf,OAAO,GAAG,SAAS,CAIrB;AAID;;;;;GAKG;AACH,wBAAgB,iBAAiB,IAAI,aAAa,CAuBjD;AAED;;;GAGG;AACH,wBAAgB,aAAa,IAAI,aAAa,CAgB7C;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,eAAe,IAAI,aAAa,CAiN/C;AAED;;;;GAIG;AACH,wBAAgB,MAAM,IAAI,aAAa,CAwFtC;AAKD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,WAAW,IAAI,aAAa,CAmF3C;AAID,MAAM,MAAM,IAAI,GACZ;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAChB;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAChB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,GACtC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,IAAI,EAAE,CAAA;CAAE,GAC5C;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE,CAAC;AAE5C;;;;;;;;;;;;GAYG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAoCtD;AASD;;;;;;GAMG;AACH,eAAO,MAAM,MAAM,EAAE,IAA8C,CAAC;AAEpE;;;;;;;;GAQG;AACH,eAAO,MAAM,MAAM,EAAE,IAAwE,CAAC;AAQ9F,eAAO,MAAM,MAAM,EAAE,IAAwD,CAAC;AAE9E;;;GAGG;AACH,eAAO,MAAM,cAAc,EAAE,IAA4B,CAAC;AAE1D;;;;;;;;GAQG;AACH,eAAO,MAAM,OAAO,EAAE,IAGrB,CAAC;AAIF;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAoBtD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CACpB,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,EACxB,OAAO,SAAI,GACV;IAAE,MAAM,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,CAexC;AAID;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,WAAW,CACzB,QAAQ,EAAE,CAAC,CAAC,EAAE,aAAa,KAAK,OAAO,EACvC,UAAU,SAAI,GACb;IAAE,WAAW,EAAE,OAAO,CAAC;IAAC,WAAW,EAAE,MAAM,CAAA;CAAE,CA4B/C"}