tla-ts 0.0.4-dev.a297123 → 0.0.4-dev.e92649a

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (311) hide show
  1. package/README.md +26 -141
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +35 -1
  6. package/dist/index.d.ts +35 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +515 -0
  15. package/dist/prove.js +515 -0
  16. package/dist/run-cli.cjs +30 -47
  17. package/dist/run-cli.js +30 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/check.ts +1 -0
  26. package/src/codegen.ts +5 -3
  27. package/src/errors.ts +86 -0
  28. package/src/evaluate.ts +54 -19
  29. package/src/index.ts +10 -0
  30. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  31. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  32. package/src/obligations/ctx.ts +64 -0
  33. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  34. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  35. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  36. package/src/{obligations.ts → obligations/index.ts} +26 -12
  37. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  38. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  39. package/src/obligations/pickle.ts +100 -0
  40. package/src/obligations/pragma.ts +189 -0
  41. package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
  42. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  43. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  44. package/src/obligations/temporal.ts +319 -0
  45. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  46. package/src/parallel-worker.ts +2 -18
  47. package/src/parallel.ts +10 -43
  48. package/src/prove/decide-pool.ts +100 -0
  49. package/src/prove/deciders.ts +27 -0
  50. package/src/prove/isabelle/LICENSE +36 -0
  51. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  52. package/src/prove/isabelle/decide.ts +47 -0
  53. package/src/prove/isabelle/encode.ts +477 -0
  54. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  55. package/src/prove/isabelle/isar/method.ts +367 -0
  56. package/src/prove/isabelle/isar/proof.ts +28 -0
  57. package/src/prove/isabelle/isar/statement.ts +57 -0
  58. package/src/prove/isabelle/isar/theory.ts +192 -0
  59. package/src/prove/isabelle/isar/type-check.ts +278 -0
  60. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  61. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  62. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  63. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  64. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  65. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  66. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  67. package/src/prove/isabelle/provers/classical.ts +389 -0
  68. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  69. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  70. package/src/prove/isabelle/pure/consts.ts +32 -0
  71. package/src/prove/isabelle/pure/conv.ts +79 -0
  72. package/src/prove/isabelle/pure/drule.ts +264 -0
  73. package/src/prove/isabelle/pure/envir.ts +363 -0
  74. package/src/prove/isabelle/pure/goal.ts +53 -0
  75. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  76. package/src/prove/isabelle/pure/list.ts +12 -0
  77. package/src/prove/isabelle/pure/logic.ts +402 -0
  78. package/src/prove/isabelle/pure/name.ts +110 -0
  79. package/src/prove/isabelle/pure/net.ts +262 -0
  80. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  81. package/src/prove/isabelle/pure/pattern.ts +650 -0
  82. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  83. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  84. package/src/prove/isabelle/pure/search.ts +68 -0
  85. package/src/prove/isabelle/pure/seq.ts +156 -0
  86. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  87. package/src/prove/isabelle/pure/table.ts +208 -0
  88. package/src/prove/isabelle/pure/tactic.ts +276 -0
  89. package/src/prove/isabelle/pure/tactical.ts +347 -0
  90. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  91. package/src/prove/isabelle/pure/term.ts +808 -0
  92. package/src/prove/isabelle/pure/thm.ts +806 -0
  93. package/src/prove/isabelle/pure/type.ts +133 -0
  94. package/src/prove/isabelle/pure/unify.ts +753 -0
  95. package/src/prove/isabelle/pure/variable.ts +25 -0
  96. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  97. package/src/prove/isabelle/tla/context.ts +74 -0
  98. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  99. package/src/prove/isabelle/tla/logic.ts +215 -0
  100. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  101. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  102. package/src/prove/ocaml.ts +22 -0
  103. package/src/prove/prep/action.ts +520 -0
  104. package/src/prove/prep/defs.ts +27 -0
  105. package/src/prove/prep/elab.ts +156 -0
  106. package/src/prove/prep/enabled-axioms.ts +189 -0
  107. package/src/prove/prep/enabled.ts +43 -0
  108. package/src/prove/prep/fingerprint.ts +388 -0
  109. package/src/prove/prep/flatten.ts +70 -0
  110. package/src/prove/prep/level-comparison.ts +552 -0
  111. package/src/prove/prep/md5.ts +67 -0
  112. package/src/prove/prep/pragma.ts +221 -0
  113. package/src/prove/prep/trivial.ts +22 -0
  114. package/src/prove/prove-worker.ts +29 -0
  115. package/src/prove/prove.ts +417 -0
  116. package/src/prove/ptl/decide.ts +68 -0
  117. package/src/prove/ptl/encode.ts +256 -0
  118. package/src/prove/ptl/sat.ts +151 -0
  119. package/src/prove/ptl/tableau.ts +276 -0
  120. package/src/prove/smt/axiomatize.ts +69 -0
  121. package/src/prove/smt/axioms.ts +210 -0
  122. package/src/prove/smt/context.ts +108 -0
  123. package/src/prove/smt/data.ts +665 -0
  124. package/src/prove/smt/encode.ts +169 -0
  125. package/src/prove/smt/extensionality.ts +63 -0
  126. package/src/prove/smt/flatten.ts +127 -0
  127. package/src/prove/smt/format.ts +143 -0
  128. package/src/prove/smt/instances.ts +182 -0
  129. package/src/prove/smt/rewrite.ts +784 -0
  130. package/src/prove/smt/simplify.ts +57 -0
  131. package/src/prove/smt/solver/act-cache.ts +265 -0
  132. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  133. package/src/prove/smt/solver/array.ts +22 -0
  134. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  135. package/src/prove/smt/solver/ast-lt.ts +157 -0
  136. package/src/prove/smt/solver/ast-util.ts +147 -0
  137. package/src/prove/smt/solver/ast.ts +1315 -0
  138. package/src/prove/smt/solver/auf-solver.ts +572 -0
  139. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  140. package/src/prove/smt/solver/cg-table.ts +175 -0
  141. package/src/prove/smt/solver/clause.ts +276 -0
  142. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  143. package/src/prove/smt/solver/context.ts +1292 -0
  144. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  145. package/src/prove/smt/solver/der.ts +224 -0
  146. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  147. package/src/prove/smt/solver/e-matching.ts +659 -0
  148. package/src/prove/smt/solver/enode.ts +259 -0
  149. package/src/prove/smt/solver/expr-ref.ts +21 -0
  150. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  151. package/src/prove/smt/solver/fingerprints.ts +92 -0
  152. package/src/prove/smt/solver/flat-literals.ts +51 -0
  153. package/src/prove/smt/solver/goal.ts +138 -0
  154. package/src/prove/smt/solver/hash.ts +173 -0
  155. package/src/prove/smt/solver/hashtable.ts +166 -0
  156. package/src/prove/smt/solver/internalizer.ts +1381 -0
  157. package/src/prove/smt/solver/lbool.ts +5 -0
  158. package/src/prove/smt/solver/literal.ts +24 -0
  159. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  160. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  161. package/src/prove/smt/solver/lp/containers.ts +296 -0
  162. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  163. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  164. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  165. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  166. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  167. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  168. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  169. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  170. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  171. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  172. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  173. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  174. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  175. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  176. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  177. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  178. package/src/prove/smt/solver/lp/nex.ts +120 -0
  179. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  180. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  181. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  182. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  183. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  184. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  185. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  186. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  187. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  188. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  189. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  190. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  191. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  192. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  193. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  194. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  195. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  196. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  197. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  198. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  199. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  200. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  201. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  202. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  203. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  204. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  205. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  206. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  207. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  208. package/src/prove/smt/solver/model-checker.ts +347 -0
  209. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  210. package/src/prove/smt/solver/model-finder.ts +155 -0
  211. package/src/prove/smt/solver/model-generator.ts +97 -0
  212. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  213. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  214. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  215. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  216. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  217. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  218. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  219. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  220. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  221. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  222. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  223. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  224. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  225. package/src/prove/smt/solver/nnf.ts +469 -0
  226. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  227. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  228. package/src/prove/smt/solver/propagate-values.ts +83 -0
  229. package/src/prove/smt/solver/proto-model.ts +551 -0
  230. package/src/prove/smt/solver/pull-quant.ts +139 -0
  231. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  232. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  233. package/src/prove/smt/solver/qe-lite.ts +381 -0
  234. package/src/prove/smt/solver/qi-queue.ts +362 -0
  235. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  236. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  237. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  238. package/src/prove/smt/solver/random-gen.ts +10 -0
  239. package/src/prove/smt/solver/rational.ts +165 -0
  240. package/src/prove/smt/solver/ref-vector.ts +62 -0
  241. package/src/prove/smt/solver/relevancy.ts +247 -0
  242. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  243. package/src/prove/smt/solver/rewriter.ts +843 -0
  244. package/src/prove/smt/solver/rlimit.ts +79 -0
  245. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  246. package/src/prove/smt/solver/solver.ts +71 -0
  247. package/src/prove/smt/solver/sort.ts +35 -0
  248. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  249. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  250. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  251. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  252. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  253. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  254. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  255. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  256. package/src/prove/smt/solver/theory-lra.ts +56 -0
  257. package/src/prove/smt/solver/var-subst.ts +258 -0
  258. package/src/prove/smt/solver/z3-license.txt +10 -0
  259. package/src/prove/smt/table.ts +170 -0
  260. package/src/prove/tlapm/tlapm.ts +96 -0
  261. package/src/prove/tlaps-module.ts +510 -0
  262. package/src/prove/verdict.ts +13 -0
  263. package/src/prove/zenon/LICENSE +32 -0
  264. package/src/prove/zenon/check/check.ts +105 -0
  265. package/src/prove/zenon/check/definitions.ts +144 -0
  266. package/src/prove/zenon/check/equality.ts +182 -0
  267. package/src/prove/zenon/check/functions.ts +62 -0
  268. package/src/prove/zenon/check/keys.ts +125 -0
  269. package/src/prove/zenon/check/propositional.ts +104 -0
  270. package/src/prove/zenon/check/records.ts +188 -0
  271. package/src/prove/zenon/check/relations.ts +121 -0
  272. package/src/prove/zenon/check/rewrites.ts +224 -0
  273. package/src/prove/zenon/check/sets.ts +302 -0
  274. package/src/prove/zenon/check/terms.ts +127 -0
  275. package/src/prove/zenon/check/tla.ts +126 -0
  276. package/src/prove/zenon/decide.ts +113 -0
  277. package/src/prove/zenon/encode.ts +444 -0
  278. package/src/prove/zenon/eqrel.ts +300 -0
  279. package/src/prove/zenon/equality-rules.ts +435 -0
  280. package/src/prove/zenon/expr.ts +551 -0
  281. package/src/prove/zenon/index-table.ts +350 -0
  282. package/src/prove/zenon/isar-case.ts +513 -0
  283. package/src/prove/zenon/isar.ts +1249 -0
  284. package/src/prove/zenon/limits.ts +15 -0
  285. package/src/prove/zenon/llproof.ts +173 -0
  286. package/src/prove/zenon/mltoll.ts +1566 -0
  287. package/src/prove/zenon/node.ts +297 -0
  288. package/src/prove/zenon/ocaml.ts +169 -0
  289. package/src/prove/zenon/parse.ts +247 -0
  290. package/src/prove/zenon/phrase.ts +191 -0
  291. package/src/prove/zenon/proof.ts +198 -0
  292. package/src/prove/zenon/propositional-rules.ts +387 -0
  293. package/src/prove/zenon/rules.ts +94 -0
  294. package/src/prove/zenon/search.ts +288 -0
  295. package/src/prove/zenon/tla/functions.ts +151 -0
  296. package/src/prove/zenon/tla/llproof.ts +480 -0
  297. package/src/prove/zenon/tla/records.ts +225 -0
  298. package/src/prove/zenon/tla/rewrites.ts +447 -0
  299. package/src/prove/zenon/tla/sets.ts +304 -0
  300. package/src/prove/zenon/tla/terms.ts +181 -0
  301. package/src/prove/zenon/tla/tla.ts +506 -0
  302. package/src/run-cli.ts +73 -20
  303. package/src/standard-modules.ts +5 -2
  304. package/src/successors.ts +24 -5
  305. package/src/tlc-random.ts +55 -32
  306. package/src/tlc-version.ts +8 -7
  307. package/src/values.ts +80 -35
  308. package/src/worker.ts +65 -0
  309. package/dist/parallel.cjs +0 -12
  310. package/dist/parallel.js +0 -12
  311. /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
@@ -0,0 +1,262 @@
1
+ // Ported from Isabelle2025's Pure/net.ML, discrimination nets. Copyright (c) 1986-2025 University
2
+ // of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
3
+
4
+ import { boundName } from "./name";
5
+ import {
6
+ emptyTable,
7
+ fastStringOrd,
8
+ foldTable,
9
+ isEmptyTable,
10
+ lookupTable,
11
+ tableEntries,
12
+ updateTable,
13
+ deleteTable,
14
+ type Table,
15
+ } from "./table";
16
+ import { headOf, type Term } from "./term";
17
+
18
+ export type NetKey =
19
+ | { readonly kind: "Comb" }
20
+ | { readonly kind: "Var" }
21
+ | { readonly kind: "Atom"; readonly name: string };
22
+
23
+ const combKey: NetKey = { kind: "Comb" };
24
+ const varKey: NetKey = { kind: "Var" };
25
+
26
+ export type Net<Item> =
27
+ | { readonly kind: "Leaf"; readonly items: readonly Item[] }
28
+ | {
29
+ readonly kind: "Net";
30
+ readonly comb: Net<Item>;
31
+ readonly var: Net<Item>;
32
+ readonly atoms: Table<string, Net<Item>>;
33
+ };
34
+
35
+ export const emptyNet: Net<never> = { kind: "Leaf", items: [] };
36
+
37
+ const isEmptyNet = <Item>(net: Net<Item>) => net.kind === "Leaf" && net.items.length === 0;
38
+
39
+ const makeNode = <Item>(): Extract<Net<Item>, { kind: "Net" }> => ({
40
+ kind: "Net",
41
+ comb: emptyNet,
42
+ var: emptyNet,
43
+ atoms: emptyTable(fastStringOrd),
44
+ });
45
+
46
+ // Net.key_of_term: preorder keys, with any term headed by a variable or an abstraction as a Var.
47
+ export const keyOfTerm = (term: Term): NetKey[] => {
48
+ const keys: NetKey[] = [];
49
+ const add = (current: Term) => {
50
+ const head = headOf(current);
51
+ if (head.kind === "Var" || head.kind === "Abs") {
52
+ keys.push(varKey);
53
+ return;
54
+ }
55
+ const rands = (inner: Term) => {
56
+ if (inner.kind === "App") {
57
+ keys.push(combKey);
58
+ rands(inner.fun);
59
+ add(inner.arg);
60
+ return;
61
+ }
62
+ if (inner.kind === "Const" || inner.kind === "Free")
63
+ keys.push({ kind: "Atom", name: inner.name });
64
+ else if (inner.kind === "Bound") keys.push({ kind: "Atom", name: boundName(inner.index) });
65
+ };
66
+ rands(current);
67
+ };
68
+ add(term);
69
+ return keys;
70
+ };
71
+
72
+ // Net.insert: raises nothing on a duplicate here; insert_safe semantics with eq. It walks down
73
+ // the keys and rebuilds the path bottom-up, so a long key list can't exhaust the stack.
74
+ export const insertNet = <Item>(
75
+ isEqual: (left: Item, right: Item) => boolean,
76
+ keys: readonly NetKey[],
77
+ item: Item,
78
+ net: Net<Item>,
79
+ ): Net<Item> | undefined => {
80
+ const path: Extract<Net<Item>, { kind: "Net" }>[] = [];
81
+ const leaf = keys.reduce((node, key) => {
82
+ const expanded = node.kind === "Net" ? node : makeNode<Item>();
83
+ path.push(expanded);
84
+ return key.kind === "Comb"
85
+ ? expanded.comb
86
+ : key.kind === "Var"
87
+ ? expanded.var
88
+ : (lookupTable(expanded.atoms, key.name) ?? emptyNet);
89
+ }, net);
90
+ const items = leaf.kind === "Leaf" ? leaf.items : [];
91
+ if (items.some((other) => isEqual(other, item))) return undefined;
92
+ return path.reduceRight<Net<Item>>(
93
+ (child, expanded, position) => {
94
+ const key = keys[position];
95
+ return key.kind === "Comb"
96
+ ? { ...expanded, comb: child }
97
+ : key.kind === "Var"
98
+ ? { ...expanded, var: child }
99
+ : { ...expanded, atoms: updateTable(expanded.atoms, key.name, child) };
100
+ },
101
+ { kind: "Leaf", items: [item, ...items] },
102
+ );
103
+ };
104
+
105
+ export const insertTermNet = <Item>(term: Term, item: Item, net: Net<Item>) =>
106
+ insertNet(() => false, keyOfTerm(term), item, net) ?? net;
107
+
108
+ export const insertTermSafe = <Item>(
109
+ isEqual: (left: Item, right: Item) => boolean,
110
+ term: Term,
111
+ item: Item,
112
+ net: Net<Item>,
113
+ ) => insertNet(isEqual, keyOfTerm(term), item, net) ?? net;
114
+
115
+ const newNet = <Item>(node: Extract<Net<Item>, { kind: "Net" }>): Net<Item> =>
116
+ isEmptyNet(node.comb) && isEmptyNet(node.var) && isEmptyTable(node.atoms) ? emptyNet : node;
117
+
118
+ // Net.delete: undefined where Isabelle raises DELETE.
119
+ export const deleteNet = <Item>(
120
+ isEqual: (left: Item, right: Item) => boolean,
121
+ keys: readonly NetKey[],
122
+ item: Item,
123
+ net: Net<Item>,
124
+ ): Net<Item> | undefined => {
125
+ const del = (position: number, node: Net<Item>): Net<Item> | undefined => {
126
+ if (node.kind === "Leaf") {
127
+ if (position < keys.length) return undefined;
128
+ const index = node.items.findIndex((other) => isEqual(other, item));
129
+ if (index === -1) return undefined;
130
+ return { kind: "Leaf", items: node.items.filter((other) => !isEqual(other, item)) };
131
+ }
132
+ if (position === keys.length) return undefined;
133
+ const key = keys[position];
134
+ if (key.kind === "Comb") {
135
+ const comb = del(position + 1, node.comb);
136
+ return comb && newNet({ ...node, comb });
137
+ }
138
+ if (key.kind === "Var") {
139
+ const child = del(position + 1, node.var);
140
+ return child && newNet({ ...node, var: child });
141
+ }
142
+ const existing = lookupTable(node.atoms, key.name);
143
+ if (existing === undefined) return undefined;
144
+ const child = del(position + 1, existing);
145
+ if (child === undefined) return undefined;
146
+ return newNet({
147
+ ...node,
148
+ atoms: isEmptyNet(child)
149
+ ? deleteTable(node.atoms, key.name)
150
+ : updateTable(node.atoms, key.name, child),
151
+ });
152
+ };
153
+ return del(0, net);
154
+ };
155
+
156
+ export const deleteTermSafe = <Item>(
157
+ isEqual: (left: Item, right: Item) => boolean,
158
+ term: Term,
159
+ item: Item,
160
+ net: Net<Item>,
161
+ ) => deleteNet(isEqual, keyOfTerm(term), item, net) ?? net;
162
+
163
+ // The lists of nets that matching conses up, as Isabelle's lists.
164
+ type Nets<Item> = { readonly head: Net<Item>; readonly tail: Nets<Item> } | undefined;
165
+
166
+ const toArray = <Item>(nets: Nets<Item>) => {
167
+ const array: Net<Item>[] = [];
168
+ for (let current = nets; current !== undefined; current = current.tail) array.push(current.head);
169
+ return array;
170
+ };
171
+
172
+ const netSkip = <Item>(net: Net<Item>, nets: Nets<Item>): Nets<Item> => {
173
+ if (net.kind === "Leaf") return nets;
174
+ const children = toArray(netSkip(net.comb, undefined));
175
+ let result = foldTable<string, Net<Item>, Nets<Item>>(
176
+ (_name, child, tail) => ({ head: child, tail }),
177
+ net.atoms,
178
+ { head: net.var, tail: nets },
179
+ );
180
+ for (let index = children.length - 1; index >= 0; index -= 1)
181
+ result = netSkip(children[index], result);
182
+ return result;
183
+ };
184
+
185
+ const look1 = <Item>(atoms: Table<string, Net<Item>>, name: string, nets: Nets<Item>) => {
186
+ const net = lookupTable(atoms, name);
187
+ return net === undefined ? nets : { head: net, tail: nets };
188
+ };
189
+
190
+ const rands = <Item>(isUnif: boolean, term: Term, net: Net<Item>, nets: Nets<Item>): Nets<Item> => {
191
+ if (net.kind === "Leaf") return nets;
192
+ if (term.kind === "App") {
193
+ const children = toArray(rands(isUnif, term.fun, net.comb, undefined));
194
+ let result = nets;
195
+ for (let index = children.length - 1; index >= 0; index -= 1)
196
+ result = matching(isUnif, term.arg, children[index], result);
197
+ return result;
198
+ }
199
+ if (term.kind === "Const" || term.kind === "Free") return look1(net.atoms, term.name, nets);
200
+ if (term.kind === "Bound") return look1(net.atoms, boundName(term.index), nets);
201
+ return nets;
202
+ };
203
+
204
+ const matching = <Item>(isUnif: boolean, term: Term, net: Net<Item>, nets: Nets<Item>) => {
205
+ if (net.kind === "Leaf") return nets;
206
+ const head = headOf(term);
207
+ if (head.kind === "Var" || head.kind === "Abs")
208
+ return isUnif ? netSkip(net, nets) : { head: net.var, tail: nets };
209
+ return rands(isUnif, term, net, { head: net.var, tail: nets });
210
+ };
211
+
212
+ const extractLeaves = <Item>(nets: Nets<Item>) => {
213
+ const items: Item[] = [];
214
+ for (let current = nets; current !== undefined; current = current.tail)
215
+ if (current.head.kind === "Leaf") for (const item of current.head.items) items.push(item);
216
+ return items;
217
+ };
218
+
219
+ export const matchTermNet = <Item>(net: Net<Item>, term: Term) =>
220
+ extractLeaves(matching(false, term, net, undefined));
221
+
222
+ export const unifyTermNet = <Item>(net: Net<Item>, term: Term) =>
223
+ extractLeaves(matching(true, term, net, undefined));
224
+
225
+ // Net.content: every item, by the order of Net.dest.
226
+ export const netContent = <Item>(net: Net<Item>): Item[] => {
227
+ if (net.kind === "Leaf") return [...net.items];
228
+ return [
229
+ ...netContent(net.comb),
230
+ ...netContent(net.var),
231
+ ...tableEntries(net.atoms).flatMap((entry) => netContent(entry[1])),
232
+ ];
233
+ };
234
+
235
+ // Net.subtract: the items of second that are not in first.
236
+ export const subtractNet = <Item>(
237
+ isEqual: (left: Item, right: Item) => boolean,
238
+ first: Net<Item>,
239
+ second: Net<Item>,
240
+ ) => {
241
+ const subtr = (left: Net<Item>, right: Net<Item>, result: Item[]): Item[] => {
242
+ if (right.kind === "Leaf") {
243
+ if (left.kind === "Net") return [...right.items, ...result];
244
+ return right.items.reduceRight(
245
+ (accumulated, item) =>
246
+ left.items.some((other) => isEqual(other, item)) ? accumulated : [item, ...accumulated],
247
+ result,
248
+ );
249
+ }
250
+ if (left.kind === "Leaf") return subtr(makeNode(), right, result);
251
+ const afterComb = subtr(left.comb, right.comb, result);
252
+ const afterVar = subtr(left.var, right.var, afterComb);
253
+ return tableEntries(right.atoms).reduce(
254
+ (accumulated, entry) =>
255
+ subtr(lookupTable(left.atoms, entry[0]) ?? makeNode(), entry[1], accumulated),
256
+ afterVar,
257
+ );
258
+ };
259
+ return subtr(first, second, []);
260
+ };
261
+
262
+ export const netEntries = <Item>(net: Net<Item>) => subtractNet(() => false, emptyNet, net);
@@ -0,0 +1,41 @@
1
+ // Ported from Isabelle2025's Pure/Isar/object_logic.ML, atomize_prems_tac, and the CONVERSION of
2
+ // Pure/tactic.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet
3
+ // Muenchen, and contributors, see LICENSE.
4
+
5
+ import { TlaIsabelleError } from "../../../errors";
6
+ import { gconvRule, paramsConv, premsConv } from "./conv";
7
+ import { hasMetaPrems } from "./logic";
8
+ import { addSimps, emptySimpset } from "./raw-simplifier";
9
+ import { rewriteCterm, simpleProver } from "./rewriter";
10
+ import { emptySeq, singleSeq } from "./seq";
11
+ import type { Limits } from "./interrupt";
12
+ import type { GoalTactic } from "./tactical";
13
+ import { reflexive, type Thm } from "./thm";
14
+
15
+ // Object_Logic.atomize_prems_tac: rewrites the premises of a goal with the atomize rules, newest
16
+ // first as Object_Logic keeps them, which turns meta-level premises into object-level formulas.
17
+ export const atomizePremsTac = (limits: Limits, rules: readonly Thm[]): GoalTactic => {
18
+ const empty = { limits, simpset: emptySimpset, bounds: 0 };
19
+ const context = { ...empty, simpset: addSimps(empty, rules) };
20
+ // Raw_Simplifier.rewrite ctxt true: full rewriting, with a prover that proves no premises.
21
+ const atomize = paramsConv(
22
+ premsConv((term) =>
23
+ rewriteCterm({ simprem: true, useprem: false, mutsimp: false }, simpleProver, context, term),
24
+ ),
25
+ );
26
+ return (index) => (state) => {
27
+ try {
28
+ return singleSeq(
29
+ gconvRule((term) => (hasMetaPrems(term) ? atomize(term) : reflexive(term)), index, state),
30
+ );
31
+ } catch (error) {
32
+ // CONVERSION fails on THM, CTERM, TERM and TYPE.
33
+ if (
34
+ error instanceof TlaIsabelleError &&
35
+ (error.exception === "THM" || error.exception === "TERM" || error.exception === "TYPE")
36
+ )
37
+ return emptySeq;
38
+ throw error;
39
+ }
40
+ };
41
+ };