tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea

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