tla-ts 0.0.9 → 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 +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -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 +3 -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 +1156 -888
  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 +330 -659
  41. package/src/cli/typescript.ts +23 -0
  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 +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  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 +137 -22
  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 -322
  64. package/src/liveness.ts +230 -133
  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 +36 -60
  88. package/src/parallel.ts +64 -73
  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 +135 -40
  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 +299 -108
  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 +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  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,25 +1,40 @@
1
- // Ported from Isabelle2025's Pure/Isar/method.ML (method syntax, combinators, SIMPLE_METHOD,
2
- // finish), the assume_rule_tac and norm_hhf_tac of Pure/goal.ML, and the methods the theories
3
- // tlapm writes use: auto, force and clarsimp (Provers/clasimp.ML), blast (Provers/blast.ML),
4
- // iprover (Tools/intuitionistic.ML) and intro. Copyright (c) 1986-2025 University of Cambridge,
5
- // Technische Universitaet Muenchen, and contributors, see LICENSE.
6
-
7
1
  import { TlaIsabelleError } from "../../../errors";
8
- import { asmRl, isNormHhf, normHhfEq, reflexiveThm, termI } from "../pure/drule";
9
- import { isEquals, stripImpPrems, stripAssumsConcl } from "../pure/logic";
10
- import { addSimps, emptySimpset, type Simpset } from "../pure/raw-simplifier";
11
- import { genericRewriteGoalTac } from "../pure/rewriter";
12
- import { filterSeq, mapsSeq, singleSeq, type Seq } from "../pure/seq";
2
+ import {
3
+ absDef,
4
+ asmRl,
5
+ equalsCong,
6
+ isNormHhf,
7
+ multiResolves,
8
+ normHhfEq,
9
+ reflexiveThm,
10
+ termI,
11
+ } from "../pure/drule";
12
+ import { isEquals, isImplies, listImplies, stripImpPrems, stripAssumsConcl } from "../pure/logic";
13
+ import { addSimps, congKey, makeSimpContext, type Simpset } from "../pure/raw-simplifier";
14
+ import { updateTable } from "../pure/table";
15
+ import { genericRewriteGoalTac, rewriteCterm, simpleProver } from "../pure/rewriter";
16
+ import { appendSeq, emptySeq, mapSeq, mapsSeq, ofCell, singleSeq, type Seq } from "../pure/seq";
17
+ import { fconvRule, premsConv } from "../pure/conv";
13
18
  import { atomizePremsTac } from "../pure/object-logic";
14
- import { normHhf } from "../pure/simplifier";
19
+ import { asmFullSimpTac, normHhf } from "../pure/simplifier";
15
20
  import type { Limits } from "../pure/interrupt";
16
- import { assumeTac, eresolveTac, flexflexTac, matchTac, resolveTac } from "../pure/tactic";
21
+ import {
22
+ assumeTac,
23
+ eresolveTac,
24
+ flexflexTac,
25
+ matchTac,
26
+ resolveTac,
27
+ type NetPair,
28
+ } from "../pure/tactic";
17
29
  import {
18
30
  allGoals,
31
+ allTac,
19
32
  appendGoal,
20
33
  changedProp,
21
34
  noTac,
22
35
  orElse,
36
+ primitive,
37
+ primSeq,
23
38
  repeatAllNew,
24
39
  subgoal,
25
40
  thenAllNew,
@@ -30,240 +45,175 @@ import {
30
45
  } from "../pure/tactical";
31
46
  import {
32
47
  addFreeNames,
48
+ addVars,
49
+ funTs,
50
+ listComb,
51
+ mapAtyps,
33
52
  maxidxOfTerm,
53
+ mkTVar,
34
54
  mkVar,
35
55
  stripAllBody,
36
56
  stripAllVars,
57
+ stripComb,
37
58
  substBounds,
59
+ aconv,
38
60
  type Term,
61
+ type Var,
39
62
  } from "../pure/term";
40
- import { nprems, trivial, type Thm } from "../pure/thm";
41
- import { variantList } from "../pure/name";
63
+ import {
64
+ assume,
65
+ bicompose,
66
+ conclOf,
67
+ forallIntr,
68
+ impliesElim,
69
+ impliesIntr,
70
+ incrIndexesThm,
71
+ instantiate,
72
+ nprems,
73
+ premsOf,
74
+ trivial,
75
+ type Thm,
76
+ } from "../pure/thm";
77
+ import { cleanName, variantList } from "../pure/name";
42
78
  import { autoTac, clarsimpTac, forceTac, type ClasimpContext } from "../provers/clasimp";
43
79
  import {
44
80
  addUnsafeDest,
45
81
  addUnsafeIntro,
82
+ clarifyTac,
83
+ fastTac,
46
84
  withClaset,
47
85
  type ClassicalContext,
48
86
  } from "../provers/classical";
49
- import { proverTac, type IntuitionisticContext } from "../tools/intuitionistic";
87
+ import {
88
+ findRulesNetpair,
89
+ proverTac,
90
+ type ContextRule,
91
+ type IntuitionisticContext,
92
+ } from "../tools/intuitionistic";
93
+ import { getThms, parseFactReferences } from "./attrib";
94
+ import type { IsarContext } from "./context";
95
+ import { casesMethod, type InductData } from "./induct";
50
96
  import { insertTac } from "./proof";
51
- import type { OuterToken } from "./theory";
97
+ import { syntaxError, type MethodText, type OuterToken } from "./theory";
52
98
 
53
- interface Modifier {
54
- readonly kind: "intro" | "dest";
55
- readonly facts: readonly string[];
56
- }
57
-
58
- type MethodText =
59
- | {
60
- readonly kind: "auto" | "blast" | "force" | "clarsimp";
61
- readonly modifiers: readonly Modifier[];
62
- }
63
- | { readonly kind: "iprover" }
64
- | { readonly kind: "intro"; readonly facts: readonly string[] }
65
- | { readonly kind: "then"; readonly methods: readonly MethodText[] }
66
- | { readonly kind: "try"; readonly method: MethodText };
67
-
68
- // The methods of by: the initial one, and the terminal one that qed runs.
69
- interface ProofText {
70
- readonly initial: MethodText;
71
- readonly terminal: MethodText | undefined;
72
- }
73
-
74
- // What a proof method reads from the Isabelle proof context.
75
99
  export interface ProofContext {
76
100
  readonly limits: Limits;
77
101
  readonly simpset: Simpset;
78
102
  readonly classical: ClassicalContext;
79
103
  readonly intuitionistic: IntuitionisticContext;
80
104
  readonly atomizeRules: readonly Thm[];
105
+ // PredicateLogic.thy's [symmetric, defn] rules, which Local_Defs.meta_rewrite_rule uses.
106
+ readonly defnRules: readonly Thm[];
107
+ readonly rulifyRules: readonly Thm[];
81
108
  readonly blastDepthTac: (context: ClassicalContext, limit: number) => GoalTactic;
82
109
  readonly blastTac: (context: ClassicalContext) => GoalTactic;
83
- readonly getFact: (name: string) => readonly Thm[];
110
+ // Context_Rules' netpairs: of the rules declared with "!", without a mark and with "?".
111
+ readonly contextRules: readonly NetPair<ContextRule>[];
112
+ readonly induct: InductData;
84
113
  }
85
114
 
86
- const syntaxError = (token: OuterToken | undefined) =>
87
- new TlaIsabelleError(
88
- "ERROR",
89
- `Outer syntax error at: ${token === undefined ? "end of input" : token.text}`,
90
- );
115
+ // A method refines the goal in the context of its proof block, which its cases extend.
116
+ export interface GoalState {
117
+ readonly context: IsarContext;
118
+ readonly goal: Thm;
119
+ }
91
120
 
92
- // Method.parse for the proof methods of by.
93
- export const parseProofText = (tokens: readonly OuterToken[]): ProofText => {
94
- let position = 0;
95
- const peek = () => tokens[position];
96
- const isSymbol = (symbol: string, offset = 0) =>
97
- tokens[position + offset]?.kind === "symbol" && tokens[position + offset].text === symbol;
98
- const expectSymbol = (symbol: string) => {
99
- if (!isSymbol(symbol)) throw syntaxError(peek());
100
- position += 1;
101
- };
102
- const isWord = () => peek()?.kind === "word";
103
- const word = () => {
104
- const token = peek();
105
- if (token?.kind !== "word") throw syntaxError(token);
106
- position += 1;
107
- return token.text;
108
- };
109
- const isSectionStart = () => isWord() && isSymbol(":", 1);
110
- const facts = () => {
111
- const names: string[] = [];
112
- while (isWord() && !isSectionStart()) names.push(word());
113
- return names;
114
- };
115
- const modifiers = (): Modifier[] => {
116
- const result: Modifier[] = [];
117
- while (isSectionStart()) {
118
- const kind = word();
119
- position += 1;
120
- if (kind !== "intro" && kind !== "dest")
121
- throw new TlaIsabelleError("ERROR", `Unsupported method modifier: ${kind}`);
122
- result.push({ kind, facts: facts() });
123
- }
124
- return result;
125
- };
126
- const method = (name: string, hasArgs: boolean): MethodText => {
127
- switch (name) {
128
- case "auto":
129
- case "blast":
130
- case "force":
131
- case "clarsimp":
132
- return { kind: name, modifiers: hasArgs ? modifiers() : [] };
133
- case "iprover":
134
- return { kind: "iprover" };
135
- case "intro":
136
- return { kind: "intro", facts: hasArgs ? facts() : [] };
137
- default:
138
- throw new TlaIsabelleError("ERROR", `Undefined method: ${name}`);
139
- }
140
- };
141
- const suffixed = (text: MethodText): MethodText => {
142
- if (!isSymbol("?")) return text;
143
- position += 1;
144
- return suffixed({ kind: "try", method: text });
145
- };
146
- const parenthesized = (): MethodText => {
147
- expectSymbol("(");
148
- const elements = [suffixed(isSymbol("(") ? parenthesized() : method(word(), true))];
149
- while (isSymbol(",")) {
150
- position += 1;
151
- elements.push(suffixed(isSymbol("(") ? parenthesized() : method(word(), true)));
152
- }
153
- expectSymbol(")");
154
- return elements.length === 1 ? elements[0] : { kind: "then", methods: elements };
121
+ type ContextTactic = (state: GoalState) => Seq<GoalState>;
122
+
123
+ export type Method = (facts: readonly Thm[]) => ContextTactic;
124
+
125
+ // Method.METHOD: a tactic that leaves the context as it is.
126
+ const toMethod =
127
+ (method: (facts: readonly Thm[]) => Tactic): Method =>
128
+ (facts) =>
129
+ (state) =>
130
+ mapSeq((goal: Thm) => ({ context: state.context, goal }), method(facts)(state.goal));
131
+
132
+ interface Modifier {
133
+ readonly kind: "intro" | "dest" | "simp";
134
+ readonly facts: readonly Thm[];
135
+ }
136
+
137
+ // Method.sections: each modifier, such as "simp add:", takes the facts up to the next one.
138
+ const parseModifiers = (isar: IsarContext, args: readonly OuterToken[]): Modifier[] => {
139
+ const headerLength = (position: number) => {
140
+ for (let length = 1; length <= 2; length += 1)
141
+ if (args[position + length]?.kind === "symbol" && args[position + length].text === ":")
142
+ return length;
143
+ return 0;
155
144
  };
156
- const atom = () => suffixed(isSymbol("(") ? parenthesized() : method(word(), false));
157
- const initial = atom();
158
- const terminal = position < tokens.length ? atom() : undefined;
159
- if (position !== tokens.length) throw syntaxError(peek());
160
- return { initial, terminal };
145
+ const modifiers: Modifier[] = [];
146
+ let position = 0;
147
+ while (position < args.length) {
148
+ const length = headerLength(position);
149
+ if (length === 0) throw syntaxError(args[position]);
150
+ const header = args
151
+ .slice(position, position + length)
152
+ .map((token) => token.text)
153
+ .join(" ");
154
+ position += length + 1;
155
+ const start = position;
156
+ while (position < args.length && headerLength(position) === 0) position += 1;
157
+ const facts = getThms(isar, parseFactReferences(args.slice(start, position)));
158
+ const kind =
159
+ header === "intro"
160
+ ? "intro"
161
+ : header === "dest"
162
+ ? "dest"
163
+ : header === "simp" || header === "simp add" || header === "add"
164
+ ? "simp"
165
+ : undefined;
166
+ if (kind === undefined)
167
+ throw new TlaIsabelleError("ERROR", `Unsupported method modifier: ${header}`);
168
+ modifiers.push({ kind, facts });
169
+ }
170
+ return modifiers;
161
171
  };
162
172
 
163
- const getFacts = (context: ProofContext, names: readonly string[]) =>
164
- names.flatMap((name) => context.getFact(name));
165
-
166
- // Method.sections: the claset the modifiers declare.
167
173
  const withModifiers = (context: ProofContext, modifiers: readonly Modifier[]): ClassicalContext =>
168
174
  modifiers.reduce(
169
175
  (classical, modifier) =>
170
- getFacts(context, modifier.facts).reduce(
171
- (current, fact) =>
172
- withClaset(
173
- current,
174
- modifier.kind === "intro"
175
- ? addUnsafeIntro(current, fact)
176
- : addUnsafeDest(current, fact),
176
+ modifier.kind === "simp"
177
+ ? classical
178
+ : modifier.facts.reduce(
179
+ (current, fact) =>
180
+ withClaset(
181
+ current,
182
+ modifier.kind === "intro"
183
+ ? addUnsafeIntro(current, fact, context.atomizeRules)
184
+ : addUnsafeDest(current, fact, context.atomizeRules),
185
+ ),
186
+ classical,
177
187
  ),
178
- classical,
179
- ),
180
188
  context.classical,
181
189
  );
182
190
 
183
- const getClasimp = (context: ProofContext, classical: ClassicalContext): ClasimpContext => ({
184
- classical,
185
- simp: { limits: context.limits, simpset: context.simpset, bounds: 0 },
191
+ const withSimps = (context: ProofContext, modifiers: readonly Modifier[]): Simpset => {
192
+ const simps = modifiers.flatMap((modifier) => (modifier.kind === "simp" ? modifier.facts : []));
193
+ return simps.length === 0
194
+ ? context.simpset
195
+ : addSimps({ limits: context.limits, simpset: context.simpset, bounds: 0 }, simps);
196
+ };
197
+
198
+ const getClasimp = (context: ProofContext, modifiers: readonly Modifier[]): ClasimpContext => ({
199
+ classical: withModifiers(context, modifiers),
200
+ simp: { limits: context.limits, simpset: withSimps(context, modifiers), bounds: 0 },
186
201
  blastDepthTac: context.blastDepthTac,
187
202
  });
188
203
 
189
204
  const insertAllTac = (context: ProofContext, facts: readonly Thm[]) =>
190
205
  allGoals((index) => insertTac(context.limits, facts, index));
191
206
 
192
- // SIMPLE_METHOD'
193
207
  const simpleMethodHead = (context: ProofContext, facts: readonly Thm[], tactic: GoalTactic) =>
194
208
  thenGoal((index) => insertTac(context.limits, facts, index), tactic)(1);
195
209
 
196
- type Method = (facts: readonly Thm[]) => Tactic;
197
-
198
- const evaluate = (context: ProofContext, text: MethodText): Method => {
199
- switch (text.kind) {
200
- case "auto":
201
- return (facts) =>
202
- thenTac(
203
- insertAllTac(context, facts),
204
- changedProp(autoTac(getClasimp(context, withModifiers(context, text.modifiers)))),
205
- );
206
- case "clarsimp":
207
- return (facts) =>
208
- simpleMethodHead(context, facts, (index) =>
209
- changedProp(
210
- clarsimpTac(getClasimp(context, withModifiers(context, text.modifiers)))(index),
211
- ),
212
- );
213
- case "force":
214
- return (facts) =>
215
- simpleMethodHead(
216
- context,
217
- facts,
218
- forceTac(
219
- getClasimp(context, withModifiers(context, text.modifiers)),
220
- context.atomizeRules,
221
- ),
222
- );
223
- case "blast":
224
- return (facts) =>
225
- simpleMethodHead(context, facts, context.blastTac(withModifiers(context, text.modifiers)));
226
- case "iprover":
227
- return (facts) =>
228
- simpleMethodHead(
229
- context,
230
- facts,
231
- thenGoal(
232
- atomizePremsTac(context.limits, context.atomizeRules),
233
- proverTac(context.intuitionistic),
234
- ),
235
- );
236
- case "intro":
237
- return (facts) => {
238
- const rules = getFacts(context, text.facts);
239
- return simpleMethodHead(context, facts, (index) =>
240
- changedProp(repeatAllNew(matchTac(context.limits, rules))(index)),
241
- );
242
- };
243
- case "then": {
244
- const methods = text.methods.map((method) => evaluate(context, method));
245
- return (facts) => (state) =>
246
- methods.reduce<Seq<Thm>>(
247
- (results, method) => mapsSeq(method(facts), results),
248
- singleSeq(state),
249
- );
250
- }
251
- case "try": {
252
- const method = evaluate(context, text.method);
253
- return (facts) => orElse(method(facts), (state) => singleSeq(state));
254
- }
255
- }
256
- };
257
-
258
- // Goal.norm_hhf_tac
259
- const normHhfTac = (limits: Limits): GoalTactic => {
260
- const empty = { limits, simpset: emptySimpset, bounds: 0 };
261
- const context = { ...empty, simpset: addSimps(empty, [normHhfEq]) };
210
+ export const normHhfTac = (limits: Limits): GoalTactic => {
211
+ const context = makeSimpContext(limits, [normHhfEq]);
262
212
  return thenGoal(
263
213
  resolveTac(limits, [asmRl]),
264
214
  subgoal((goal, index) =>
265
215
  isNormHhf(false, goal)
266
- ? (state) => singleSeq(state)
216
+ ? allTac
267
217
  : genericRewriteGoalTac(
268
218
  { simprem: true, useprem: false, mutsimp: false },
269
219
  () => undefined,
@@ -274,12 +224,204 @@ const normHhfTac = (limits: Limits): GoalTactic => {
274
224
  );
275
225
  };
276
226
 
277
- // Goal.assume_rule_tac: solves a goal with one of its non-atomic premises.
227
+ // Method.rule_tac: with facts, the rules first resolve against them.
228
+ const ruleTac = (limits: Limits, rules: readonly Thm[], facts: readonly Thm[]): GoalTactic =>
229
+ thenAllNew(
230
+ (index) => (state) =>
231
+ facts.length === 0
232
+ ? resolveTac(limits, rules)(index)(state)
233
+ : mapsSeq(
234
+ (rule) => resolveTac(limits, [rule])(index)(state),
235
+ multiResolves(limits, facts, rules),
236
+ ),
237
+ normHhfTac(limits),
238
+ );
239
+
240
+ // Classical.some_rule_tac: the rules of the context and the claset's extra rules that fit the
241
+ // goal, or the first fact as an elimination rule.
242
+ const someRuleTac = (context: ProofContext, facts: readonly Thm[]): GoalTactic =>
243
+ thenAllNew(
244
+ subgoal((goal, index) => {
245
+ const [bang, plain, query] = context.contextRules.map((netpair) =>
246
+ findRulesNetpair(false, facts, goal, netpair),
247
+ );
248
+ const extra = findRulesNetpair(true, facts, goal, context.classical.claset.extra);
249
+ return (state) =>
250
+ mapsSeq(
251
+ (rule) => resolveTac(context.limits, [rule])(index)(state),
252
+ multiResolves(context.limits, facts, [...bang, ...plain, ...extra, ...query]),
253
+ );
254
+ }),
255
+ normHhfTac(context.limits),
256
+ );
257
+
258
+ // Tactic.distinct_subgoals_tac: a subgoal that occurs again is solved by its first occurrence.
259
+ const distinctSubgoalsTac: Tactic = (state) => {
260
+ const prems = premsOf(state);
261
+ const distinct = prems.filter(
262
+ (prem, index) => prems.findIndex((other) => aconv(other, prem)) === index,
263
+ );
264
+ if (distinct.length === prems.length) return singleSeq(state);
265
+ const template = listImplies(prems, conclOf(state));
266
+ const rule = impliesIntr(
267
+ template,
268
+ distinct.reduceRight(
269
+ (result, prem) => impliesIntr(prem, result),
270
+ prems.reduce((result, prem) => impliesElim(result, assume(prem)), assume(template)),
271
+ ),
272
+ );
273
+ return singleSeq(impliesElim(rule, state));
274
+ };
275
+
276
+ // Class.standard_intro_classes_tac: without facts, intro_classes_tac, whose rules conclude
277
+ // OFCLASS, so they resolve with no TLA+ goal unless its conclusion is a variable.
278
+ const standardIntroClassesTac =
279
+ (facts: readonly Thm[]): Tactic =>
280
+ (state) => {
281
+ if (facts.length > 0 || nprems(state) === 0) return emptySeq;
282
+ if (premsOf(state).some((prem) => stripComb(stripAssumsConcl(prem))[0].kind === "Var"))
283
+ throw new TlaIsabelleError("ERROR", "Unsupported intro_classes on a flexible goal");
284
+ return distinctSubgoalsTac(state);
285
+ };
286
+
287
+ // Proof_Context.fact_tac: a fact closes the goal by composition, lifted over its parameters.
288
+ const factTac = (limits: Limits, facts: readonly Thm[]): GoalTactic =>
289
+ thenGoal(normHhfTac(limits), (index) =>
290
+ facts.reduceRight<Tactic>(
291
+ (rest, fact) => (state) =>
292
+ appendSeq(
293
+ primSeq((current: Thm) =>
294
+ bicompose(
295
+ limits,
296
+ { flatten: true, match: false, incremented: true },
297
+ {
298
+ isElim: false,
299
+ rule: liftAll(index, current, incrIndexesThm(current.maxidx + 1, fact)),
300
+ subgoals: 0,
301
+ },
302
+ index,
303
+ current,
304
+ ),
305
+ )(state),
306
+ rest(state),
307
+ ),
308
+ noTac,
309
+ ),
310
+ );
311
+
312
+ // Drule.lift_all: the fact's variables become functions of the goal's parameters.
313
+ const liftAll = (index: number, state: Thm, fact: Thm): Thm => {
314
+ const vars = stripAllVars(stripImpPrems(state.prop)[index - 1]);
315
+ const names = variantList(
316
+ [],
317
+ vars.map((variable) => cleanName(variable.name)),
318
+ );
319
+ const params = vars.map((variable, position) =>
320
+ mkVar(
321
+ names[position],
322
+ fact.maxidx + 1,
323
+ mapAtyps(
324
+ (atom) =>
325
+ atom.kind === "TVar" ? mkTVar(atom.name, atom.index + fact.maxidx + 1, atom.sort) : atom,
326
+ variable.type,
327
+ ),
328
+ ),
329
+ );
330
+ const factVars = [fact.prop, ...fact.tpairs.flat()].reduceRight<Var[]>(
331
+ (found, term) => addVars(term, found),
332
+ [],
333
+ );
334
+ return params.reduceRight(
335
+ (result, param) => forallIntr(param, result),
336
+ instantiate(
337
+ factVars.map((variable) => ({
338
+ variable,
339
+ term: listComb(
340
+ mkVar(
341
+ variable.name,
342
+ variable.index,
343
+ funTs(
344
+ params.map((param) => param.type),
345
+ variable.type,
346
+ ),
347
+ ),
348
+ params,
349
+ ),
350
+ })),
351
+ fact,
352
+ ),
353
+ );
354
+ };
355
+
356
+ // Local_Defs.meta_rewrite_conv: object-level equations and implications become meta-level ones,
357
+ // and Drule.equals_cong leaves meta-level equations alone.
358
+ export const metaRewriteConv = (context: ProofContext, term: Term): Thm => {
359
+ const defnContext = makeSimpContext(context.limits, context.defnRules);
360
+ return rewriteCterm(
361
+ { simprem: false, useprem: false, mutsimp: false },
362
+ () => undefined,
363
+ {
364
+ ...defnContext,
365
+ simpset: {
366
+ ...defnContext.simpset,
367
+ congs: updateTable(
368
+ defnContext.simpset.congs,
369
+ congKey({ isConst: true, name: "Pure.eq" }),
370
+ equalsCong,
371
+ ),
372
+ },
373
+ },
374
+ term,
375
+ );
376
+ };
377
+
378
+ const metaRewriteRule = (context: ProofContext, thm: Thm): Thm =>
379
+ fconvRule((term) => metaRewriteConv(context, term), thm);
380
+
381
+ export const rewriteRule = (limits: Limits, rules: readonly Thm[], thm: Thm): Thm =>
382
+ rules.length === 0
383
+ ? thm
384
+ : fconvRule(
385
+ (term) =>
386
+ rewriteCterm(
387
+ { simprem: true, useprem: false, mutsimp: false },
388
+ simpleProver,
389
+ makeSimpContext(limits, rules),
390
+ term,
391
+ ),
392
+ thm,
393
+ );
394
+
395
+ const rewriteGoalsRule = (limits: Limits, rules: readonly Thm[], state: Thm): Thm =>
396
+ fconvRule(
397
+ premsConv((term) =>
398
+ rewriteCterm(
399
+ { simprem: true, useprem: true, mutsimp: true },
400
+ simpleProver,
401
+ makeSimpContext(limits, rules),
402
+ term,
403
+ ),
404
+ ),
405
+ state,
406
+ );
407
+
408
+ // Local_Defs.gen_unfold: the rules rewrite, then again as abstractions, which unfold the constants
409
+ // they define where they are unapplied.
410
+ const genUnfold =
411
+ (rewrite: (limits: Limits, rules: readonly Thm[], thm: Thm) => Thm) =>
412
+ (context: ProofContext, rules: readonly Thm[], thm: Thm): Thm => {
413
+ const metaRules = rules.map((rule) => metaRewriteRule(context, rule));
414
+ const absRules = metaRules.map((rule) => (isEquals(rule.prop) ? absDef(rule) : rule));
415
+ return rewrite(context.limits, absRules, rewrite(context.limits, metaRules, thm));
416
+ };
417
+
418
+ export const unfoldRule = genUnfold(rewriteRule);
419
+ export const unfoldGoals = genUnfold(rewriteGoalsRule);
420
+
278
421
  const assumeRuleTac = (limits: Limits): GoalTactic =>
279
422
  thenGoal(
280
423
  normHhfTac(limits),
281
424
  subgoal((goal, index) => {
282
- // Variable.focus_cterm and Variable.export: the parameters become schematic variables.
283
425
  const params = stripAllVars(goal);
284
426
  const names = variantList(
285
427
  addFreeNames(goal, []),
@@ -292,11 +434,8 @@ const assumeRuleTac = (limits: Limits): GoalTactic =>
292
434
  );
293
435
  const rules = stripImpPrems(body).filter(
294
436
  (prem) =>
295
- prem.kind === "App" &&
296
- ((prem.fun.kind === "App" &&
297
- prem.fun.fun.kind === "Const" &&
298
- prem.fun.fun.name === "Pure.imp") ||
299
- (prem.fun.kind === "Const" && prem.fun.name === "Pure.all")),
437
+ isImplies(prem) ||
438
+ (prem.kind === "App" && prem.fun.kind === "Const" && prem.fun.name === "Pure.all"),
300
439
  );
301
440
  return rules.reduceRight<GoalTactic>(
302
441
  (tactic, rule) =>
@@ -309,7 +448,6 @@ const assumeRuleTac = (limits: Limits): GoalTactic =>
309
448
  }),
310
449
  );
311
450
 
312
- // Method.assm_tac
313
451
  const assmTac = (limits: Limits): GoalTactic => {
314
452
  const condRtac = (isRule: (concl: Term) => boolean, rule: Thm) =>
315
453
  subgoal((goal, index) =>
@@ -331,7 +469,6 @@ const assmTac = (limits: Limits): GoalTactic => {
331
469
  );
332
470
  };
333
471
 
334
- // Method.all_assm_tac
335
472
  const allAssmTac =
336
473
  (limits: Limits) =>
337
474
  (index: number): Tactic =>
@@ -343,25 +480,172 @@ const allAssmTac =
343
480
  allAssmTac(limits)(index + 1),
344
481
  )(state);
345
482
 
346
- // Proof.local_terminal_proof: by initial terminal runs the initial method with the facts, then
347
- // the terminal one without them and Method.finish, and succeeds on the first result that leaves
348
- // no goal.
349
- export const terminalProof = (
483
+ // Method.finish of an immediate proof, as qed and by are: assumptions finish the closing step.
484
+ export const finishTac =
485
+ (limits: Limits): Tactic =>
486
+ (state) =>
487
+ mapsSeq(flexflexTac(limits), allAssmTac(limits)(1)(state));
488
+
489
+ // Seq.REPEAT, depth first.
490
+ const repeat =
491
+ (tactic: ContextTactic): ContextTactic =>
492
+ (state) => {
493
+ const results = tactic(state);
494
+ const cell = results.pull();
495
+ return cell === undefined
496
+ ? singleSeq(state)
497
+ : appendSeq(repeat(tactic)(cell[0]), mapsSeq(repeat(tactic), cell[1]));
498
+ };
499
+
500
+ const orElseContext =
501
+ (first: ContextTactic, second: ContextTactic): ContextTactic =>
502
+ (state) => {
503
+ const cell = first(state).pull();
504
+ return cell === undefined ? second(state) : ofCell(cell);
505
+ };
506
+
507
+ const methodSource = (
350
508
  context: ProofContext,
351
- text: ProofText,
352
- facts: readonly Thm[],
353
- state: Thm,
354
- ): Seq<Thm> => {
355
- const initial = evaluate(context, text.initial);
356
- const terminal = text.terminal === undefined ? undefined : evaluate(context, text.terminal);
357
- const finish: Tactic = (result) =>
358
- mapsSeq(flexflexTac(context.limits), allAssmTac(context.limits)(1)(result));
359
- return filterSeq(
360
- (result) => nprems(result) === 0,
361
- mapsSeq(
362
- (result) =>
363
- mapsSeq(finish, terminal === undefined ? singleSeq(result) : terminal([])(result)),
364
- initial(facts)(state),
365
- ),
366
- );
509
+ isar: IsarContext,
510
+ name: string,
511
+ args: readonly OuterToken[],
512
+ ): ((facts: readonly Thm[]) => Tactic) => {
513
+ const thms = () => getThms(isar, parseFactReferences(args));
514
+ const noArgs = () => {
515
+ if (args.length > 0) throw syntaxError(args[0]);
516
+ };
517
+ switch (name) {
518
+ case "auto": {
519
+ const modifiers = parseModifiers(isar, args);
520
+ return (facts) =>
521
+ thenTac(insertAllTac(context, facts), changedProp(autoTac(getClasimp(context, modifiers))));
522
+ }
523
+ case "clarsimp": {
524
+ const modifiers = parseModifiers(isar, args);
525
+ return (facts) =>
526
+ simpleMethodHead(context, facts, (index) =>
527
+ changedProp(clarsimpTac(getClasimp(context, modifiers))(index)),
528
+ );
529
+ }
530
+ case "force": {
531
+ const modifiers = parseModifiers(isar, args);
532
+ return (facts) =>
533
+ simpleMethodHead(
534
+ context,
535
+ facts,
536
+ forceTac(getClasimp(context, modifiers), context.atomizeRules),
537
+ );
538
+ }
539
+ case "blast": {
540
+ const modifiers = parseModifiers(isar, args);
541
+ return (facts) =>
542
+ simpleMethodHead(context, facts, context.blastTac(withModifiers(context, modifiers)));
543
+ }
544
+ case "fast": {
545
+ const modifiers = parseModifiers(isar, args);
546
+ return (facts) =>
547
+ simpleMethodHead(
548
+ context,
549
+ facts,
550
+ fastTac(withModifiers(context, modifiers), context.atomizeRules),
551
+ );
552
+ }
553
+ case "clarify": {
554
+ const modifiers = parseModifiers(isar, args);
555
+ return (facts) =>
556
+ simpleMethodHead(context, facts, (index) =>
557
+ changedProp(clarifyTac(withModifiers(context, modifiers))(index)),
558
+ );
559
+ }
560
+ case "simp": {
561
+ const modifiers = parseModifiers(isar, args);
562
+ if (modifiers.some((modifier) => modifier.kind !== "simp"))
563
+ throw new TlaIsabelleError("ERROR", "Unsupported method modifier for simp");
564
+ const simpset = withSimps(context, modifiers);
565
+ return (facts) =>
566
+ simpleMethodHead(context, facts, (index) =>
567
+ changedProp(asmFullSimpTac({ limits: context.limits, simpset, bounds: 0 })(index)),
568
+ );
569
+ }
570
+ case "iprover":
571
+ noArgs();
572
+ return (facts) =>
573
+ simpleMethodHead(
574
+ context,
575
+ facts,
576
+ thenGoal(
577
+ atomizePremsTac(context.limits, context.atomizeRules),
578
+ proverTac(context.intuitionistic),
579
+ ),
580
+ );
581
+ case "intro": {
582
+ const rules = thms();
583
+ return (facts) =>
584
+ simpleMethodHead(context, facts, (index) =>
585
+ changedProp(repeatAllNew(matchTac(context.limits, rules))(index)),
586
+ );
587
+ }
588
+ case "rule": {
589
+ const rules = thms();
590
+ return (facts) =>
591
+ rules.length === 0
592
+ ? someRuleTac(context, facts)(1)
593
+ : ruleTac(context.limits, rules, facts)(1);
594
+ }
595
+ case "standard":
596
+ noArgs();
597
+ return (facts) => orElse(someRuleTac(context, facts)(1), standardIntroClassesTac(facts));
598
+ case "fact": {
599
+ const rules = thms();
600
+ if (rules.length === 0) throw new TlaIsabelleError("ERROR", "Unsupported method: fact");
601
+ return (facts) => simpleMethodHead(context, facts, factTac(context.limits, rules));
602
+ }
603
+ case "unfold": {
604
+ const rules = thms();
605
+ return (facts) =>
606
+ thenTac(
607
+ insertAllTac(context, facts),
608
+ changedProp(primitive((state) => unfoldGoals(context, rules, state))),
609
+ );
610
+ }
611
+ case "-":
612
+ noArgs();
613
+ return (facts) => insertAllTac(context, facts);
614
+ default:
615
+ throw new TlaIsabelleError("ERROR", `Undefined method: ${name}`);
616
+ }
617
+ };
618
+
619
+ export const evaluate = (isar: IsarContext, text: MethodText): Method => {
620
+ const context = isar.tactics;
621
+ switch (text.kind) {
622
+ case "source":
623
+ return text.name === "cases"
624
+ ? casesMethod(isar, text.args)
625
+ : toMethod(methodSource(context, isar, text.name, text.args));
626
+ case "then": {
627
+ const methods = text.texts.map((inner) => evaluate(isar, inner));
628
+ return (facts) => (state) =>
629
+ methods.reduce<Seq<GoalState>>(
630
+ (results, method) => mapsSeq(method(facts), results),
631
+ singleSeq(state),
632
+ );
633
+ }
634
+ case "orelse": {
635
+ const methods = text.texts.map((inner) => evaluate(isar, inner));
636
+ return (facts) =>
637
+ methods.reduceRight<ContextTactic>(
638
+ (rest, method) => orElseContext(method(facts), rest),
639
+ () => emptySeq,
640
+ );
641
+ }
642
+ case "try": {
643
+ const method = evaluate(isar, text.texts[0]);
644
+ return (facts) => orElseContext(method(facts), (state) => singleSeq(state));
645
+ }
646
+ case "repeat1": {
647
+ const method = evaluate(isar, text.texts[0]);
648
+ return (facts) => (state) => mapsSeq(repeat(method(facts)), method(facts)(state));
649
+ }
650
+ }
367
651
  };