tla-ts 0.0.3 → 0.0.4-dev.2a873ee

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 (370) hide show
  1. package/README.md +46 -115
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +194 -8
  8. package/dist/index.d.ts +194 -8
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +996 -0
  17. package/dist/prove.js +996 -0
  18. package/dist/run-cli.cjs +37 -20
  19. package/dist/run-cli.js +37 -20
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +1387 -18
  23. package/dist/transfer.js +1387 -18
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +24 -11
  27. package/src/ast.ts +149 -8
  28. package/src/bags.ts +4 -7
  29. package/src/builtins.ts +29 -11
  30. package/src/bundled-modules.ts +3 -3
  31. package/src/canonical.ts +4 -3
  32. package/src/check.ts +1540 -235
  33. package/src/cli-options.ts +12 -6
  34. package/src/cli.ts +8 -1
  35. package/src/codegen.ts +98 -39
  36. package/src/config.ts +254 -181
  37. package/src/dependencies.ts +2 -2
  38. package/src/environment.ts +540 -140
  39. package/src/errors.ts +284 -4
  40. package/src/evaluate.ts +1043 -293
  41. package/src/exit-codes.ts +22 -43
  42. package/src/fingerprints.ts +46 -11
  43. package/src/index.ts +11 -0
  44. package/src/instances.ts +19 -16
  45. package/src/java-overrides.ts +104 -25
  46. package/src/levels.ts +191 -45
  47. package/src/lexer.ts +127 -30
  48. package/src/live-check.ts +867 -0
  49. package/src/liveness.ts +218 -572
  50. package/src/{obligation-action.ts → obligations/action.ts} +247 -69
  51. package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
  52. package/src/obligations/ctx.ts +64 -0
  53. package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
  54. package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
  55. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  56. package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
  57. package/src/{obligations.ts → obligations/index.ts} +32 -16
  58. package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
  59. package/src/{obligation-module.ts → obligations/module.ts} +113 -121
  60. package/src/obligations/pickle.ts +98 -0
  61. package/src/obligations/pragma.ts +189 -0
  62. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  63. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  64. package/src/{obligation-source.ts → obligations/source.ts} +156 -99
  65. package/src/obligations/temporal.ts +321 -0
  66. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  67. package/src/ocaml-marshal.ts +166 -0
  68. package/src/parallel-worker.ts +169 -224
  69. package/src/parallel.ts +140 -81
  70. package/src/parser.ts +456 -147
  71. package/src/pcal-ast.ts +770 -0
  72. package/src/pcal-parse.ts +1523 -0
  73. package/src/pcal-tokenize.ts +516 -0
  74. package/src/pcal-translate.ts +1230 -0
  75. package/src/pcal-validate.ts +454 -0
  76. package/src/prove/decide-pool.ts +95 -0
  77. package/src/prove/deciders.ts +33 -0
  78. package/src/prove/first-order.ts +78 -0
  79. package/src/prove/isabelle/LICENSE +36 -0
  80. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  81. package/src/prove/isabelle/decide.ts +47 -0
  82. package/src/prove/isabelle/encode.ts +446 -0
  83. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  84. package/src/prove/isabelle/isar/method.ts +367 -0
  85. package/src/prove/isabelle/isar/proof.ts +28 -0
  86. package/src/prove/isabelle/isar/statement.ts +57 -0
  87. package/src/prove/isabelle/isar/theory.ts +192 -0
  88. package/src/prove/isabelle/isar/type-check.ts +278 -0
  89. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  90. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  91. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  92. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  93. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  94. package/src/prove/isabelle/provers/blast/term.ts +546 -0
  95. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  96. package/src/prove/isabelle/provers/classical.ts +389 -0
  97. package/src/prove/isabelle/provers/hypsubst.ts +433 -0
  98. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  99. package/src/prove/isabelle/pure/consts.ts +32 -0
  100. package/src/prove/isabelle/pure/conv.ts +79 -0
  101. package/src/prove/isabelle/pure/drule.ts +264 -0
  102. package/src/prove/isabelle/pure/envir.ts +331 -0
  103. package/src/prove/isabelle/pure/goal.ts +53 -0
  104. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  105. package/src/prove/isabelle/pure/list.ts +12 -0
  106. package/src/prove/isabelle/pure/logic.ts +330 -0
  107. package/src/prove/isabelle/pure/name.ts +98 -0
  108. package/src/prove/isabelle/pure/net.ts +215 -0
  109. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  110. package/src/prove/isabelle/pure/pattern.ts +631 -0
  111. package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
  112. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  113. package/src/prove/isabelle/pure/search.ts +68 -0
  114. package/src/prove/isabelle/pure/seq.ts +133 -0
  115. package/src/prove/isabelle/pure/simplifier.ts +106 -0
  116. package/src/prove/isabelle/pure/table.ts +201 -0
  117. package/src/prove/isabelle/pure/tactic.ts +168 -0
  118. package/src/prove/isabelle/pure/tactical.ts +264 -0
  119. package/src/prove/isabelle/pure/term-ord.ts +105 -0
  120. package/src/prove/isabelle/pure/term.ts +688 -0
  121. package/src/prove/isabelle/pure/thm.ts +783 -0
  122. package/src/prove/isabelle/pure/type.ts +121 -0
  123. package/src/prove/isabelle/pure/unify.ts +753 -0
  124. package/src/prove/isabelle/pure/variable.ts +25 -0
  125. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  126. package/src/prove/isabelle/tla/context.ts +74 -0
  127. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  128. package/src/prove/isabelle/tla/logic.ts +215 -0
  129. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  130. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  131. package/src/prove/ocaml.ts +22 -0
  132. package/src/prove/prep/action.ts +508 -0
  133. package/src/prove/prep/defs.ts +33 -0
  134. package/src/prove/prep/elab.ts +156 -0
  135. package/src/prove/prep/enabled-axioms.ts +189 -0
  136. package/src/prove/prep/enabled.ts +43 -0
  137. package/src/prove/prep/fingerprint.ts +388 -0
  138. package/src/prove/prep/flatten.ts +70 -0
  139. package/src/prove/prep/level-comparison.ts +529 -0
  140. package/src/prove/prep/md5.ts +67 -0
  141. package/src/prove/prep/pragma.ts +221 -0
  142. package/src/prove/prep/trivial.ts +22 -0
  143. package/src/prove/prove-worker.ts +22 -0
  144. package/src/prove/prove.ts +498 -0
  145. package/src/prove/ptl/decide.ts +68 -0
  146. package/src/prove/ptl/encode.ts +255 -0
  147. package/src/prove/ptl/sat.ts +151 -0
  148. package/src/prove/ptl/tableau.ts +276 -0
  149. package/src/prove/smt/axiomatize.ts +69 -0
  150. package/src/prove/smt/axioms.ts +209 -0
  151. package/src/prove/smt/context.ts +108 -0
  152. package/src/prove/smt/data.ts +636 -0
  153. package/src/prove/smt/encode.ts +164 -0
  154. package/src/prove/smt/extensionality.ts +65 -0
  155. package/src/prove/smt/flatten.ts +112 -0
  156. package/src/prove/smt/format.ts +154 -0
  157. package/src/prove/smt/instances.ts +181 -0
  158. package/src/prove/smt/rewrite.ts +772 -0
  159. package/src/prove/smt/simplify.ts +57 -0
  160. package/src/prove/smt/solver/act-cache.ts +265 -0
  161. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  162. package/src/prove/smt/solver/array.ts +22 -0
  163. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  164. package/src/prove/smt/solver/ast-lt.ts +157 -0
  165. package/src/prove/smt/solver/ast-util.ts +91 -0
  166. package/src/prove/smt/solver/ast.ts +1315 -0
  167. package/src/prove/smt/solver/auf-solver.ts +572 -0
  168. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  169. package/src/prove/smt/solver/cg-table.ts +175 -0
  170. package/src/prove/smt/solver/clause.ts +276 -0
  171. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  172. package/src/prove/smt/solver/context.ts +1292 -0
  173. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  174. package/src/prove/smt/solver/der.ts +224 -0
  175. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  176. package/src/prove/smt/solver/e-matching.ts +659 -0
  177. package/src/prove/smt/solver/enode.ts +259 -0
  178. package/src/prove/smt/solver/expr-ref.ts +21 -0
  179. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  180. package/src/prove/smt/solver/fingerprints.ts +92 -0
  181. package/src/prove/smt/solver/flat-literals.ts +51 -0
  182. package/src/prove/smt/solver/goal.ts +138 -0
  183. package/src/prove/smt/solver/hash.ts +173 -0
  184. package/src/prove/smt/solver/hashtable.ts +166 -0
  185. package/src/prove/smt/solver/internalizer.ts +1381 -0
  186. package/src/prove/smt/solver/lbool.ts +5 -0
  187. package/src/prove/smt/solver/literal.ts +24 -0
  188. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  189. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  190. package/src/prove/smt/solver/lp/containers.ts +296 -0
  191. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  192. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  193. package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
  194. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  195. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  196. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  197. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  198. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  199. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  200. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  201. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  202. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  203. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  204. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  205. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  206. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  207. package/src/prove/smt/solver/lp/nex.ts +120 -0
  208. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  209. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  210. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  211. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  212. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  213. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  214. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  215. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  216. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  217. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  218. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  219. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  220. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  221. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  222. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  223. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  224. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  225. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  226. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  227. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  228. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  229. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  230. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  231. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  232. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  233. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  234. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  235. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  236. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  237. package/src/prove/smt/solver/model-checker.ts +347 -0
  238. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  239. package/src/prove/smt/solver/model-finder.ts +155 -0
  240. package/src/prove/smt/solver/model-generator.ts +97 -0
  241. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  242. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  243. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  244. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  245. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  246. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  247. package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
  248. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  249. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  250. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  251. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  252. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  253. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  254. package/src/prove/smt/solver/nnf.ts +469 -0
  255. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  256. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  257. package/src/prove/smt/solver/propagate-values.ts +83 -0
  258. package/src/prove/smt/solver/proto-model.ts +551 -0
  259. package/src/prove/smt/solver/pull-quant.ts +139 -0
  260. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  261. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  262. package/src/prove/smt/solver/qe-lite.ts +381 -0
  263. package/src/prove/smt/solver/qi-queue.ts +362 -0
  264. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  265. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  266. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  267. package/src/prove/smt/solver/random-gen.ts +10 -0
  268. package/src/prove/smt/solver/rational.ts +165 -0
  269. package/src/prove/smt/solver/ref-vector.ts +62 -0
  270. package/src/prove/smt/solver/relevancy.ts +247 -0
  271. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  272. package/src/prove/smt/solver/rewriter.ts +843 -0
  273. package/src/prove/smt/solver/rlimit.ts +79 -0
  274. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  275. package/src/prove/smt/solver/solver.ts +71 -0
  276. package/src/prove/smt/solver/sort.ts +35 -0
  277. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  278. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  279. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  280. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  281. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  282. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  283. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  284. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  285. package/src/prove/smt/solver/theory-lra.ts +56 -0
  286. package/src/prove/smt/solver/var-subst.ts +258 -0
  287. package/src/prove/smt/solver/z3-license.txt +10 -0
  288. package/src/prove/smt/table.ts +170 -0
  289. package/src/prove/tlapm/tlapm.ts +96 -0
  290. package/src/prove/tlaps-module.ts +510 -0
  291. package/src/prove/verdict.ts +18 -0
  292. package/src/prove/zenon/LICENSE +32 -0
  293. package/src/prove/zenon/check/check.ts +105 -0
  294. package/src/prove/zenon/check/definitions.ts +144 -0
  295. package/src/prove/zenon/check/equality.ts +182 -0
  296. package/src/prove/zenon/check/functions.ts +62 -0
  297. package/src/prove/zenon/check/keys.ts +125 -0
  298. package/src/prove/zenon/check/propositional.ts +104 -0
  299. package/src/prove/zenon/check/records.ts +188 -0
  300. package/src/prove/zenon/check/relations.ts +121 -0
  301. package/src/prove/zenon/check/rewrites.ts +224 -0
  302. package/src/prove/zenon/check/sets.ts +302 -0
  303. package/src/prove/zenon/check/terms.ts +127 -0
  304. package/src/prove/zenon/check/tla.ts +126 -0
  305. package/src/prove/zenon/decide.ts +113 -0
  306. package/src/prove/zenon/encode.ts +379 -0
  307. package/src/prove/zenon/eqrel.ts +300 -0
  308. package/src/prove/zenon/equality-rules.ts +435 -0
  309. package/src/prove/zenon/expr.ts +551 -0
  310. package/src/prove/zenon/index-table.ts +350 -0
  311. package/src/prove/zenon/isar-case.ts +513 -0
  312. package/src/prove/zenon/isar.ts +1249 -0
  313. package/src/prove/zenon/limits.ts +15 -0
  314. package/src/prove/zenon/llproof.ts +173 -0
  315. package/src/prove/zenon/mltoll.ts +1566 -0
  316. package/src/prove/zenon/node.ts +297 -0
  317. package/src/prove/zenon/ocaml.ts +169 -0
  318. package/src/prove/zenon/parse.ts +247 -0
  319. package/src/prove/zenon/phrase.ts +191 -0
  320. package/src/prove/zenon/proof.ts +198 -0
  321. package/src/prove/zenon/propositional-rules.ts +387 -0
  322. package/src/prove/zenon/rules.ts +94 -0
  323. package/src/prove/zenon/search.ts +288 -0
  324. package/src/prove/zenon/tla/functions.ts +151 -0
  325. package/src/prove/zenon/tla/llproof.ts +480 -0
  326. package/src/prove/zenon/tla/records.ts +225 -0
  327. package/src/prove/zenon/tla/rewrites.ts +447 -0
  328. package/src/prove/zenon/tla/sets.ts +304 -0
  329. package/src/prove/zenon/tla/terms.ts +162 -0
  330. package/src/prove/zenon/tla/tla.ts +506 -0
  331. package/src/randomization.ts +24 -7
  332. package/src/resolve.ts +1481 -426
  333. package/src/run-cli.ts +1483 -212
  334. package/src/runtime.ts +19 -1
  335. package/src/sany-builtins.ts +147 -0
  336. package/src/sany-generator.ts +3128 -0
  337. package/src/sany-levels.ts +1208 -0
  338. package/src/sany-lexer.ts +545 -0
  339. package/src/sany-linter.ts +122 -0
  340. package/src/sany-modules.ts +1398 -0
  341. package/src/sany-nodes.ts +463 -0
  342. package/src/sany-parse-error.ts +2161 -0
  343. package/src/sany-report.ts +356 -0
  344. package/src/sany-selectors.ts +738 -0
  345. package/src/sany-source.ts +248 -0
  346. package/src/sany-xml.ts +1017 -0
  347. package/src/spec-description.ts +42 -11
  348. package/src/standard-modules.ts +203 -148
  349. package/src/standard-ranges.ts +116 -0
  350. package/src/state-graph.ts +180 -0
  351. package/src/subexpressions.ts +231 -171
  352. package/src/substitution-levels.ts +38 -17
  353. package/src/successors.ts +241 -110
  354. package/src/symmetry.ts +194 -54
  355. package/src/tableau.ts +54 -25
  356. package/src/tlapm-cache.ts +236 -0
  357. package/src/tlc-ext.ts +42 -29
  358. package/src/tlc-messages.ts +329 -0
  359. package/src/tlc-module.ts +52 -43
  360. package/src/tlc-modules.ts +4 -0
  361. package/src/tlc-order.ts +78 -10
  362. package/src/tlc-random.ts +84 -33
  363. package/src/tlc-replay.ts +655 -0
  364. package/src/tlc-summary.ts +20 -5
  365. package/src/tlc-version.ts +19 -0
  366. package/src/transfer.ts +15 -3
  367. package/src/values.ts +787 -190
  368. package/src/worker.ts +65 -0
  369. package/dist/parallel.cjs +0 -12
  370. package/dist/parallel.js +0 -12
@@ -0,0 +1,264 @@
1
+ // Ported from Isabelle2025's Pure/tactical.ML and Pure/search.ML. Copyright (c) 1986-2025
2
+ // University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
3
+
4
+ import { TlaIsabelleError } from "../../../errors";
5
+ import {
6
+ appendSeq,
7
+ emptySeq,
8
+ filterSeq,
9
+ deferSeq,
10
+ makeSeq,
11
+ mapsSeq,
12
+ ofCell,
13
+ singleSeq,
14
+ type Cell,
15
+ type Seq,
16
+ } from "./seq";
17
+ import { cons, type List } from "./list";
18
+ import { aconv } from "./term";
19
+ import { nprems, premOf, type Thm } from "./thm";
20
+
21
+ export type Tactic = (state: Thm) => Seq<Thm>;
22
+ export type GoalTactic = (index: number) => Tactic;
23
+
24
+ export const allTac: Tactic = (state) => singleSeq(state);
25
+ export const noTac: Tactic = () => emptySeq;
26
+
27
+ export const thenTac =
28
+ (first: Tactic, second: Tactic): Tactic =>
29
+ (state) =>
30
+ mapsSeq(second, first(state));
31
+
32
+ export const orElse =
33
+ (first: Tactic, second: Tactic): Tactic =>
34
+ (state) => {
35
+ const cell = first(state).pull();
36
+ return cell === undefined ? second(state) : ofCell(cell);
37
+ };
38
+
39
+ export const appendTac =
40
+ (first: Tactic, second: Tactic): Tactic =>
41
+ (state) =>
42
+ appendSeq(
43
+ first(state),
44
+ deferSeq(() => second(state)),
45
+ );
46
+
47
+ export const thenElse =
48
+ (test: Tactic, onSuccess: Tactic, onFailure: Tactic): Tactic =>
49
+ (state) => {
50
+ const cell = test(state).pull();
51
+ return cell === undefined ? onFailure(state) : mapsSeq(onSuccess, ofCell(cell));
52
+ };
53
+
54
+ export const thenGoal =
55
+ (first: GoalTactic, second: GoalTactic): GoalTactic =>
56
+ (index) =>
57
+ thenTac(first(index), second(index));
58
+
59
+ export const orElseGoal =
60
+ (first: GoalTactic, second: GoalTactic): GoalTactic =>
61
+ (index) =>
62
+ orElse(first(index), second(index));
63
+
64
+ export const appendGoal =
65
+ (first: GoalTactic, second: GoalTactic): GoalTactic =>
66
+ (index) =>
67
+ appendTac(first(index), second(index));
68
+
69
+ export const determ =
70
+ (tactic: Tactic): Tactic =>
71
+ (state) =>
72
+ makeSeq(() => {
73
+ const cell = tactic(state).pull();
74
+ return cell === undefined ? undefined : [cell[0], emptySeq];
75
+ });
76
+
77
+ export const tryTac = (tactic: Tactic) => orElse(tactic, allTac);
78
+
79
+ // Thm.eq_thm: equal hypotheses, flex-flex pairs and propositions.
80
+ export const eqThm = (left: Thm, right: Thm) =>
81
+ left === right ||
82
+ (aconv(left.prop, right.prop) &&
83
+ left.hyps.length === right.hyps.length &&
84
+ left.hyps.every((hyp) => right.hyps.some((other) => aconv(hyp, other))) &&
85
+ left.tpairs.length === right.tpairs.length &&
86
+ left.tpairs.every(
87
+ (pair, index) =>
88
+ aconv(pair[0], right.tpairs[index][0]) && aconv(pair[1], right.tpairs[index][1]),
89
+ ));
90
+
91
+ export const eqThmProp = (left: Thm, right: Thm) => aconv(left.prop, right.prop);
92
+
93
+ interface Trail {
94
+ readonly state: Thm;
95
+ readonly rest: Seq<Thm>;
96
+ readonly tactics: readonly Tactic[];
97
+ }
98
+
99
+ // EVERY: tac1 THEN ... THEN tacn, without backtracking over repeated states.
100
+ export const every = (tactics: readonly Tactic[]): Tactic => {
101
+ const evy = (trail: readonly Trail[], remaining: readonly Tactic[], state: Thm): Seq<Thm> => {
102
+ if (remaining.length === 0) return makeSeq(() => [state, makeSeq(() => evyBack(trail).pull())]);
103
+ const cell = remaining[0](state).pull();
104
+ if (cell === undefined) return evyBack(trail);
105
+ return evy(
106
+ [{ state: cell[0], rest: cell[1], tactics: remaining.slice(1) }, ...trail],
107
+ remaining.slice(1),
108
+ cell[0],
109
+ );
110
+ };
111
+ const evyBack = (trail: readonly Trail[]): Seq<Thm> => {
112
+ let current = trail;
113
+ while (current.length > 0) {
114
+ const top = current[0];
115
+ const cell = top.rest.pull();
116
+ if (cell === undefined) current = current.slice(1);
117
+ else if (eqThm(top.state, cell[0]))
118
+ current = [{ ...top, rest: cell[1] }, ...current.slice(1)];
119
+ else
120
+ return evy(
121
+ [{ state: cell[0], rest: cell[1], tactics: top.tactics }, ...current.slice(1)],
122
+ top.tactics,
123
+ cell[0],
124
+ );
125
+ }
126
+ return emptySeq;
127
+ };
128
+ return (state) => evy([], tactics, state);
129
+ };
130
+
131
+ export const first = (tactics: readonly Tactic[]): Tactic =>
132
+ tactics.reduceRight((rest, tactic) => orElse(tactic, rest), noTac);
133
+
134
+ export const firstGoal =
135
+ (tactics: readonly GoalTactic[]): GoalTactic =>
136
+ (index) =>
137
+ first(tactics.map((tactic) => tactic(index)));
138
+
139
+ export const repeatDetermN =
140
+ (count: number, tactic: Tactic): Tactic =>
141
+ (state) =>
142
+ makeSeq(() => {
143
+ let current = state;
144
+ let remaining = count;
145
+ while (remaining !== 0) {
146
+ const cell = tactic(current).pull();
147
+ if (cell === undefined) break;
148
+ current = cell[0];
149
+ remaining -= 1;
150
+ }
151
+ return [current, emptySeq];
152
+ });
153
+
154
+ export const repeatDeterm = (tactic: Tactic) => repeatDetermN(-1, tactic);
155
+
156
+ export const repeatDeterm1 = (tactic: Tactic) => thenTac(determ(tactic), repeatDeterm(tactic));
157
+
158
+ export const changed =
159
+ (tactic: Tactic): Tactic =>
160
+ (state) =>
161
+ filterSeq((result) => !eqThm(state, result), tactic(state));
162
+
163
+ export const changedProp =
164
+ (tactic: Tactic): Tactic =>
165
+ (state) =>
166
+ filterSeq((result) => !eqThmProp(state, result), tactic(state));
167
+
168
+ export const allGoals =
169
+ (tactic: GoalTactic): Tactic =>
170
+ (state) => {
171
+ const doall = (index: number): Tactic =>
172
+ index === 0 ? allTac : thenTac(tactic(index), doall(index - 1));
173
+ return doall(nprems(state))(state);
174
+ };
175
+
176
+ export const firstGoalTac =
177
+ (tactic: GoalTactic): Tactic =>
178
+ (state) => {
179
+ const count = nprems(state);
180
+ const find = (index: number): Tactic =>
181
+ index > count ? noTac : orElse(tactic(index), find(index + 1));
182
+ return find(1)(state);
183
+ };
184
+
185
+ const isThmError = (error: unknown) =>
186
+ error instanceof TlaIsabelleError && error.exception === "THM";
187
+
188
+ // SUBGOAL: a tactic built from goal index of the state, failing if there is no such goal.
189
+ export const subgoal =
190
+ (build: (goal: ReturnType<typeof premOf>, index: number) => Tactic): GoalTactic =>
191
+ (index) =>
192
+ (state) => {
193
+ if (index < 1 || index > nprems(state)) return emptySeq;
194
+ return build(premOf(state, index), index)(state);
195
+ };
196
+
197
+ // Seq.INTERVAL: applies tactic to goals last down to first.
198
+ const interval = (tactic: GoalTactic, firstIndex: number, lastIndex: number): Tactic =>
199
+ lastIndex < firstIndex
200
+ ? allTac
201
+ : thenTac(tactic(lastIndex), interval(tactic, firstIndex, lastIndex - 1));
202
+
203
+ export const thenAllNew =
204
+ (first: GoalTactic, second: GoalTactic): GoalTactic =>
205
+ (index) =>
206
+ (state) =>
207
+ thenTac(first(index), (result) =>
208
+ interval(second, index, index + nprems(result) - nprems(state))(result),
209
+ )(state);
210
+
211
+ export const repeatAllNew = (tactic: GoalTactic): GoalTactic =>
212
+ thenAllNew(tactic, (index) => tryTac(repeatAllNew(tactic)(index)));
213
+
214
+ export const primSeq =
215
+ (apply: (state: Thm) => Seq<Thm>): Tactic =>
216
+ (state) => {
217
+ try {
218
+ return apply(state);
219
+ } catch (error) {
220
+ if (isThmError(error)) return emptySeq;
221
+ throw error;
222
+ }
223
+ };
224
+
225
+ export const primitive = (apply: (state: Thm) => Thm): Tactic =>
226
+ primSeq((state) => singleSeq(apply(state)));
227
+
228
+ export const condTac =
229
+ (test: (state: Thm) => boolean, onTrue: Tactic, onFalse: Tactic): Tactic =>
230
+ (state) =>
231
+ test(state) ? onTrue(state) : onFalse(state);
232
+
233
+ // Search.DEPTH_FIRST: depth-first search for a state satisfying the test. The stack of
234
+ // alternatives and the states already returned are lists, as in Isabelle, since the stack can grow
235
+ // as deep as the search goes.
236
+ const depthFirst = (test: (state: Thm) => boolean, tactic: Tactic): Tactic => {
237
+ const isUsed = (used: List<Thm> | undefined, state: Thm) => {
238
+ for (let current = used; current !== undefined; current = current.tail)
239
+ if (eqThm(current.head, state)) return true;
240
+ return false;
241
+ };
242
+ const depth = (used: List<Thm> | undefined, stack: List<Seq<Thm>> | undefined): Cell<Thm> => {
243
+ let current = stack;
244
+ while (current !== undefined) {
245
+ const cell = current.head.pull();
246
+ if (cell === undefined) {
247
+ current = current.tail;
248
+ continue;
249
+ }
250
+ const state = cell[0];
251
+ const rest = cons(cell[1], current.tail);
252
+ if (test(state) && !isUsed(used, state))
253
+ return [state, makeSeq(() => depth(cons(state, used), rest))];
254
+ current = cons(tactic(state), rest);
255
+ }
256
+ return undefined;
257
+ };
258
+ return (state) => makeSeq(() => depth(undefined, cons(singleSeq(state), undefined)));
259
+ };
260
+
261
+ export const hasFewerPrems = (count: number) => (state: Thm) => nprems(state) < count;
262
+
263
+ // Search.DEPTH_SOLVE: depth-first search until no goals remain.
264
+ export const depthSolve = (tactic: Tactic) => depthFirst(hasFewerPrems(1), tactic);
@@ -0,0 +1,105 @@
1
+ // Ported from Isabelle2025's Pure/term_ord.ML. Copyright (c) 1986-2025 University of Cambridge,
2
+ // Technische Universitaet Muenchen, and contributors, see LICENSE.
3
+
4
+ import { fastIndexnameOrd, fastStringOrd, indexnameOrd } from "./table";
5
+ import { mkType, sizeOfTerm, type Term, type Typ } from "./term";
6
+
7
+ const intOrd = (left: number, right: number) => (left < right ? -1 : left > right ? 1 : 0);
8
+
9
+ const dictOrd = <Item>(
10
+ ord: (left: Item, right: Item) => number,
11
+ left: readonly Item[],
12
+ right: readonly Item[],
13
+ ) => {
14
+ for (let index = 0; ; index += 1) {
15
+ if (index === left.length) return index === right.length ? 0 : -1;
16
+ if (index === right.length) return 1;
17
+ const order = ord(left[index], right[index]);
18
+ if (order !== 0) return order;
19
+ }
20
+ };
21
+
22
+ const sortOrd = (left: readonly string[], right: readonly string[]) =>
23
+ dictOrd(fastStringOrd, left, right);
24
+
25
+ const typConsNr = (type: Typ) => (type.kind === "TVar" ? 0 : type.kind === "TFree" ? 1 : 2);
26
+
27
+ const typOrd = (left: Typ, right: Typ): number => {
28
+ if (left === right) return 0;
29
+ if (left.kind === "Type" && right.kind === "Type") {
30
+ const order = fastStringOrd(left.name, right.name);
31
+ return order !== 0 ? order : dictOrd(typOrd, left.args, right.args);
32
+ }
33
+ if (left.kind === "TFree" && right.kind === "TFree") {
34
+ const order = fastStringOrd(left.name, right.name);
35
+ return order !== 0 ? order : sortOrd(left.sort, right.sort);
36
+ }
37
+ if (left.kind === "TVar" && right.kind === "TVar") {
38
+ const order = fastIndexnameOrd(left, right);
39
+ return order !== 0 ? order : sortOrd(left.sort, right.sort);
40
+ }
41
+ return intOrd(typConsNr(left), typConsNr(right));
42
+ };
43
+
44
+ const hdDepth = (term: Term): [Term, number] => {
45
+ let current = term;
46
+ let depth = 0;
47
+ while (current.kind === "App") {
48
+ current = current.fun;
49
+ depth += 1;
50
+ }
51
+ return [current, depth];
52
+ };
53
+
54
+ const dummyT = mkType("dummy");
55
+
56
+ const destHd = (term: Term): [{ name: string; index: number }, Typ, number] => {
57
+ switch (term.kind) {
58
+ case "Const":
59
+ return [{ name: term.name, index: 0 }, term.type, 0];
60
+ case "Free":
61
+ return [{ name: term.name, index: 0 }, term.type, 1];
62
+ case "Var":
63
+ return [{ name: term.name, index: term.index }, term.type, 2];
64
+ case "Bound":
65
+ return [{ name: "", index: term.index }, dummyT, 3];
66
+ case "Abs":
67
+ return [{ name: "", index: 0 }, term.type, 4];
68
+ case "App":
69
+ return [{ name: "", index: 0 }, dummyT, 5];
70
+ }
71
+ };
72
+
73
+ const hdOrd = (left: Term, right: Term) => {
74
+ const [leftName, leftType, leftNr] = destHd(left);
75
+ const [rightName, rightType, rightNr] = destHd(right);
76
+ const name = indexnameOrd(leftName, rightName);
77
+ if (name !== 0) return name;
78
+ const type = typOrd(leftType, rightType);
79
+ return type !== 0 ? type : intOrd(leftNr, rightNr);
80
+ };
81
+
82
+ const argsOrd = (left: Term, right: Term): number => {
83
+ if (left.kind === "App" && right.kind === "App") {
84
+ const order = argsOrd(left.fun, right.fun);
85
+ return order !== 0 ? order : termOrd(left.arg, right.arg);
86
+ }
87
+ return 0;
88
+ };
89
+
90
+ // Term_Ord.term_ord: a linear well-founded AC-compatible order for ordered rewriting.
91
+ export const termOrd = (left: Term, right: Term): number => {
92
+ if (left === right) return 0;
93
+ if (left.kind === "Abs" && right.kind === "Abs") {
94
+ const order = termOrd(left.body, right.body);
95
+ return order !== 0 ? order : typOrd(left.type, right.type);
96
+ }
97
+ const size = intOrd(sizeOfTerm(left), sizeOfTerm(right));
98
+ if (size !== 0) return size;
99
+ const [leftHead, leftDepth] = hdDepth(left);
100
+ const [rightHead, rightDepth] = hdDepth(right);
101
+ const head = hdOrd(leftHead, rightHead);
102
+ if (head !== 0) return head;
103
+ const depth = intOrd(leftDepth, rightDepth);
104
+ return depth !== 0 ? depth : argsOrd(left, right);
105
+ };