@stevenvo780/st-lang 4.3.0 → 4.5.0

package/dist/runtime/pi-calculus/reduction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduction.js","sourceRoot":"","sources":["../../../src/runtime/pi-calculus/reduction.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qDAAqD;AACrD,+DAA+D;AAC/D,+BAA+B;AAC/B,EAAE;AACF,kDAAkD;AAClD,qCAAqC;AACrC,2CAA2C;AAC3C,uEAAuE;AACvE,0EAA0E;AAC1E,sEAAsE;AACtE,8DAA8D;AAC9D,EAAE;AACF,oEAAoE;AACpE,sEAAsE;AACtE,+DAA+D;;AAwI/D,wBAMC;AA4ND,oCAEC;AAOD,sBAWC;AA3XD,iDAA4C;AAC5C,mCAA4D;AAqB5D;;;;;;;;;GASG;AACH,SAAS,aAAa,CACpB,CAAY,EACZ,OAAoC,EACpC,GAAkB;IAElB,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,OAAO;YACV,GAAG,CAAC,IAAI,CAAC;gBACP,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,OAAO;aACR,CAAC,CAAC;YACH,MAAM;QACR,KAAK,UAAU;YACb,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1F,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1F,MAAM;QACR,KAAK,QAAQ;YACX,2DAA2D;YAC3D,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC9C,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC/C,MAAM;QACR,KAAK,aAAa;YAChB,2EAA2E;YAC3E,aAAa,CACX,CAAC,CAAC,IAAI,EACN,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,EAC3F,GAAG,CACJ,CAAC;YACF,MAAM;QACR,KAAK,OAAO;YACV,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;gBACvB,sEAAsE;gBACtE,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;YACtC,CAAC;YACD,MAAM;QACR,KAAK,KAAK,CAAC;QACX,KAAK,KAAK,CAAC;QACX,KAAK,QAAQ;YACX,uEAAuE;YACvE,kDAAkD;YAClD,MAAM;IACV,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACrB,CAAY,EACZ,OAAoC,EACpC,GAAmB;IAEnB,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,QAAQ;YACX,GAAG,CAAC,IAAI,CAAC;gBACP,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,OAAO;aACR,CAAC,CAAC;YACH,MAAM;QACR,KAAK,UAAU;YACb,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YAC3F,cAAc,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YAC3F,MAAM;QACR,KAAK,QAAQ;YACX,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC/C,cAAc,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAChD,MAAM;QACR,KAAK,aAAa;YAChB,cAAc,CACZ,CAAC,CAAC,IAAI,EACN,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,EAC3F,GAAG,CACJ,CAAC;YACF,MAAM;QACR,KAAK,OAAO;YACV,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;gBACvB,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;YACvC,CAAC;YACD,MAAM;QACR,KAAK,KAAK,CAAC;QACX,KAAK,KAAK,CAAC;QACX,KAAK,OAAO;YACV,MAAM;IACV,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,iEAAiE;AACjE,+DAA+D;AAE/D;;;;;;;;;GASG;AACH,SAAgB,MAAM,CAAC,CAAY;IACjC,2DAA2D;IAC3D,yEAAyE;IACzE,MAAM,UAAU,GAAgB,EAAE,CAAC;IACnC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAC/C,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAC5B,CAAY,EACZ,OAAoC,EACpC,GAAgB;IAEhB,qBAAqB;IACrB,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;QAC7C,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,iEAAiE;IACjE,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACrB,qBAAqB,CACnB,CAAC,CAAC,IAAI,EACN,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAC5D,GAAG,CACJ,CAAC;IACJ,CAAC;IAED,2EAA2E;IAC3E,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACnC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAErC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO;gBAAE,SAAS;YACtC,kEAAkE;YAClE,oEAAoE;YACpE,mEAAmE;YACnE,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnC,IAAI,OAAO,KAAK,IAAI;gBAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,SAAS,CAAC,CAAY,EAAE,CAAc,EAAE,CAAe;IAC9D,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAChC,MAAM,MAAM,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;IACnD,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;AACtC,CAAC;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CACzB,CAAY,EACZ,CAAc,EACd,CAAe,EACf,MAA0B;IAE1B,6BAA6B;IAC7B,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5F,MAAM,WAAW,GAAG,IAAA,yBAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACxD,OAAO,WAAW,CAAC;IACrB,CAAC;IACD,8BAA8B;IAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/F,OAAO,CAAC,CAAC,IAAI,CAAC;IAChB,CAAC;IACD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK,CAAC;QACX,KAAK,OAAO,CAAC;QACb,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC;QACX,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACjD,MAAM,UAAU,GAAG,gBAAgB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,IAAI,SAAS,CAAC,QAAQ,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;gBAC/C,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC;gBACpB,OAAO;oBACL,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;oBACxD,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;iBAC3D,CAAC;YACJ,CAAC;YACD,IAAI,UAAU,CAAC,QAAQ,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;gBAC/C,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC;gBACpB,OAAO;oBACL,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;oBACxD,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;iBAC3D,CAAC;YACJ,CAAC;YACD,qCAAqC;YACrC,IAAI,SAAS,CAAC,QAAQ,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;gBAC9C,OAAO;oBACL,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;oBAC9C,KAAK,EAAE,CAAC,CAAC,KAAK;iBACf,CAAC;YACJ,CAAC;YACD,IAAI,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;gBAChD,OAAO;oBACL,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,CAAC,CAAC,IAAI;oBACZ,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;iBACjD,CAAC;YACJ,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,yDAAyD;YACzD,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACjD,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;gBAC1C,OAAO,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAClD,CAAC;YACD,IAAI,QAAQ,CAAC,QAAQ,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;gBAC5C,OAAO,kBAAkB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YACnD,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,yEAAyE;YACzE,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;YAClB,IAAI,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;YACxB,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;gBAChC,KAAK,MAAM,CAAC,IAAI,IAAA,iBAAS,EAAC,IAAI,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC9C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACnB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAClB,MAAM,KAAK,GAAG,IAAA,iBAAS,EAAC,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;gBAC1C,IAAI,GAAG,IAAA,mBAAW,EAAC,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;gBAC3C,OAAO,GAAG,KAAK,CAAC;YAClB,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,kBAAkB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC;QAChF,CAAC;QACD,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,oEAAoE;YACpE,MAAM,GAAG,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACvE,MAAM,QAAQ,GAAc;oBAC1B,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,CAAC,CAAC,IAAI;oBACZ,KAAK,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE;iBAC7C,CAAC;gBACF,OAAO,kBAAkB,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YACpD,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;QACD,KAAK,OAAO;YACV,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC;gBACvB,OAAO,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAClD,CAAC;YACD,OAAO,CAAC,CAAC;IACb,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CACvB,CAAY,EACZ,CAAc,EACd,CAAe;IAEf,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,CAAC,CAAC,CAAC,CAAC;IACR,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;IAE/B,SAAS,IAAI,CAAC,CAAY;QACxB,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;YAC5F,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,IACE,CAAC,CAAC,IAAI,KAAK,QAAQ;YACnB,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO;YACvB,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YACnB,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EACjB,CAAC;YACD,SAAS,GAAG,IAAI,CAAC;QACnB,CAAC;QACD,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,UAAU,CAAC;YAChB,KAAK,QAAQ;gBACX,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACb,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACd,OAAO;YACT,KAAK,KAAK,CAAC;YACX,KAAK,aAAa;gBAChB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACb,OAAO;YACT,KAAK,OAAO;gBACV,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACb,OAAO;YACT;gBACE,OAAO;QACX,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAgB,YAAY,CAAC,CAAY;IACvC,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;AAChC,CAAC;AAED;;;;GAIG;AACH,SAAgB,KAAK,CAAC,CAAY,EAAE,WAAmB,GAAG;IACxD,MAAM,MAAM,GAAgB,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAC7B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,OAAO,GAAG,IAAI,CAAC;IACjB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/runtime/pi-calculus/substitution.d.ts

@@ -0,0 +1,11 @@
+import type { PiProcess } from './types';
+/**
+ * Sustitución `p[x := v]` capture-avoiding.
+ *
+ *  - Si `x === v` o `x` no aparece libre, devuelve `p` sin cambios
+ *    estructurales (pero retorna un AST nuevo solo donde fue necesario).
+ *  - En binders (input, new) verifica que el nombre ligado no capture
+ *    `v`: si lo hiciera, refresca el binder con `freshName`.
+ */
+export declare function substitute(p: PiProcess, x: string, v: string): PiProcess;
+//# sourceMappingURL=substitution.d.ts.map

package/dist/runtime/pi-calculus/substitution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"substitution.d.ts","sourceRoot":"","sources":["../../../src/runtime/pi-calculus/substitution.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAGzC;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS,CAqFxE"}

package/dist/runtime/pi-calculus/substitution.js

@@ -0,0 +1,109 @@
+"use strict";
+// ============================================================
+// π-calculus — sustitución capture-avoiding P[x := v].
+// ============================================================
+// Reemplaza ocurrencias libres de `x` por `v` en P. Si `v` cae bajo un
+// binder que lo capturaría (input o new que liga el mismo nombre `v`),
+// se α-renombra el binder con un nombre fresco antes de descender.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.substitute = substitute;
+const names_1 = require("./names");
+/**
+ * Sustitución `p[x := v]` capture-avoiding.
+ *
+ *  - Si `x === v` o `x` no aparece libre, devuelve `p` sin cambios
+ *    estructurales (pero retorna un AST nuevo solo donde fue necesario).
+ *  - En binders (input, new) verifica que el nombre ligado no capture
+ *    `v`: si lo hiciera, refresca el binder con `freshName`.
+ */
+function substitute(p, x, v) {
+    if (x === v)
+        return p;
+    switch (p.kind) {
+        case 'nil':
+            return p;
+        case 'input': {
+            const newChannel = p.channel === x ? v : p.channel;
+            // El binder atrapa `x`: el cuerpo no ve `x` libre, no hay que descender.
+            if (p.bind === x) {
+                return { kind: 'input', channel: newChannel, bind: p.bind, cont: p.cont };
+            }
+            // Capture: el binder es justo `v`. Refrescamos el binder.
+            if (p.bind === v) {
+                const avoid = new Set();
+                for (const n of (0, names_1.freeNames)(p.cont))
+                    avoid.add(n);
+                avoid.add(x);
+                avoid.add(v);
+                const fresh = (0, names_1.freshName)(p.bind, avoid);
+                const renamed = (0, names_1.alphaRename)(p.cont, p.bind, fresh);
+                return {
+                    kind: 'input',
+                    channel: newChannel,
+                    bind: fresh,
+                    cont: substitute(renamed, x, v),
+                };
+            }
+            return {
+                kind: 'input',
+                channel: newChannel,
+                bind: p.bind,
+                cont: substitute(p.cont, x, v),
+            };
+        }
+        case 'output':
+            return {
+                kind: 'output',
+                channel: p.channel === x ? v : p.channel,
+                value: p.value === x ? v : p.value,
+                cont: substitute(p.cont, x, v),
+            };
+        case 'parallel':
+            return {
+                kind: 'parallel',
+                left: substitute(p.left, x, v),
+                right: substitute(p.right, x, v),
+            };
+        case 'choice':
+            return {
+                kind: 'choice',
+                left: substitute(p.left, x, v),
+                right: substitute(p.right, x, v),
+            };
+        case 'new': {
+            if (p.channel === x) {
+                return p;
+            }
+            if (p.channel === v) {
+                const avoid = new Set();
+                for (const n of (0, names_1.freeNames)(p.body))
+                    avoid.add(n);
+                avoid.add(x);
+                avoid.add(v);
+                const fresh = (0, names_1.freshName)(p.channel, avoid);
+                const renamed = (0, names_1.alphaRename)(p.body, p.channel, fresh);
+                return {
+                    kind: 'new',
+                    channel: fresh,
+                    body: substitute(renamed, x, v),
+                };
+            }
+            return {
+                kind: 'new',
+                channel: p.channel,
+                body: substitute(p.body, x, v),
+            };
+        }
+        case 'replication':
+            return { kind: 'replication', body: substitute(p.body, x, v) };
+        case 'match':
+            return {
+                kind: 'match',
+                left: p.left === x ? v : p.left,
+                right: p.right === x ? v : p.right,
+                cont: substitute(p.cont, x, v),
+            };
+    }
+}
+//# sourceMappingURL=substitution.js.map

package/dist/runtime/pi-calculus/substitution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"substitution.js","sourceRoot":"","sources":["../../../src/runtime/pi-calculus/substitution.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uDAAuD;AACvD,+DAA+D;AAC/D,uEAAuE;AACvE,uEAAuE;AACvE,mEAAmE;AACnE,+DAA+D;;AAa/D,gCAqFC;AA/FD,mCAA4D;AAE5D;;;;;;;GAOG;AACH,SAAgB,UAAU,CAAC,CAAY,EAAE,CAAS,EAAE,CAAS;IAC3D,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,KAAK;YACR,OAAO,CAAC,CAAC;QACX,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,UAAU,GAAG,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YACnD,yEAAyE;YACzE,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACjB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YAC5E,CAAC;YACD,0DAA0D;YAC1D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACjB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;gBAChC,KAAK,MAAM,CAAC,IAAI,IAAA,iBAAS,EAAC,CAAC,CAAC,IAAI,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACb,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACb,MAAM,KAAK,GAAG,IAAA,iBAAS,EAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACvC,MAAM,OAAO,GAAG,IAAA,mBAAW,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACnD,OAAO;oBACL,IAAI,EAAE,OAAO;oBACb,OAAO,EAAE,UAAU;oBACnB,IAAI,EAAE,KAAK;oBACX,IAAI,EAAE,UAAU,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;iBAChC,CAAC;YACJ,CAAC;YACD,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,OAAO,EAAE,UAAU;gBACnB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;aAC/B,CAAC;QACJ,CAAC;QACD,KAAK,QAAQ;YACX,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,OAAO,EAAE,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO;gBACxC,KAAK,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;gBAClC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;aAC/B,CAAC;QACJ,KAAK,UAAU;YACb,OAAO;gBACL,IAAI,EAAE,UAAU;gBAChB,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC9B,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;aACjC,CAAC;QACJ,KAAK,QAAQ;YACX,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC9B,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;aACjC,CAAC;QACJ,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,CAAC;YACX,CAAC;YACD,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;gBACpB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;gBAChC,KAAK,MAAM,CAAC,IAAI,IAAA,iBAAS,EAAC,CAAC,CAAC,IAAI,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACb,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACb,MAAM,KAAK,GAAG,IAAA,iBAAS,EAAC,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;gBAC1C,MAAM,OAAO,GAAG,IAAA,mBAAW,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;gBACtD,OAAO;oBACL,IAAI,EAAE,KAAK;oBACX,OAAO,EAAE,KAAK;oBACd,IAAI,EAAE,UAAU,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;iBAChC,CAAC;YACJ,CAAC;YACD,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;aAC/B,CAAC;QACJ,CAAC;QACD,KAAK,aAAa;YAChB,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACjE,KAAK,OAAO;YACV,OAAO;gBACL,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;gBAC/B,KAAK,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK;gBAClC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;aAC/B,CAAC;IACN,CAAC;AACH,CAAC"}

package/dist/runtime/pi-calculus/types.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Proceso del π-calculus. Es un AST con etiquetas discriminadas para
+ * facilitar pattern matching exhaustivo en TypeScript.
+ */
+export type PiProcess = {
+    kind: 'nil';
+} | {
+    kind: 'input';
+    channel: string;
+    bind: string;
+    cont: PiProcess;
+} | {
+    kind: 'output';
+    channel: string;
+    value: string;
+    cont: PiProcess;
+} | {
+    kind: 'parallel';
+    left: PiProcess;
+    right: PiProcess;
+} | {
+    kind: 'new';
+    channel: string;
+    body: PiProcess;
+} | {
+    kind: 'replication';
+    body: PiProcess;
+} | {
+    kind: 'choice';
+    left: PiProcess;
+    right: PiProcess;
+} | {
+    kind: 'match';
+    left: string;
+    right: string;
+    cont: PiProcess;
+};
+//# sourceMappingURL=types.d.ts.map

package/dist/runtime/pi-calculus/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/runtime/pi-calculus/types.ts"],"names":[],"mappings":"AAoBA;;;GAGG;AACH,MAAM,MAAM,SAAS,GACjB;IAAE,IAAI,EAAE,KAAK,CAAA;CAAE,GACf;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GACjE;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GACnE;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,SAAS,CAAA;CAAE,GACvD;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GACjD;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GACxC;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,SAAS,CAAA;CAAE,GACrD;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,SAAS,CAAA;CAAE,CAAC"}

package/dist/runtime/pi-calculus/types.js

@@ -0,0 +1,22 @@
+"use strict";
+// ============================================================
+// π-calculus — tipos del álgebra de procesos de Milner.
+// ============================================================
+// Sintaxis (subset estándar monádico):
+//   0                      proceso nulo (nil)
+//   c(x).P                 input: recibe valor por canal c, lo liga a x, sigue P
+//   c̄⟨v⟩.P                output: envía v por canal c, sigue P
+//   P | Q                  composición paralela
+//   (ν c) P                restricción / canal nuevo (scope local)
+//   !P                     replicación (infinitas copias en paralelo)
+//   P + Q                  suma / choice no-determinista
+//   [x = y].P              match: continúa solo si x ≡ y
+//
+// Convenciones de nombres:
+//   - Los "names" son strings; un canal y un valor pueden coincidir
+//     sintácticamente (uniformidad de nombres es la firma del π-calculus).
+//   - Las ligaduras (input y new) pueden requerir α-conversión durante
+//     la sustitución para evitar capturas.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/runtime/pi-calculus/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/runtime/pi-calculus/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wDAAwD;AACxD,+DAA+D;AAC/D,uCAAuC;AACvC,8CAA8C;AAC9C,iFAAiF;AACjF,gEAAgE;AAChE,gDAAgD;AAChD,mEAAmE;AACnE,sEAAsE;AACtE,yDAAyD;AACzD,yDAAyD;AACzD,EAAE;AACF,2BAA2B;AAC3B,oEAAoE;AACpE,2EAA2E;AAC3E,uEAAuE;AACvE,2CAA2C;AAC3C,+DAA+D"}

package/dist/runtime/planning/astar.d.ts

@@ -0,0 +1,10 @@
+import type { AStarOptions, Plan, STRIPSProblem } from './types';
+/**
+ * A* planner. Devuelve plan de menor costo bajo `heuristic` admisible,
+ * o `null` si no hay solución dentro de los límites.
+ *
+ * Default: `goalCountHeuristic` (|goal\state|). Para mejor rendimiento
+ * en problemas no triviales, pasar `makeFFHeuristic(problem)`.
+ */
+export declare function aStarPlan(problem: STRIPSProblem, options?: AStarOptions): Plan | null;
+//# sourceMappingURL=astar.d.ts.map

package/dist/runtime/planning/astar.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"astar.d.ts","sourceRoot":"","sources":["../../../src/runtime/planning/astar.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,YAAY,EAAmB,IAAI,EAAY,aAAa,EAAE,MAAM,SAAS,CAAC;AA6E5F;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,aAAa,EAAE,OAAO,GAAE,YAAiB,GAAG,IAAI,GAAG,IAAI,CA4DzF"}

package/dist/runtime/planning/astar.js

@@ -0,0 +1,155 @@
+"use strict";
+// ============================================================
+// ST Planning — A* Planner (forward search con heurística)
+// ============================================================
+//
+// A* sobre el espacio de estados: f(n) = g(n) + h(n) donde
+//   g(n) = costo acumulado del plan hasta n
+//   h(n) = heurística admisible al goal (default FF)
+//
+// Con h admisible (≤ costo real), A* garantiza el plan de menor
+// COSTO. Con heurística no admisible, sigue funcionando pero pierde
+// la garantía de óptimo (suele ser más rápido).
+//
+// Implementación de la priority queue: binary heap sobre `f`. Para
+// problemas reales (b ~ 5, d ~ 30) basta — no necesitamos Fibonacci.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.aStarPlan = aStarPlan;
+const ground_1 = require("./ground");
+const bfs_1 = require("./bfs");
+const heuristic_1 = require("./heuristic");
+// ── Min-heap por f ─────────────────────────────────────────────
+//
+// Implementación clásica con array indexado en 0. Comparador estable
+// usando un contador de inserción como tiebreaker (FIFO entre nodos
+// con mismo f; ayuda a reproducibilidad).
+class MinHeap {
+    items = [];
+    seqCounter = 0;
+    size() {
+        return this.items.length;
+    }
+    push(node) {
+        this.items.push({ node, seq: this.seqCounter++ });
+        this.bubbleUp(this.items.length - 1);
+    }
+    pop() {
+        if (this.items.length === 0)
+            return undefined;
+        const top = this.items[0];
+        const last = this.items.pop();
+        if (this.items.length > 0) {
+            this.items[0] = last;
+            this.bubbleDown(0);
+        }
+        return top.node;
+    }
+    less(a, b) {
+        const ia = this.items[a];
+        const ib = this.items[b];
+        if (ia.node.f !== ib.node.f)
+            return ia.node.f < ib.node.f;
+        return ia.seq < ib.seq;
+    }
+    swap(a, b) {
+        const tmp = this.items[a];
+        this.items[a] = this.items[b];
+        this.items[b] = tmp;
+    }
+    bubbleUp(i) {
+        while (i > 0) {
+            const parent = Math.floor((i - 1) / 2);
+            if (this.less(i, parent)) {
+                this.swap(i, parent);
+                i = parent;
+            }
+            else
+                break;
+        }
+    }
+    bubbleDown(i) {
+        const n = this.items.length;
+        while (true) {
+            const l = i * 2 + 1;
+            const r = i * 2 + 2;
+            let best = i;
+            if (l < n && this.less(l, best))
+                best = l;
+            if (r < n && this.less(r, best))
+                best = r;
+            if (best === i)
+                break;
+            this.swap(i, best);
+            i = best;
+        }
+    }
+}
+/**
+ * A* planner. Devuelve plan de menor costo bajo `heuristic` admisible,
+ * o `null` si no hay solución dentro de los límites.
+ *
+ * Default: `goalCountHeuristic` (|goal\state|). Para mejor rendimiento
+ * en problemas no triviales, pasar `makeFFHeuristic(problem)`.
+ */
+function aStarPlan(problem, options = {}) {
+    const heuristic = options.heuristic ?? heuristic_1.goalCountHeuristic;
+    const maxDepth = options.maxDepth ?? 200;
+    const maxNodes = options.maxNodes ?? 100_000;
+    const cost = options.costFunction ?? (() => 1);
+    if ((0, ground_1.goalSatisfied)(problem.initialState, problem.goal)) {
+        return { actions: [], length: 0, cost: 0 };
+    }
+    const groundedByAction = problem.actions.map((a) => ({
+        schema: a,
+        instances: (0, ground_1.groundAll)(a, problem.objects),
+    }));
+    const heap = new MinHeap();
+    const initialH = heuristic(problem.initialState, problem.goal);
+    heap.push({ state: problem.initialState, plan: [], g: 0, f: initialH });
+    // gScore[hash] = mejor g conocido para ese estado. Permite reabrir
+    // si encontramos camino mejor (closed list optimista).
+    const gScore = new Map();
+    gScore.set((0, bfs_1.hashState)(problem.initialState), 0);
+    let expanded = 0;
+    while (heap.size() > 0) {
+        const node = heap.pop();
+        const hash = (0, bfs_1.hashState)(node.state);
+        // Si hay un g mejor registrado, este nodo es stale; skip.
+        const known = gScore.get(hash);
+        if (known !== undefined && node.g > known)
+            continue;
+        if ((0, ground_1.goalSatisfied)(node.state, problem.goal)) {
+            return { actions: node.plan, length: node.plan.length, cost: node.g };
+        }
+        if (node.plan.length >= maxDepth)
+            continue;
+        if (expanded >= maxNodes)
+            return null;
+        expanded++;
+        for (const { schema, instances } of groundedByAction) {
+            for (const { bindings, grounded } of instances) {
+                if (!(0, ground_1.preconditionsSatisfied)(node.state, grounded.preconditions))
+                    continue;
+                const next = (0, ground_1.applyAction)(node.state, grounded);
+                const step = { action: schema, bindings };
+                const tentativeG = node.g + cost(step);
+                const nextHash = (0, bfs_1.hashState)(next);
+                const prevG = gScore.get(nextHash);
+                if (prevG !== undefined && tentativeG >= prevG)
+                    continue;
+                gScore.set(nextHash, tentativeG);
+                const h = heuristic(next, problem.goal);
+                if (!Number.isFinite(h))
+                    continue; // dead end relajado
+                heap.push({
+                    state: next,
+                    plan: [...node.plan, step],
+                    g: tentativeG,
+                    f: tentativeG + h,
+                });
+            }
+        }
+    }
+    return null;
+}
+//# sourceMappingURL=astar.js.map

package/dist/runtime/planning/astar.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"astar.js","sourceRoot":"","sources":["../../../src/runtime/planning/astar.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2DAA2D;AAC3D,+DAA+D;AAC/D,EAAE;AACF,2DAA2D;AAC3D,4CAA4C;AAC5C,qDAAqD;AACrD,EAAE;AACF,gEAAgE;AAChE,oEAAoE;AACpE,gDAAgD;AAChD,EAAE;AACF,mEAAmE;AACnE,qEAAqE;;AAyFrE,8BA4DC;AAnJD,qCAAyF;AACzF,+BAAkC;AAClC,2CAAiD;AAUjD,kEAAkE;AAClE,EAAE;AACF,qEAAqE;AACrE,oEAAoE;AACpE,0CAA0C;AAE1C,MAAM,OAAO;IACH,KAAK,GAA4C,EAAE,CAAC;IACpD,UAAU,GAAG,CAAC,CAAC;IAEvB,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,IAAI,CAAC,IAAe;QAClB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QAClD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAqC,CAAC;QAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAsC,CAAC;QAClE,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC,IAAI,CAAC;IAClB,CAAC;IAEO,IAAI,CAAC,CAAS,EAAE,CAAS;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAqC,CAAC;QAC7D,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAqC,CAAC;QAC7D,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1D,OAAO,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC;IACzB,CAAC;IAEO,IAAI,CAAC,CAAS,EAAE,CAAS;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAqC,CAAC;QAC9D,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAqC,CAAC;QAClE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACtB,CAAC;IAEO,QAAQ,CAAC,CAAS;QACxB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC;gBACzB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;gBACrB,CAAC,GAAG,MAAM,CAAC;YACb,CAAC;;gBAAM,MAAM;QACf,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,CAAS;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC5B,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC;gBAAE,IAAI,GAAG,CAAC,CAAC;YAC1C,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC;gBAAE,IAAI,GAAG,CAAC,CAAC;YAC1C,IAAI,IAAI,KAAK,CAAC;gBAAE,MAAM;YACtB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACnB,CAAC,GAAG,IAAI,CAAC;QACX,CAAC;IACH,CAAC;CACF;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CAAC,OAAsB,EAAE,UAAwB,EAAE;IAC1E,MAAM,SAAS,GAAc,OAAO,CAAC,SAAS,IAAI,8BAAkB,CAAC;IACrE,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAC;IACzC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC;IAC7C,MAAM,IAAI,GAAG,OAAO,CAAC,YAAY,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAE/C,IAAI,IAAA,sBAAa,EAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACtD,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IAC7C,CAAC;IAED,MAAM,gBAAgB,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnD,MAAM,EAAE,CAAC;QACT,SAAS,EAAE,IAAA,kBAAS,EAAC,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC;KACzC,CAAC,CAAC,CAAC;IAEJ,MAAM,IAAI,GAAG,IAAI,OAAO,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/D,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,YAAY,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;IACxE,mEAAmE;IACnE,uDAAuD;IACvD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,CAAC,GAAG,CAAC,IAAA,eAAS,EAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,OAAO,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAe,CAAC;QACrC,MAAM,IAAI,GAAG,IAAA,eAAS,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,0DAA0D;QAC1D,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,CAAC,GAAG,KAAK;YAAE,SAAS;QACpD,IAAI,IAAA,sBAAa,EAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5C,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;QACxE,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,QAAQ;YAAE,SAAS;QAC3C,IAAI,QAAQ,IAAI,QAAQ;YAAE,OAAO,IAAI,CAAC;QACtC,QAAQ,EAAE,CAAC;QAEX,KAAK,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,gBAAgB,EAAE,CAAC;YACrD,KAAK,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC/C,IAAI,CAAC,IAAA,+BAAsB,EAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,aAAa,CAAC;oBAAE,SAAS;gBAC1E,MAAM,IAAI,GAAG,IAAA,oBAAW,EAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAC/C,MAAM,IAAI,GAAa,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;gBACpD,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvC,MAAM,QAAQ,GAAG,IAAA,eAAS,EAAC,IAAI,CAAC,CAAC;gBACjC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACnC,IAAI,KAAK,KAAK,SAAS,IAAI,UAAU,IAAI,KAAK;oBAAE,SAAS;gBACzD,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;gBACjC,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;gBACxC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,SAAS,CAAC,oBAAoB;gBACvD,IAAI,CAAC,IAAI,CAAC;oBACR,KAAK,EAAE,IAAI;oBACX,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;oBAC1B,CAAC,EAAE,UAAU;oBACb,CAAC,EAAE,UAAU,GAAG,CAAC;iBAClB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/runtime/planning/bfs.d.ts

@@ -0,0 +1,17 @@
+import type { Fact, Plan, PlannerOptions, STRIPSProblem } from './types';
+/**
+ * Hash canónico de un estado: orden lex de los hechos y join. Es
+ * O(n log n) pero los estados de planning suelen ser chicos.
+ */
+export declare function hashState(state: Set<Fact>): string;
+/**
+ * BFS planner. Devuelve plan de menor longitud, o `null` si no hay
+ * solución dentro de los límites.
+ *
+ * Complejidad: O(b^d) donde b = factor de rama (acciones ground
+ * aplicables) y d = profundidad. Para problemas reales sin podas se
+ * vuelve inviable rápido — usar `aStarPlan` con FF heuristic para
+ * dominios no triviales.
+ */
+export declare function bfsPlan(problem: STRIPSProblem, options?: PlannerOptions): Plan | null;
+//# sourceMappingURL=bfs.d.ts.map

package/dist/runtime/planning/bfs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bfs.d.ts","sourceRoot":"","sources":["../../../src/runtime/planning/bfs.ts"],"names":[],"mappings":"AAkBA,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAY,cAAc,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAEnF;;;GAGG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAIlD;AAED;;;;;;;;GAQG;AACH,wBAAgB,OAAO,CAAC,OAAO,EAAE,aAAa,EAAE,OAAO,GAAE,cAAmB,GAAG,IAAI,GAAG,IAAI,CAsDzF"}

package/dist/runtime/planning/bfs.js

@@ -0,0 +1,87 @@
+"use strict";
+// ============================================================
+// ST Planning — BFS Planner (forward search)
+// ============================================================
+//
+// Búsqueda forward en anchura desde el initialState. Garantiza el
+// plan de MENOR longitud (≠ menor costo si hay costos no uniformes;
+// para costos pesados usá `aStarPlan`).
+//
+// Esquema:
+//   1. Frontera = cola con (state, planSoFar).
+//   2. Visitados = set de hashes canónicos de estado (para no
+//      re-expandir el mismo estado).
+//   3. Pop, chequear goal, si no → expandir todas las acciones
+//      aplicables (con preconditions ⊆ state) y agregar nuevos
+//      estados a la frontera.
+//   4. Cortar por `maxDepth` y `maxNodes`.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.hashState = hashState;
+exports.bfsPlan = bfsPlan;
+const ground_1 = require("./ground");
+/**
+ * Hash canónico de un estado: orden lex de los hechos y join. Es
+ * O(n log n) pero los estados de planning suelen ser chicos.
+ */
+function hashState(state) {
+    const arr = Array.from(state);
+    arr.sort();
+    return arr.join('
'); // separador improbable en facts user-supplied
+}
+/**
+ * BFS planner. Devuelve plan de menor longitud, o `null` si no hay
+ * solución dentro de los límites.
+ *
+ * Complejidad: O(b^d) donde b = factor de rama (acciones ground
+ * aplicables) y d = profundidad. Para problemas reales sin podas se
+ * vuelve inviable rápido — usar `aStarPlan` con FF heuristic para
+ * dominios no triviales.
+ */
+function bfsPlan(problem, options = {}) {
+    const maxDepth = options.maxDepth ?? 50;
+    const maxNodes = options.maxNodes ?? 100_000;
+    const cost = options.costFunction ?? (() => 1);
+    // Caso degenerado: goal ya satisfecho en S₀.
+    if ((0, ground_1.goalSatisfied)(problem.initialState, problem.goal)) {
+        return { actions: [], length: 0, cost: 0 };
+    }
+    // Pre-grounding: pre-computamos todas las acciones ground para cada
+    // schema. Para problemas con muchos objetos esto puede ser caro pero
+    // permite expandir sucesores en O(|ground|·|state|).
+    const groundedByAction = problem.actions.map((a) => ({
+        schema: a,
+        instances: (0, ground_1.groundAll)(a, problem.objects),
+    }));
+    const queue = [{ state: problem.initialState, plan: [], cost: 0 }];
+    const visited = new Set();
+    visited.add(hashState(problem.initialState));
+    let expanded = 0;
+    while (queue.length > 0) {
+        const node = queue.shift();
+        if (node.plan.length >= maxDepth)
+            continue;
+        if (expanded >= maxNodes)
+            return null;
+        expanded++;
+        for (const { schema, instances } of groundedByAction) {
+            for (const { bindings, grounded } of instances) {
+                if (!(0, ground_1.preconditionsSatisfied)(node.state, grounded.preconditions))
+                    continue;
+                const next = (0, ground_1.applyAction)(node.state, grounded);
+                const h = hashState(next);
+                if (visited.has(h))
+                    continue;
+                visited.add(h);
+                const step = { action: schema, bindings };
+                const nextPlan = [...node.plan, step];
+                const nextCost = node.cost + cost(step);
+                if ((0, ground_1.goalSatisfied)(next, problem.goal)) {
+                    return { actions: nextPlan, length: nextPlan.length, cost: nextCost };
+                }
+                queue.push({ state: next, plan: nextPlan, cost: nextCost });
+            }
+        }
+    }
+    return null;
+}
+//# sourceMappingURL=bfs.js.map

package/dist/runtime/planning/bfs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bfs.js","sourceRoot":"","sources":["../../../src/runtime/planning/bfs.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6CAA6C;AAC7C,+DAA+D;AAC/D,EAAE;AACF,kEAAkE;AAClE,oEAAoE;AACpE,wCAAwC;AACxC,EAAE;AACF,WAAW;AACX,+CAA+C;AAC/C,8DAA8D;AAC9D,qCAAqC;AACrC,+DAA+D;AAC/D,+DAA+D;AAC/D,8BAA8B;AAC9B,2CAA2C;;AAS3C,8BAIC;AAWD,0BAsDC;AA5ED,qCAAyF;AAGzF;;;GAGG;AACH,SAAgB,SAAS,CAAC,KAAgB;IACxC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,GAAG,CAAC,IAAI,EAAE,CAAC;IACX,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,8CAA8C;AACtE,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,OAAO,CAAC,OAAsB,EAAE,UAA0B,EAAE;IAC1E,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC;IACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC;IAC7C,MAAM,IAAI,GAAG,OAAO,CAAC,YAAY,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAE/C,6CAA6C;IAC7C,IAAI,IAAA,sBAAa,EAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACtD,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IAC7C,CAAC;IAED,oEAAoE;IACpE,qEAAqE;IACrE,qDAAqD;IACrD,MAAM,gBAAgB,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnD,MAAM,EAAE,CAAC;QACT,SAAS,EAAE,IAAA,kBAAS,EAAC,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC;KACzC,CAAC,CAAC,CAAC;IAQJ,MAAM,KAAK,GAAgB,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,YAAY,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IAChF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC;IAC7C,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAe,CAAC;QACxC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,QAAQ;YAAE,SAAS;QAC3C,IAAI,QAAQ,IAAI,QAAQ;YAAE,OAAO,IAAI,CAAC;QACtC,QAAQ,EAAE,CAAC;QAEX,KAAK,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,gBAAgB,EAAE,CAAC;YACrD,KAAK,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC/C,IAAI,CAAC,IAAA,+BAAsB,EAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,aAAa,CAAC;oBAAE,SAAS;gBAC1E,MAAM,IAAI,GAAG,IAAA,oBAAW,EAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAC/C,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;gBAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC7B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACf,MAAM,IAAI,GAAa,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;gBACpD,MAAM,QAAQ,GAAe,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxC,IAAI,IAAA,sBAAa,EAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBACtC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;gBACxE,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/runtime/planning/ground.d.ts

@@ -0,0 +1,55 @@
+import type { Fact, GroundedAction, STRIPSAction } from './types';
+/**
+ * Sustituye variables `?var` por sus valores ligados en una cadena.
+ * Si la variable no está en bindings, se deja como está (permite
+ * grounding parcial / debugging).
+ */
+export declare function substituteVars(text: string, bindings: Record<string, string>): string;
+/**
+ * Aplica un binding a un schema y devuelve una acción ground.
+ *
+ * No valida que el binding cubra todos los parámetros: lo que falte
+ * queda con `?var` en el string (caller's responsibility validar).
+ */
+export declare function ground(action: STRIPSAction, bindings: Record<string, string>): GroundedAction;
+/**
+ * Aplica una acción ground a un estado, devolviendo un nuevo estado.
+ *
+ * Convención STRIPS estándar: primero se borran los hechos en delList,
+ * luego se añaden los de addList. Si un hecho está en ambos, el
+ * resultado neto es "añadido" (delete antes que add).
+ *
+ * NO valida preconditions — esa verificación se hace en el planner
+ * antes de invocar applyAction. (Permite usarlo para forward search
+ * sin redundancia.)
+ */
+export declare function applyAction(state: Set<Fact>, grounded: {
+    addList: Set<Fact>;
+    delList: Set<Fact>;
+}): Set<Fact>;
+/**
+ * Chequea si un estado satisface las preconditions de una acción
+ * ground (todas presentes).
+ */
+export declare function preconditionsSatisfied(state: Set<Fact>, preconditions: Set<Fact>): boolean;
+/**
+ * Chequea si un estado satisface el goal (goal ⊆ state).
+ */
+export declare function goalSatisfied(state: Set<Fact>, goal: Set<Fact>): boolean;
+/**
+ * Enumera el producto cartesiano de objetos para los parámetros de
+ * una acción y devuelve TODAS las acciones ground posibles.
+ *
+ * Si el dominio tiene tipos en `objects`, por simplicidad enumeramos
+ * sobre `flatObjects = union(values of objects)`. Quien necesite
+ * tipos más finos puede pre-filtrar las acciones ground devueltas.
+ *
+ * Para |params|=2 con |objs|=10 → 100 acciones ground por schema. Es
+ * fácil que esto explote, así que el planner aplica `preconditionsSatisfied`
+ * como filtro early y typically la mayoría se podan.
+ */
+export declare function groundAll(action: STRIPSAction, objects: Record<string, string[]>): Array<{
+    bindings: Record<string, string>;
+    grounded: GroundedAction;
+}>;
+//# sourceMappingURL=ground.d.ts.map

package/dist/runtime/planning/ground.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ground.d.ts","sourceRoot":"","sources":["../../../src/runtime/planning/ground.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,IAAI,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAElE;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CASrF;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,cAAc,CAQ7F;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,EAChB,QAAQ,EAAE;IAAE,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;CAAE,GACnD,GAAG,CAAC,IAAI,CAAC,CAKX;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAK1F;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAKxE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CACvB,MAAM,EAAE,YAAY,EACpB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAChC,KAAK,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAAC,QAAQ,EAAE,cAAc,CAAA;CAAE,CAAC,CA+CvE"}