tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.28c823e4b

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 (390) hide show
  1. package/README.md +7 -0
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +3 -3
  4. package/dist/deciders.cjs +28 -28
  5. package/dist/deciders.js +52 -52
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +105 -10
  8. package/dist/index.d.ts +105 -10
  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 +116 -36
  15. package/dist/prove.js +116 -36
  16. package/dist/run.cjs +143 -31
  17. package/dist/run.js +143 -31
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +129 -104
  21. package/dist/transfer.js +129 -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 +4 -23
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +40 -78
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check.ts +564 -366
  30. package/src/cli/options.ts +10 -5
  31. package/src/cli/run.ts +0 -2
  32. package/src/cli/runtime-invariants.ts +136 -0
  33. package/src/cli/shared.ts +18 -11
  34. package/src/cli/tlapm.ts +0 -12
  35. package/src/cli/tlc-arguments.ts +640 -0
  36. package/src/cli/tlc-usage.ts +361 -0
  37. package/src/cli/tlc.ts +525 -216
  38. package/src/cli/typescript.ts +0 -3
  39. package/src/cli/xml-exporter.ts +4 -16
  40. package/src/cli.ts +0 -1
  41. package/src/codegen.ts +191 -64
  42. package/src/config.ts +140 -109
  43. package/src/coverage.ts +837 -0
  44. package/src/dependencies.ts +6 -40
  45. package/src/dfid.ts +618 -0
  46. package/src/environment.ts +237 -119
  47. package/src/errors.ts +56 -56
  48. package/src/evaluate.ts +543 -341
  49. package/src/exit-codes.ts +37 -3
  50. package/src/fingerprints.ts +10 -10
  51. package/src/index.ts +3 -0
  52. package/src/instances.ts +38 -31
  53. package/src/java-overrides.ts +4 -19
  54. package/src/json-reader.ts +455 -0
  55. package/src/json.ts +255 -139
  56. package/src/levels.ts +8 -17
  57. package/src/lexer.ts +80 -100
  58. package/src/liveness-checker.ts +77 -117
  59. package/src/liveness.ts +106 -62
  60. package/src/obligations/action.ts +4 -28
  61. package/src/obligations/anonymize.ts +84 -80
  62. package/src/obligations/equality.ts +1 -1
  63. package/src/obligations/expression.ts +2 -19
  64. package/src/obligations/format.ts +1 -9
  65. package/src/obligations/generate.ts +1 -11
  66. package/src/obligations/index.ts +0 -11
  67. package/src/obligations/levels.ts +4 -8
  68. package/src/obligations/module.ts +1 -15
  69. package/src/obligations/normalize.ts +5 -24
  70. package/src/obligations/operators.ts +1 -2
  71. package/src/obligations/pragma.ts +1 -10
  72. package/src/obligations/printer.ts +47 -46
  73. package/src/obligations/proof.ts +1 -5
  74. package/src/obligations/regroup.ts +1 -4
  75. package/src/obligations/simplify.ts +3 -14
  76. package/src/obligations/source.ts +1 -21
  77. package/src/obligations/subexpression.ts +5 -11
  78. package/src/obligations/substitution.ts +1 -3
  79. package/src/obligations/temporal.ts +8 -14
  80. package/src/obligations/tuples.ts +3 -9
  81. package/src/parallel-worker.ts +24 -33
  82. package/src/parallel.ts +48 -40
  83. package/src/parser.ts +565 -282
  84. package/src/pcal/ast.ts +53 -86
  85. package/src/pcal/parse.ts +144 -219
  86. package/src/pcal/tokenize.ts +91 -131
  87. package/src/pcal/translate.ts +83 -130
  88. package/src/pcal/validate.ts +48 -68
  89. package/src/pretty-print.ts +7 -8
  90. package/src/prover/decide-pool.ts +5 -10
  91. package/src/prover/deciders.ts +0 -4
  92. package/src/prover/first-order.ts +0 -11
  93. package/src/prover/isabelle/decide.ts +0 -6
  94. package/src/prover/isabelle/encode.ts +11 -23
  95. package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
  96. package/src/prover/isabelle/isar/method.ts +25 -38
  97. package/src/prover/isabelle/isar/proof.ts +1 -10
  98. package/src/prover/isabelle/isar/statement.ts +1 -6
  99. package/src/prover/isabelle/isar/theory.ts +15 -26
  100. package/src/prover/isabelle/isar/type-check.ts +11 -25
  101. package/src/prover/isabelle/provers/blast/blast.ts +10 -41
  102. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  103. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  104. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  105. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  106. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  107. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  108. package/src/prover/isabelle/provers/classical.ts +14 -42
  109. package/src/prover/isabelle/provers/hypsubst.ts +11 -25
  110. package/src/prover/isabelle/pure/bicompose.ts +16 -13
  111. package/src/prover/isabelle/pure/consts.ts +1 -7
  112. package/src/prover/isabelle/pure/conv.ts +1 -9
  113. package/src/prover/isabelle/pure/drule.ts +24 -40
  114. package/src/prover/isabelle/pure/envir.ts +3 -52
  115. package/src/prover/isabelle/pure/goal.ts +1 -7
  116. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  117. package/src/prover/isabelle/pure/list.ts +0 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -14
  119. package/src/prover/isabelle/pure/name.ts +2 -9
  120. package/src/prover/isabelle/pure/net.ts +3 -59
  121. package/src/prover/isabelle/pure/object-logic.ts +3 -10
  122. package/src/prover/isabelle/pure/pattern.ts +2 -19
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
  124. package/src/prover/isabelle/pure/rewriter.ts +26 -58
  125. package/src/prover/isabelle/pure/search.ts +3 -10
  126. package/src/prover/isabelle/pure/seq.ts +1 -10
  127. package/src/prover/isabelle/pure/simplifier.ts +4 -12
  128. package/src/prover/isabelle/pure/table.ts +1 -31
  129. package/src/prover/isabelle/pure/tactic.ts +12 -22
  130. package/src/prover/isabelle/pure/tactical.ts +6 -12
  131. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  132. package/src/prover/isabelle/pure/term.ts +2 -43
  133. package/src/prover/isabelle/pure/thm.ts +13 -36
  134. package/src/prover/isabelle/pure/type.ts +2 -15
  135. package/src/prover/isabelle/pure/unify.ts +20 -30
  136. package/src/prover/isabelle/pure/variable.ts +3 -7
  137. package/src/prover/isabelle/tla/classical-setup.ts +9 -19
  138. package/src/prover/isabelle/tla/context.ts +8 -16
  139. package/src/prover/isabelle/tla/logic.ts +4 -11
  140. package/src/prover/isabelle/tla/simpdata.ts +46 -34
  141. package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
  142. package/src/prover/ocaml.ts +0 -6
  143. package/src/prover/prep/action.ts +4 -36
  144. package/src/prover/prep/enabled-axioms.ts +12 -19
  145. package/src/prover/prep/fingerprint.ts +0 -16
  146. package/src/prover/prep/level-comparison.ts +8 -12
  147. package/src/prover/prep/md5.ts +0 -2
  148. package/src/prover/prep/methods.ts +9 -36
  149. package/src/prover/prep/normalize.ts +4 -28
  150. package/src/prover/prove-worker.ts +0 -2
  151. package/src/prover/prove.ts +0 -36
  152. package/src/prover/ptl/decide.ts +7 -12
  153. package/src/prover/ptl/encode.ts +14 -36
  154. package/src/prover/ptl/sat.ts +24 -32
  155. package/src/prover/ptl/tableau.ts +12 -26
  156. package/src/prover/smt/axioms.ts +0 -7
  157. package/src/prover/smt/context.ts +19 -26
  158. package/src/prover/smt/data.ts +51 -54
  159. package/src/prover/smt/encode.ts +14 -35
  160. package/src/prover/smt/extensionality.ts +0 -10
  161. package/src/prover/smt/flatten.ts +3 -22
  162. package/src/prover/smt/format.ts +5 -10
  163. package/src/prover/smt/instances.ts +0 -10
  164. package/src/prover/smt/rewrite.ts +66 -101
  165. package/src/prover/smt/solver/act-cache.ts +0 -15
  166. package/src/prover/smt/solver/arith-rewriter.ts +3 -48
  167. package/src/prover/smt/solver/array.ts +1 -3
  168. package/src/prover/smt/solver/asserted-formulas.ts +1 -43
  169. package/src/prover/smt/solver/ast-lt.ts +1 -11
  170. package/src/prover/smt/solver/ast-util.ts +1 -6
  171. package/src/prover/smt/solver/ast.ts +1 -143
  172. package/src/prover/smt/solver/auf-solver.ts +6 -39
  173. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  174. package/src/prover/smt/solver/cg-table.ts +1 -18
  175. package/src/prover/smt/solver/clause.ts +1 -27
  176. package/src/prover/smt/solver/conflict-resolution.ts +0 -9
  177. package/src/prover/smt/solver/context.ts +4 -61
  178. package/src/prover/smt/solver/ctx-simplify.ts +14 -41
  179. package/src/prover/smt/solver/der.ts +2 -21
  180. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  181. package/src/prover/smt/solver/e-matching.ts +3 -34
  182. package/src/prover/smt/solver/enode.ts +1 -21
  183. package/src/prover/smt/solver/expr-ref.ts +1 -5
  184. package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
  185. package/src/prover/smt/solver/fingerprints.ts +1 -12
  186. package/src/prover/smt/solver/flat-literals.ts +1 -9
  187. package/src/prover/smt/solver/goal.ts +2 -14
  188. package/src/prover/smt/solver/hash.ts +0 -8
  189. package/src/prover/smt/solver/hashtable.ts +1 -12
  190. package/src/prover/smt/solver/internalizer.ts +6 -98
  191. package/src/prover/smt/solver/lbool.ts +1 -2
  192. package/src/prover/smt/solver/literal.ts +0 -3
  193. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  194. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  195. package/src/prover/smt/solver/lp/containers.ts +12 -30
  196. package/src/prover/smt/solver/lp/core-solver.ts +10 -31
  197. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  198. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  199. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  200. package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
  201. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  202. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  203. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  204. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  205. package/src/prover/smt/solver/lp/int-cube.ts +15 -36
  206. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  207. package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
  208. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  209. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  210. package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
  211. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  212. package/src/prover/smt/solver/lp/nex.ts +1 -6
  213. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  214. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  215. package/src/prover/smt/solver/lp/nla-core.ts +35 -130
  216. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  217. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  218. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  219. package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
  220. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  221. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  222. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  223. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  224. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  225. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  226. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  227. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  228. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  229. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  230. package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
  231. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  232. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  233. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  234. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  235. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  236. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  237. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  238. package/src/prover/smt/solver/lp/union-find.ts +1 -6
  239. package/src/prover/smt/solver/mam-compiler.ts +14 -56
  240. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  241. package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
  242. package/src/prover/smt/solver/model-checker.ts +2 -36
  243. package/src/prover/smt/solver/model-evaluator.ts +3 -29
  244. package/src/prover/smt/solver/model-finder.ts +3 -15
  245. package/src/prover/smt/solver/model-generator.ts +1 -12
  246. package/src/prover/smt/solver/model-macro-solver.ts +12 -69
  247. package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
  248. package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
  249. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  250. package/src/prover/smt/solver/nlsat/explain.ts +3 -47
  251. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
  252. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
  253. package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
  254. package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
  255. package/src/prover/smt/solver/nlsat/solver.ts +7 -67
  256. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  257. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
  258. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  259. package/src/prover/smt/solver/nnf.ts +3 -38
  260. package/src/prover/smt/solver/pattern-inference.ts +2 -15
  261. package/src/prover/smt/solver/poly-rewriter.ts +3 -23
  262. package/src/prover/smt/solver/propagate-values.ts +1 -10
  263. package/src/prover/smt/solver/proto-model.ts +3 -48
  264. package/src/prover/smt/solver/pull-quant.ts +1 -12
  265. package/src/prover/smt/solver/qe-lite-der.ts +1 -29
  266. package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
  267. package/src/prover/smt/solver/qe-lite.ts +3 -33
  268. package/src/prover/smt/solver/qi-queue.ts +1 -16
  269. package/src/prover/smt/solver/quant-tactics.ts +5 -22
  270. package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
  271. package/src/prover/smt/solver/quantifier-manager.ts +1 -8
  272. package/src/prover/smt/solver/random-gen.ts +1 -2
  273. package/src/prover/smt/solver/rational.ts +1 -8
  274. package/src/prover/smt/solver/ref-vector.ts +1 -6
  275. package/src/prover/smt/solver/relevancy.ts +2 -15
  276. package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
  277. package/src/prover/smt/solver/rewriter.ts +3 -85
  278. package/src/prover/smt/solver/rlimit.ts +2 -20
  279. package/src/prover/smt/solver/smtlib-parser.ts +2 -37
  280. package/src/prover/smt/solver/solver.ts +1 -16
  281. package/src/prover/smt/solver/sort.ts +1 -5
  282. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  283. package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
  284. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
  285. package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
  286. package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
  287. package/src/prover/smt/solver/theory-lra-model.ts +4 -19
  288. package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
  289. package/src/prover/smt/solver/theory-lra-state.ts +3 -8
  290. package/src/prover/smt/solver/theory-lra.ts +1 -8
  291. package/src/prover/smt/solver/var-subst.ts +2 -26
  292. package/src/prover/smt/table.ts +0 -8
  293. package/src/prover/tlapm/cache.ts +20 -25
  294. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  295. package/src/prover/tlapm/tlapm.ts +12 -17
  296. package/src/prover/verdict.ts +0 -2
  297. package/src/prover/zenon/check/check.ts +0 -9
  298. package/src/prover/zenon/check/definitions.ts +5 -15
  299. package/src/prover/zenon/check/equality.ts +0 -8
  300. package/src/prover/zenon/check/functions.ts +0 -4
  301. package/src/prover/zenon/check/keys.ts +0 -7
  302. package/src/prover/zenon/check/propositional.ts +0 -3
  303. package/src/prover/zenon/check/records.ts +0 -5
  304. package/src/prover/zenon/check/relations.ts +0 -13
  305. package/src/prover/zenon/check/rewrites.ts +0 -6
  306. package/src/prover/zenon/check/sets.ts +0 -3
  307. package/src/prover/zenon/check/terms.ts +0 -17
  308. package/src/prover/zenon/check/tla.ts +0 -6
  309. package/src/prover/zenon/decide.ts +0 -12
  310. package/src/prover/zenon/encode.ts +1 -8
  311. package/src/prover/zenon/eqrel.ts +0 -13
  312. package/src/prover/zenon/equality-rules.ts +0 -4
  313. package/src/prover/zenon/expr.ts +1 -26
  314. package/src/prover/zenon/index-table.ts +17 -38
  315. package/src/prover/zenon/isar-case.ts +9 -19
  316. package/src/prover/zenon/isar.ts +1 -29
  317. package/src/prover/zenon/limits.ts +0 -4
  318. package/src/prover/zenon/llproof.ts +0 -9
  319. package/src/prover/zenon/mltoll.ts +54 -76
  320. package/src/prover/zenon/node.ts +1 -11
  321. package/src/prover/zenon/ocaml.ts +1 -17
  322. package/src/prover/zenon/parse.ts +2 -7
  323. package/src/prover/zenon/phrase.ts +1 -11
  324. package/src/prover/zenon/proof.ts +0 -9
  325. package/src/prover/zenon/propositional-rules.ts +0 -5
  326. package/src/prover/zenon/rules.ts +2 -6
  327. package/src/prover/zenon/search.ts +1 -17
  328. package/src/prover/zenon/tla/functions.ts +57 -29
  329. package/src/prover/zenon/tla/llproof.ts +63 -70
  330. package/src/prover/zenon/tla/records.ts +56 -27
  331. package/src/prover/zenon/tla/rewrites.ts +12 -19
  332. package/src/prover/zenon/tla/sets.ts +68 -39
  333. package/src/prover/zenon/tla/terms.ts +0 -6
  334. package/src/prover/zenon/tla/tla.ts +59 -58
  335. package/src/randomization.ts +81 -35
  336. package/src/resolve.ts +12 -112
  337. package/src/runtime.ts +22 -22
  338. package/src/sany/builtins.ts +2 -5
  339. package/src/sany/generator.ts +149 -252
  340. package/src/sany/levels.ts +6 -34
  341. package/src/sany/lexer.ts +41 -61
  342. package/src/sany/linter.ts +1 -9
  343. package/src/sany/modules.ts +1 -5
  344. package/src/sany/nodes.ts +0 -31
  345. package/src/sany/parse-error.ts +39 -117
  346. package/src/sany/report.ts +29 -63
  347. package/src/sany/selectors.ts +15 -39
  348. package/src/sany/source.ts +1 -17
  349. package/src/sany/xml.ts +13 -63
  350. package/src/search.ts +495 -155
  351. package/src/simulate.ts +685 -0
  352. package/src/spec-description.ts +176 -69
  353. package/src/standard-definitions.ts +0 -4
  354. package/src/standard-modules.ts +254 -69
  355. package/src/state-graph.ts +50 -24
  356. package/src/subexpressions.ts +69 -52
  357. package/src/substitution-levels.ts +2 -3
  358. package/src/successors.ts +260 -91
  359. package/src/symmetry.ts +33 -25
  360. package/src/tableau.ts +27 -24
  361. package/src/tlc/fingerprint.ts +183 -67
  362. package/src/tlc/jar-data.ts +112 -6
  363. package/src/tlc/messages.ts +110 -44
  364. package/src/tlc/order.ts +37 -60
  365. package/src/tlc/random.ts +33 -45
  366. package/src/tlc/replay.ts +549 -217
  367. package/src/tlc/summary.ts +36 -47
  368. package/src/tlc/tlc-operators.ts +76 -41
  369. package/src/tlc/tlcext-operators.ts +139 -122
  370. package/src/tlc/trace-spec.ts +269 -0
  371. package/src/tlc/value-stream.ts +139 -0
  372. package/src/tlc/version.ts +1 -4
  373. package/src/transfer.ts +22 -25
  374. package/src/typescript/actions.ts +8 -21
  375. package/src/typescript/collections.ts +0 -15
  376. package/src/typescript/compile.ts +0 -5
  377. package/src/typescript/context.ts +0 -12
  378. package/src/typescript/emit.ts +0 -1
  379. package/src/typescript/expressions.ts +0 -12
  380. package/src/typescript/formula.ts +4 -12
  381. package/src/typescript/functions.ts +6 -17
  382. package/src/typescript/model.ts +10 -11
  383. package/src/typescript/names.ts +0 -2
  384. package/src/typescript/program.ts +0 -3
  385. package/src/typescript/properties.ts +6 -8
  386. package/src/typescript/scope.ts +0 -5
  387. package/src/typescript/steps.ts +0 -10
  388. package/src/typescript/types.ts +1 -8
  389. package/src/values.ts +749 -330
  390. package/src/worker.ts +7 -8
@@ -1,7 +1,4 @@
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.
1
+ // Ported from Isabelle2025's Pure/envir.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
5
2
 
6
3
  import { TlaIsabelleError } from "../../../errors";
7
4
  import {
@@ -36,7 +33,7 @@ import {
36
33
  type Typ,
37
34
  type Var,
38
35
  } from "./term";
39
- import { devar, emptyTyEnv, normType, substType, unifiedTypes, type TyEnv } from "./type";
36
+ import { devar, emptyTyEnv, normType, unifiedTypes, type TyEnv } from "./type";
40
37
 
41
38
  export interface Binding {
42
39
  readonly type: Typ;
@@ -63,7 +60,6 @@ const initEnvir = emptyEnvir(-1);
63
60
 
64
61
  export const isEmptyEnvir = (envir: Envir) => isEmptyTable(envir.tenv) && isEmptyTable(envir.tyenv);
65
62
 
66
- // radixstring (26, "a", n)
67
63
  const radixString = (value: number): string => {
68
64
  const digits: number[] = [];
69
65
  let remaining = value;
@@ -74,7 +70,6 @@ const radixString = (value: number): string => {
74
70
  return digits.map((digit) => String.fromCharCode(97 + digit)).join("");
75
71
  };
76
72
 
77
- // Envir.genvars: fresh variables with an index above every present one.
78
73
  export const genvars = (name: string, envir: Envir, types: readonly Typ[]): [Envir, Var[]] => {
79
74
  const index = envir.maxidx + 1;
80
75
  const vars = types.map((type, position) =>
@@ -88,17 +83,14 @@ export const genvar = (name: string, envir: Envir, type: Typ): [Envir, Var] => {
88
83
  return [updated, vars[0]];
89
84
  };
90
85
 
91
- // Envir.lookup1: lookup without chasing type assignments, for environments from matching.
92
86
  export const lookup1 = (tenv: TEnv, variable: Var): Term | undefined => {
93
87
  const binding = lookupTable(tenv, variable);
94
88
  if (binding === undefined) return undefined;
95
- if (!eqTypExact(variable.type, binding.type))
89
+ if (!unifiedTypes(emptyTyEnv, variable.type, binding.type))
96
90
  throw new TlaIsabelleError("TYPE", "Variable has two distinct types");
97
91
  return binding.term;
98
92
  };
99
93
 
100
- const eqTypExact = (left: Typ, right: Typ) => unifiedTypes(emptyTyEnv, left, right);
101
-
102
94
  export const lookup = (envir: Envir, variable: Var): Term | undefined => {
103
95
  const binding = lookupTable(envir.tenv, variable);
104
96
  if (binding === undefined) return undefined;
@@ -120,7 +112,6 @@ export const update = (variable: Var, term: Term, envir: Envir): Envir => {
120
112
  };
121
113
  };
122
114
 
123
- // Envir.above: whether the least index updated exceeds limit.
124
115
  export const above = (envir: Envir, limit: number) => {
125
116
  const term = minTable(envir.tenv);
126
117
  const type = minTable(envir.tyenv);
@@ -129,7 +120,6 @@ export const above = (envir: Envir, limit: number) => {
129
120
  );
130
121
  };
131
122
 
132
- // Envir.vupdate: an assignment that suppresses higher indexes between variables.
133
123
  export const vupdate = (variable: Var, term: Term, envir: Envir): Envir => {
134
124
  if (term.kind !== "Var") return update(variable, term, envir);
135
125
  if (variable.name === term.name && variable.index === term.index) return envir;
@@ -191,7 +181,6 @@ const normTerm2 = (envir: Envir, term: Term): Term => {
191
181
  }
192
182
  };
193
183
 
194
- // Envir.norm_term: instantiates the environment and beta-normalizes.
195
184
  export const normTerm = (envir: Envir, term: Term): Term => {
196
185
  if (isEmptyEnvir(envir) && !couldBetaContract(term)) return term;
197
186
  return isEmptyTable(envir.tyenv) ? normTerm1(envir.tenv, term) : normTerm2(envir, term);
@@ -199,7 +188,6 @@ export const normTerm = (envir: Envir, term: Term): Term => {
199
188
 
200
189
  export const betaNorm = (term: Term) => normTerm(initEnvir, term);
201
190
 
202
- // Envir.head_norm: normalizes the head only, for unification.
203
191
  export const headNorm = (envir: Envir, term: Term): Term => {
204
192
  if ((flagsOf(term) & (HAS_VAR | HAS_REDEX)) === 0) return term;
205
193
  switch (term.kind) {
@@ -250,7 +238,6 @@ const etaSame = (term: Term): Term => {
250
238
  return term;
251
239
  };
252
240
 
253
- // Envir.eta_contract
254
241
  export const etaContract = (term: Term) => (couldEtaContract(term) ? etaSame(term) : term);
255
242
 
256
243
  export const aeconv = (left: Term, right: Term) =>
@@ -275,7 +262,6 @@ export const envBinderTypes = (envir: Envir, type: Typ): Typ[] => {
275
262
  return [];
276
263
  };
277
264
 
278
- // Envir.fastype: the type of a term, chasing type assignments at applications.
279
265
  export const fastype = (envir: Envir, types: readonly Typ[], term: Term): Typ => {
280
266
  switch (term.kind) {
281
267
  case "App": {
@@ -294,38 +280,3 @@ export const fastype = (envir: Envir, types: readonly Typ[], term: Term): Typ =>
294
280
  return term.type;
295
281
  }
296
282
  };
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,6 +1,4 @@
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.
1
+ // Ported from Isabelle2025's Pure/goal.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
4
2
 
5
3
  import { TlaIsabelleError } from "../../../errors";
6
4
  import { compNoFlatten, protectD, protectI } from "./drule";
@@ -8,10 +6,8 @@ import { emptySeq } from "./seq";
8
6
  import { primitive, thenTac, type GoalTactic, type Tactic } from "./tactical";
9
7
  import { nprems, permutePrems, type Thm } from "./thm";
10
8
 
11
- // A ==> ... ==> C becomes A ==> #(... ==> C), keeping count premises.
12
9
  const protect = (count: number, thm: Thm) => compNoFlatten(thm, count, 1, protectI);
13
10
 
14
- // A ==> ... ==> #C becomes A ==> ... ==> C.
15
11
  const conclude = (thm: Thm) => compNoFlatten(thm, nprems(thm), 1, protectD);
16
12
 
17
13
  const restrict = (index: number, count: number, state: Thm) => {
@@ -22,7 +18,6 @@ const restrict = (index: number, count: number, state: Thm) => {
22
18
 
23
19
  const unrestrict = (index: number, state: Thm) => permutePrems(0, 1 - index, conclude(state));
24
20
 
25
- // SELECT_GOAL: runs the tactic on goal index alone.
26
21
  export const selectGoal =
27
22
  (tactic: Tactic): GoalTactic =>
28
23
  (index) =>
@@ -37,7 +32,6 @@ export const selectGoal =
37
32
  )(state);
38
33
  };
39
34
 
40
- // PREFER_GOAL: runs the tactic with goal index moved to the front.
41
35
  export const preferGoal =
42
36
  (tactic: Tactic): GoalTactic =>
43
37
  (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,6 +1,4 @@
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.
1
+ // Ported from Isabelle2025's Pure/logic.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
4
2
 
5
3
  import { TlaIsabelleError } from "../../../errors";
6
4
  import { variantList } from "./name";
@@ -25,7 +23,6 @@ import {
25
23
  type Typ,
26
24
  } from "./term";
27
25
 
28
- // Logic.occs: whether a subterm of other is aconv to term.
29
26
  export const occs = (term: Term, other: Term): boolean =>
30
27
  mayOccur(term, other) &&
31
28
  (aconv(term, other) ||
@@ -52,7 +49,6 @@ export const mkEquals = (left: Term, right: Term) => {
52
49
  return mkApp(mkApp(mkConst("Pure.eq", funTs([type, type], propT)), left), right);
53
50
  };
54
51
 
55
- // A term c $ x $ y.
56
52
  interface ConstApp2 extends App {
57
53
  readonly fun: App;
58
54
  }
@@ -101,7 +97,6 @@ export const stripImpConcl = (term: Term): Term => {
101
97
  return current;
102
98
  };
103
99
 
104
- // Logic.strip_prems: removes count premises, returning them reversed onto premises.
105
100
  export const stripPrems = (
106
101
  count: number,
107
102
  premises: readonly Term[],
@@ -124,11 +119,9 @@ export const isProtected = (term: Term) =>
124
119
  export const mkTerm = (term: Term) =>
125
120
  mkApp(mkConst("Pure.term", funT(fastypeOf(term), propT)), term);
126
121
 
127
- // Logic.combound: term(Bound (start+count-1), ..., Bound start).
128
122
  export const combound = (term: Term, start: number, count: number): Term =>
129
123
  count > 0 ? mkApp(combound(term, start + 1, count - 1), mkBound(start)) : term;
130
124
 
131
- // Logic.rlist_abs: ([xn, ..., x1], body) to %x1 ... xn. body.
132
125
  export const rlistAbs = (binders: readonly Binder[], body: Term) =>
133
126
  binders.reduce((result, binder) => mkAbs(binder.name, binder.type, result), body);
134
127
 
@@ -141,7 +134,6 @@ const incrTVar = (increment: number, type: Typ) =>
141
134
  type,
142
135
  );
143
136
 
144
- // Logic.incr_indexes_operation: lifts the variables over the types and increments their indexes.
145
137
  const incrIndexesFixed = (
146
138
  fixed: readonly string[],
147
139
  types: readonly Typ[],
@@ -201,7 +193,6 @@ const isAllAbs = (
201
193
  term.fun.name === "Pure.all" &&
202
194
  term.arg.kind === "Abs";
203
195
 
204
- // Logic.lift_abs: lifts a term over the parameters of a goal.
205
196
  export const liftAbs = (increment: number, goal: Term, term: Term): Term => {
206
197
  const lift = (types: Typ[], current: Term): Term => {
207
198
  if (isConstApp2(current, "Pure.imp")) return lift(types, current.arg);
@@ -216,7 +207,6 @@ export const liftAbs = (increment: number, goal: Term, term: Term): Term => {
216
207
  return lift([], goal);
217
208
  };
218
209
 
219
- // Logic.lift_all: lifts a proposition over the parameters and premises of a goal.
220
210
  export const liftAll = (increment: number, goal: Term, term: Term): Term => {
221
211
  const lift = (types: Typ[], current: Term): Term => {
222
212
  if (isConstApp2(current, "Pure.imp"))
@@ -281,7 +271,6 @@ export const hasMetaPrems = (term: Term): boolean => {
281
271
  return false;
282
272
  };
283
273
 
284
- // Logic.remove_params: drops count parameters and premise number index.
285
274
  const removeParams = (count: number, index: number, term: Term): Term => {
286
275
  if (count === 0 && index <= 0) return term;
287
276
  if (isConstApp2(term, "Pure.imp"))
@@ -293,7 +282,6 @@ const removeParams = (count: number, index: number, term: Term): Term => {
293
282
  return term;
294
283
  };
295
284
 
296
- // Logic.flatten_params: moves all parameters to the front, renaming them apart.
297
285
  export const flattenParams = (index: number, term: Term) => {
298
286
  const params = stripParams(term);
299
287
  const names = variantList(
@@ -304,7 +292,6 @@ export const flattenParams = (index: number, term: Term) => {
304
292
  return listAll(vars, removeParams(vars.length, index, term));
305
293
  };
306
294
 
307
- // Logic.strip_assums_imp: strips at most count premises.
308
295
  const stripAssumsImp = (count: number, hyps: Term[], term: Term): [Term[], Term] => {
309
296
  if (count === 0) return [hyps, term];
310
297
  if (isConstApp2(term, "Pure.imp"))
@@ -1,8 +1,5 @@
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.
1
+ // Ported from Isabelle2025's Pure/name.ML and Pure/General/symbol.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
4
2
 
5
- // Symbol.explode: \<name> symbols count as one symbol.
6
3
  const explodeSymbols = (text: string): string[] => text.match(/\\<\^?[A-Za-z0-9_']*>|[^]/gu) ?? [];
7
4
 
8
5
  const isRawSymbolic = (symbol: string) => symbol.startsWith("\\<") && !symbol.startsWith("\\<^");
@@ -48,7 +45,6 @@ const cleanIndex = (name: string): [string, number] => {
48
45
 
49
46
  export const cleanName = (name: string) => cleanIndex(name)[0];
50
47
 
51
- // Name.context: the declared names with their latest renaming.
52
48
  export type NameContext = ReadonlyMap<string, string | undefined>;
53
49
 
54
50
  export const declareName = (name: string, context: NameContext): NameContext => {
@@ -65,7 +61,6 @@ export const emptyNameContext: NameContext = new Map([
65
61
  export const makeNameContext = (names: readonly string[]) =>
66
62
  names.reduce((context, name) => declareName(name, context), emptyNameContext);
67
63
 
68
- // Name.variant: a name distinct from the declared ones, keeping a suffix of underscores.
69
64
  export const variantName = (name: string, context: NameContext): [string, NameContext] => {
70
65
  const [base, count] = cleanIndex(name);
71
66
  if (!context.has(base)) return [base + "_".repeat(count), declareName(base, context)];
@@ -79,7 +74,7 @@ export const variantName = (name: string, context: NameContext): [string, NameCo
79
74
  return [current + "_".repeat(count), declareName(current, renamed)];
80
75
  };
81
76
 
82
- export const variantNames = (names: readonly string[], context: NameContext) => {
77
+ const variantNames = (names: readonly string[], context: NameContext) => {
83
78
  let current = context;
84
79
  return names.map((name) => {
85
80
  const [variant, next] = variantName(name, current);
@@ -91,8 +86,6 @@ export const variantNames = (names: readonly string[], context: NameContext) =>
91
86
  export const variantList = (used: readonly string[], names: readonly string[]) =>
92
87
  variantNames(names, makeNameContext(used));
93
88
 
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
89
  export const isBoundName = (name: string) => name.startsWith(":");
97
90
 
98
91
  export const boundName = (index: number) => `:${String(index).padStart(3, "0")}`;
@@ -1,15 +1,13 @@
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.
1
+ // Ported from Isabelle2025's Pure/net.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
3
2
 
3
+ import type { List } from "./list";
4
4
  import { boundName } from "./name";
5
5
  import {
6
6
  emptyTable,
7
7
  fastStringOrd,
8
8
  foldTable,
9
- isEmptyTable,
10
9
  lookupTable,
11
10
  updateTable,
12
- deleteTable,
13
11
  type Table,
14
12
  } from "./table";
15
13
  import { headOf, type Term } from "./term";
@@ -33,8 +31,6 @@ export type Net<Item> =
33
31
 
34
32
  export const emptyNet: Net<never> = { kind: "Leaf", items: [] };
35
33
 
36
- const isEmptyNet = <Item>(net: Net<Item>) => net.kind === "Leaf" && net.items.length === 0;
37
-
38
34
  const makeNode = <Item>(): Extract<Net<Item>, { kind: "Net" }> => ({
39
35
  kind: "Net",
40
36
  comb: emptyNet,
@@ -42,7 +38,6 @@ const makeNode = <Item>(): Extract<Net<Item>, { kind: "Net" }> => ({
42
38
  atoms: emptyTable(fastStringOrd),
43
39
  });
44
40
 
45
- // Net.key_of_term: preorder keys, with any term headed by a variable or an abstraction as a Var.
46
41
  export const keyOfTerm = (term: Term): NetKey[] => {
47
42
  const keys: NetKey[] = [];
48
43
  const add = (current: Term) => {
@@ -68,8 +63,6 @@ export const keyOfTerm = (term: Term): NetKey[] => {
68
63
  return keys;
69
64
  };
70
65
 
71
- // Net.insert: raises nothing on a duplicate here; insert_safe semantics with eq. It walks down
72
- // the keys and rebuilds the path bottom-up, so a long key list can't exhaust the stack.
73
66
  export const insertNet = <Item>(
74
67
  isEqual: (left: Item, right: Item) => boolean,
75
68
  keys: readonly NetKey[],
@@ -104,56 +97,7 @@ export const insertNet = <Item>(
104
97
  export const insertTermNet = <Item>(term: Term, item: Item, net: Net<Item>) =>
105
98
  insertNet(() => false, keyOfTerm(term), item, net) ?? net;
106
99
 
107
- const newNet = <Item>(node: Extract<Net<Item>, { kind: "Net" }>): Net<Item> =>
108
- isEmptyNet(node.comb) && isEmptyNet(node.var) && isEmptyTable(node.atoms) ? emptyNet : node;
109
-
110
- // Net.delete: undefined where Isabelle raises DELETE.
111
- const deleteNet = <Item>(
112
- isEqual: (left: Item, right: Item) => boolean,
113
- keys: readonly NetKey[],
114
- item: Item,
115
- net: Net<Item>,
116
- ): Net<Item> | undefined => {
117
- const del = (position: number, node: Net<Item>): Net<Item> | undefined => {
118
- if (node.kind === "Leaf") {
119
- if (position < keys.length) return undefined;
120
- const index = node.items.findIndex((other) => isEqual(other, item));
121
- if (index === -1) return undefined;
122
- return { kind: "Leaf", items: node.items.filter((other) => !isEqual(other, item)) };
123
- }
124
- if (position === keys.length) return undefined;
125
- const key = keys[position];
126
- if (key.kind === "Comb") {
127
- const comb = del(position + 1, node.comb);
128
- return comb && newNet({ ...node, comb });
129
- }
130
- if (key.kind === "Var") {
131
- const child = del(position + 1, node.var);
132
- return child && newNet({ ...node, var: child });
133
- }
134
- const existing = lookupTable(node.atoms, key.name);
135
- if (existing === undefined) return undefined;
136
- const child = del(position + 1, existing);
137
- if (child === undefined) return undefined;
138
- return newNet({
139
- ...node,
140
- atoms: isEmptyNet(child)
141
- ? deleteTable(node.atoms, key.name)
142
- : updateTable(node.atoms, key.name, child),
143
- });
144
- };
145
- return del(0, net);
146
- };
147
-
148
- export const deleteTermSafe = <Item>(
149
- isEqual: (left: Item, right: Item) => boolean,
150
- term: Term,
151
- item: Item,
152
- net: Net<Item>,
153
- ) => deleteNet(isEqual, keyOfTerm(term), item, net) ?? net;
154
-
155
- // The lists of nets that matching conses up, as Isabelle's lists.
156
- type Nets<Item> = { readonly head: Net<Item>; readonly tail: Nets<Item> } | undefined;
100
+ type Nets<Item> = List<Net<Item>> | undefined;
157
101
 
158
102
  const toArray = <Item>(nets: Nets<Item>) => {
159
103
  const array: Net<Item>[] = [];
@@ -1,23 +1,17 @@
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.
1
+ // Ported from Isabelle2025's Pure/Isar/object_logic.ML and Pure/tactic.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
4
2
 
5
3
  import { TlaIsabelleError } from "../../../errors";
6
4
  import { gconvRule, paramsConv, premsConv } from "./conv";
7
5
  import { hasMetaPrems } from "./logic";
8
- import { addSimps, emptySimpset } from "./raw-simplifier";
6
+ import { makeSimpContext } from "./raw-simplifier";
9
7
  import { rewriteCterm, simpleProver } from "./rewriter";
10
8
  import { emptySeq, singleSeq } from "./seq";
11
9
  import type { Limits } from "./interrupt";
12
10
  import type { GoalTactic } from "./tactical";
13
11
  import { reflexive, type Thm } from "./thm";
14
12
 
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
13
  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.
14
+ const context = makeSimpContext(limits, rules);
21
15
  const atomize = paramsConv(
22
16
  premsConv((term) =>
23
17
  rewriteCterm({ simprem: true, useprem: false, mutsimp: false }, simpleProver, context, term),
@@ -29,7 +23,6 @@ export const atomizePremsTac = (limits: Limits, rules: readonly Thm[]): GoalTact
29
23
  gconvRule((term) => (hasMetaPrems(term) ? atomize(term) : reflexive(term)), index, state),
30
24
  );
31
25
  } catch (error) {
32
- // CONVERSION fails on THM, CTERM, TERM and TYPE.
33
26
  if (
34
27
  error instanceof TlaIsabelleError &&
35
28
  (error.exception === "THM" || error.exception === "TERM" || error.exception === "TYPE")
@@ -1,12 +1,8 @@
1
- // Ported from Isabelle2025's Pure/pattern.ML and Pure/more_pattern.ML. Copyright (c) 1986-2025
2
- // University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
3
- //
4
- // Unification and matching of higher-order patterns. Isabelle signals failure with the
5
- // exceptions Unif, Pattern and MATCH; here they stay inside this module and the exported
6
- // functions return undefined instead.
1
+ // Ported from Isabelle2025's Pure/pattern.ML and Pure/more_pattern.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
7
2
 
8
3
  import { TlaIsabelleError } from "../../../errors";
9
4
  import { aeconv, genvar, headNorm, lookup, lookup1, update, type Envir, type TEnv } from "./envir";
5
+ import type { Binder } from "./logic";
10
6
  import { hasKey, indexnameOrd, updateTable } from "./table";
11
7
  import {
12
8
  eqTyp,
@@ -32,11 +28,6 @@ class Unif {}
32
28
  class NotPattern {}
33
29
  class Match {}
34
30
 
35
- interface Binder {
36
- name: string;
37
- type: Typ;
38
- }
39
-
40
31
  const occurs = (variable: Var, term: Term, envir: Envir): boolean => {
41
32
  const visit = (current: Term): boolean => {
42
33
  if ((flagsOf(current) & HAS_VAR) === 0) return false;
@@ -156,7 +147,6 @@ const mkNewHnf = (
156
147
  return update(variable, mkHnf(binders, indexes, fresh, args), updated);
157
148
  };
158
149
 
159
- // downto0 (is, n): whether is is [n, n - 1, ..., 0].
160
150
  const isDownto0 = (indexes: readonly number[], count: number) =>
161
151
  indexes.length === count + 1 && indexes.every((index, position) => index === count - position);
162
152
 
@@ -306,7 +296,6 @@ const flexflex2 = (
306
296
  : assign(rightVar, rightIndexes, leftVar, leftIndexes);
307
297
  };
308
298
 
309
- // Pattern.unify_types: undefined where Isabelle raises Unif.
310
299
  export const unifyTypesEnvir = (left: Typ, right: Typ, envir: Envir): Envir | undefined => {
311
300
  if (eqTyp(left, right)) return envir;
312
301
  const tyenv = unifyTypes(right, left, envir.tyenv);
@@ -420,7 +409,6 @@ type PatternUnifyResult =
420
409
  | { kind: "clash" }
421
410
  | { kind: "not a pattern" };
422
411
 
423
- // Pattern.unify: distinguishes a clash (Unif) from terms outside the pattern fragment (Pattern).
424
412
  export const unifyPattern = (left: Term, right: Term, envir: Envir): PatternUnifyResult => {
425
413
  try {
426
414
  return { kind: "unified", envir: unif([], left, right, envir) };
@@ -595,22 +583,18 @@ const catchMatch = (run: () => MatchEnv): MatchEnv | undefined => {
595
583
  }
596
584
  };
597
585
 
598
- // Pattern.match: undefined where Isabelle raises MATCH.
599
586
  export const matchPattern = (pattern: Term, object: Term, env: MatchEnv): MatchEnv | undefined =>
600
587
  catchMatch(() => higherOrderMatch(pattern, object, env));
601
588
 
602
- // Pattern.first_order_match
603
589
  export const firstOrderMatchPattern = (
604
590
  pattern: Term,
605
591
  object: Term,
606
592
  env: MatchEnv,
607
593
  ): MatchEnv | undefined => catchMatch(() => firstOrderMatch(pattern, object, env));
608
594
 
609
- // Pattern.matches
610
595
  export const matches = (pattern: Term, object: Term, tyenv: TyEnv, tenv: TEnv) =>
611
596
  matchPattern(pattern, object, { tyenv, tenv }) !== undefined;
612
597
 
613
- // Pattern.pattern
614
598
  export const isPattern = (term: Term): boolean => {
615
599
  if (term.kind === "Abs") return isPattern(term.body);
616
600
  const [head, args] = stripComb(term);
@@ -622,7 +606,6 @@ export const isPattern = (term: Term): boolean => {
622
606
  return args.every(isPattern);
623
607
  };
624
608
 
625
- // Pattern.first_order
626
609
  export const isFirstOrder = (term: Term): boolean => {
627
610
  if (term.kind === "Abs") return isFirstOrder(term.body);
628
611
  if (term.kind === "App")