tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.37a75eb5b

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