tla-ts 0.0.9 → 0.0.10-dev.06b481ee0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1156 -888
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +330 -659
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +137 -22
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -322
  64. package/src/liveness.ts +230 -133
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +36 -60
  88. package/src/parallel.ts +64 -73
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +135 -40
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +299 -108
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,1108 @@
1
+ import type { Bound, Declaration, Definition, Expression, Instance } from "../ast";
2
+ import { TlaSyntaxError } from "../errors";
3
+ import { createLevelFields } from "./builtins";
4
+ import {
5
+ createContext,
6
+ type ExprNode,
7
+ type ExprOrOpArgNode,
8
+ type FormalParamNode,
9
+ formatSanyLocation,
10
+ getSymbolArity,
11
+ type InstanceNode,
12
+ isAbsent,
13
+ type LabelNode,
14
+ type LetInNode,
15
+ type OpApplNode,
16
+ type OpArgNode,
17
+ type OpDeclNode,
18
+ type OpDefNode,
19
+ type SanyLocation,
20
+ type SymbolNode,
21
+ type ThmOrAssumpDefNode,
22
+ } from "./nodes";
23
+ import { getSelectorItems, isGeneralId, type SelectorItem } from "./selectors";
24
+ import {
25
+ findNameTokens,
26
+ findToken,
27
+ getArgumentSpan,
28
+ getExpressionSpan,
29
+ getMatchingIndex,
30
+ getParenthesizedSpan,
31
+ getPreComments,
32
+ getSpanLocation,
33
+ getTokenIndex,
34
+ getTokenLocation,
35
+ getTokenSource,
36
+ isToken,
37
+ type SourceFile,
38
+ type TokenSpan,
39
+ } from "./source";
40
+ import {
41
+ applyBuiltin,
42
+ createFormalParam,
43
+ createNullNode,
44
+ createOpArg,
45
+ createOpDef,
46
+ createString,
47
+ getBuiltin,
48
+ getLocation,
49
+ type ModuleGeneration,
50
+ popLabels,
51
+ pushLabelScope,
52
+ resolveSymbol,
53
+ withContext,
54
+ } from "./generation";
55
+ import { resolveSynonym } from "../tlc/jar-data";
56
+ import { getOperandSpan } from "./generator-def-entries";
57
+ import {
58
+ checkForUndefinedRecursiveOps,
59
+ getDefinitionSpan,
60
+ processFunction,
61
+ processModuleDefinition,
62
+ processOperator,
63
+ processRecursive,
64
+ } from "./generator-definitions";
65
+
66
+ const isIdentifier = (name: string) => /^[A-Za-z0-9_]+$/.test(name);
67
+
68
+ const isSelector = (name: string) => name !== "!!" && name.includes("!");
69
+
70
+ interface BoundSymbols {
71
+ bounded: FormalParamNode[][];
72
+ tupleOrs: boolean[];
73
+ ranges: ExprNode[];
74
+ }
75
+
76
+ type LetUnit =
77
+ | { kind: "Recursive"; declarations: Declaration[] }
78
+ | { kind: "Instance"; instance: Instance }
79
+ | { kind: "Definition"; definition: Definition };
80
+
81
+ const getNumeralDigits = (text: string) =>
82
+ BigInt(text.startsWith("\\") ? `0${text.slice(1).replace(/^h/i, "x")}` : text).toString();
83
+
84
+ const OPERATOR_ARGUMENT_KINDS = new Set<Expression["kind"]>([
85
+ "Identifier",
86
+ "Subexpression",
87
+ "OperatorReference",
88
+ "Lambda",
89
+ ]);
90
+
91
+ const isOperatorArgument = (argument: Expression) => {
92
+ const items = argument.kind === "Apply" ? getSelectorItems(argument) : undefined;
93
+ return OPERATOR_ARGUMENT_KINDS.has(argument.kind) || (items !== undefined && isGeneralId(items));
94
+ };
95
+
96
+ const locateSelectorItems = (file: SourceFile, items: SelectorItem[], span: TokenSpan) => {
97
+ let cursor = span.start;
98
+ return items.map((item): SelectorItem => {
99
+ const text = item.op === "Name" ? item.name : item.op === "Null" ? "(" : String(item.op);
100
+ const index = findToken(file, cursor, span.end, text);
101
+ if (index === -1) return item;
102
+ if (item.op === "Null") {
103
+ const close = getMatchingIndex(file, index);
104
+ cursor = close + 1;
105
+ return { ...item, location: getSpanLocation(file, { start: index, end: close }) };
106
+ }
107
+ cursor = index + 1;
108
+ const location = getTokenLocation(file, index);
109
+ if (item.args === undefined || !isToken(file, index + 1, "(")) return { ...item, location };
110
+ const close = getMatchingIndex(file, index + 1);
111
+ cursor = close + 1;
112
+ return {
113
+ ...item,
114
+ location,
115
+ argsLocation: getSpanLocation(file, { start: index + 1, end: close }),
116
+ };
117
+ });
118
+ };
119
+
120
+ export const generateSelector = (
121
+ generation: ModuleGeneration,
122
+ expression: Expression,
123
+ expectedArity: number,
124
+ isFact: boolean,
125
+ isDef: boolean,
126
+ ) => {
127
+ const items = getSelectorItems(expression);
128
+ if (items === undefined) throw new TlaSyntaxError(`Expected a name, found ${expression.kind}`);
129
+ return generation.selectorToNode(
130
+ locateSelectorItems(generation.file, items, getExpressionSpan(generation.file, expression)),
131
+ expectedArity,
132
+ isFact,
133
+ isDef,
134
+ getLocation(generation.file, expression),
135
+ );
136
+ };
137
+
138
+ const generateSelectorExpression = (generation: ModuleGeneration, expression: Expression) => {
139
+ const node = generateSelector(generation, expression, 0, false, false);
140
+ if (node.kind !== "OpAppl") throw new TlaSyntaxError("Expected an expression");
141
+ return node;
142
+ };
143
+
144
+ const checkRecursion = (generation: ModuleGeneration, node: ExprNode) => {
145
+ if (node.kind !== "OpAppl") return;
146
+ const recursive = generation.functions.find((entry) => entry.name === node.operator.name);
147
+ if (recursive) recursive.node.operator = getBuiltin(generation, "$RecursiveFcnSpec");
148
+ };
149
+
150
+ const getBoundGroups = (bounds: Bound[]) =>
151
+ bounds.reduce<Bound[][]>((groups, bound) => {
152
+ const last = groups[groups.length - 1];
153
+ const isSameGroup =
154
+ last !== undefined &&
155
+ last[0].set === bound.set &&
156
+ bound.pattern.kind === "Name" &&
157
+ last[0].pattern.kind === "Name";
158
+ if (isSameGroup) last.push(bound);
159
+ else groups.push([bound]);
160
+ return groups;
161
+ }, []);
162
+
163
+ export const generateBounds = (
164
+ generation: ModuleGeneration,
165
+ bounds: Bound[],
166
+ searchStart: number,
167
+ ) =>
168
+ generateBoundsWithRanges(
169
+ generation,
170
+ bounds,
171
+ searchStart,
172
+ getBoundGroups(bounds).map((group) => generateExpression(generation, group[0].set)),
173
+ );
174
+
175
+ export const generateWithParams = (
176
+ generation: ModuleGeneration,
177
+ params: FormalParamNode[],
178
+ expression: Expression,
179
+ ) => {
180
+ const scope = generation.labelScopes.at(-1);
181
+ scope?.params.push(params);
182
+ const node = generateExpression(generation, expression);
183
+ scope?.params.pop();
184
+ return node;
185
+ };
186
+
187
+ const generateBoundApplication = (
188
+ generation: ModuleGeneration,
189
+ name: string,
190
+ bounds: Bound[],
191
+ searchStart: number,
192
+ body: Expression,
193
+ location: SanyLocation,
194
+ ) =>
195
+ withContext(generation, createContext(), () => {
196
+ const symbols = generateBounds(generation, bounds, searchStart);
197
+ const operand = generateWithParams(generation, symbols.bounded.flat(), body);
198
+ return applyBuiltin(generation, name, [operand], location, symbols);
199
+ });
200
+
201
+ const generateLambda = (
202
+ generation: ModuleGeneration,
203
+ expression: Expression & { kind: "Lambda" },
204
+ ): OpDefNode => {
205
+ const span = getExpressionSpan(generation.file, expression);
206
+ const nameIndexes = findNameTokens(generation.file, span.start, span.end, expression.params);
207
+ return withContext(generation, createContext(), () => {
208
+ const params = expression.params.map((name, index) =>
209
+ createFormalParam(
210
+ generation,
211
+ name,
212
+ 0,
213
+ getTokenLocation(generation.file, nameIndexes[index]),
214
+ true,
215
+ ),
216
+ );
217
+ const body = generateWithParams(generation, params, expression.body);
218
+ return createOpDef(generation, {
219
+ name: "LAMBDA",
220
+ params,
221
+ body,
222
+ location: getSpanLocation(generation.file, span),
223
+ preComments: getPreComments(generation.file, span.start),
224
+ });
225
+ });
226
+ };
227
+
228
+ const getOperatorArgumentName = (file: SourceFile, argument: Expression) =>
229
+ argument.kind === "OperatorReference"
230
+ ? argument.operator
231
+ : argument.kind === "Lambda" && argument.body.kind === "Apply"
232
+ ? argument.body.operator
233
+ : file.tokens[getTokenIndex(file, argument.location)].text;
234
+
235
+ const resolveOperatorArgument = (
236
+ generation: ModuleGeneration,
237
+ argument: Expression,
238
+ location: SanyLocation,
239
+ ) => {
240
+ const name = getOperatorArgumentName(generation.file, argument);
241
+ const symbol = resolveSymbol(generation.contexts, resolveSynonym(name));
242
+ if (symbol !== undefined) return createOpArg(generation, symbol, location);
243
+ generation.addError(location, `Could not find declaration or definition of symbol '${name}'.`);
244
+ return createNullNode(generation);
245
+ };
246
+
247
+ export const generateOperatorArgument = (
248
+ generation: ModuleGeneration,
249
+ argument: Expression,
250
+ target: OpDeclNode,
251
+ ): OpArgNode | OpApplNode => {
252
+ const span = getExpressionSpan(generation.file, argument);
253
+ const parenthesizedSpan = getParenthesizedSpan(generation.file, span);
254
+ const location = getSpanLocation(generation.file, parenthesizedSpan);
255
+ const isParenthesized = parenthesizedSpan !== span;
256
+ if (argument.kind === "Lambda" && !isParenthesized) {
257
+ if (argument.location.range !== undefined && argument.operator === undefined)
258
+ return createOpArg(generation, generateLambda(generation, argument), location);
259
+ return resolveOperatorArgument(generation, argument, location);
260
+ }
261
+ if (isParenthesized || !isOperatorArgument(argument)) {
262
+ generation.addError(
263
+ location,
264
+ `Arity ${target.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${target.name}'.`,
265
+ );
266
+ return createNullNode(generation);
267
+ }
268
+ if (argument.kind === "OperatorReference") {
269
+ return resolveOperatorArgument(generation, argument, location);
270
+ }
271
+ const node = generateSelector(generation, argument, target.arity, false, false);
272
+ if (node.kind === "OpArg" || (node.kind === "OpAppl" && node.nullKind !== undefined)) return node;
273
+ throw new TlaSyntaxError(
274
+ `Expected an operator argument at line ${location.beginLine}, column ${location.beginColumn}`,
275
+ );
276
+ };
277
+
278
+ export const generateArgument = (
279
+ generation: ModuleGeneration,
280
+ operator: SymbolNode,
281
+ index: number,
282
+ argument: Expression,
283
+ operatorLocation: SanyLocation,
284
+ ): ExprOrOpArgNode => {
285
+ const params =
286
+ operator.kind === "OpDef" &&
287
+ (operator.defKind === "UserDefined" || operator.defKind === "ModuleInstance")
288
+ ? (operator.params ?? [])
289
+ : undefined;
290
+ if (params !== undefined && params.length <= index) return createNullNode(generation);
291
+ const expectedArity = params?.[index]?.arity ?? 0;
292
+ if (expectedArity === 0) return generateExpression(generation, argument);
293
+ const span = getExpressionSpan(generation.file, argument);
294
+ const location = getSpanLocation(generation.file, span);
295
+ const position = `${index + 1} (counting from 1)`;
296
+ const argumentSpan = getArgumentSpan(generation.file, span);
297
+ if (argumentSpan !== span || !isOperatorArgument(argument)) {
298
+ generation.addError(
299
+ getSpanLocation(generation.file, argumentSpan),
300
+ `An expression appears as argument number ${position} to operator '${operator.name}', in a position an operator is required.`,
301
+ );
302
+ return createNullNode(generation);
303
+ }
304
+ if (
305
+ argument.kind === "Identifier" ||
306
+ argument.kind === "Subexpression" ||
307
+ argument.kind === "Apply"
308
+ ) {
309
+ const node = generateSelector(generation, argument, expectedArity, false, false);
310
+ if (node.kind === "OpArg" || node.kind === "OpAppl") return node;
311
+ throw new TlaSyntaxError(`Expected an operator argument at ${formatSanyLocation(location)}`);
312
+ }
313
+ if (
314
+ argument.kind === "Lambda" &&
315
+ argument.location.range !== undefined &&
316
+ argument.operator === undefined
317
+ ) {
318
+ const lambda = generateLambda(generation, argument);
319
+ const arity = getSymbolArity(lambda);
320
+ if (arity === expectedArity) return createOpArg(generation, lambda, location);
321
+ generation.addError(
322
+ operatorLocation,
323
+ `Lambda expression with arity ${arity} used as argument ${index + 1} of operator \`${operator.name}', \nbut an operator of arity ${expectedArity} is required.`,
324
+ );
325
+ return createNullNode(generation);
326
+ }
327
+ const name = getOperatorArgumentName(generation.file, argument);
328
+ const symbol = resolveSymbol(generation.contexts, resolveSynonym(name));
329
+ if (symbol === undefined) {
330
+ generation.addError(location, `Could not find declaration or definition of symbol '${name}'.`);
331
+ return createNullNode(generation);
332
+ }
333
+ const arity = getSymbolArity(symbol);
334
+ if (arity === expectedArity) return createOpArg(generation, symbol, location);
335
+ generation.addError(
336
+ operatorLocation,
337
+ `Operator with incorrect arity passed as argument. \nOperator '${symbol.name}' of arity ${arity} is argument number ${position} to operator \`${formatSanyLocation(operator.location)}', \nbut an operator of arity ${expectedArity} was expected.`,
338
+ );
339
+ return createNullNode(generation);
340
+ };
341
+
342
+ const generateJunction = (
343
+ generation: ModuleGeneration,
344
+ expression: Expression & { kind: "And" | "Or" },
345
+ ) => {
346
+ const location = getLocation(generation.file, expression);
347
+ if (expression.isBulleted) {
348
+ return applyBuiltin(
349
+ generation,
350
+ expression.kind === "And" ? "$ConjList" : "$DisjList",
351
+ expression.operands.map((operand) => generateExpression(generation, operand)),
352
+ location,
353
+ );
354
+ }
355
+ const span = getExpressionSpan(generation.file, expression);
356
+ const name = expression.kind === "And" ? "\\land" : "\\lor";
357
+ const [first, ...rest] = expression.operands;
358
+ return rest.reduce<ExprNode>(
359
+ (left, operand, index) => {
360
+ const operandSpan = getOperandSpan(generation.file, operand);
361
+ const end = index === rest.length - 1 ? span.end : operandSpan.end;
362
+ return applyBuiltin(
363
+ generation,
364
+ name,
365
+ [left, generateExpression(generation, operand)],
366
+ getSpanLocation(generation.file, { start: span.start, end }),
367
+ );
368
+ },
369
+ generateExpression(generation, first),
370
+ );
371
+ };
372
+
373
+ const generateCase = (generation: ModuleGeneration, expression: Expression & { kind: "Case" }) => {
374
+ const span = getExpressionSpan(generation.file, expression);
375
+ const arms = expression.arms.map((arm, index) => {
376
+ const condition = getOperandSpan(generation.file, arm.condition);
377
+ const isLast = index === expression.arms.length - 1 && expression.other === undefined;
378
+ const body = getOperandSpan(generation.file, arm.body);
379
+ const operands = [
380
+ generateExpression(generation, arm.condition),
381
+ generateExpression(generation, arm.body),
382
+ ];
383
+ return applyBuiltin(
384
+ generation,
385
+ "$Pair",
386
+ operands,
387
+ getSpanLocation(generation.file, {
388
+ start: condition.start,
389
+ end: isLast ? span.end : body.end,
390
+ }),
391
+ );
392
+ });
393
+ const other = expression.other;
394
+ if (other) {
395
+ const body = getOperandSpan(generation.file, other);
396
+ const otherIndex = findTokenBefore(generation.file, body.start, "OTHER");
397
+ arms.push(
398
+ applyBuiltin(
399
+ generation,
400
+ "$Pair",
401
+ [undefined, generateExpression(generation, other)],
402
+ getSpanLocation(generation.file, { start: otherIndex, end: span.end }),
403
+ ),
404
+ );
405
+ }
406
+ return applyBuiltin(generation, "$Case", arms, getSpanLocation(generation.file, span));
407
+ };
408
+
409
+ const findTokenBefore = (file: SourceFile, index: number, text: string) => {
410
+ for (let current = index; current >= 0; current--) {
411
+ if (isToken(file, current, text)) return current;
412
+ }
413
+ return index;
414
+ };
415
+
416
+ const generateExcept = (
417
+ generation: ModuleGeneration,
418
+ expression: Expression & { kind: "Except" },
419
+ ) => {
420
+ const span = getExpressionSpan(generation.file, expression);
421
+ const location = getSpanLocation(generation.file, span);
422
+ const operands: ExprOrOpArgNode[] = [generateExpression(generation, expression.function)];
423
+ const exceptNode = applyBuiltin(generation, "$Except", operands, location);
424
+ const functionSpan = getExpressionSpan(generation.file, expression.function);
425
+ let cursor = findToken(generation.file, functionSpan.end + 1, span.end, "EXCEPT") + 1;
426
+ expression.updates.forEach((update) => {
427
+ const bang = findToken(generation.file, cursor, span.end, "!");
428
+ const valueSpan = getOperandSpan(generation.file, update.value);
429
+ const specLocation = getSpanLocation(generation.file, { start: bang, end: valueSpan.end });
430
+ let pathCursor = bang + 1;
431
+ const components = update.path.map((step): ExprNode => {
432
+ if (step.kind === "Field") {
433
+ const nameIndex = findNameOrKeyword(generation.file, pathCursor, step.name);
434
+ pathCursor = nameIndex + 1;
435
+ return createString(generation, step.name, getTokenLocation(generation.file, nameIndex));
436
+ }
437
+ const open = findToken(generation.file, pathCursor, span.end, "[");
438
+ const close = getMatchingIndex(generation.file, open);
439
+ pathCursor = close + 1;
440
+ if (step.args.length === 1) return generateExpression(generation, step.args[0]);
441
+ return applyBuiltin(
442
+ generation,
443
+ "$Tuple",
444
+ step.args.map((innerArgument) => generateExpression(generation, innerArgument)),
445
+ getSpanLocation(generation.file, { start: open, end: close }),
446
+ );
447
+ });
448
+ const sequence = applyBuiltin(generation, "$Seq", components, specLocation);
449
+ const pair = applyBuiltin(generation, "$Pair", [sequence], specLocation);
450
+ generation.exceptSpecStack.push(pair);
451
+ generation.exceptStack.push(exceptNode);
452
+ pair.operands.push(generateExpression(generation, update.value));
453
+ generation.exceptSpecStack.pop();
454
+ generation.exceptStack.pop();
455
+ operands.push(pair);
456
+ cursor = valueSpan.end + 1;
457
+ });
458
+ return exceptNode;
459
+ };
460
+
461
+ export const findNameOrKeyword = (file: SourceFile, start: number, name: string) => {
462
+ for (let index = start; index < file.tokens.length; index++) {
463
+ if (file.tokens[index].text === name && file.tokens[index].kind !== "String") return index;
464
+ }
465
+ return start;
466
+ };
467
+
468
+ const generateRecordFields = (
469
+ generation: ModuleGeneration,
470
+ operator: "$RcdConstructor" | "$SetOfRcds",
471
+ expression: Expression & { kind: "Record" | "RecordSet" },
472
+ ) => {
473
+ const span = getExpressionSpan(generation.file, expression);
474
+ let cursor = span.start + 1;
475
+ const pairs = expression.fields.map((field, fieldIndex) => {
476
+ const nameIndex = findNameOrKeyword(generation.file, cursor, field.name);
477
+ const valueSpan = getOperandSpan(generation.file, field.value);
478
+ cursor = valueSpan.end + 1;
479
+ if (expression.fields.slice(0, fieldIndex).some((other) => other.name === field.name)) {
480
+ generation.addError(
481
+ getTokenLocation(generation.file, nameIndex),
482
+ "Non-unique fields in constructor.",
483
+ );
484
+ }
485
+ return applyBuiltin(
486
+ generation,
487
+ "$Pair",
488
+ [
489
+ createString(generation, field.name, getTokenLocation(generation.file, nameIndex)),
490
+ generateExpression(generation, field.value),
491
+ ],
492
+ getSpanLocation(generation.file, { start: nameIndex, end: valueSpan.end }),
493
+ );
494
+ });
495
+ const record = applyBuiltin(generation, operator, pairs, getSpanLocation(generation.file, span));
496
+ generation.currentModule.records.push(record);
497
+ return record;
498
+ };
499
+
500
+ const getTokenPosition = (file: SourceFile, index: number) => ({
501
+ line: file.tokens[index].line,
502
+ column: file.tokens[index].column,
503
+ });
504
+
505
+ const getRecursiveDeclarations = (file: SourceFile, start: number) => {
506
+ const declarations: Declaration[] = [];
507
+ let index = start;
508
+ while (file.tokens[index]?.kind === "Identifier") {
509
+ const end = isToken(file, index + 1, "(") ? getMatchingIndex(file, index + 1) : index;
510
+ const arity = file.tokens.slice(index + 1, end).filter((token) => token.text === "_").length;
511
+ declarations.push({
512
+ name: file.tokens[index].text,
513
+ arity,
514
+ location: {
515
+ ...getTokenPosition(file, index),
516
+ range: {
517
+ module: file.name,
518
+ start: getTokenPosition(file, index),
519
+ end: getTokenPosition(file, end),
520
+ },
521
+ },
522
+ });
523
+ if (!isToken(file, end + 1, ",")) break;
524
+ index = end + 2;
525
+ }
526
+ return declarations;
527
+ };
528
+
529
+ const getLetUnits = (file: SourceFile, expression: Expression & { kind: "Let" }) => {
530
+ const units = [
531
+ ...expression.definitions.map((definition) => ({
532
+ unit: { kind: "Definition", definition } satisfies LetUnit,
533
+ span: getDefinitionSpan(file, definition),
534
+ })),
535
+ ...(expression.instances ?? []).map((instance) => ({
536
+ unit: { kind: "Instance", instance } satisfies LetUnit,
537
+ span: getDefinitionSpan(file, instance),
538
+ })),
539
+ ];
540
+ const letStart = getExpressionSpan(file, expression).start;
541
+ const bodyStart = getOperandSpan(file, expression.body).start;
542
+ const recursives: { unit: LetUnit; span: TokenSpan }[] = [];
543
+ for (let index = letStart + 1; index < bodyStart; index++) {
544
+ const isInUnit = units.some((entry) => entry.span.start <= index && index <= entry.span.end);
545
+ if (isToken(file, index, "RECURSIVE") && !isInUnit) {
546
+ recursives.push({
547
+ unit: { kind: "Recursive", declarations: getRecursiveDeclarations(file, index + 1) },
548
+ span: { start: index, end: index },
549
+ });
550
+ }
551
+ }
552
+ return [...units, ...recursives]
553
+ .toSorted((first, second) => first.span.start - second.span.start)
554
+ .map((entry) => entry.unit);
555
+ };
556
+
557
+ const generateLet = (
558
+ generation: ModuleGeneration,
559
+ expression: Expression & { kind: "Let" },
560
+ ): LetInNode => {
561
+ const context = createContext();
562
+ return withContext(generation, context, () => {
563
+ generation.curLevel++;
564
+ generation.unresolvedCount[generation.curLevel] = 0;
565
+ const opDefs: (OpDefNode | ThmOrAssumpDefNode)[] = [];
566
+ const instances: InstanceNode[] = [];
567
+ getLetUnits(generation.file, expression).forEach((unit) => {
568
+ if (unit.kind === "Recursive") processRecursive(generation, unit.declarations);
569
+ else if (unit.kind === "Instance") {
570
+ processModuleDefinition(generation, unit.instance, opDefs, instances);
571
+ } else if (unit.definition.kind === "Function") {
572
+ processFunction(generation, unit.definition, opDefs);
573
+ } else processOperator(generation, unit.definition, opDefs);
574
+ });
575
+ checkForUndefinedRecursiveOps(generation);
576
+ generation.curLevel = Math.max(generation.curLevel - 1, 0);
577
+ const body = generateExpression(generation, expression.body);
578
+ return {
579
+ ...createLevelFields(generation.getId()),
580
+ kind: "LetIn",
581
+ opDefs,
582
+ instances,
583
+ body,
584
+ context,
585
+ location: getLocation(generation.file, expression),
586
+ };
587
+ });
588
+ };
589
+
590
+ const generateChoose = (
591
+ generation: ModuleGeneration,
592
+ expression: Expression & { kind: "Choose" },
593
+ ) => {
594
+ const span = getExpressionSpan(generation.file, expression);
595
+ const location = getSpanLocation(generation.file, span);
596
+ return withContext(generation, createContext(), () => {
597
+ const pattern = expression.pattern;
598
+ const names = pattern.kind === "Name" ? [pattern.name] : pattern.names;
599
+ if (expression.set === undefined) {
600
+ const indexes = findNameTokens(generation.file, span.start, span.end, names);
601
+ const params = names.map((name, index) =>
602
+ createFormalParam(
603
+ generation,
604
+ name,
605
+ 0,
606
+ getTokenLocation(generation.file, pattern.kind === "Name" ? span.start : indexes[index]),
607
+ true,
608
+ ),
609
+ );
610
+ const body = generateWithParams(generation, params, expression.body);
611
+ return applyBuiltin(generation, "$UnboundedChoose", [body], location, { unbounded: params });
612
+ }
613
+ const range = generateExpression(generation, expression.set);
614
+ const setSpan = getExpressionSpan(generation.file, expression.set);
615
+ const indexes = findNameTokens(generation.file, span.start, setSpan.start, names);
616
+ const params = names.map((name, index) =>
617
+ createFormalParam(
618
+ generation,
619
+ name,
620
+ 0,
621
+ getTokenLocation(generation.file, indexes[index]),
622
+ true,
623
+ ),
624
+ );
625
+ const body = generateWithParams(generation, params, expression.body);
626
+ return applyBuiltin(generation, "$BoundedChoose", [body], location, {
627
+ bounded: [params],
628
+ tupleOrs: [pattern.kind === "Tuple"],
629
+ ranges: [range],
630
+ });
631
+ });
632
+ };
633
+
634
+ const getUnresolvedOperator = (
635
+ generation: ModuleGeneration,
636
+ expression: Expression & { kind: "Apply" },
637
+ ) => {
638
+ if (
639
+ isIdentifier(expression.operator) ||
640
+ isSelector(expression.operator) ||
641
+ expression.args.length > 2
642
+ ) {
643
+ return undefined;
644
+ }
645
+ if (resolveSymbol(generation.contexts, resolveSynonym(expression.operator)) !== undefined) {
646
+ return undefined;
647
+ }
648
+ const span = getExpressionSpan(generation.file, expression);
649
+ if (
650
+ generation.file.tokens[span.start].text === expression.operator &&
651
+ isToken(generation.file, span.start + 1, "(")
652
+ ) {
653
+ return undefined;
654
+ }
655
+ const firstSpan = getOperandSpan(generation.file, expression.args[0]);
656
+ const isPrefix = expression.args.length === 1 && firstSpan.start !== span.start;
657
+ const index = isPrefix ? span.start : firstSpan.end + 1;
658
+ const text = getTokenSource(generation.file, index);
659
+ return {
660
+ index,
661
+ name: isPrefix && text === "-" ? "-." : text,
662
+ fixity: isPrefix ? "prefix" : expression.args.length === 2 ? "infix" : "postfix",
663
+ };
664
+ };
665
+
666
+ export const generateExpression = (
667
+ generation: ModuleGeneration,
668
+ expression: Expression,
669
+ ): ExprNode => {
670
+ const location = getLocation(generation.file, expression);
671
+ switch (expression.kind) {
672
+ case "Number":
673
+ return {
674
+ ...createLevelFields(generation.getId()),
675
+ kind: "Numeral",
676
+ value: getNumeralDigits(expression.text ?? String(expression.value)),
677
+ location,
678
+ };
679
+ case "Decimal": {
680
+ const [integralPart, fractionalPart] = expression.text.split(".");
681
+ const mantissa = BigInt(integralPart + fractionalPart);
682
+ const isLong = mantissa <= 9223372036854775807n;
683
+ return {
684
+ ...createLevelFields(generation.getId()),
685
+ kind: "Decimal",
686
+ mantissa: mantissa.toString(),
687
+ exponent: isLong ? String(-fractionalPart.length) : String(fractionalPart.length),
688
+ integralPart,
689
+ fractionalPart,
690
+ location,
691
+ };
692
+ }
693
+ case "String":
694
+ return createString(generation, expression.value, location);
695
+ case "Identifier": {
696
+ const node = generateSelectorExpression(generation, expression);
697
+ checkRecursion(generation, node);
698
+ return node;
699
+ }
700
+ case "Apply": {
701
+ const unresolved = getUnresolvedOperator(generation, expression);
702
+ if (unresolved !== undefined) {
703
+ generation.addError(
704
+ getTokenLocation(generation.file, unresolved.index),
705
+ `Could not find declaration or definition of symbol '${unresolved.name}'.`,
706
+ );
707
+ generation.addError(
708
+ location,
709
+ `Couldn't resolve ${unresolved.fixity} operator symbol \`${unresolved.name}'.`,
710
+ );
711
+ return { ...createNullNode(generation), nullKind: "absent" };
712
+ }
713
+ const node = generateSelectorExpression(generation, expression);
714
+ if (isSelector(expression.operator) || isIdentifier(expression.operator)) {
715
+ checkRecursion(generation, node);
716
+ }
717
+ return node;
718
+ }
719
+ case "Bracket":
720
+ generation.addError(
721
+ getTokenLocation(generation.file, getExpressionSpan(generation.file, expression).start),
722
+ "Unsupported expression type `['.",
723
+ );
724
+ return { ...createNullNode(generation), nullKind: "absent" };
725
+ case "OperatorReference":
726
+ case "Lambda": {
727
+ const token = generation.file.tokens[getExpressionSpan(generation.file, expression).start];
728
+ const name = expression.operator ?? token.text;
729
+ // Deviation from SANY: Generator#generateExpression names its internal node kind here, where tla-ts words it as for a name.
730
+ const symbol = resolveSymbol(generation.contexts, resolveSynonym(name));
731
+ generation.addError(
732
+ location,
733
+ token.text === "LAMBDA"
734
+ ? "LAMBDA expression used where an expression is required."
735
+ : symbol === undefined
736
+ ? `Could not find declaration or definition of symbol '${token.spelling ?? name}'.`
737
+ : `The operator ${resolveSynonym(name)} requires ${getSymbolArity(symbol)} arguments.`,
738
+ );
739
+ return { ...createNullNode(generation), nullKind: "absent" };
740
+ }
741
+ case "And":
742
+ case "Or":
743
+ return generateJunction(generation, expression);
744
+ case "Prime":
745
+ return applyBuiltin(
746
+ generation,
747
+ "'",
748
+ [generateExpression(generation, expression.expression)],
749
+ location,
750
+ );
751
+ case "Unchanged":
752
+ return applyBuiltin(
753
+ generation,
754
+ "UNCHANGED",
755
+ [generateExpression(generation, expression.expression)],
756
+ location,
757
+ );
758
+ case "Enabled":
759
+ return applyBuiltin(
760
+ generation,
761
+ "ENABLED",
762
+ [generateExpression(generation, expression.expression)],
763
+ location,
764
+ );
765
+ case "Always":
766
+ return applyBuiltin(
767
+ generation,
768
+ "[]",
769
+ [generateExpression(generation, expression.expression)],
770
+ location,
771
+ );
772
+ case "Eventually":
773
+ return applyBuiltin(
774
+ generation,
775
+ "<>",
776
+ [generateExpression(generation, expression.expression)],
777
+ location,
778
+ );
779
+ case "If":
780
+ return applyBuiltin(
781
+ generation,
782
+ "$IfThenElse",
783
+ [
784
+ generateExpression(generation, expression.condition),
785
+ generateExpression(generation, expression.consequent),
786
+ generateExpression(generation, expression.alternative),
787
+ ],
788
+ location,
789
+ );
790
+ case "Case":
791
+ return generateCase(generation, expression);
792
+ case "Let":
793
+ return generateLet(generation, expression);
794
+ case "Forall":
795
+ case "Exists":
796
+ return generateBoundApplication(
797
+ generation,
798
+ expression.kind === "Forall" ? "$BoundedForall" : "$BoundedExists",
799
+ expression.bounds,
800
+ getExpressionSpan(generation.file, expression).start,
801
+ expression.body,
802
+ location,
803
+ );
804
+ case "UnboundedQuantifier": {
805
+ const span = getExpressionSpan(generation.file, expression);
806
+ const bodySpan = getExpressionSpan(generation.file, expression.body);
807
+ const indexes = findNameTokens(generation.file, span.start, bodySpan.start, expression.names);
808
+ const name = expression.isTemporal
809
+ ? expression.quantifier === "Forall"
810
+ ? "$TemporalForall"
811
+ : "$TemporalExists"
812
+ : expression.quantifier === "Forall"
813
+ ? "$UnboundedForall"
814
+ : "$UnboundedExists";
815
+ return withContext(generation, createContext(), () => {
816
+ const params = expression.names.map((paramName, index) =>
817
+ createFormalParam(
818
+ generation,
819
+ paramName,
820
+ 0,
821
+ getTokenLocation(generation.file, indexes[index]),
822
+ true,
823
+ ),
824
+ );
825
+ const body = generateWithParams(generation, params, expression.body);
826
+ return applyBuiltin(generation, name, [body], location, { unbounded: params });
827
+ });
828
+ }
829
+ case "Choose":
830
+ return generateChoose(generation, expression);
831
+ case "SetEnumeration":
832
+ return applyBuiltin(
833
+ generation,
834
+ "$SetEnumerate",
835
+ expression.elements.map((element) => generateExpression(generation, element)),
836
+ location,
837
+ );
838
+ case "Tuple":
839
+ return applyBuiltin(
840
+ generation,
841
+ "$Tuple",
842
+ expression.elements.map((element) => generateExpression(generation, element)),
843
+ location,
844
+ );
845
+ case "SetFilter": {
846
+ const range = generateExpression(generation, expression.bound.set);
847
+ const span = getExpressionSpan(generation.file, expression);
848
+ return withContext(generation, createContext(), () => {
849
+ const bounds = generateBoundsWithRanges(generation, [expression.bound], span.start, [
850
+ range,
851
+ ]);
852
+ const body = generateWithParams(generation, bounds.bounded.flat(), expression.predicate);
853
+ return applyBuiltin(generation, "$SubsetOf", [body], location, bounds);
854
+ });
855
+ }
856
+ case "SetMap":
857
+ return generateBoundApplication(
858
+ generation,
859
+ "$SetOfAll",
860
+ expression.bounds,
861
+ getExpressionSpan(generation.file, expression.expression).end + 1,
862
+ expression.expression,
863
+ location,
864
+ );
865
+ case "FunctionConstruction":
866
+ return generateBoundApplication(
867
+ generation,
868
+ "$FcnConstructor",
869
+ expression.bounds,
870
+ getExpressionSpan(generation.file, expression).start,
871
+ expression.body,
872
+ location,
873
+ );
874
+ case "FunctionSet":
875
+ return applyBuiltin(
876
+ generation,
877
+ "$SetOfFcns",
878
+ [
879
+ generateExpression(generation, expression.domain),
880
+ generateExpression(generation, expression.range),
881
+ ],
882
+ location,
883
+ );
884
+ case "Record":
885
+ return generateRecordFields(generation, "$RcdConstructor", expression);
886
+ case "RecordSet":
887
+ return generateRecordFields(generation, "$SetOfRcds", expression);
888
+ case "Except":
889
+ return generateExcept(generation, expression);
890
+ case "ExceptAt": {
891
+ const except = generation.exceptStack[generation.exceptStack.length - 1];
892
+ const component = generation.exceptSpecStack[generation.exceptSpecStack.length - 1];
893
+ if (except === undefined || component === undefined) {
894
+ generation.addError(location, "@ used where its meaning is not defined.");
895
+ return createNullNode(generation);
896
+ }
897
+ return {
898
+ ...createLevelFields(generation.getId()),
899
+ kind: "At",
900
+ except,
901
+ component,
902
+ location: component.location,
903
+ };
904
+ }
905
+ case "FunctionApplication": {
906
+ const functionNode = generateExpression(generation, expression.function);
907
+ if (isAbsent(functionNode)) return functionNode;
908
+ checkRecursion(generation, functionNode);
909
+ const operator = functionNode.kind === "OpAppl" ? functionNode.operator : undefined;
910
+ const body =
911
+ operator?.kind === "OpDef" && operator.defKind === "UserDefined"
912
+ ? operator.body
913
+ : undefined;
914
+ if (
915
+ body?.kind === "OpAppl" &&
916
+ (body.operator.name === "$NonRecursiveFcnSpec" ||
917
+ body.operator.name === "$RecursiveFcnSpec")
918
+ ) {
919
+ const paramCount = (body.bounded ?? []).reduce(
920
+ (count, params, index) => count + (body.tupleOrs?.[index] ? 1 : params.length),
921
+ 0,
922
+ );
923
+ if (expression.args.length >= 2 && paramCount !== expression.args.length) {
924
+ generation.addError(
925
+ location,
926
+ `Function '${operator?.name}' is defined with ${paramCount} parameters, but is applied to ${expression.args.length} arguments.`,
927
+ );
928
+ return createNullNode(generation);
929
+ }
930
+ }
931
+ const argument =
932
+ expression.args.length === 1
933
+ ? generateExpression(generation, expression.args[0])
934
+ : applyBuiltin(
935
+ generation,
936
+ "$Tuple",
937
+ expression.args.map((innerArgument) => generateExpression(generation, innerArgument)),
938
+ location,
939
+ );
940
+ return applyBuiltin(generation, "$FcnApply", [functionNode, argument], location);
941
+ }
942
+ case "FieldAccess": {
943
+ const record = generateExpression(generation, expression.record);
944
+ const span = getExpressionSpan(generation.file, expression);
945
+ return applyBuiltin(
946
+ generation,
947
+ "$RcdSelect",
948
+ [
949
+ record,
950
+ createString(generation, expression.field, getTokenLocation(generation.file, span.end)),
951
+ ],
952
+ location,
953
+ );
954
+ }
955
+ case "Product":
956
+ return applyBuiltin(
957
+ generation,
958
+ "$CartesianProd",
959
+ expression.factors.map((factor) => generateExpression(generation, factor)),
960
+ location,
961
+ );
962
+ case "BoxAction":
963
+ case "AngleAction":
964
+ return applyBuiltin(
965
+ generation,
966
+ expression.kind === "BoxAction" ? "$SquareAct" : "$AngleAct",
967
+ [
968
+ generateExpression(generation, expression.action),
969
+ generateExpression(generation, expression.subscript),
970
+ ],
971
+ location,
972
+ );
973
+ case "WeakFairness":
974
+ case "StrongFairness":
975
+ return applyBuiltin(
976
+ generation,
977
+ expression.kind === "WeakFairness" ? "$WF" : "$SF",
978
+ [
979
+ generateExpression(generation, expression.subscript),
980
+ generateExpression(generation, expression.action),
981
+ ],
982
+ location,
983
+ );
984
+ case "Label":
985
+ return generateLabel(generation, expression);
986
+ case "Subexpression":
987
+ return generateSelectorExpression(generation, expression);
988
+ case "Selection":
989
+ return generateExpression(generation, expression.expression);
990
+ }
991
+ };
992
+
993
+ const generateBoundsWithRanges = (
994
+ generation: ModuleGeneration,
995
+ bounds: Bound[],
996
+ searchStart: number,
997
+ ranges: ExprNode[],
998
+ ): BoundSymbols => {
999
+ const groups = getBoundGroups(bounds);
1000
+ let cursor = searchStart;
1001
+ const bounded = groups.map((group) => {
1002
+ const setSpan = getExpressionSpan(generation.file, group[0].set);
1003
+ const names = group.flatMap((bound) =>
1004
+ bound.pattern.kind === "Name" ? [bound.pattern.name] : bound.pattern.names,
1005
+ );
1006
+ const indexes = findNameTokens(generation.file, cursor, setSpan.start, names);
1007
+ cursor = setSpan.end + 1;
1008
+ return names.map((name, index) =>
1009
+ createFormalParam(
1010
+ generation,
1011
+ name,
1012
+ 0,
1013
+ getTokenLocation(generation.file, indexes[index]),
1014
+ true,
1015
+ ),
1016
+ );
1017
+ });
1018
+ return {
1019
+ bounded,
1020
+ tupleOrs: groups.map((group) => group[0].pattern.kind === "Tuple"),
1021
+ ranges,
1022
+ };
1023
+ };
1024
+
1025
+ const generateLabel = (
1026
+ generation: ModuleGeneration,
1027
+ expression: Expression & { kind: "Label" },
1028
+ ): LabelNode | OpApplNode => {
1029
+ const location = getLocation(generation.file, expression);
1030
+ const scope = generation.labelScopes.at(-1);
1031
+ if (scope === undefined) {
1032
+ generation.addError(location, "Label not in definition or proof step.");
1033
+ return createNullNode(generation);
1034
+ }
1035
+ if (
1036
+ generation.assumeProveState.isDeclared
1037
+ .slice(2, generation.assumeProveState.depth + 1)
1038
+ .some(Boolean)
1039
+ ) {
1040
+ generation.addError(
1041
+ location,
1042
+ "Label not allowed within scope of declaration in nested ASSUME/PROVE.",
1043
+ );
1044
+ return createNullNode(generation);
1045
+ }
1046
+ if (generation.exceptStack.length > 0 && generation.exceptSpecStack.length > 0) {
1047
+ generation.addError(location, "Labels inside EXCEPT clauses are not yet implemented.");
1048
+ return createNullNode(generation);
1049
+ }
1050
+ pushLabelScope(generation);
1051
+ const body = generateExpression(generation, expression.body);
1052
+ const labels = popLabels(generation);
1053
+ const paramIndexes = findNameTokens(
1054
+ generation.file,
1055
+ getExpressionSpan(generation.file, expression).start,
1056
+ getExpressionSpan(generation.file, expression.body).start,
1057
+ expression.params,
1058
+ );
1059
+ const params = expression.params.map((name, index) => {
1060
+ const symbol = resolveSymbol(generation.contexts, name);
1061
+ if (symbol?.kind === "FormalParam") return symbol;
1062
+ const paramLocation = getTokenLocation(generation.file, paramIndexes[index]);
1063
+ generation.addError(paramLocation, `Illegal parameter ${name} of label \`${expression.name}'.`);
1064
+ return createFormalParam(generation, name, 0, paramLocation, false);
1065
+ });
1066
+ const label: LabelNode = {
1067
+ ...createLevelFields(generation.getId()),
1068
+ kind: "Label",
1069
+ name: expression.name,
1070
+ params,
1071
+ body,
1072
+ labels,
1073
+ isAssumeProve: false,
1074
+ location,
1075
+ };
1076
+ const named = new Set<FormalParamNode>();
1077
+ params.forEach((param) => {
1078
+ if (named.has(param)) {
1079
+ generation.addError(
1080
+ location,
1081
+ `Repeated formal parameter ${param.name} \nin label \`${label.name}'.`,
1082
+ );
1083
+ }
1084
+ named.add(param);
1085
+ });
1086
+ scope.params.flat().forEach((param) => {
1087
+ if (!named.delete(param)) {
1088
+ generation.addError(
1089
+ location,
1090
+ `Label ${label.name} must contain formal parameter \`${param.name}'.`,
1091
+ );
1092
+ }
1093
+ });
1094
+ if (named.size > 0) {
1095
+ const extras = [...named].map((param) => `${param.name} `).join("");
1096
+ generation.addError(location, `Label ${label.name} declares extra parameter(s) ${extras}`);
1097
+ }
1098
+ if (scope.labels.has(label.name))
1099
+ generation.addError(location, `Duplicate label \`${label.name}'.`);
1100
+ else scope.labels.set(label.name, label);
1101
+ const goal = generation.assumeProveState.goal;
1102
+ if (goal)
1103
+ generation.labelGoals.set(label, {
1104
+ scope: goal,
1105
+ clause: generation.assumeProveState.goalClause,
1106
+ });
1107
+ return label;
1108
+ };