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,188 @@
1
+ // The checks of the TLA+ extension's rules for tuples and records, after the lemmas in Zenon.thy
2
+ // that justify them.
3
+
4
+ import type { PlainRuleName } from "../proof";
5
+ import {
6
+ app,
7
+ domain,
8
+ ensure,
9
+ equal,
10
+ expectApp,
11
+ expectNot,
12
+ fapply,
13
+ getPairs,
14
+ getStringText,
15
+ makeNatural,
16
+ member,
17
+ not,
18
+ type Checker,
19
+ type RuleSpec,
20
+ type SpecTable,
21
+ type Term,
22
+ } from "./terms";
23
+
24
+ // The fields of a record or a set of records, whose labels must be distinct string literals.
25
+ export const getFields = (record: Term, constructor: "TLA.record" | "TLA.recordset") => {
26
+ const fields = getPairs(expectApp(record, constructor));
27
+ const labels = fields.map((field) => getStringText(field[0]));
28
+ ensure(new Set(labels).size === labels.length);
29
+ return fields;
30
+ };
31
+
32
+ const getLabels = (fields: [Term, Term][]) =>
33
+ app(
34
+ "TLA.set",
35
+ fields.map((field) => field[0]),
36
+ );
37
+
38
+ const getRecordInequalitySpec = (formula: Term, isRecordRight: boolean): RuleSpec => {
39
+ const sides = expectApp(expectNot(formula), "=", 2);
40
+ const other = isRecordRight ? sides[0] : sides[1];
41
+ const fields = getFields(isRecordRight ? sides[1] : sides[0], "TLA.record");
42
+ return {
43
+ premises: [formula],
44
+ branches: [
45
+ [not(app("TLA.isAFcn", [other]))],
46
+ [not(equal(domain(other), getLabels(fields)))],
47
+ ...fields.map((field) => [not(equal(fapply(other, field[0]), field[1]))]),
48
+ ],
49
+ };
50
+ };
51
+
52
+ // Checks that the formulas list exactly the expected ones, and returns them as branches.
53
+ const expectSameSet = (checker: Checker, given: Term[], expected: Term[]) => {
54
+ const keys = new Set(expected.map(checker.getTopKey));
55
+ ensure(
56
+ given.length === keys.size && given.every((formula) => keys.has(checker.getTopKey(formula))),
57
+ );
58
+ return given.map((formula) => [formula]);
59
+ };
60
+
61
+ export const RECORD_RULES = {
62
+ tuple_eq_match: (args) => {
63
+ const sides = expectApp(args[0], "=", 2);
64
+ const left = expectApp(sides[0], "TLA.tuple");
65
+ const right = expectApp(sides[1], "TLA.tuple");
66
+ ensure(left.length === right.length);
67
+ return {
68
+ premises: [args[0]],
69
+ branches: [left.map((inner, index) => equal(inner, right[index]))],
70
+ };
71
+ },
72
+ tuple_eq_mismatch: (args) => {
73
+ const sides = expectApp(args[0], "=", 2);
74
+ ensure(expectApp(sides[0], "TLA.tuple").length !== expectApp(sides[1], "TLA.tuple").length);
75
+ return { premises: [args[0]], branches: [] };
76
+ },
77
+ in_product: (args) => {
78
+ const sides = expectApp(args[0], "TLA.in", 2);
79
+ const element = sides[0];
80
+ const components = expectApp(expectApp(sides[1], "TLA.Product", 1)[0], "TLA.tuple");
81
+ return {
82
+ premises: [args[0]],
83
+ branches: [
84
+ [
85
+ app("TLA.isASeq", [element]),
86
+ equal(app("TLA.Len", [element]), makeNatural(components.length)),
87
+ ...components.map((inner, index) =>
88
+ member(fapply(element, makeNatural(index + 1)), inner),
89
+ ),
90
+ ],
91
+ ],
92
+ };
93
+ },
94
+ notin_product: (args) => {
95
+ const sides = expectApp(expectNot(args[0]), "TLA.in", 2);
96
+ const element = sides[0];
97
+ const components = expectApp(expectApp(sides[1], "TLA.Product", 1)[0], "TLA.tuple");
98
+ return {
99
+ premises: [args[0]],
100
+ branches: [
101
+ [not(app("TLA.isASeq", [element]))],
102
+ [not(equal(app("TLA.Len", [element]), makeNatural(components.length)))],
103
+ ...components.map((inner, index) => [
104
+ not(member(fapply(element, makeNatural(index + 1)), inner)),
105
+ ]),
106
+ ],
107
+ };
108
+ },
109
+ tuple_notisaseq: (args) => {
110
+ expectApp(expectApp(expectNot(args[0]), "TLA.isASeq", 1)[0], "TLA.tuple");
111
+ return { premises: [args[0]], branches: [] };
112
+ },
113
+ record_eq_match: (args, checker) => {
114
+ const sides = expectApp(args[0], "=", 2);
115
+ const left = getFields(sides[0], "TLA.record");
116
+ const right = getFields(sides[1], "TLA.record");
117
+ const valuesByLabel = new Map(right.map((field) => [getStringText(field[0]), field[1]]));
118
+ const equalities = left.flatMap((field) => {
119
+ const other = valuesByLabel.get(getStringText(field[0]));
120
+ return other === undefined ? [] : [equal(field[1], other)];
121
+ });
122
+ const keys = new Set(equalities.map(checker.getTopKey));
123
+ const given = args.slice(1);
124
+ ensure(given.every((formula) => keys.has(checker.getTopKey(formula))));
125
+ return { premises: [args[0]], branches: [given] };
126
+ },
127
+ record_eq_mismatch: (args) => {
128
+ const sides = expectApp(args[0], "=", 2);
129
+ const leftLabels = getFields(sides[0], "TLA.record").map((field) => getStringText(field[0]));
130
+ const rightLabels = new Set(
131
+ getFields(sides[1], "TLA.record").map((field) => getStringText(field[0])),
132
+ );
133
+ ensure(
134
+ leftLabels.length !== rightLabels.size || leftLabels.some((label) => !rightLabels.has(label)),
135
+ );
136
+ return { premises: [args[0]], branches: [] };
137
+ },
138
+ record_neq_match: (args, checker) => {
139
+ const sides = expectApp(expectNot(args[0]), "=", 2);
140
+ const left = getFields(sides[0], "TLA.record");
141
+ const right = getFields(sides[1], "TLA.record");
142
+ const valuesByLabel = new Map(right.map((field) => [getStringText(field[0]), field[1]]));
143
+ ensure(left.length === right.length);
144
+ const inequalities = left.map((field) => {
145
+ const other = valuesByLabel.get(getStringText(field[0]));
146
+ ensure(other !== undefined);
147
+ return not(equal(field[1], other));
148
+ });
149
+ return {
150
+ premises: [args[0]],
151
+ branches: expectSameSet(checker, args.slice(1), inequalities),
152
+ };
153
+ },
154
+ neq_record: (args) => getRecordInequalitySpec(args[0], true),
155
+ record_neq: (args) => getRecordInequalitySpec(args[0], false),
156
+ in_recordset: (args) => {
157
+ const sides = expectApp(args[0], "TLA.in", 2);
158
+ const element = sides[0];
159
+ const fields = getFields(sides[1], "TLA.recordset");
160
+ return {
161
+ premises: [args[0]],
162
+ branches: [
163
+ [
164
+ app("TLA.isAFcn", [element]),
165
+ equal(domain(element), getLabels(fields)),
166
+ ...fields.map((field) => member(fapply(element, field[0]), field[1])),
167
+ ],
168
+ ],
169
+ };
170
+ },
171
+ notin_recordset: (args) => {
172
+ const sides = expectApp(expectNot(args[0]), "TLA.in", 2);
173
+ const element = sides[0];
174
+ const fields = getFields(sides[1], "TLA.recordset");
175
+ return {
176
+ premises: [args[0]],
177
+ branches: [
178
+ [not(app("TLA.isAFcn", [element]))],
179
+ [not(equal(domain(element), getLabels(fields)))],
180
+ ...fields.map((field) => [not(member(fapply(element, field[0]), field[1]))]),
181
+ ],
182
+ };
183
+ },
184
+ record_notisafcn: (args) => {
185
+ expectApp(expectApp(expectNot(args[0]), "TLA.isAFcn", 1)[0], "TLA.record");
186
+ return { premises: [args[0]], branches: [] };
187
+ },
188
+ } satisfies Partial<SpecTable<PlainRuleName>>;
@@ -0,0 +1,121 @@
1
+ // Whether the hypotheses make a relation reflexive, symmetric or transitive, which Zenon's rules for
2
+ // relations other than = rely on. The property holds when no way for the relation to hold among
3
+ // three elements satisfies the ground instances of the hypotheses and breaks the property.
4
+
5
+ import type { CheckContext, RelationProperty, Term } from "./terms";
6
+
7
+ type Polarity = "positive" | "negative" | "both";
8
+
9
+ // A hypothesis as a test on how a relation holds among three elements: `values` gives the bound
10
+ // variables their elements and bit 3 * i + j of `holds` says whether the relation holds from
11
+ // element i to element j.
12
+ type GroundTest = (values: number[], holds: number) => boolean;
13
+
14
+ const ELEMENTS = [0, 1, 2];
15
+
16
+ // The type Zenon gives a variable that its binder leaves untyped, which ranges over everything.
17
+ const UNTYPED = "zenon_U";
18
+
19
+ // The ground instances of a hypothesis over three elements. A universal quantifier where the
20
+ // hypothesis asserts it, or an existential where it denies it, becomes a test over the three
21
+ // elements, which the hypothesis implies. Undefined when the hypothesis says anything but how the
22
+ // relation holds between bound variables, so that it's left out.
23
+ const getGroundTest = (
24
+ formula: Term,
25
+ symbol: string,
26
+ bound: string[],
27
+ polarity: Polarity,
28
+ ): GroundTest | undefined => {
29
+ const flip = (): Polarity =>
30
+ polarity === "both" ? "both" : polarity === "positive" ? "negative" : "positive";
31
+ switch (formula.kind) {
32
+ case "true":
33
+ return () => true;
34
+ case "false":
35
+ return () => false;
36
+ case "not": {
37
+ const operand = getGroundTest(formula.args[0], symbol, bound, flip());
38
+ return operand && ((values, holds) => !operand(values, holds));
39
+ }
40
+ case "and":
41
+ case "or":
42
+ case "imply":
43
+ case "equiv": {
44
+ const left = getGroundTest(
45
+ formula.args[0],
46
+ symbol,
47
+ bound,
48
+ formula.kind === "imply" ? flip() : formula.kind === "equiv" ? "both" : polarity,
49
+ );
50
+ const right = getGroundTest(
51
+ formula.args[1],
52
+ symbol,
53
+ bound,
54
+ formula.kind === "equiv" ? "both" : polarity,
55
+ );
56
+ if (left === undefined || right === undefined) return undefined;
57
+ if (formula.kind === "and")
58
+ return (values, holds) => left(values, holds) && right(values, holds);
59
+ if (formula.kind === "or")
60
+ return (values, holds) => left(values, holds) || right(values, holds);
61
+ if (formula.kind === "imply")
62
+ return (values, holds) => !left(values, holds) || right(values, holds);
63
+ return (values, holds) => left(values, holds) === right(values, holds);
64
+ }
65
+ case "all":
66
+ case "ex": {
67
+ const isUniversal =
68
+ formula.kind === "all" ? polarity === "positive" : polarity === "negative";
69
+ if (!isUniversal || formula.symbol !== UNTYPED) return undefined;
70
+ const body = getGroundTest(
71
+ formula.args[1],
72
+ symbol,
73
+ [...bound, formula.args[0].symbol],
74
+ polarity,
75
+ );
76
+ if (body === undefined) return undefined;
77
+ return formula.kind === "all"
78
+ ? (values, holds) => ELEMENTS.every((element) => body([...values, element], holds))
79
+ : (values, holds) => ELEMENTS.some((element) => body([...values, element], holds));
80
+ }
81
+ case "app": {
82
+ if (formula.symbol !== symbol || formula.args.length !== 2) return undefined;
83
+ const positions = formula.args.map((inner) =>
84
+ inner.kind === "var" ? bound.lastIndexOf(inner.symbol) : -1,
85
+ );
86
+ if (positions.includes(-1)) return undefined;
87
+ return (values, holds) =>
88
+ ((holds >> (3 * values[positions[0]] + values[positions[1]])) & 1) === 1;
89
+ }
90
+ default:
91
+ return undefined;
92
+ }
93
+ };
94
+
95
+ // = has every property. Another relation has the ones the hypotheses give it.
96
+ export const createRelationProperties = (context: CheckContext) => {
97
+ const cache = new Map<string, boolean>();
98
+ const hasProperty = (symbol: string, property: RelationProperty) => {
99
+ const key = `${property}:${symbol}`;
100
+ const cached = cache.get(key);
101
+ if (cached !== undefined) return cached;
102
+ const tests = context.hypotheses.flatMap((hypothesis) => {
103
+ const test = getGroundTest(hypothesis, symbol, [], "positive");
104
+ return test === undefined ? [] : [test];
105
+ });
106
+ const has = (holds: number, from: number, to: number) => ((holds >> (3 * from + to)) & 1) === 1;
107
+ const isBroken = (holds: number) =>
108
+ property === "reflexive"
109
+ ? !has(holds, 0, 0)
110
+ : property === "symmetric"
111
+ ? has(holds, 0, 1) && !has(holds, 1, 0)
112
+ : has(holds, 0, 1) && has(holds, 1, 2) && !has(holds, 0, 2);
113
+ const result = [...Array(512).keys()].every(
114
+ (holds) => !isBroken(holds) || !tests.every((test) => test([], holds)),
115
+ );
116
+ cache.set(key, result);
117
+ return result;
118
+ };
119
+ return (symbol: string, properties: RelationProperty[]) =>
120
+ symbol === "=" || properties.every((property) => hasProperty(symbol, property));
121
+ };
@@ -0,0 +1,224 @@
1
+ // The checks of the TLA+ extension's rules that rewrite a subterm in place: evaluating a function
2
+ // application, DOMAIN, IF, CASE, Len, or a formula used as a term. Each rule names the context of
3
+ // the subterm as a lambda, (\x. context).
4
+
5
+ import type { PlainRuleName } from "../proof";
6
+ import { getFields } from "./records";
7
+ import {
8
+ and,
9
+ app,
10
+ domain,
11
+ ensure,
12
+ equal,
13
+ expectApp,
14
+ FALSE,
15
+ fapply,
16
+ getPairs,
17
+ getStringText,
18
+ instantiate,
19
+ isApp,
20
+ isVariable,
21
+ makeNatural,
22
+ member,
23
+ not,
24
+ TRUE,
25
+ type Checker,
26
+ type RuleSpec,
27
+ type SpecTable,
28
+ type Term,
29
+ } from "./terms";
30
+
31
+ // The term that fills the hole of a context to give a formula.
32
+ const getFilled = (lambda: Term, formula: Term) => {
33
+ ensure(lambda.kind === "lam");
34
+ const hole = lambda.args[0].symbol;
35
+ const find = (context: Term, candidate: Term): Term | undefined => {
36
+ if (context.kind === "var" && context.symbol === hole) return candidate;
37
+ if (context.kind !== candidate.kind || context.symbol !== candidate.symbol) return undefined;
38
+ if (context.args.length !== candidate.args.length) return undefined;
39
+ if (context.kind !== "app" && context.kind !== "not") return undefined;
40
+ for (let index = 0; index < context.args.length; index++) {
41
+ const found = find(context.args[index], candidate.args[index]);
42
+ if (found !== undefined) return found;
43
+ }
44
+ return undefined;
45
+ };
46
+ const filled = find(lambda.args[1], formula);
47
+ ensure(filled !== undefined);
48
+ return filled;
49
+ };
50
+
51
+ const getRewriteSpec = (
52
+ checker: Checker,
53
+ formula: Term,
54
+ lambda: Term,
55
+ build: (filled: Term) => Term[][],
56
+ ): RuleSpec => {
57
+ const filled = getFilled(lambda, formula);
58
+ ensure(checker.isSame(formula, instantiate(lambda, filled)));
59
+ return { premises: [formula], branches: build(filled) };
60
+ };
61
+
62
+ const getCaseBranches = (lambda: Term, args: Term[], condition: Term): Term[][] => {
63
+ if (args.length === 0) return [[condition]];
64
+ if (args.length === 1) return [[condition, instantiate(lambda, args[0])]];
65
+ return [
66
+ [args[0], instantiate(lambda, args[1])],
67
+ ...getCaseBranches(lambda, args.slice(2), and(not(args[0]), condition)),
68
+ ];
69
+ };
70
+
71
+ // A formula used as a term splits into the cases where it equals TRUE and FALSE.
72
+ const getBoolCaseSpec = (
73
+ checker: Checker,
74
+ args: Term[],
75
+ isKind: (operand: Term) => boolean,
76
+ ): RuleSpec => {
77
+ const operand = expectApp(args[1], "=", 2)[0];
78
+ ensure(isKind(operand));
79
+ const lambda = args[5];
80
+ const filled = getFilled(lambda, args[0]);
81
+ ensure(checker.isSame(filled, operand) && checker.isSame(args[0], instantiate(lambda, operand)));
82
+ return {
83
+ premises: [args[0]],
84
+ branches: [
85
+ [equal(operand, TRUE), instantiate(lambda, TRUE)],
86
+ [equal(operand, FALSE), instantiate(lambda, FALSE)],
87
+ ],
88
+ };
89
+ };
90
+
91
+ const getNatural = (formula: Term): number => {
92
+ let count = 0;
93
+ let current = formula;
94
+ while (isApp(current, "TLA.fapply", 2) && isVariable(current.args[0], "TLA.Succ")) {
95
+ count++;
96
+ current = current.args[1];
97
+ }
98
+ ensure(current.kind === "var" && /^(0|[1-9][0-9]*)$/.test(current.symbol));
99
+ return count + Number(current.symbol);
100
+ };
101
+
102
+ export const REWRITE_RULES = {
103
+ trueistrue: (args, checker) => {
104
+ const lambda = args[3];
105
+ const subterm = args[1];
106
+ ensure(lambda.kind === "lam" && checker.isSame(args[0], instantiate(lambda, subterm)));
107
+ return { premises: [args[0], subterm], branches: [[instantiate(lambda, TRUE)]] };
108
+ },
109
+ fapplyfcn: (args, checker) =>
110
+ getRewriteSpec(checker, args[0], args[3], (filled) => {
111
+ const applied = expectApp(filled, "TLA.fapply", 2);
112
+ const fcn = expectApp(applied[0], "TLA.Fcn", 2);
113
+ ensure(fcn[1].kind === "lam");
114
+ return [
115
+ [not(member(applied[1], fcn[0]))],
116
+ [instantiate(args[3], instantiate(fcn[1], applied[1]))],
117
+ ];
118
+ }),
119
+ fapplyexcept: (args, checker) =>
120
+ getRewriteSpec(checker, args[0], args[8], (filled) => {
121
+ const applied = expectApp(filled, "TLA.fapply", 2);
122
+ const except = expectApp(applied[0], "TLA.except", 3);
123
+ const argument = applied[1];
124
+ const inDomain = member(argument, domain(except[0]));
125
+ return [
126
+ [inDomain, equal(except[1], argument), instantiate(args[8], except[2])],
127
+ [
128
+ inDomain,
129
+ not(equal(except[1], argument)),
130
+ instantiate(args[8], fapply(except[0], argument)),
131
+ ],
132
+ [not(inDomain)],
133
+ ];
134
+ }),
135
+ tuple_access: (args, checker) =>
136
+ getRewriteSpec(checker, args[0], args[2], (filled) => {
137
+ const applied = expectApp(filled, "TLA.fapply", 2);
138
+ const components = expectApp(applied[0], "TLA.tuple");
139
+ const position = getNatural(applied[1]);
140
+ ensure(position >= 1 && position <= components.length);
141
+ return [[instantiate(args[2], components[position - 1])]];
142
+ }),
143
+ record_access: (args, checker) =>
144
+ getRewriteSpec(checker, args[0], args[2], (filled) => {
145
+ const applied = expectApp(filled, "TLA.fapply", 2);
146
+ const label = getStringText(applied[1]);
147
+ const field = getFields(applied[0], "TLA.record").find(
148
+ (inner) => getStringText(inner[0]) === label,
149
+ );
150
+ ensure(field !== undefined);
151
+ return [[instantiate(args[2], field[1])]];
152
+ }),
153
+ domain_fcn: (args, checker) =>
154
+ getRewriteSpec(checker, args[0], args[2], (filled) => {
155
+ const fcn = expectApp(expectApp(filled, "TLA.DOMAIN", 1)[0], "TLA.Fcn", 2);
156
+ return [[instantiate(args[2], fcn[0])]];
157
+ }),
158
+ domain_except: (args, checker) =>
159
+ getRewriteSpec(checker, args[0], args[2], (filled) => {
160
+ const except = expectApp(expectApp(filled, "TLA.DOMAIN", 1)[0], "TLA.except", 3);
161
+ return [[instantiate(args[2], domain(except[0]))]];
162
+ }),
163
+ record_domain: (args, checker) =>
164
+ getRewriteSpec(checker, args[0], args[2], (filled) => {
165
+ const record = expectApp(filled, "TLA.DOMAIN", 1)[0];
166
+ const fields = getPairs(expectApp(record, "TLA.record"));
167
+ return [
168
+ [
169
+ instantiate(
170
+ args[2],
171
+ app(
172
+ "TLA.set",
173
+ fields.map((field) => field[0]),
174
+ ),
175
+ ),
176
+ ],
177
+ ];
178
+ }),
179
+ boolcase_not: (args, checker) =>
180
+ getBoolCaseSpec(checker, args, (operand) => operand.kind === "not"),
181
+ boolcase_and: (args, checker) =>
182
+ getBoolCaseSpec(checker, args, (operand) => operand.kind === "and"),
183
+ boolcase_or: (args, checker) =>
184
+ getBoolCaseSpec(checker, args, (operand) => operand.kind === "or"),
185
+ boolcase_imply: (args, checker) =>
186
+ getBoolCaseSpec(checker, args, (operand) => operand.kind === "imply"),
187
+ boolcase_equiv: (args, checker) =>
188
+ getBoolCaseSpec(checker, args, (operand) => operand.kind === "equiv"),
189
+ boolcase_equal: (args, checker) =>
190
+ getBoolCaseSpec(checker, args, (operand) => isApp(operand, "=", 2)),
191
+ boolcase_all: (args, checker) =>
192
+ getBoolCaseSpec(checker, args, (operand) => operand.kind === "all"),
193
+ boolcase_ex: (args, checker) =>
194
+ getBoolCaseSpec(checker, args, (operand) => operand.kind === "ex"),
195
+ iftrue: (args, checker) =>
196
+ getRewriteSpec(checker, args[0], args[2], (filled) => {
197
+ const operands = expectApp(filled, "TLA.cond", 3);
198
+ ensure(operands[0].kind === "true");
199
+ return [[instantiate(args[2], operands[1])]];
200
+ }),
201
+ iffalse: (args, checker) =>
202
+ getRewriteSpec(checker, args[0], args[2], (filled) => {
203
+ const operands = expectApp(filled, "TLA.cond", 3);
204
+ ensure(operands[0].kind === "false");
205
+ return [[instantiate(args[2], operands[2])]];
206
+ }),
207
+ ifthenelse: (args, checker) =>
208
+ getRewriteSpec(checker, args[0], args[5], (filled) => {
209
+ const operands = expectApp(filled, "TLA.cond", 3);
210
+ return [
211
+ [operands[0], instantiate(args[5], operands[1])],
212
+ [not(operands[0]), instantiate(args[5], operands[2])],
213
+ ];
214
+ }),
215
+ case: (args, checker) =>
216
+ getRewriteSpec(checker, args[0], args[1], (filled) =>
217
+ getCaseBranches(args[1], expectApp(filled, "TLA.CASE"), TRUE),
218
+ ),
219
+ tuple_len: (args, checker) =>
220
+ getRewriteSpec(checker, args[0], args[2], (filled) => {
221
+ const components = expectApp(expectApp(filled, "TLA.Len", 1)[0], "TLA.tuple");
222
+ return [[instantiate(args[2], makeNatural(components.length))]];
223
+ }),
224
+ } satisfies Partial<SpecTable<PlainRuleName>>;