tla-ts 0.0.4 → 0.0.5

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 (378) hide show
  1. package/README.md +37 -126
  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 +46 -12
  8. package/dist/index.d.ts +46 -12
  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 +1006 -0
  17. package/dist/prove.js +1006 -0
  18. package/dist/run.cjs +45 -0
  19. package/dist/run.js +45 -0
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +76 -92
  23. package/dist/transfer.js +76 -92
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +21 -12
  27. package/src/ast.ts +2 -2
  28. package/src/bags.ts +22 -23
  29. package/src/builtins.ts +16 -8
  30. package/src/check.ts +131 -1153
  31. package/src/{cli-options.ts → cli/options.ts} +54 -9
  32. package/src/cli/run.ts +63 -0
  33. package/src/cli/shared.ts +106 -0
  34. package/src/cli/tlapm.ts +374 -0
  35. package/src/{run-cli.ts → cli/tlc.ts} +115 -721
  36. package/src/cli/xml-exporter.ts +221 -0
  37. package/src/cli.ts +1 -1
  38. package/src/codegen.ts +43 -22
  39. package/src/config.ts +5 -5
  40. package/src/dependencies.ts +4 -6
  41. package/src/environment.ts +55 -60
  42. package/src/errors.ts +97 -35
  43. package/src/evaluate.ts +361 -181
  44. package/src/exit-codes.ts +1 -1
  45. package/src/fingerprints.ts +3 -3
  46. package/src/index.ts +10 -0
  47. package/src/instances.ts +56 -46
  48. package/src/java-overrides.ts +79 -41
  49. package/src/json.ts +31 -36
  50. package/src/levels.ts +10 -13
  51. package/src/{live-check.ts → liveness-checker.ts} +207 -141
  52. package/src/liveness.ts +38 -34
  53. package/src/{obligation-action.ts → obligations/action.ts} +248 -74
  54. package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
  55. package/src/obligations/equality.ts +260 -0
  56. package/src/obligations/expression.ts +618 -0
  57. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  58. package/src/obligations/generate.ts +457 -0
  59. package/src/{obligations.ts → obligations/index.ts} +46 -32
  60. package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
  61. package/src/obligations/module.ts +445 -0
  62. package/src/obligations/normalize.ts +554 -0
  63. package/src/obligations/operators.ts +176 -0
  64. package/src/obligations/pragma.ts +195 -0
  65. package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
  66. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  67. package/src/obligations/regroup.ts +100 -0
  68. package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
  69. package/src/{obligation-source.ts → obligations/source.ts} +172 -216
  70. package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
  71. package/src/obligations/substitution.ts +261 -0
  72. package/src/obligations/temporal.ts +321 -0
  73. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  74. package/src/parallel-worker.ts +39 -51
  75. package/src/parallel.ts +39 -66
  76. package/src/parser.ts +67 -74
  77. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  78. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  79. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  80. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  81. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  82. package/src/prover/decide-pool.ts +95 -0
  83. package/src/prover/deciders.ts +33 -0
  84. package/src/prover/first-order.ts +175 -0
  85. package/src/prover/isabelle/LICENSE +36 -0
  86. package/src/prover/isabelle/LICENSE-tlapm +26 -0
  87. package/src/prover/isabelle/decide.ts +44 -0
  88. package/src/prover/isabelle/encode.ts +445 -0
  89. package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
  90. package/src/prover/isabelle/isar/method.ts +367 -0
  91. package/src/prover/isabelle/isar/proof.ts +28 -0
  92. package/src/prover/isabelle/isar/statement.ts +57 -0
  93. package/src/prover/isabelle/isar/theory.ts +192 -0
  94. package/src/prover/isabelle/isar/type-check.ts +278 -0
  95. package/src/prover/isabelle/provers/blast/blast.ts +258 -0
  96. package/src/prover/isabelle/provers/blast/branch.ts +322 -0
  97. package/src/prover/isabelle/provers/blast/prove.ts +347 -0
  98. package/src/prover/isabelle/provers/blast/rules.ts +330 -0
  99. package/src/prover/isabelle/provers/blast/state.ts +180 -0
  100. package/src/prover/isabelle/provers/blast/term.ts +546 -0
  101. package/src/prover/isabelle/provers/clasimp.ts +150 -0
  102. package/src/prover/isabelle/provers/classical.ts +389 -0
  103. package/src/prover/isabelle/provers/hypsubst.ts +433 -0
  104. package/src/prover/isabelle/pure/bicompose.ts +174 -0
  105. package/src/prover/isabelle/pure/consts.ts +32 -0
  106. package/src/prover/isabelle/pure/conv.ts +79 -0
  107. package/src/prover/isabelle/pure/drule.ts +264 -0
  108. package/src/prover/isabelle/pure/envir.ts +331 -0
  109. package/src/prover/isabelle/pure/goal.ts +53 -0
  110. package/src/prover/isabelle/pure/interrupt.ts +16 -0
  111. package/src/prover/isabelle/pure/list.ts +12 -0
  112. package/src/prover/isabelle/pure/logic.ts +330 -0
  113. package/src/prover/isabelle/pure/name.ts +98 -0
  114. package/src/prover/isabelle/pure/net.ts +215 -0
  115. package/src/prover/isabelle/pure/object-logic.ts +41 -0
  116. package/src/prover/isabelle/pure/pattern.ts +631 -0
  117. package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
  118. package/src/prover/isabelle/pure/rewriter.ts +602 -0
  119. package/src/prover/isabelle/pure/search.ts +68 -0
  120. package/src/prover/isabelle/pure/seq.ts +133 -0
  121. package/src/prover/isabelle/pure/simplifier.ts +106 -0
  122. package/src/prover/isabelle/pure/table.ts +201 -0
  123. package/src/prover/isabelle/pure/tactic.ts +168 -0
  124. package/src/prover/isabelle/pure/tactical.ts +264 -0
  125. package/src/prover/isabelle/pure/term-ord.ts +105 -0
  126. package/src/prover/isabelle/pure/term.ts +688 -0
  127. package/src/prover/isabelle/pure/thm.ts +783 -0
  128. package/src/prover/isabelle/pure/type.ts +121 -0
  129. package/src/prover/isabelle/pure/unify.ts +753 -0
  130. package/src/prover/isabelle/pure/variable.ts +25 -0
  131. package/src/prover/isabelle/tla/classical-setup.ts +101 -0
  132. package/src/prover/isabelle/tla/context.ts +74 -0
  133. package/src/prover/isabelle/tla/logic-data.ts +5 -0
  134. package/src/prover/isabelle/tla/logic.ts +215 -0
  135. package/src/prover/isabelle/tla/simpdata.ts +241 -0
  136. package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
  137. package/src/prover/ocaml.ts +22 -0
  138. package/src/prover/prep/action.ts +508 -0
  139. package/src/prover/prep/enabled-axioms.ts +189 -0
  140. package/src/prover/prep/fingerprint.ts +388 -0
  141. package/src/prover/prep/level-comparison.ts +529 -0
  142. package/src/prover/prep/md5.ts +60 -0
  143. package/src/prover/prep/methods.ts +221 -0
  144. package/src/prover/prep/normalize.ts +309 -0
  145. package/src/prover/prove-worker.ts +22 -0
  146. package/src/prover/prove.ts +492 -0
  147. package/src/prover/ptl/decide.ts +68 -0
  148. package/src/prover/ptl/encode.ts +244 -0
  149. package/src/prover/ptl/sat.ts +151 -0
  150. package/src/prover/ptl/tableau.ts +276 -0
  151. package/src/prover/smt/axioms.ts +209 -0
  152. package/src/prover/smt/context.ts +108 -0
  153. package/src/prover/smt/data.ts +636 -0
  154. package/src/prover/smt/encode.ts +275 -0
  155. package/src/prover/smt/extensionality.ts +65 -0
  156. package/src/prover/smt/flatten.ts +112 -0
  157. package/src/prover/smt/format.ts +154 -0
  158. package/src/prover/smt/instances.ts +181 -0
  159. package/src/prover/smt/rewrite.ts +766 -0
  160. package/src/prover/smt/solver/act-cache.ts +265 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +962 -0
  162. package/src/prover/smt/solver/array.ts +22 -0
  163. package/src/prover/smt/solver/asserted-formulas.ts +469 -0
  164. package/src/prover/smt/solver/ast-lt.ts +157 -0
  165. package/src/prover/smt/solver/ast-util.ts +91 -0
  166. package/src/prover/smt/solver/ast.ts +1315 -0
  167. package/src/prover/smt/solver/auf-solver.ts +572 -0
  168. package/src/prover/smt/solver/case-split-queue.ts +178 -0
  169. package/src/prover/smt/solver/cg-table.ts +175 -0
  170. package/src/prover/smt/solver/clause.ts +276 -0
  171. package/src/prover/smt/solver/conflict-resolution.ts +343 -0
  172. package/src/prover/smt/solver/context.ts +1292 -0
  173. package/src/prover/smt/solver/ctx-simplify.ts +334 -0
  174. package/src/prover/smt/solver/der.ts +224 -0
  175. package/src/prover/smt/solver/dyn-ack.ts +141 -0
  176. package/src/prover/smt/solver/e-matching.ts +659 -0
  177. package/src/prover/smt/solver/enode.ts +259 -0
  178. package/src/prover/smt/solver/expr-ref.ts +21 -0
  179. package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
  180. package/src/prover/smt/solver/fingerprints.ts +92 -0
  181. package/src/prover/smt/solver/flat-literals.ts +51 -0
  182. package/src/prover/smt/solver/goal.ts +138 -0
  183. package/src/prover/smt/solver/hash.ts +173 -0
  184. package/src/prover/smt/solver/hashtable.ts +166 -0
  185. package/src/prover/smt/solver/internalizer.ts +1381 -0
  186. package/src/prover/smt/solver/lbool.ts +5 -0
  187. package/src/prover/smt/solver/literal.ts +24 -0
  188. package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
  189. package/src/prover/smt/solver/lp/constraints.ts +78 -0
  190. package/src/prover/smt/solver/lp/containers.ts +296 -0
  191. package/src/prover/smt/solver/lp/core-solver.ts +504 -0
  192. package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
  193. package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
  194. package/src/prover/smt/solver/lp/dependency.ts +51 -0
  195. package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
  196. package/src/prover/smt/solver/lp/explanation.ts +46 -0
  197. package/src/prover/smt/solver/lp/gomory.ts +255 -0
  198. package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
  199. package/src/prover/smt/solver/lp/hnf.ts +281 -0
  200. package/src/prover/smt/solver/lp/int-cube.ts +295 -0
  201. package/src/prover/smt/solver/lp/int-solver.ts +514 -0
  202. package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
  203. package/src/prover/smt/solver/lp/lar-term.ts +62 -0
  204. package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
  205. package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
  206. package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
  207. package/src/prover/smt/solver/lp/nex.ts +120 -0
  208. package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
  209. package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
  210. package/src/prover/smt/solver/lp/nla-core.ts +968 -0
  211. package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
  212. package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
  213. package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
  214. package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
  215. package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
  216. package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
  217. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  218. package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
  219. package/src/prover/smt/solver/lp/nla-order.ts +307 -0
  220. package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
  221. package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
  222. package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
  223. package/src/prover/smt/solver/lp/nla-types.ts +124 -0
  224. package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
  225. package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
  226. package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
  227. package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
  228. package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
  229. package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
  230. package/src/prover/smt/solver/lp/pdd.ts +971 -0
  231. package/src/prover/smt/solver/lp/random-updater.ts +138 -0
  232. package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
  233. package/src/prover/smt/solver/lp/union-find.ts +96 -0
  234. package/src/prover/smt/solver/mam-compiler.ts +847 -0
  235. package/src/prover/smt/solver/mam-interpreter.ts +400 -0
  236. package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
  237. package/src/prover/smt/solver/model-checker.ts +347 -0
  238. package/src/prover/smt/solver/model-evaluator.ts +262 -0
  239. package/src/prover/smt/solver/model-finder.ts +155 -0
  240. package/src/prover/smt/solver/model-generator.ts +97 -0
  241. package/src/prover/smt/solver/model-macro-solver.ts +728 -0
  242. package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
  243. package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
  244. package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
  245. package/src/prover/smt/solver/nlsat/explain.ts +607 -0
  246. package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
  247. package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
  248. package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
  249. package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
  250. package/src/prover/smt/solver/nlsat/solver.ts +911 -0
  251. package/src/prover/smt/solver/nlsat/types.ts +43 -0
  252. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  253. package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
  254. package/src/prover/smt/solver/nnf.ts +469 -0
  255. package/src/prover/smt/solver/pattern-inference.ts +351 -0
  256. package/src/prover/smt/solver/poly-rewriter.ts +477 -0
  257. package/src/prover/smt/solver/propagate-values.ts +83 -0
  258. package/src/prover/smt/solver/proto-model.ts +551 -0
  259. package/src/prover/smt/solver/pull-quant.ts +139 -0
  260. package/src/prover/smt/solver/qe-lite-der.ts +526 -0
  261. package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
  262. package/src/prover/smt/solver/qe-lite.ts +381 -0
  263. package/src/prover/smt/solver/qi-queue.ts +362 -0
  264. package/src/prover/smt/solver/quant-tactics.ts +117 -0
  265. package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
  266. package/src/prover/smt/solver/quantifier-manager.ts +186 -0
  267. package/src/prover/smt/solver/random-gen.ts +10 -0
  268. package/src/prover/smt/solver/rational.ts +165 -0
  269. package/src/prover/smt/solver/ref-vector.ts +62 -0
  270. package/src/prover/smt/solver/relevancy.ts +247 -0
  271. package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
  272. package/src/prover/smt/solver/rewriter.ts +843 -0
  273. package/src/prover/smt/solver/rlimit.ts +79 -0
  274. package/src/prover/smt/solver/smtlib-parser.ts +526 -0
  275. package/src/prover/smt/solver/solver.ts +71 -0
  276. package/src/prover/smt/solver/sort.ts +35 -0
  277. package/src/prover/smt/solver/sticky-generations.ts +69 -0
  278. package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
  279. package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
  280. package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
  281. package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
  282. package/src/prover/smt/solver/theory-lra-model.ts +243 -0
  283. package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
  284. package/src/prover/smt/solver/theory-lra-state.ts +43 -0
  285. package/src/prover/smt/solver/theory-lra.ts +56 -0
  286. package/src/prover/smt/solver/var-subst.ts +258 -0
  287. package/src/prover/smt/solver/z3-license.txt +10 -0
  288. package/src/prover/smt/table.ts +170 -0
  289. package/src/prover/tlapm/cache.ts +236 -0
  290. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  291. package/src/prover/tlapm/tlapm.ts +96 -0
  292. package/src/prover/tlaps-module.ts +510 -0
  293. package/src/prover/verdict.ts +13 -0
  294. package/src/prover/zenon/LICENSE +32 -0
  295. package/src/prover/zenon/check/check.ts +105 -0
  296. package/src/prover/zenon/check/definitions.ts +144 -0
  297. package/src/prover/zenon/check/equality.ts +182 -0
  298. package/src/prover/zenon/check/functions.ts +62 -0
  299. package/src/prover/zenon/check/keys.ts +125 -0
  300. package/src/prover/zenon/check/propositional.ts +104 -0
  301. package/src/prover/zenon/check/records.ts +188 -0
  302. package/src/prover/zenon/check/relations.ts +121 -0
  303. package/src/prover/zenon/check/rewrites.ts +224 -0
  304. package/src/prover/zenon/check/sets.ts +302 -0
  305. package/src/prover/zenon/check/terms.ts +127 -0
  306. package/src/prover/zenon/check/tla.ts +126 -0
  307. package/src/prover/zenon/decide.ts +107 -0
  308. package/src/prover/zenon/encode.ts +378 -0
  309. package/src/prover/zenon/eqrel.ts +300 -0
  310. package/src/prover/zenon/equality-rules.ts +435 -0
  311. package/src/prover/zenon/expr.ts +551 -0
  312. package/src/prover/zenon/index-table.ts +350 -0
  313. package/src/prover/zenon/isar-case.ts +513 -0
  314. package/src/prover/zenon/isar.ts +1249 -0
  315. package/src/prover/zenon/limits.ts +15 -0
  316. package/src/prover/zenon/llproof.ts +173 -0
  317. package/src/prover/zenon/mltoll.ts +1566 -0
  318. package/src/prover/zenon/node.ts +297 -0
  319. package/src/prover/zenon/ocaml.ts +169 -0
  320. package/src/prover/zenon/parse.ts +247 -0
  321. package/src/prover/zenon/phrase.ts +191 -0
  322. package/src/prover/zenon/proof.ts +198 -0
  323. package/src/prover/zenon/propositional-rules.ts +387 -0
  324. package/src/prover/zenon/rules.ts +94 -0
  325. package/src/prover/zenon/search.ts +288 -0
  326. package/src/prover/zenon/tla/functions.ts +151 -0
  327. package/src/prover/zenon/tla/llproof.ts +480 -0
  328. package/src/prover/zenon/tla/records.ts +225 -0
  329. package/src/prover/zenon/tla/rewrites.ts +447 -0
  330. package/src/prover/zenon/tla/sets.ts +304 -0
  331. package/src/prover/zenon/tla/terms.ts +162 -0
  332. package/src/prover/zenon/tla/tla.ts +506 -0
  333. package/src/randomization.ts +19 -24
  334. package/src/resolve.ts +15 -22
  335. package/src/runtime.ts +8 -8
  336. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  337. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  338. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  339. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  340. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  341. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  342. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  343. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  344. package/src/{sany-report.ts → sany/report.ts} +16 -17
  345. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  346. package/src/{sany-source.ts → sany/source.ts} +6 -7
  347. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  348. package/src/search.ts +969 -0
  349. package/src/spec-description.ts +26 -20
  350. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  351. package/src/standard-modules.ts +21 -22
  352. package/src/state-graph.ts +9 -8
  353. package/src/substitution-levels.ts +2 -2
  354. package/src/successors.ts +39 -23
  355. package/src/symmetry.ts +1 -1
  356. package/src/tableau.ts +6 -7
  357. package/src/tlc/fingerprint.ts +214 -0
  358. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  359. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  360. package/src/{tlc-random.ts → tlc/random.ts} +3 -190
  361. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  362. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  363. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  364. package/src/{tlc-version.ts → tlc/version.ts} +8 -7
  365. package/src/transfer.ts +32 -32
  366. package/src/values.ts +166 -111
  367. package/src/worker.ts +62 -0
  368. package/dist/parallel.cjs +0 -12
  369. package/dist/parallel.js +0 -12
  370. package/dist/run-cli.cjs +0 -55
  371. package/dist/run-cli.js +0 -55
  372. package/src/canonical.ts +0 -40
  373. package/src/obligation-expression.ts +0 -1060
  374. package/src/obligation-module.ts +0 -1042
  375. package/src/standard-ranges.ts +0 -116
  376. package/src/value-sources.ts +0 -29
  377. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  378. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
@@ -0,0 +1,304 @@
1
+ // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
+ //
3
+ // The rules for sets: membership in each kind of set, set equality and inclusion.
4
+
5
+ import { isApp, type Expr } from "../expr";
6
+ import type { Priority } from "../node";
7
+ import { makeRule, type Rule } from "../proof";
8
+ import {
9
+ equal,
10
+ getBranches,
11
+ isConstructor,
12
+ isVariable,
13
+ makeExtensionNode,
14
+ makeInstanceNode,
15
+ member,
16
+ SET_CONSTRUCTORS,
17
+ type Item,
18
+ type Literal,
19
+ } from "./terms";
20
+
21
+ const decomposeAdd = (set: Expr): [Expr[], Expr] => {
22
+ const elements: Expr[] = [];
23
+ let rest = set;
24
+ while (isApp(rest, "TLA.addElt", 2)) {
25
+ elements.push(rest.args[0]);
26
+ rest = rest.args[1];
27
+ }
28
+ return [elements, rest];
29
+ };
30
+
31
+ export const getMembershipNodes = (literal: Literal): Item[] | undefined => {
32
+ const exprs = literal.context.exprs;
33
+ const formula = literal.formula;
34
+ const isNegated = literal.isNegated;
35
+ const relation = literal.relation;
36
+ const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
37
+ makeExtensionNode(literal, priority, rule, branches);
38
+ const instance = (priority: Priority, quantified: Expr, term: Expr) =>
39
+ makeInstanceNode(literal, priority, quantified, term);
40
+ if (relation?.symbol === "TLA.in") {
41
+ const element = relation.args[0];
42
+ const set = relation.args[1];
43
+ if (!isNegated && isVariable(set, "TLA.emptyset"))
44
+ return node("prop", makeRule("in_emptyset", [formula, element]), []);
45
+ if (isApp(set, "TLA.upair", 2)) {
46
+ const first = equal(exprs, element, set.args[0]);
47
+ const second = equal(exprs, element, set.args[1]);
48
+ return isNegated
49
+ ? node(
50
+ "prop",
51
+ makeRule("notin_upair", [
52
+ formula,
53
+ exprs.enot(first),
54
+ exprs.enot(second),
55
+ element,
56
+ set.args[0],
57
+ set.args[1],
58
+ ]),
59
+ [[exprs.enot(first), exprs.enot(second)]],
60
+ )
61
+ : node(
62
+ "prop",
63
+ makeRule("in_upair", [formula, first, second, element, set.args[0], set.args[1]]),
64
+ [[first], [second]],
65
+ );
66
+ }
67
+ if (isApp(set, "TLA.addElt", 2)) {
68
+ const decomposed = decomposeAdd(set);
69
+ const isEmptyRest = decomposed[1] === exprs.evar("TLA.emptyset");
70
+ if (!isNegated) {
71
+ const equalities = decomposed[0].map((inner) => equal(exprs, element, inner));
72
+ const formulas = isEmptyRest
73
+ ? equalities
74
+ : [...equalities, member(exprs, element, decomposed[1])];
75
+ return node("prop", makeRule("in_addElt", [formula, element, set]), getBranches(formulas));
76
+ }
77
+ const inequalities = decomposed[0].map((inner) => exprs.enot(equal(exprs, element, inner)));
78
+ const formulas = isEmptyRest
79
+ ? inequalities
80
+ : [exprs.enot(member(exprs, element, decomposed[1])), ...inequalities];
81
+ return node("prop", makeRule("notin_addElt", [formula, element, set]), [formulas]);
82
+ }
83
+ if (isApp(set, "TLA.set"))
84
+ return isNegated
85
+ ? node("prop", makeRule("notin_set", [formula, element, set]), [
86
+ set.args.map((inner) => exprs.enot(equal(exprs, element, inner))),
87
+ ])
88
+ : node(
89
+ "prop",
90
+ makeRule("in_set", [formula, element, set]),
91
+ getBranches(set.args.map((inner) => equal(exprs, element, inner))),
92
+ );
93
+ if (isNegated && set.kind === "meta")
94
+ return instance({ instance: set.args[0] }, set.args[0], exprs.eapp("TLA.set", [element]));
95
+ if (isApp(set, "TLA.SUBSET", 1)) {
96
+ const subset = exprs.eapp("TLA.subseteq", [element, set.args[0]]);
97
+ return isNegated
98
+ ? node(
99
+ "prop",
100
+ makeRule("notin_SUBSET", [formula, exprs.enot(subset), element, set.args[0]]),
101
+ [[exprs.enot(subset)]],
102
+ )
103
+ : node("prop", makeRule("in_SUBSET", [formula, subset, element, set.args[0]]), [[subset]]);
104
+ }
105
+ if (isApp(set, "TLA.UNION", 1)) {
106
+ const bound = exprs.newVar();
107
+ const exists = exprs.eex(
108
+ bound,
109
+ "",
110
+ exprs.eand(member(exprs, bound, set.args[0]), member(exprs, element, bound)),
111
+ );
112
+ return isNegated
113
+ ? node(
114
+ "arity",
115
+ makeRule("notin_UNION", [formula, exprs.enot(exists), element, set.args[0]]),
116
+ [[exprs.enot(exists)]],
117
+ )
118
+ : node("prop", makeRule("in_UNION", [formula, exists, element, set.args[0]]), [[exists]]);
119
+ }
120
+ const binarySetRules: Record<
121
+ string,
122
+ [
123
+ "in_cup" | "in_cap" | "in_setminus",
124
+ "notin_cup" | "notin_cap" | "notin_setminus",
125
+ boolean,
126
+ boolean,
127
+ ]
128
+ > = {
129
+ "TLA.cup": ["in_cup", "notin_cup", true, false],
130
+ "TLA.cap": ["in_cap", "notin_cap", false, true],
131
+ "TLA.setminus": ["in_setminus", "notin_setminus", false, true],
132
+ };
133
+ const binarySetRule = set.kind === "app" ? binarySetRules[set.symbol] : undefined;
134
+ if (binarySetRule !== undefined && set.args.length === 2) {
135
+ const first = member(exprs, element, set.args[0]);
136
+ const secondPositive = member(exprs, element, set.args[1]);
137
+ const isMinus = set.symbol === "TLA.setminus";
138
+ const second = isMinus !== isNegated ? exprs.enot(secondPositive) : secondPositive;
139
+ const firstLiteral = isNegated ? exprs.enot(first) : first;
140
+ const isSplit = isNegated ? binarySetRule[3] : binarySetRule[2];
141
+ return node(
142
+ "prop",
143
+ makeRule(isNegated ? binarySetRule[1] : binarySetRule[0], [
144
+ formula,
145
+ firstLiteral,
146
+ second,
147
+ element,
148
+ set.args[0],
149
+ set.args[1],
150
+ ]),
151
+ isSplit ? [[firstLiteral], [second]] : [[firstLiteral, second]],
152
+ );
153
+ }
154
+ if (isApp(set, "TLA.subsetOf", 2) && set.args[1].kind === "lam") {
155
+ const predicate = set.args[1];
156
+ const inBase = member(exprs, element, set.args[0]);
157
+ const holds = exprs.substitute([[predicate.args[0], element]], predicate.args[1]);
158
+ return isNegated
159
+ ? node(
160
+ "prop",
161
+ makeRule("notin_subsetof", [
162
+ formula,
163
+ exprs.enot(inBase),
164
+ exprs.enot(holds),
165
+ element,
166
+ set.args[0],
167
+ predicate,
168
+ ]),
169
+ [[exprs.enot(inBase)], [exprs.enot(holds)]],
170
+ )
171
+ : node(
172
+ "prop",
173
+ makeRule("in_subsetof", [formula, inBase, holds, element, set.args[0], predicate]),
174
+ [[inBase, holds]],
175
+ );
176
+ }
177
+ if (isApp(set, "TLA.setOfAll", 2) && set.args[1].kind === "lam") {
178
+ const predicate = set.args[1];
179
+ const bound = exprs.newVar();
180
+ const exists = exprs.eex(
181
+ bound,
182
+ "",
183
+ exprs.eand(
184
+ member(exprs, bound, set.args[0]),
185
+ equal(exprs, element, exprs.substitute([[predicate.args[0], bound]], predicate.args[1])),
186
+ ),
187
+ );
188
+ const result = isNegated ? exprs.enot(exists) : exists;
189
+ return node(
190
+ { instance: result },
191
+ makeRule(isNegated ? "notin_setofall" : "in_setofall", [
192
+ formula,
193
+ result,
194
+ element,
195
+ set.args[0],
196
+ predicate,
197
+ ]),
198
+ [[result]],
199
+ );
200
+ }
201
+ }
202
+ return undefined;
203
+ };
204
+
205
+ export const getSetEqualityNodes = (literal: Literal): Item[] | undefined => {
206
+ const exprs = literal.context.exprs;
207
+ const formula = literal.formula;
208
+ const isNegated = literal.isNegated;
209
+ const relation = literal.relation;
210
+ const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
211
+ makeExtensionNode(literal, priority, rule, branches);
212
+ if (relation?.symbol !== "=") return undefined;
213
+ const left = relation.args[0];
214
+ const right = relation.args[1];
215
+ if (!isNegated && isVariable(right, "TLA.emptyset")) {
216
+ const bound = exprs.newVar();
217
+ const empty = exprs.eall(bound, "", exprs.enot(member(exprs, bound, left)));
218
+ return node("arity", makeRule("setequalempty", [formula, empty, left]), [[empty]]);
219
+ }
220
+ if (!isNegated && isVariable(left, "TLA.emptyset")) {
221
+ const bound = exprs.newVar();
222
+ const empty = exprs.eall(bound, "", exprs.enot(member(exprs, bound, right)));
223
+ return node("arity", makeRule("setemptyequal", [formula, empty, right]), [[empty]]);
224
+ }
225
+ if (isConstructor(SET_CONSTRUCTORS, left) || isConstructor(SET_CONSTRUCTORS, right)) {
226
+ const bound = exprs.newVar();
227
+ const extensional = exprs.eall(
228
+ bound,
229
+ "",
230
+ exprs.eequiv(member(exprs, bound, left), member(exprs, bound, right)),
231
+ );
232
+ const result = isNegated ? exprs.enot(extensional) : extensional;
233
+ return node(
234
+ { instance: result },
235
+ makeRule(isNegated ? "notsetequal" : "setequal", [formula, result, left, right]),
236
+ [[result]],
237
+ );
238
+ }
239
+ return undefined;
240
+ };
241
+
242
+ // A metavariable in a set, against the disequalities of that set.
243
+ export const getMetaMembershipNodes = (literal: Literal): Item[] | undefined => {
244
+ const exprs = literal.context.exprs;
245
+ const index = literal.context.index;
246
+ const relation = literal.relation;
247
+ const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
248
+ makeExtensionNode(literal, priority, rule, branches);
249
+ if (relation?.symbol === "TLA.in" && relation.args[0].kind === "meta") {
250
+ const bound = exprs.newVar();
251
+ return index.findDisequalities(relation.args[1]).flatMap((disequality) => {
252
+ const sides: Expr[] = disequality.args[0].args;
253
+ const different = exprs.enot(
254
+ exprs.eall(
255
+ bound,
256
+ "",
257
+ exprs.eequiv(member(exprs, bound, sides[0]), member(exprs, bound, sides[1])),
258
+ ),
259
+ );
260
+ return node(
261
+ { instance: different },
262
+ makeRule("notsetequal", [disequality, different, sides[0], sides[1]]),
263
+ [[different]],
264
+ );
265
+ });
266
+ }
267
+ return undefined;
268
+ };
269
+
270
+ export const getSubsetNodes = (literal: Literal): Item[] | undefined => {
271
+ const exprs = literal.context.exprs;
272
+ const formula = literal.formula;
273
+ const isNegated = literal.isNegated;
274
+ const relation = literal.relation;
275
+ const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
276
+ makeExtensionNode(literal, priority, rule, branches);
277
+ if (relation?.symbol === "TLA.subseteq") {
278
+ const left = relation.args[0];
279
+ const right = relation.args[1];
280
+ if (isApp(left, "TLA.cup", 2)) {
281
+ const first = exprs.eapp("TLA.subseteq", [left.args[0], right]);
282
+ const second = exprs.eapp("TLA.subseteq", [left.args[1], right]);
283
+ return isNegated
284
+ ? node(
285
+ "arity",
286
+ makeRule("not_cup_subseteq", [formula, exprs.enot(first), exprs.enot(second)]),
287
+ [[exprs.enot(first)], [exprs.enot(second)]],
288
+ )
289
+ : node("arity", makeRule("cup_subseteq", [formula, first, second]), [[first, second]]);
290
+ }
291
+ if (isApp(right, "TLA.cap", 2)) {
292
+ // Zenon builds the same subset twice here, from the second set.
293
+ const subset = exprs.eapp("TLA.subseteq", [left, right.args[1]]);
294
+ return isNegated
295
+ ? node(
296
+ "arity",
297
+ makeRule("not_subseteq_cap", [formula, exprs.enot(subset), exprs.enot(subset)]),
298
+ [[exprs.enot(subset)], [exprs.enot(subset)]],
299
+ )
300
+ : node("arity", makeRule("subseteq_cap", [formula, subset, subset]), [[subset, subset]]);
301
+ }
302
+ }
303
+ return undefined;
304
+ };
@@ -0,0 +1,162 @@
1
+ // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
+ //
3
+ // What the rules of the TLA+ extension share: the symbols it knows, a literal taken apart, and the
4
+ // nodes it makes.
5
+
6
+ import { TlaZenonError } from "../../../errors";
7
+ import { isApp, isRelation, type Expr, type Expressions, type RelationExpr } from "../expr";
8
+ import type { Index } from "../index-table";
9
+ import type { Node, Priority } from "../node";
10
+ import { makeRule, type Rule } from "../proof";
11
+
12
+ // A node, or Zenon's Stop: the rules after it don't apply to the formula.
13
+ export type Item = Node | "stop";
14
+
15
+ export const SET_CONSTRUCTORS = [
16
+ "TLA.emptyset",
17
+ "TLA.upair",
18
+ "TLA.addElt",
19
+ "TLA.set",
20
+ "TLA.infinity",
21
+ "TLA.SUBSET",
22
+ "TLA.UNION",
23
+ "TLA.INTER",
24
+ "TLA.cup",
25
+ "TLA.cap",
26
+ "TLA.setminus",
27
+ "TLA.subsetOf",
28
+ "TLA.setOfAll",
29
+ "TLA.FuncSet",
30
+ "TLA.DOMAIN",
31
+ "TLA.Product",
32
+ "arith.N",
33
+ "arith.Z",
34
+ "arith.R",
35
+ "arith.natrange",
36
+ "arith.intrange",
37
+ "TLA.Seq",
38
+ "TLA.recordset",
39
+ ];
40
+
41
+ export const FUNCTION_CONSTRUCTORS = ["TLA.Fcn", "TLA.except", "TLA.oneArg", "TLA.extend"];
42
+
43
+ export const isVariable = (expression: Expr, name: string) =>
44
+ expression.kind === "var" && expression.symbol === name;
45
+
46
+ export const isConstructor = (constructors: string[], expression: Expr) =>
47
+ (expression.kind === "var" || expression.kind === "app") &&
48
+ constructors.includes(expression.symbol);
49
+
50
+ export const isNotEquiv = (expression: Expr) => isApp(expression, "$notequiv");
51
+
52
+ const isString = (expression: Expr) => isApp(expression, "$string");
53
+
54
+ export const equal = (exprs: Expressions, left: Expr, right: Expr) =>
55
+ exprs.eapp("=", [left, right]);
56
+
57
+ export const member = (exprs: Expressions, element: Expr, set: Expr) =>
58
+ exprs.eapp("TLA.in", [element, set]);
59
+
60
+ export const fapply = (exprs: Expressions, fcn: Expr, argument: Expr) =>
61
+ exprs.eapp("TLA.fapply", [fcn, argument]);
62
+
63
+ export const domain = (exprs: Expressions, fcn: Expr) => exprs.eapp("TLA.DOMAIN", [fcn]);
64
+
65
+ export const getBranches = (formulas: Expr[]) => formulas.map((formula) => [formula]);
66
+
67
+ export const makeNatural = (exprs: Expressions, count: number) => {
68
+ let result: Expr = exprs.evar("0");
69
+ for (let index = 0; index < count; index++)
70
+ result = fapply(exprs, exprs.evar("TLA.Succ"), result);
71
+ return result;
72
+ };
73
+
74
+ export const isTriviallyNotIn = (element: Expr, set: Expr) =>
75
+ isString(element) &&
76
+ isApp(set, "TLA.set") &&
77
+ set.args.every((inner) => isString(inner) && inner !== element);
78
+
79
+ export const getPairs = (args: Expr[]) => {
80
+ const pairs: [Expr, Expr][] = [];
81
+ for (let index = 0; index + 1 < args.length; index += 2)
82
+ pairs.push([args[index], args[index + 1]]);
83
+ return pairs;
84
+ };
85
+
86
+ export interface TlaContext {
87
+ index: Index;
88
+ exprs: Expressions;
89
+ }
90
+
91
+ // A formula that the propositional rules look at: a literal, its atom and, when the atom relates
92
+ // two terms, the atom as a relation.
93
+ export interface Literal {
94
+ context: TlaContext;
95
+ formula: Expr;
96
+ goalness: number;
97
+ isNegated: boolean;
98
+ atom: Expr;
99
+ relation: RelationExpr | undefined;
100
+ }
101
+
102
+ export const getLiteral = (context: TlaContext, formula: Expr, goalness: number): Literal => {
103
+ const atom = formula.kind === "not" ? formula.args[0] : formula;
104
+ return {
105
+ context,
106
+ formula,
107
+ goalness,
108
+ isNegated: formula.kind === "not",
109
+ atom,
110
+ relation: isRelation(atom) ? atom : undefined,
111
+ };
112
+ };
113
+
114
+ export const makeExtensionNode = (
115
+ literal: Literal,
116
+ priority: Priority,
117
+ rule: Rule,
118
+ branches: Expr[][],
119
+ ): Node[] => [
120
+ {
121
+ conclusions: [literal.formula],
122
+ rule,
123
+ priority,
124
+ goalness: literal.goalness,
125
+ branches,
126
+ },
127
+ ];
128
+
129
+ export const makeInstanceNode = (
130
+ literal: Literal,
131
+ priority: Priority,
132
+ quantified: Expr,
133
+ term: Expr,
134
+ ): Node[] => {
135
+ const exprs = literal.context.exprs;
136
+ const goalness = literal.goalness;
137
+ if (quantified.kind === "all")
138
+ return [
139
+ {
140
+ conclusions: [quantified],
141
+ rule: makeRule("all", [quantified, term]),
142
+ priority,
143
+ goalness,
144
+ branches: [[exprs.substitute([[quantified.args[0], term]], quantified.args[1])]],
145
+ },
146
+ ];
147
+ if (quantified.kind === "ex") {
148
+ const negated = exprs.enot(quantified);
149
+ return [
150
+ {
151
+ conclusions: [negated],
152
+ rule: makeRule("not_ex", [negated, term]),
153
+ priority,
154
+ goalness,
155
+ branches: [
156
+ [exprs.substitute([[quantified.args[0], term]], exprs.enot(quantified.args[1]))],
157
+ ],
158
+ },
159
+ ];
160
+ }
161
+ throw new TlaZenonError("Zenon: instantiating a formula that isn't quantified");
162
+ };