kibi-cli 2.31.1 → 2.35.1

package/dist/operations/proof/receipt-compaction.js

@@ -72,8 +72,12 @@ export function compactProofReceipts(receipts, anchor) {
     add(newest(receipts, all));
     add(newest(receipts, all.filter((index) => receipts[index]?.outcome === "passed")));
     const selectors = [];
-    if (anchor.bindingHash !== undefined && anchor.bindingHash !== "") {
-        const bindingHash = anchor.bindingHash;
+    for (const bindingHash of [
+        anchor.bindingHash,
+        ...(anchor.legacyBindingHashes ?? []),
+    ]) {
+        if (bindingHash === undefined || bindingHash === "")
+            continue;
         selectors.push((receipt) => receipt.binding_hash === bindingHash);
     }
     if (anchor.codeSnapshot !== undefined && anchor.codeSnapshot !== "") {

package/dist/operations/proof/regular-language.d.ts

@@ -0,0 +1,89 @@
+/**
+ * Exact decisions about the languages of regular expressions, for the regex
+ * proof kind. A pattern is parsed into a regular expression over UTF-16 code
+ * units, compiled to an NFA, and compared with another by exploring the
+ * product of their lazily determinized automata. Every answer is a decision,
+ * not a sample: two patterns are equivalent only when no string tells them
+ * apart, and a "no" comes with the shortest string that does.
+ *
+ * Only the regular part of the syntax is accepted. Backreferences,
+ * lookaround, word boundaries, inline flags, Unicode property escapes and the
+ * stateful or line-based flags (g, y, m, v; Python MULTILINE, VERBOSE,
+ * LOCALE) are refused with a reason, so a pattern Kibi cannot model exactly
+ * never earns an answer.
+ *
+ * Strings are well-formed UTF-16 text: every string Kibi compares is a
+ * sequence of Unicode scalar values (no lone surrogates). A JavaScript
+ * pattern without the u flag still works on code units, so it may match half
+ * of a surrogate pair inside such a string, and that is modeled.
+ */
+/** Which engine's syntax and semantics a pattern follows. */
+export type RegexFlavor = "js" | "python";
+/** How a pattern is applied to a string. */
+export type MatchMode = 
+/** RegExp.prototype.test and Python re.search: a match anywhere counts. */
+"search"
+/** The whole string must match (a fact's pattern). */
+ | "full";
+/** A pattern as a language: its source, flags, flavor and how it is applied. */
+export type PatternSpec = Readonly<{
+    source: string;
+    flags?: string;
+    flavor: RegexFlavor;
+    mode: MatchMode;
+}>;
+/** A language Kibi can compare: a pattern, or exactly one string. */
+export type LanguageSpec = (PatternSpec & {
+    type: "pattern";
+}) | Readonly<{
+    type: "literal";
+    value: string;
+}>;
+type Interval = readonly [number, number];
+type Ranges = Interval[];
+/** A pattern Kibi refuses to model; the message says why. */
+export declare class UnsupportedPattern extends Error {
+}
+type Edge = Readonly<{
+    type: "eps";
+    to: number;
+}> | Readonly<{
+    type: "units";
+    ranges: Ranges;
+    to: number;
+}> | Readonly<{
+    type: "assert";
+    kind: "bol" | "eol" | "eolnl";
+    to: number;
+}>;
+declare class Nfa {
+    readonly edges: Edge[][];
+    state(): number;
+    add(from: number, edge: Edge): void;
+}
+type Compiled = Readonly<{
+    nfa: Nfa;
+    start: number;
+    accept: number;
+    mode: MatchMode;
+}>;
+/** Compile a language to an NFA over UTF-16 code units, or refuse it. */
+export declare function compileLanguage(spec: LanguageSpec): Compiled;
+/** What Kibi decided about two languages. */
+export type LanguageDecision = Readonly<{
+    holds: true;
+}> | Readonly<{
+    holds: false;
+    witness: string;
+    reason: string;
+}>;
+/** Whether two languages hold exactly the same strings. */
+export declare function languagesEqual(left: LanguageSpec, right: LanguageSpec): LanguageDecision;
+/** Whether no string is in both languages. */
+export declare function languagesDisjoint(left: LanguageSpec, right: LanguageSpec): LanguageDecision;
+/** Whether every string of `left` is in `right`. */
+export declare function languageIncluded(left: LanguageSpec, right: LanguageSpec): LanguageDecision;
+/** Whether a language holds `text` (a well-formed string). */
+export declare function languageAccepts(spec: LanguageSpec, text: string): boolean;
+export {};
+//# sourceMappingURL=regular-language.d.ts.map

package/dist/operations/proof/regular-language.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"regular-language.d.ts","sourceRoot":"","sources":["../../../src/operations/proof/regular-language.ts"],"names":[],"mappings":"AAkBA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,6DAA6D;AAE7D,MAAM,MAAM,WAAW,GAAG,IAAI,GAAG,QAAQ,CAAC;AAE1C,4CAA4C;AAE5C,MAAM,MAAM,SAAS;AACnB,2EAA2E;AACzE,QAAQ;AACV,sDAAsD;GACpD,MAAM,CAAC;AAEX,gFAAgF;AAEhF,MAAM,MAAM,WAAW,GAAG,QAAQ,CAAC;IACjC,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,WAAW,CAAC;IACpB,IAAI,EAAE,SAAS,CAAC;CACjB,CAAC,CAAC;AAEH,qEAAqE;AAErE,MAAM,MAAM,YAAY,GACpB,CAAC,WAAW,GAAG;IAAE,IAAI,EAAE,SAAS,CAAA;CAAE,CAAC,GACnC,QAAQ,CAAC;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC;AAEjD,KAAK,QAAQ,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAC1C,KAAK,MAAM,GAAG,QAAQ,EAAE,CAAC;AAOzB,6DAA6D;AAC7D,qBAAa,kBAAmB,SAAQ,KAAK;CAAG;AAmjBhD,KAAK,IAAI,GACL,QAAQ,CAAC;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,GACrC,QAAQ,CAAC;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,GACvD,QAAQ,CAAC;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,KAAK,GAAG,KAAK,GAAG,OAAO,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC;AAE5E,cAAM,GAAG;IACP,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAM;IAE9B,KAAK,IAAI,MAAM;IASf,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI;CAGpC;AA+FD,KAAK,QAAQ,GAAG,QAAQ,CAAC;IACvB,GAAG,EAAE,GAAG,CAAC;IACT,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,SAAS,CAAC;CACjB,CAAC,CAAC;AAEH,yEAAyE;AAEzE,wBAAgB,eAAe,CAAC,IAAI,EAAE,YAAY,GAAG,QAAQ,CAmB5D;AA2LD,6CAA6C;AAE7C,MAAM,MAAM,gBAAgB,GACxB,QAAQ,CAAC;IAAE,KAAK,EAAE,IAAI,CAAA;CAAE,CAAC,GACzB,QAAQ,CAAC;IAAE,KAAK,EAAE,KAAK,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC;AAoDhE,2DAA2D;AAE3D,wBAAgB,cAAc,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,gBAAgB,CAExF;AAED,8CAA8C;AAE9C,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,gBAAgB,CAE3F;AAED,oDAAoD;AAEpD,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,gBAAgB,CAE1F;AAED,8DAA8D;AAE9D,wBAAgB,eAAe,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAMzE"}