tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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