tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

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 (631) hide show
  1. package/README.md +8 -0
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,9 +1,5 @@
1
- // Ported from Isabelle2025's Pure/conv.ML, conversions: functions from a term to a theorem that
2
- // it equals another. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet
3
- // Muenchen, and contributors, see LICENSE.
4
-
5
1
  import { TlaIsabelleError } from "../../../errors";
6
- import { destEquals, destImplies, implies, isImplies } from "./logic";
2
+ import { destEquals, destImplies, implies, isAllAbs, isImplies } from "./logic";
7
3
  import { declareName, makeNameContext, variantName, type NameContext } from "./name";
8
4
  import { aconv, addFreeNames, mkFree, substBound, type Term } from "./term";
9
5
  import {
@@ -24,11 +20,9 @@ const isReflexive = (eq: Thm) => {
24
20
  return aconv(lhs, rhs);
25
21
  };
26
22
 
27
- // Drule.imp_cong_rule
28
23
  export const impCongRule = (first: Thm, second: Thm) =>
29
24
  combination(combination(reflexive(implies), first), second);
30
25
 
31
- // Conv.prems_conv ~1: converts every premise.
32
26
  export const premsConv =
33
27
  (convert: Conversion): Conversion =>
34
28
  (term) =>
@@ -36,19 +30,11 @@ export const premsConv =
36
30
  ? impCongRule(convert(destImplies(term)[0]), premsConv(convert)(destImplies(term)[1]))
37
31
  : reflexive(term);
38
32
 
39
- // Conv.params_conv ~1: converts the body under every outer parameter, fixed as a fresh free
40
- // variable.
41
33
  export const paramsConv = (convert: Conversion): Conversion => {
42
34
  const under =
43
35
  (names: NameContext): Conversion =>
44
36
  (term) => {
45
- if (
46
- term.kind !== "App" ||
47
- term.fun.kind !== "Const" ||
48
- term.fun.name !== "Pure.all" ||
49
- term.arg.kind !== "Abs"
50
- )
51
- return convert(term);
37
+ if (!isAllAbs(term)) return convert(term);
52
38
  const abs = term.arg;
53
39
  const [name, nextNames] = variantName(abs.name, names);
54
40
  const free = mkFree(name, abs.type);
@@ -60,7 +46,6 @@ export const paramsConv = (convert: Conversion): Conversion => {
60
46
  return (term) => under(makeNameContext(addFreeNames(term, [])))(term);
61
47
  };
62
48
 
63
- // Conv.gconv_rule: converts goal index of a state.
64
49
  export const gconvRule = (convert: Conversion, index: number, state: Thm): Thm => {
65
50
  if (index < 1 || index > nprems(state)) throw new TlaIsabelleError("THM", `gconv_rule ${index}`);
66
51
  const eq = convert(premOf(state, index));
@@ -72,7 +57,6 @@ export const gconvRule = (convert: Conversion, index: number, state: Thm): Thm =
72
57
  return permutePrems(0, 1 - index, converted);
73
58
  };
74
59
 
75
- // Conv.fconv_rule: converts a theorem's proposition.
76
60
  export const fconvRule = (convert: Conversion, thm: Thm): Thm => {
77
61
  const eq = convert(thm.prop);
78
62
  return isReflexive(eq) ? thm : equalElim(eq, thm);
@@ -1,8 +1,11 @@
1
- // Ported from Isabelle2025's Pure/drule.ML, Pure/term_subst.ML and the basic rules of Pure.thy.
2
- // Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and
3
- // contributors, see LICENSE.
4
-
5
- import { cleanName, emptyNameContext, variantList, variantName, type NameContext } from "./name";
1
+ import {
2
+ cleanName,
3
+ emptyNameContext,
4
+ isBoundName,
5
+ variantList,
6
+ variantName,
7
+ type NameContext,
8
+ } from "./name";
6
9
  import {
7
10
  emptyTable,
8
11
  fastIndexnameOrd,
@@ -12,10 +15,12 @@ import {
12
15
  type IndexKey,
13
16
  } from "./table";
14
17
  import { TlaIsabelleError } from "../../../errors";
15
- import { allConst, isProtected, mkEquals, mkImplies, mkTerm, protect } from "./logic";
16
- import { listOfSeq } from "./seq";
17
- import { eqThm } from "./tactical";
18
+ import { allConst, destEquals, isProtected, mkEquals, mkImplies, mkTerm, protect } from "./logic";
19
+ import type { Limits } from "./interrupt";
20
+ import { emptySeq, listOfSeq, mapsSeq, seqOfList, singleSeq, type Seq } from "./seq";
21
+ import { distinctThms } from "./tactical";
18
22
  import {
23
+ aconv,
19
24
  foldVars,
20
25
  foldAtyps,
21
26
  foldTypes,
@@ -33,27 +38,27 @@ import {
33
38
  } from "./term";
34
39
  import { normType, type TyEnv } from "./type";
35
40
  import {
41
+ abstractRule,
36
42
  axiomThm,
43
+ betaConversion,
37
44
  bicompose,
45
+ biresolution,
46
+ etaConversion,
38
47
  forallElim,
39
48
  forallIntr,
40
49
  incrIndexesThm,
41
50
  instantiate,
42
51
  instantiateTypes,
52
+ nprems,
43
53
  rs,
54
+ symmetric,
55
+ transitive,
44
56
  type Instantiation,
45
57
  type Thm,
46
58
  } from "./thm";
47
59
 
48
60
  const propVar = (name: string) => mkVar(name, 0, propT);
49
61
 
50
- // The basic rules of Pure.thy, with the variable names Isabelle gives them.
51
- export const cutRl = axiomThm(
52
- mkImplies(
53
- mkImplies(propVar("psi"), propVar("theta")),
54
- mkImplies(propVar("psi"), propVar("theta")),
55
- ),
56
- );
57
62
  export const revcutRl = axiomThm(
58
63
  mkImplies(propVar("V"), mkImplies(mkImplies(propVar("V"), propVar("W")), propVar("W"))),
59
64
  );
@@ -64,6 +69,13 @@ export const remdupsRl = axiomThm(
64
69
  );
65
70
  export const protectI = axiomThm(mkImplies(propVar("A"), protect(propVar("A"))));
66
71
  export const protectD = axiomThm(mkImplies(protect(propVar("A")), propVar("A")));
72
+ export const protectCong = axiomThm(mkEquals(protect(propVar("A")), protect(propVar("A"))));
73
+ export const equalsCong = axiomThm(
74
+ mkEquals(
75
+ mkEquals(mkVar("x", 0, mkTVar("'a", 0)), mkVar("y", 0, mkTVar("'a", 0))),
76
+ mkEquals(mkVar("x", 0, mkTVar("'a", 0)), mkVar("y", 0, mkTVar("'a", 0))),
77
+ ),
78
+ );
67
79
  export const reflexiveThm = axiomThm(
68
80
  mkEquals(mkVar("x", 0, mkTVar("'a", 0)), mkVar("x", 0, mkTVar("'a", 0))),
69
81
  );
@@ -94,7 +106,6 @@ export const trivForallEquality = axiomThm(
94
106
  mkEquals(mkApp(allConst(typeA), mkAbs("x", typeA, propVar("V"))), propVar("V")),
95
107
  );
96
108
 
97
- // Drule.norm_hhf_eq: (PROP ?phi ==> (!!x. PROP ?psi x)) == (!!x. PROP ?phi ==> PROP ?psi x).
98
109
  export const normHhfEq = axiomThm(
99
110
  mkEquals(
100
111
  mkImplies(
@@ -115,7 +126,6 @@ export const normHhfEq = axiomThm(
115
126
  ),
116
127
  );
117
128
 
118
- // Drule.is_norm_hhf: no quantifier right of an implication and no beta redex.
119
129
  export const isNormHhf = (isProtecting: boolean, term: Term): boolean => {
120
130
  if (term.kind === "Const") return term.name !== "Pure.sort_constraint";
121
131
  if (term.kind === "Abs") return isNormHhf(isProtecting, term.body);
@@ -134,7 +144,6 @@ export const isNormHhf = (isProtecting: boolean, term: Term): boolean => {
134
144
  return isNormHhf(isProtecting, term.fun) && isNormHhf(isProtecting, term.arg);
135
145
  };
136
146
 
137
- // Drule.outer_params: the outermost parameters, named apart.
138
147
  const outerParams = (term: Term) => {
139
148
  const vars = stripAllVars(term);
140
149
  const names = variantList(
@@ -144,7 +153,6 @@ const outerParams = (term: Term) => {
144
153
  return vars.map((variable, index) => ({ name: names[index], type: variable.type }));
145
154
  };
146
155
 
147
- // Variable.gen_all: the outermost parameters become schematic variables.
148
156
  export const genAll = (thm: Thm) => {
149
157
  const index = Math.max(thm.maxidx, -1) + 1;
150
158
  return outerParams(thm.prop).reduce(
@@ -153,9 +161,8 @@ export const genAll = (thm: Thm) => {
153
161
  );
154
162
  };
155
163
 
156
- // Thm.forall_intr_vars: quantifies the schematic variables in order of appearance.
157
164
  export const forallIntrVars = (thm: Thm) => {
158
- const vars = fullProps(thm).reduce(
165
+ const vars = fullProps(thm).reduce<Var[]>(
159
166
  (result, term) =>
160
167
  foldVars(
161
168
  (atom, current: Var[]) =>
@@ -165,17 +172,16 @@ export const forallIntrVars = (thm: Thm) => {
165
172
  term,
166
173
  result,
167
174
  ),
168
- [] as Var[],
175
+ [],
169
176
  );
170
177
  return vars.reduceRight((result, variable) => forallIntr(variable, result), thm);
171
178
  };
172
179
 
173
180
  const variantBound = (name: string, used: NameContext) =>
174
- variantName(name.startsWith(":") ? "u" : name, used);
181
+ variantName(isBoundName(name) ? "u" : name, used);
175
182
 
176
183
  const fullProps = (thm: Thm) => [...thm.tpairs.flatMap((pair) => [pair[0], pair[1]]), thm.prop];
177
184
 
178
- // Drule.zero_var_indexes: renames the schematic variables apart with index 0.
179
185
  export const zeroVarIndexes = (thm: Thm): Thm => {
180
186
  const terms = fullProps(thm);
181
187
  const tvars = terms.reduce(
@@ -224,41 +230,85 @@ export const zeroVarIndexes = (thm: Thm): Thm => {
224
230
  return instantiate(insts, instantiateTypes(tyenv, thm));
225
231
  };
226
232
 
227
- // Tactic.make_elim: turns a destruction rule into an elimination rule.
228
233
  export const makeElim = (rule: Thm) => zeroVarIndexes(rs(rule, revcutRl));
229
234
 
230
- // Drule.compose: resolves tha into premise index of thb without lifting, with a unique result.
231
235
  const compose = (tha: Thm, index: number, thb: Thm): Thm => {
232
- const results = listOfSeq(
233
- bicompose(
234
- undefined,
235
- { flatten: true, match: false, incremented: true },
236
- { isElim: false, rule: tha, subgoals: 0 },
237
- index,
238
- thb,
236
+ const results = distinctThms(
237
+ listOfSeq(
238
+ bicompose(
239
+ undefined,
240
+ { flatten: true, match: false, incremented: true },
241
+ { isElim: false, rule: tha, subgoals: 0 },
242
+ index,
243
+ thb,
244
+ ),
239
245
  ),
240
- ).filter((result, position, all) => all.findIndex((other) => eqThm(other, result)) === position);
246
+ );
241
247
  if (results.length !== 1)
242
248
  throw new TlaIsabelleError("THM", `compose: unique result expected ${index}`);
243
249
  return results[0];
244
250
  };
245
251
 
246
- // COMP_INCR
252
+ export const betaEtaConversion = (term: Term) => {
253
+ const beta = betaConversion(true, term);
254
+ return transitive(beta, etaConversion(destEquals(beta.prop)[1]));
255
+ };
256
+
257
+ // f ?x1 ... ?xn == u becomes f == %x1 ... xn. u.
258
+ export const absDef = (thm: Thm): Thm => {
259
+ const contractLhs = (current: Thm) =>
260
+ transitive(symmetric(betaEtaConversion(destEquals(current.prop)[0])), current);
261
+ const varArgs = (term: Term): Term[] => {
262
+ if (term.kind !== "App" || term.arg.kind !== "Var") return [];
263
+ const variable = term.arg;
264
+ return [variable, ...varArgs(term.fun).filter((other) => !aconv(other, variable))];
265
+ };
266
+ const contracted = contractLhs(thm);
267
+ return contractLhs(
268
+ varArgs(destEquals(contracted.prop)[0]).reduce(
269
+ (current, variable) =>
270
+ abstractRule(variable.kind === "Var" ? variable.name : "", variable, current),
271
+ contracted,
272
+ ),
273
+ );
274
+ };
275
+
247
276
  export const compIncr = (tha: Thm, thb: Thm) =>
248
277
  compose(tha, 1, incrIndexesThm(tha.maxidx + 1, thb));
249
278
 
250
- // Drule.comp_no_flatten: composes th, keeping its first count premises, into premise index of
251
- // rule.
252
279
  export const compNoFlatten = (thm: Thm, count: number, index: number, rule: Thm): Thm => {
253
- const results = listOfSeq(
254
- bicompose(
255
- undefined,
256
- { flatten: false, match: false, incremented: true },
257
- { isElim: false, rule: thm, subgoals: count },
258
- index,
259
- incrIndexesThm(thm.maxidx + 1, rule),
280
+ const results = distinctThms(
281
+ listOfSeq(
282
+ bicompose(
283
+ undefined,
284
+ { flatten: false, match: false, incremented: true },
285
+ { isElim: false, rule: thm, subgoals: count },
286
+ index,
287
+ incrIndexesThm(thm.maxidx + 1, rule),
288
+ ),
260
289
  ),
261
- ).filter((result, position, all) => all.findIndex((other) => eqThm(other, result)) === position);
290
+ );
262
291
  if (results.length !== 1) throw new TlaIsabelleError("THM", `comp_no_flatten ${index}`);
263
292
  return results[0];
264
293
  };
294
+
295
+ export const multiResolves = (
296
+ limits: Limits,
297
+ facts: readonly Thm[],
298
+ rules: readonly Thm[],
299
+ ): Seq<Thm> =>
300
+ mapsSeq(
301
+ (rule) =>
302
+ facts.reduceRight<Seq<Thm>>(
303
+ (results, fact, index) =>
304
+ mapsSeq(
305
+ (thm) =>
306
+ index + 1 > nprems(thm)
307
+ ? emptySeq
308
+ : biresolution(limits, false, [{ isElim: false, rule: fact }], index + 1, thm),
309
+ results,
310
+ ),
311
+ singleSeq(rule),
312
+ ),
313
+ seqOfList(rules),
314
+ );
@@ -1,8 +1,3 @@
1
- // Ported from Isabelle2025's Pure/envir.ML. Copyright (c) 1986-2025 University of Cambridge,
2
- // Technische Universitaet Muenchen, and contributors, see LICENSE.
3
- //
4
- // Environments of assignments to schematic variables, and beta and eta normalization.
5
-
6
1
  import { TlaIsabelleError } from "../../../errors";
7
2
  import {
8
3
  emptyTable,
@@ -36,7 +31,7 @@ import {
36
31
  type Typ,
37
32
  type Var,
38
33
  } from "./term";
39
- import { devar, emptyTyEnv, normType, substType, unifiedTypes, type TyEnv } from "./type";
34
+ import { devar, emptyTyEnv, normType, unifiedTypes, type TyEnv } from "./type";
40
35
 
41
36
  export interface Binding {
42
37
  readonly type: Typ;
@@ -63,7 +58,6 @@ const initEnvir = emptyEnvir(-1);
63
58
 
64
59
  export const isEmptyEnvir = (envir: Envir) => isEmptyTable(envir.tenv) && isEmptyTable(envir.tyenv);
65
60
 
66
- // radixstring (26, "a", n)
67
61
  const radixString = (value: number): string => {
68
62
  const digits: number[] = [];
69
63
  let remaining = value;
@@ -74,7 +68,6 @@ const radixString = (value: number): string => {
74
68
  return digits.map((digit) => String.fromCharCode(97 + digit)).join("");
75
69
  };
76
70
 
77
- // Envir.genvars: fresh variables with an index above every present one.
78
71
  export const genvars = (name: string, envir: Envir, types: readonly Typ[]): [Envir, Var[]] => {
79
72
  const index = envir.maxidx + 1;
80
73
  const vars = types.map((type, position) =>
@@ -88,17 +81,14 @@ export const genvar = (name: string, envir: Envir, type: Typ): [Envir, Var] => {
88
81
  return [updated, vars[0]];
89
82
  };
90
83
 
91
- // Envir.lookup1: lookup without chasing type assignments, for environments from matching.
92
84
  export const lookup1 = (tenv: TEnv, variable: Var): Term | undefined => {
93
85
  const binding = lookupTable(tenv, variable);
94
86
  if (binding === undefined) return undefined;
95
- if (!eqTypExact(variable.type, binding.type))
87
+ if (!unifiedTypes(emptyTyEnv, variable.type, binding.type))
96
88
  throw new TlaIsabelleError("TYPE", "Variable has two distinct types");
97
89
  return binding.term;
98
90
  };
99
91
 
100
- const eqTypExact = (left: Typ, right: Typ) => unifiedTypes(emptyTyEnv, left, right);
101
-
102
92
  export const lookup = (envir: Envir, variable: Var): Term | undefined => {
103
93
  const binding = lookupTable(envir.tenv, variable);
104
94
  if (binding === undefined) return undefined;
@@ -120,7 +110,6 @@ export const update = (variable: Var, term: Term, envir: Envir): Envir => {
120
110
  };
121
111
  };
122
112
 
123
- // Envir.above: whether the least index updated exceeds limit.
124
113
  export const above = (envir: Envir, limit: number) => {
125
114
  const term = minTable(envir.tenv);
126
115
  const type = minTable(envir.tyenv);
@@ -129,7 +118,6 @@ export const above = (envir: Envir, limit: number) => {
129
118
  );
130
119
  };
131
120
 
132
- // Envir.vupdate: an assignment that suppresses higher indexes between variables.
133
121
  export const vupdate = (variable: Var, term: Term, envir: Envir): Envir => {
134
122
  if (term.kind !== "Var") return update(variable, term, envir);
135
123
  if (variable.name === term.name && variable.index === term.index) return envir;
@@ -191,7 +179,6 @@ const normTerm2 = (envir: Envir, term: Term): Term => {
191
179
  }
192
180
  };
193
181
 
194
- // Envir.norm_term: instantiates the environment and beta-normalizes.
195
182
  export const normTerm = (envir: Envir, term: Term): Term => {
196
183
  if (isEmptyEnvir(envir) && !couldBetaContract(term)) return term;
197
184
  return isEmptyTable(envir.tyenv) ? normTerm1(envir.tenv, term) : normTerm2(envir, term);
@@ -199,7 +186,6 @@ export const normTerm = (envir: Envir, term: Term): Term => {
199
186
 
200
187
  export const betaNorm = (term: Term) => normTerm(initEnvir, term);
201
188
 
202
- // Envir.head_norm: normalizes the head only, for unification.
203
189
  export const headNorm = (envir: Envir, term: Term): Term => {
204
190
  if ((flagsOf(term) & (HAS_VAR | HAS_REDEX)) === 0) return term;
205
191
  switch (term.kind) {
@@ -250,7 +236,6 @@ const etaSame = (term: Term): Term => {
250
236
  return term;
251
237
  };
252
238
 
253
- // Envir.eta_contract
254
239
  export const etaContract = (term: Term) => (couldEtaContract(term) ? etaSame(term) : term);
255
240
 
256
241
  export const aeconv = (left: Term, right: Term) =>
@@ -275,7 +260,6 @@ export const envBinderTypes = (envir: Envir, type: Typ): Typ[] => {
275
260
  return [];
276
261
  };
277
262
 
278
- // Envir.fastype: the type of a term, chasing type assignments at applications.
279
263
  export const fastype = (envir: Envir, types: readonly Typ[], term: Term): Typ => {
280
264
  switch (term.kind) {
281
265
  case "App": {
@@ -294,38 +278,3 @@ export const fastype = (envir: Envir, types: readonly Typ[], term: Term): Typ =>
294
278
  return term.type;
295
279
  }
296
280
  };
297
-
298
- // Envir.subst_term: instantiates without chasing variables.
299
- const substTermAux = (tyenv: TyEnv, tenv: TEnv, term: Term): Term => {
300
- if (maxidxOfTerm(term) < 0) return term;
301
- switch (term.kind) {
302
- case "Const":
303
- case "Free": {
304
- const type = isEmptyTable(tyenv) ? term.type : substType(tyenv, term.type);
305
- return type === term.type ? term : { ...term, type };
306
- }
307
- case "Var": {
308
- const assigned = lookup1(tenv, term);
309
- if (assigned !== undefined) return assigned;
310
- const type = isEmptyTable(tyenv) ? term.type : substType(tyenv, term.type);
311
- return type === term.type ? term : { ...term, type };
312
- }
313
- case "Bound":
314
- return term;
315
- case "Abs":
316
- return updateAbs(
317
- term,
318
- substTermAux(tyenv, tenv, term.body),
319
- isEmptyTable(tyenv) ? term.type : substType(tyenv, term.type),
320
- );
321
- case "App":
322
- return updateApp(
323
- term,
324
- substTermAux(tyenv, tenv, term.fun),
325
- substTermAux(tyenv, tenv, term.arg),
326
- );
327
- }
328
- };
329
-
330
- export const substTerm = (tyenv: TyEnv, tenv: TEnv, term: Term) =>
331
- isEmptyTable(tenv) && isEmptyTable(tyenv) ? term : substTermAux(tyenv, tenv, term);
@@ -1,18 +1,12 @@
1
- // Ported from Isabelle2025's Pure/goal.ML: focusing a tactic on one subgoal. Copyright (c)
2
- // 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see
3
- // LICENSE.
4
-
5
1
  import { TlaIsabelleError } from "../../../errors";
6
2
  import { compNoFlatten, protectD, protectI } from "./drule";
7
3
  import { emptySeq } from "./seq";
8
4
  import { primitive, thenTac, type GoalTactic, type Tactic } from "./tactical";
9
5
  import { nprems, permutePrems, type Thm } from "./thm";
10
6
 
11
- // A ==> ... ==> C becomes A ==> #(... ==> C), keeping count premises.
12
7
  const protect = (count: number, thm: Thm) => compNoFlatten(thm, count, 1, protectI);
13
8
 
14
- // A ==> ... ==> #C becomes A ==> ... ==> C.
15
- const conclude = (thm: Thm) => compNoFlatten(thm, nprems(thm), 1, protectD);
9
+ export const conclude = (thm: Thm) => compNoFlatten(thm, nprems(thm), 1, protectD);
16
10
 
17
11
  const restrict = (index: number, count: number, state: Thm) => {
18
12
  if (index < 1 || count < 1 || index + count - 1 > nprems(state))
@@ -22,7 +16,6 @@ const restrict = (index: number, count: number, state: Thm) => {
22
16
 
23
17
  const unrestrict = (index: number, state: Thm) => permutePrems(0, 1 - index, conclude(state));
24
18
 
25
- // SELECT_GOAL: runs the tactic on goal index alone.
26
19
  export const selectGoal =
27
20
  (tactic: Tactic): GoalTactic =>
28
21
  (index) =>
@@ -37,7 +30,6 @@ export const selectGoal =
37
30
  )(state);
38
31
  };
39
32
 
40
- // PREFER_GOAL: runs the tactic with goal index moved to the front.
41
33
  export const preferGoal =
42
34
  (tactic: Tactic): GoalTactic =>
43
35
  (index) =>
@@ -1,15 +1,10 @@
1
- // Isabelle interrupts a proof that runs out of time, wherever it is; this port checks for that at
2
- // the points where Isabelle's tactics and unifier spend their time.
3
-
4
1
  import { TlaIsabelleError } from "../../../errors";
5
2
 
6
- // When a proof gives up: past the deadline, a time from Date.now(), or once the signal aborts.
7
3
  export interface Limits {
8
4
  readonly deadline: number;
9
5
  readonly signal?: AbortSignal;
10
6
  }
11
7
 
12
- // tlapm reports no success for an interrupted proof.
13
8
  export const checkInterrupt = (limits: Limits) => {
14
9
  if (Date.now() > limits.deadline || limits.signal?.aborted === true)
15
10
  throw new TlaIsabelleError("Interrupt", "Interrupt");
@@ -1,6 +1,3 @@
1
- // ML's lists: each shares its tail, so that adding to the front takes constant time and keeps the
2
- // rest of the list alive only through the new cell.
3
-
4
1
  export interface List<Item> {
5
2
  readonly head: Item;
6
3
  readonly tail: List<Item> | undefined;
@@ -1,7 +1,3 @@
1
- // Ported from Isabelle2025's Pure/logic.ML, the abstract syntax of the meta logic. Copyright (c)
2
- // 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see
3
- // LICENSE.
4
-
5
1
  import { TlaIsabelleError } from "../../../errors";
6
2
  import { variantList } from "./name";
7
3
  import {
@@ -25,7 +21,6 @@ import {
25
21
  type Typ,
26
22
  } from "./term";
27
23
 
28
- // Logic.occs: whether a subterm of other is aconv to term.
29
24
  export const occs = (term: Term, other: Term): boolean =>
30
25
  mayOccur(term, other) &&
31
26
  (aconv(term, other) ||
@@ -52,7 +47,6 @@ export const mkEquals = (left: Term, right: Term) => {
52
47
  return mkApp(mkApp(mkConst("Pure.eq", funTs([type, type], propT)), left), right);
53
48
  };
54
49
 
55
- // A term c $ x $ y.
56
50
  interface ConstApp2 extends App {
57
51
  readonly fun: App;
58
52
  }
@@ -101,7 +95,6 @@ export const stripImpConcl = (term: Term): Term => {
101
95
  return current;
102
96
  };
103
97
 
104
- // Logic.strip_prems: removes count premises, returning them reversed onto premises.
105
98
  export const stripPrems = (
106
99
  count: number,
107
100
  premises: readonly Term[],
@@ -124,11 +117,9 @@ export const isProtected = (term: Term) =>
124
117
  export const mkTerm = (term: Term) =>
125
118
  mkApp(mkConst("Pure.term", funT(fastypeOf(term), propT)), term);
126
119
 
127
- // Logic.combound: term(Bound (start+count-1), ..., Bound start).
128
120
  export const combound = (term: Term, start: number, count: number): Term =>
129
121
  count > 0 ? mkApp(combound(term, start + 1, count - 1), mkBound(start)) : term;
130
122
 
131
- // Logic.rlist_abs: ([xn, ..., x1], body) to %x1 ... xn. body.
132
123
  export const rlistAbs = (binders: readonly Binder[], body: Term) =>
133
124
  binders.reduce((result, binder) => mkAbs(binder.name, binder.type, result), body);
134
125
 
@@ -141,7 +132,6 @@ const incrTVar = (increment: number, type: Typ) =>
141
132
  type,
142
133
  );
143
134
 
144
- // Logic.incr_indexes_operation: lifts the variables over the types and increments their indexes.
145
135
  const incrIndexesFixed = (
146
136
  fixed: readonly string[],
147
137
  types: readonly Typ[],
@@ -191,7 +181,7 @@ const incrIndexesFixed = (
191
181
  export const incrIndexes = (types: readonly Typ[], increment: number, term: Term) =>
192
182
  incrIndexesFixed([], types, increment, 0, term);
193
183
 
194
- const isAllAbs = (
184
+ export const isAllAbs = (
195
185
  term: Term,
196
186
  ): term is Extract<Term, { kind: "App" }> & {
197
187
  arg: Extract<Term, { kind: "Abs" }>;
@@ -201,7 +191,6 @@ const isAllAbs = (
201
191
  term.fun.name === "Pure.all" &&
202
192
  term.arg.kind === "Abs";
203
193
 
204
- // Logic.lift_abs: lifts a term over the parameters of a goal.
205
194
  export const liftAbs = (increment: number, goal: Term, term: Term): Term => {
206
195
  const lift = (types: Typ[], current: Term): Term => {
207
196
  if (isConstApp2(current, "Pure.imp")) return lift(types, current.arg);
@@ -216,7 +205,6 @@ export const liftAbs = (increment: number, goal: Term, term: Term): Term => {
216
205
  return lift([], goal);
217
206
  };
218
207
 
219
- // Logic.lift_all: lifts a proposition over the parameters and premises of a goal.
220
208
  export const liftAll = (increment: number, goal: Term, term: Term): Term => {
221
209
  const lift = (types: Typ[], current: Term): Term => {
222
210
  if (isConstApp2(current, "Pure.imp"))
@@ -281,7 +269,6 @@ export const hasMetaPrems = (term: Term): boolean => {
281
269
  return false;
282
270
  };
283
271
 
284
- // Logic.remove_params: drops count parameters and premise number index.
285
272
  const removeParams = (count: number, index: number, term: Term): Term => {
286
273
  if (count === 0 && index <= 0) return term;
287
274
  if (isConstApp2(term, "Pure.imp"))
@@ -293,7 +280,6 @@ const removeParams = (count: number, index: number, term: Term): Term => {
293
280
  return term;
294
281
  };
295
282
 
296
- // Logic.flatten_params: moves all parameters to the front, renaming them apart.
297
283
  export const flattenParams = (index: number, term: Term) => {
298
284
  const params = stripParams(term);
299
285
  const names = variantList(
@@ -304,7 +290,6 @@ export const flattenParams = (index: number, term: Term) => {
304
290
  return listAll(vars, removeParams(vars.length, index, term));
305
291
  };
306
292
 
307
- // Logic.strip_assums_imp: strips at most count premises.
308
293
  const stripAssumsImp = (count: number, hyps: Term[], term: Term): [Term[], Term] => {
309
294
  if (count === 0) return [hyps, term];
310
295
  if (isConstApp2(term, "Pure.imp"))
@@ -1,8 +1,3 @@
1
- // Ported from Isabelle2025's Pure/name.ML and the name bumping of Pure/General/symbol.ML.
2
- // Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and
3
- // contributors, see LICENSE.
4
-
5
- // Symbol.explode: \<name> symbols count as one symbol.
6
1
  const explodeSymbols = (text: string): string[] => text.match(/\\<\^?[A-Za-z0-9_']*>|[^]/gu) ?? [];
7
2
 
8
3
  const isRawSymbolic = (symbol: string) => symbol.startsWith("\\<") && !symbol.startsWith("\\<^");
@@ -48,7 +43,6 @@ const cleanIndex = (name: string): [string, number] => {
48
43
 
49
44
  export const cleanName = (name: string) => cleanIndex(name)[0];
50
45
 
51
- // Name.context: the declared names with their latest renaming.
52
46
  export type NameContext = ReadonlyMap<string, string | undefined>;
53
47
 
54
48
  export const declareName = (name: string, context: NameContext): NameContext => {
@@ -65,7 +59,6 @@ export const emptyNameContext: NameContext = new Map([
65
59
  export const makeNameContext = (names: readonly string[]) =>
66
60
  names.reduce((context, name) => declareName(name, context), emptyNameContext);
67
61
 
68
- // Name.variant: a name distinct from the declared ones, keeping a suffix of underscores.
69
62
  export const variantName = (name: string, context: NameContext): [string, NameContext] => {
70
63
  const [base, count] = cleanIndex(name);
71
64
  if (!context.has(base)) return [base + "_".repeat(count), declareName(base, context)];
@@ -79,7 +72,7 @@ export const variantName = (name: string, context: NameContext): [string, NameCo
79
72
  return [current + "_".repeat(count), declareName(current, renamed)];
80
73
  };
81
74
 
82
- export const variantNames = (names: readonly string[], context: NameContext) => {
75
+ const variantNames = (names: readonly string[], context: NameContext) => {
83
76
  let current = context;
84
77
  return names.map((name) => {
85
78
  const [variant, next] = variantName(name, current);
@@ -91,8 +84,6 @@ export const variantNames = (names: readonly string[], context: NameContext) =>
91
84
  export const variantList = (used: readonly string[], names: readonly string[]) =>
92
85
  variantNames(names, makeNameContext(used));
93
86
 
94
- // Name.is_bound and Name.bound: the names of loose bound variables in nets and printing.
95
- // Name.is_bound: the names the simplifier gives the free variables standing for bound ones.
96
87
  export const isBoundName = (name: string) => name.startsWith(":");
97
88
 
98
89
  export const boundName = (index: number) => `:${String(index).padStart(3, "0")}`;