tla-ts 0.0.4-dev.702eb98 → 0.0.4-dev.7714e32

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 (382) hide show
  1. package/README.md +32 -6
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +27 -27
  5. package/dist/deciders.js +34 -34
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +12 -14
  8. package/dist/index.d.ts +12 -14
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +516 -25
  15. package/dist/prove.js +518 -27
  16. package/dist/run.cjs +45 -0
  17. package/dist/run.js +45 -0
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +76 -86
  21. package/dist/transfer.js +73 -83
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +1 -1
  25. package/src/ast.ts +2 -2
  26. package/src/bags.ts +22 -23
  27. package/src/builtins.ts +16 -8
  28. package/src/check.ts +131 -1154
  29. package/src/{cli-options.ts → cli/options.ts} +54 -9
  30. package/src/cli/run.ts +63 -0
  31. package/src/cli/shared.ts +106 -0
  32. package/src/cli/tlapm.ts +374 -0
  33. package/src/{run-cli.ts → cli/tlc.ts} +112 -761
  34. package/src/cli/xml-exporter.ts +221 -0
  35. package/src/cli.ts +1 -1
  36. package/src/codegen.ts +17 -15
  37. package/src/config.ts +5 -5
  38. package/src/dependencies.ts +4 -6
  39. package/src/environment.ts +55 -60
  40. package/src/errors.ts +12 -36
  41. package/src/evaluate.ts +81 -101
  42. package/src/exit-codes.ts +1 -1
  43. package/src/fingerprints.ts +3 -3
  44. package/src/index.ts +2 -2
  45. package/src/instances.ts +56 -46
  46. package/src/java-overrides.ts +79 -41
  47. package/src/json.ts +31 -36
  48. package/src/levels.ts +10 -13
  49. package/src/{live-check.ts → liveness-checker.ts} +169 -142
  50. package/src/liveness.ts +38 -34
  51. package/src/obligations/action.ts +58 -105
  52. package/src/obligations/{anon.ts → anonymize.ts} +44 -52
  53. package/src/obligations/equality.ts +260 -0
  54. package/src/obligations/expression.ts +42 -530
  55. package/src/obligations/format.ts +7 -8
  56. package/src/obligations/generate.ts +93 -783
  57. package/src/obligations/index.ts +23 -23
  58. package/src/obligations/levels.ts +38 -44
  59. package/src/obligations/module.ts +106 -729
  60. package/src/obligations/normalize.ts +554 -0
  61. package/src/obligations/operators.ts +176 -0
  62. package/src/obligations/pragma.ts +35 -29
  63. package/src/obligations/printer.ts +98 -209
  64. package/src/obligations/proof.ts +0 -1
  65. package/src/obligations/regroup.ts +100 -0
  66. package/src/obligations/simplify.ts +668 -0
  67. package/src/obligations/source.ts +92 -192
  68. package/src/obligations/{deref.ts → subexpression.ts} +82 -113
  69. package/src/obligations/substitution.ts +261 -0
  70. package/src/obligations/temporal.ts +32 -30
  71. package/src/obligations/tuples.ts +37 -53
  72. package/src/parallel-worker.ts +37 -33
  73. package/src/parallel.ts +30 -24
  74. package/src/parser.ts +67 -74
  75. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  76. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  77. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  78. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  79. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  80. package/src/{prove → prover}/decide-pool.ts +14 -19
  81. package/src/{prove → prover}/deciders.ts +7 -1
  82. package/src/{obligations/pickle.ts → prover/first-order.ts} +79 -4
  83. package/src/{prove → prover}/isabelle/decide.ts +3 -6
  84. package/src/{prove → prover}/isabelle/encode.ts +106 -138
  85. package/src/{prove → prover}/isabelle/isar/inner-syntax.ts +1 -1
  86. package/src/{prove → prover}/isabelle/isar/method.ts +3 -3
  87. package/src/{prove → prover}/isabelle/isar/type-check.ts +1 -1
  88. package/src/{prove → prover}/isabelle/provers/blast/blast.ts +1 -1
  89. package/src/{prove → prover}/isabelle/provers/blast/branch.ts +1 -1
  90. package/src/{prove → prover}/isabelle/provers/blast/term.ts +3 -4
  91. package/src/{prove → prover}/isabelle/provers/clasimp.ts +1 -1
  92. package/src/{prove → prover}/isabelle/provers/classical.ts +3 -3
  93. package/src/{prove → prover}/isabelle/provers/hypsubst.ts +1 -9
  94. package/src/{prove → prover}/isabelle/pure/conv.ts +1 -1
  95. package/src/{prove → prover}/isabelle/pure/drule.ts +2 -2
  96. package/src/{prove → prover}/isabelle/pure/envir.ts +3 -35
  97. package/src/{prove → prover}/isabelle/pure/logic.ts +4 -76
  98. package/src/{prove → prover}/isabelle/pure/name.ts +1 -13
  99. package/src/{prove → prover}/isabelle/pure/net.ts +2 -49
  100. package/src/{prove → prover}/isabelle/pure/pattern.ts +3 -22
  101. package/src/{prove → prover}/isabelle/pure/raw-simplifier.ts +3 -18
  102. package/src/{prove → prover}/isabelle/pure/seq.ts +0 -23
  103. package/src/{prove → prover}/isabelle/pure/simplifier.ts +2 -8
  104. package/src/{prove → prover}/isabelle/pure/table.ts +1 -8
  105. package/src/{prove → prover}/isabelle/pure/tactic.ts +5 -113
  106. package/src/{prove → prover}/isabelle/pure/tactical.ts +1 -84
  107. package/src/{prove → prover}/isabelle/pure/term-ord.ts +1 -55
  108. package/src/{prove → prover}/isabelle/pure/term.ts +8 -128
  109. package/src/{prove → prover}/isabelle/pure/thm.ts +4 -27
  110. package/src/{prove → prover}/isabelle/pure/type.ts +0 -12
  111. package/src/{prove → prover}/isabelle/pure/unify.ts +1 -1
  112. package/src/{prove → prover}/isabelle/tla/classical-setup.ts +1 -1
  113. package/src/{prove → prover}/ocaml.ts +1 -1
  114. package/src/{prove → prover}/prep/action.ts +54 -66
  115. package/src/{prove → prover}/prep/enabled-axioms.ts +2 -2
  116. package/src/{prove → prover}/prep/fingerprint.ts +3 -3
  117. package/src/{prove → prover}/prep/level-comparison.ts +15 -38
  118. package/src/{prove → prover}/prep/md5.ts +2 -9
  119. package/src/{prove/prep/pragma.ts → prover/prep/methods.ts} +4 -4
  120. package/src/prover/prep/normalize.ts +309 -0
  121. package/src/{prove → prover}/prove-worker.ts +4 -11
  122. package/src/prover/prove.ts +492 -0
  123. package/src/{prove → prover}/ptl/encode.ts +19 -31
  124. package/src/{prove → prover}/smt/axioms.ts +78 -79
  125. package/src/{prove → prover}/smt/data.ts +16 -45
  126. package/src/{prove → prover}/smt/encode.ts +134 -28
  127. package/src/{prove → prover}/smt/extensionality.ts +14 -12
  128. package/src/{prove → prover}/smt/flatten.ts +3 -18
  129. package/src/{prove → prover}/smt/format.ts +14 -3
  130. package/src/{prove → prover}/smt/instances.ts +4 -5
  131. package/src/{prove → prover}/smt/rewrite.ts +41 -59
  132. package/src/{prove → prover}/smt/solver/ast-util.ts +0 -56
  133. package/src/{prove → prover}/smt/solver/case-split-queue.ts +1 -1
  134. package/src/{prove → prover}/smt/solver/enode.ts +1 -1
  135. package/src/{prove → prover}/smt/solver/lp/dep-intervals.ts +0 -14
  136. package/src/{prove → prover}/smt/solver/model-macro-solver.ts +1 -1
  137. package/src/{prove → prover}/smt/solver/nlsat/algebraic.ts +3 -3
  138. package/src/{prove → prover}/smt/solver/nlsat/atoms.ts +1 -1
  139. package/src/{prove → prover}/smt/solver/nlsat/explain.ts +1 -1
  140. package/src/{prove → prover}/smt/solver/nlsat/interval-set.ts +1 -1
  141. package/src/{prove → prover}/smt/solver/nlsat/levelwise.ts +4 -7
  142. package/src/{prove → prover}/smt/solver/nlsat/polynomial.ts +4 -4
  143. package/src/{prove → prover}/smt/solver/nlsat/upolynomial.ts +2 -2
  144. package/src/{prove → prover}/smt/solver/pattern-inference.ts +1 -1
  145. package/src/{prove → prover}/smt/solver/relevancy.ts +2 -2
  146. package/src/{prove → prover}/smt/solver/rewriter.ts +1 -1
  147. package/src/{prove → prover}/smt/solver/solver.ts +2 -2
  148. package/src/prover/tlapm/cache.ts +236 -0
  149. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  150. package/src/{prove → prover}/tlapm/tlapm.ts +1 -2
  151. package/src/prover/verdict.ts +13 -0
  152. package/src/{prove → prover}/zenon/decide.ts +5 -11
  153. package/src/{prove → prover}/zenon/encode.ts +40 -106
  154. package/src/{prove → prover}/zenon/eqrel.ts +1 -1
  155. package/src/{prove → prover}/zenon/equality-rules.ts +1 -1
  156. package/src/{prove → prover}/zenon/expr.ts +2 -2
  157. package/src/{prove → prover}/zenon/index-table.ts +1 -1
  158. package/src/{prove → prover}/zenon/isar.ts +1 -1
  159. package/src/{prove → prover}/zenon/llproof.ts +1 -1
  160. package/src/{prove → prover}/zenon/mltoll.ts +1 -1
  161. package/src/{prove → prover}/zenon/node.ts +1 -1
  162. package/src/{prove → prover}/zenon/search.ts +1 -1
  163. package/src/{prove → prover}/zenon/tla/terms.ts +1 -20
  164. package/src/{prove → prover}/zenon/tla/tla.ts +1 -1
  165. package/src/randomization.ts +19 -24
  166. package/src/resolve.ts +15 -22
  167. package/src/runtime.ts +8 -8
  168. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  169. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  170. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  171. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  172. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  173. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  174. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  175. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  176. package/src/{sany-report.ts → sany/report.ts} +16 -17
  177. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  178. package/src/{sany-source.ts → sany/source.ts} +6 -7
  179. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  180. package/src/search.ts +969 -0
  181. package/src/spec-description.ts +26 -20
  182. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  183. package/src/standard-modules.ts +16 -20
  184. package/src/state-graph.ts +9 -8
  185. package/src/substitution-levels.ts +2 -2
  186. package/src/successors.ts +16 -19
  187. package/src/symmetry.ts +1 -1
  188. package/src/tableau.ts +6 -7
  189. package/src/tlc/fingerprint.ts +214 -0
  190. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  191. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  192. package/src/{tlc-random.ts → tlc/random.ts} +3 -213
  193. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  194. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  195. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  196. package/src/transfer.ts +32 -32
  197. package/src/values.ts +72 -67
  198. package/src/worker.ts +1 -4
  199. package/dist/run-cli.cjs +0 -38
  200. package/dist/run-cli.js +0 -38
  201. package/src/canonical.ts +0 -40
  202. package/src/obligations/ctx.ts +0 -64
  203. package/src/prove/prep/defs.ts +0 -27
  204. package/src/prove/prep/elab.ts +0 -156
  205. package/src/prove/prep/enabled.ts +0 -43
  206. package/src/prove/prep/flatten.ts +0 -70
  207. package/src/prove/prep/trivial.ts +0 -22
  208. package/src/prove/prove.ts +0 -417
  209. package/src/prove/smt/axiomatize.ts +0 -69
  210. package/src/prove/smt/simplify.ts +0 -57
  211. package/src/prove/verdict.ts +0 -13
  212. package/src/standard-ranges.ts +0 -116
  213. package/src/value-sources.ts +0 -29
  214. /package/src/{prove → prover}/isabelle/LICENSE +0 -0
  215. /package/src/{prove → prover}/isabelle/LICENSE-tlapm +0 -0
  216. /package/src/{prove → prover}/isabelle/isar/proof.ts +0 -0
  217. /package/src/{prove → prover}/isabelle/isar/statement.ts +0 -0
  218. /package/src/{prove → prover}/isabelle/isar/theory.ts +0 -0
  219. /package/src/{prove → prover}/isabelle/provers/blast/prove.ts +0 -0
  220. /package/src/{prove → prover}/isabelle/provers/blast/rules.ts +0 -0
  221. /package/src/{prove → prover}/isabelle/provers/blast/state.ts +0 -0
  222. /package/src/{prove → prover}/isabelle/pure/bicompose.ts +0 -0
  223. /package/src/{prove → prover}/isabelle/pure/consts.ts +0 -0
  224. /package/src/{prove → prover}/isabelle/pure/goal.ts +0 -0
  225. /package/src/{prove → prover}/isabelle/pure/interrupt.ts +0 -0
  226. /package/src/{prove → prover}/isabelle/pure/list.ts +0 -0
  227. /package/src/{prove → prover}/isabelle/pure/object-logic.ts +0 -0
  228. /package/src/{prove → prover}/isabelle/pure/rewriter.ts +0 -0
  229. /package/src/{prove → prover}/isabelle/pure/search.ts +0 -0
  230. /package/src/{prove → prover}/isabelle/pure/variable.ts +0 -0
  231. /package/src/{prove → prover}/isabelle/tla/context.ts +0 -0
  232. /package/src/{prove → prover}/isabelle/tla/logic-data.ts +0 -0
  233. /package/src/{prove → prover}/isabelle/tla/logic.ts +0 -0
  234. /package/src/{prove → prover}/isabelle/tla/simpdata.ts +0 -0
  235. /package/src/{prove → prover}/isabelle/tools/intuitionistic.ts +0 -0
  236. /package/src/{prove → prover}/ptl/decide.ts +0 -0
  237. /package/src/{prove → prover}/ptl/sat.ts +0 -0
  238. /package/src/{prove → prover}/ptl/tableau.ts +0 -0
  239. /package/src/{prove → prover}/smt/context.ts +0 -0
  240. /package/src/{prove → prover}/smt/solver/act-cache.ts +0 -0
  241. /package/src/{prove → prover}/smt/solver/arith-rewriter.ts +0 -0
  242. /package/src/{prove → prover}/smt/solver/array.ts +0 -0
  243. /package/src/{prove → prover}/smt/solver/asserted-formulas.ts +0 -0
  244. /package/src/{prove → prover}/smt/solver/ast-lt.ts +0 -0
  245. /package/src/{prove → prover}/smt/solver/ast.ts +0 -0
  246. /package/src/{prove → prover}/smt/solver/auf-solver.ts +0 -0
  247. /package/src/{prove → prover}/smt/solver/cg-table.ts +0 -0
  248. /package/src/{prove → prover}/smt/solver/clause.ts +0 -0
  249. /package/src/{prove → prover}/smt/solver/conflict-resolution.ts +0 -0
  250. /package/src/{prove → prover}/smt/solver/context.ts +0 -0
  251. /package/src/{prove → prover}/smt/solver/ctx-simplify.ts +0 -0
  252. /package/src/{prove → prover}/smt/solver/der.ts +0 -0
  253. /package/src/{prove → prover}/smt/solver/dyn-ack.ts +0 -0
  254. /package/src/{prove → prover}/smt/solver/e-matching.ts +0 -0
  255. /package/src/{prove → prover}/smt/solver/expr-ref.ts +0 -0
  256. /package/src/{prove → prover}/smt/solver/expr-safe-replace.ts +0 -0
  257. /package/src/{prove → prover}/smt/solver/fingerprints.ts +0 -0
  258. /package/src/{prove → prover}/smt/solver/flat-literals.ts +0 -0
  259. /package/src/{prove → prover}/smt/solver/goal.ts +0 -0
  260. /package/src/{prove → prover}/smt/solver/hash.ts +0 -0
  261. /package/src/{prove → prover}/smt/solver/hashtable.ts +0 -0
  262. /package/src/{prove → prover}/smt/solver/internalizer.ts +0 -0
  263. /package/src/{prove → prover}/smt/solver/lbool.ts +0 -0
  264. /package/src/{prove → prover}/smt/solver/literal.ts +0 -0
  265. /package/src/{prove → prover}/smt/solver/lp/bound-propagator.ts +0 -0
  266. /package/src/{prove → prover}/smt/solver/lp/constraints.ts +0 -0
  267. /package/src/{prove → prover}/smt/solver/lp/containers.ts +0 -0
  268. /package/src/{prove → prover}/smt/solver/lp/core-solver.ts +0 -0
  269. /package/src/{prove → prover}/smt/solver/lp/cross-nested.ts +0 -0
  270. /package/src/{prove → prover}/smt/solver/lp/dependency.ts +0 -0
  271. /package/src/{prove → prover}/smt/solver/lp/dioph-eq.ts +0 -0
  272. /package/src/{prove → prover}/smt/solver/lp/explanation.ts +0 -0
  273. /package/src/{prove → prover}/smt/solver/lp/gomory.ts +0 -0
  274. /package/src/{prove → prover}/smt/solver/lp/hnf-cutter.ts +0 -0
  275. /package/src/{prove → prover}/smt/solver/lp/hnf.ts +0 -0
  276. /package/src/{prove → prover}/smt/solver/lp/int-cube.ts +0 -0
  277. /package/src/{prove → prover}/smt/solver/lp/int-solver.ts +0 -0
  278. /package/src/{prove → prover}/smt/solver/lp/lar-solver.ts +0 -0
  279. /package/src/{prove → prover}/smt/solver/lp/lar-term.ts +0 -0
  280. /package/src/{prove → prover}/smt/solver/lp/lp-settings.ts +0 -0
  281. /package/src/{prove → prover}/smt/solver/lp/maximize-term.ts +0 -0
  282. /package/src/{prove → prover}/smt/solver/lp/nex-creator.ts +0 -0
  283. /package/src/{prove → prover}/smt/solver/lp/nex.ts +0 -0
  284. /package/src/{prove → prover}/smt/solver/lp/nla-backoff.ts +0 -0
  285. /package/src/{prove → prover}/smt/solver/lp/nla-basics.ts +0 -0
  286. /package/src/{prove → prover}/smt/solver/lp/nla-core.ts +0 -0
  287. /package/src/{prove → prover}/smt/solver/lp/nla-divisions.ts +0 -0
  288. /package/src/{prove → prover}/smt/solver/lp/nla-emonics.ts +0 -0
  289. /package/src/{prove → prover}/smt/solver/lp/nla-factorization.ts +0 -0
  290. /package/src/{prove → prover}/smt/solver/lp/nla-grobner.ts +0 -0
  291. /package/src/{prove → prover}/smt/solver/lp/nla-horner.ts +0 -0
  292. /package/src/{prove → prover}/smt/solver/lp/nla-intervals.ts +0 -0
  293. /package/src/{prove → prover}/smt/solver/lp/nla-monomial-bounds.ts +0 -0
  294. /package/src/{prove → prover}/smt/solver/lp/nla-monotone.ts +0 -0
  295. /package/src/{prove → prover}/smt/solver/lp/nla-order.ts +0 -0
  296. /package/src/{prove → prover}/smt/solver/lp/nla-patcher.ts +0 -0
  297. /package/src/{prove → prover}/smt/solver/lp/nla-tangents.ts +0 -0
  298. /package/src/{prove → prover}/smt/solver/lp/nla-throttle.ts +0 -0
  299. /package/src/{prove → prover}/smt/solver/lp/nla-types.ts +0 -0
  300. /package/src/{prove → prover}/smt/solver/lp/nla-var-eqs.ts +0 -0
  301. /package/src/{prove → prover}/smt/solver/lp/nra-solver.ts +0 -0
  302. /package/src/{prove → prover}/smt/solver/lp/numeric-pair.ts +0 -0
  303. /package/src/{prove → prover}/smt/solver/lp/pdd-interval.ts +0 -0
  304. /package/src/{prove → prover}/smt/solver/lp/pdd-simplifier.ts +0 -0
  305. /package/src/{prove → prover}/smt/solver/lp/pdd-solver.ts +0 -0
  306. /package/src/{prove → prover}/smt/solver/lp/pdd.ts +0 -0
  307. /package/src/{prove → prover}/smt/solver/lp/random-updater.ts +0 -0
  308. /package/src/{prove → prover}/smt/solver/lp/static-matrix.ts +0 -0
  309. /package/src/{prove → prover}/smt/solver/lp/union-find.ts +0 -0
  310. /package/src/{prove → prover}/smt/solver/mam-compiler.ts +0 -0
  311. /package/src/{prove → prover}/smt/solver/mam-interpreter.ts +0 -0
  312. /package/src/{prove → prover}/smt/solver/maximize-ac-sharing.ts +0 -0
  313. /package/src/{prove → prover}/smt/solver/model-checker.ts +0 -0
  314. /package/src/{prove → prover}/smt/solver/model-evaluator.ts +0 -0
  315. /package/src/{prove → prover}/smt/solver/model-finder.ts +0 -0
  316. /package/src/{prove → prover}/smt/solver/model-generator.ts +0 -0
  317. /package/src/{prove → prover}/smt/solver/nlsat/evaluator.ts +0 -0
  318. /package/src/{prove → prover}/smt/solver/nlsat/mpbq.ts +0 -0
  319. /package/src/{prove → prover}/smt/solver/nlsat/solver.ts +0 -0
  320. /package/src/{prove → prover}/smt/solver/nlsat/types.ts +0 -0
  321. /package/src/{prove → prover}/smt/solver/nlsat/upolynomial-factorization.ts +0 -0
  322. /package/src/{prove → prover}/smt/solver/nnf.ts +0 -0
  323. /package/src/{prove → prover}/smt/solver/poly-rewriter.ts +0 -0
  324. /package/src/{prove → prover}/smt/solver/propagate-values.ts +0 -0
  325. /package/src/{prove → prover}/smt/solver/proto-model.ts +0 -0
  326. /package/src/{prove → prover}/smt/solver/pull-quant.ts +0 -0
  327. /package/src/{prove → prover}/smt/solver/qe-lite-der.ts +0 -0
  328. /package/src/{prove → prover}/smt/solver/qe-lite-fm.ts +0 -0
  329. /package/src/{prove → prover}/smt/solver/qe-lite.ts +0 -0
  330. /package/src/{prove → prover}/smt/solver/qi-queue.ts +0 -0
  331. /package/src/{prove → prover}/smt/solver/quant-tactics.ts +0 -0
  332. /package/src/{prove → prover}/smt/solver/quantifier-analyzer.ts +0 -0
  333. /package/src/{prove → prover}/smt/solver/quantifier-manager.ts +0 -0
  334. /package/src/{prove → prover}/smt/solver/random-gen.ts +0 -0
  335. /package/src/{prove → prover}/smt/solver/rational.ts +0 -0
  336. /package/src/{prove → prover}/smt/solver/ref-vector.ts +0 -0
  337. /package/src/{prove → prover}/smt/solver/rewriter-tpl.ts +0 -0
  338. /package/src/{prove → prover}/smt/solver/rlimit.ts +0 -0
  339. /package/src/{prove → prover}/smt/solver/smtlib-parser.ts +0 -0
  340. /package/src/{prove → prover}/smt/solver/sort.ts +0 -0
  341. /package/src/{prove → prover}/smt/solver/sticky-generations.ts +0 -0
  342. /package/src/{prove → prover}/smt/solver/theory-lra-axioms.ts +0 -0
  343. /package/src/{prove → prover}/smt/solver/theory-lra-bounds.ts +0 -0
  344. /package/src/{prove → prover}/smt/solver/theory-lra-final-check.ts +0 -0
  345. /package/src/{prove → prover}/smt/solver/theory-lra-internalize.ts +0 -0
  346. /package/src/{prove → prover}/smt/solver/theory-lra-model.ts +0 -0
  347. /package/src/{prove → prover}/smt/solver/theory-lra-propagate.ts +0 -0
  348. /package/src/{prove → prover}/smt/solver/theory-lra-state.ts +0 -0
  349. /package/src/{prove → prover}/smt/solver/theory-lra.ts +0 -0
  350. /package/src/{prove → prover}/smt/solver/var-subst.ts +0 -0
  351. /package/src/{prove → prover}/smt/solver/z3-license.txt +0 -0
  352. /package/src/{prove → prover}/smt/table.ts +0 -0
  353. /package/src/{prove → prover}/tlaps-module.ts +0 -0
  354. /package/src/{prove → prover}/zenon/LICENSE +0 -0
  355. /package/src/{prove → prover}/zenon/check/check.ts +0 -0
  356. /package/src/{prove → prover}/zenon/check/definitions.ts +0 -0
  357. /package/src/{prove → prover}/zenon/check/equality.ts +0 -0
  358. /package/src/{prove → prover}/zenon/check/functions.ts +0 -0
  359. /package/src/{prove → prover}/zenon/check/keys.ts +0 -0
  360. /package/src/{prove → prover}/zenon/check/propositional.ts +0 -0
  361. /package/src/{prove → prover}/zenon/check/records.ts +0 -0
  362. /package/src/{prove → prover}/zenon/check/relations.ts +0 -0
  363. /package/src/{prove → prover}/zenon/check/rewrites.ts +0 -0
  364. /package/src/{prove → prover}/zenon/check/sets.ts +0 -0
  365. /package/src/{prove → prover}/zenon/check/terms.ts +0 -0
  366. /package/src/{prove → prover}/zenon/check/tla.ts +0 -0
  367. /package/src/{prove → prover}/zenon/isar-case.ts +0 -0
  368. /package/src/{prove → prover}/zenon/limits.ts +0 -0
  369. /package/src/{prove → prover}/zenon/ocaml.ts +0 -0
  370. /package/src/{prove → prover}/zenon/parse.ts +0 -0
  371. /package/src/{prove → prover}/zenon/phrase.ts +0 -0
  372. /package/src/{prove → prover}/zenon/proof.ts +0 -0
  373. /package/src/{prove → prover}/zenon/propositional-rules.ts +0 -0
  374. /package/src/{prove → prover}/zenon/rules.ts +0 -0
  375. /package/src/{prove → prover}/zenon/tla/functions.ts +0 -0
  376. /package/src/{prove → prover}/zenon/tla/llproof.ts +0 -0
  377. /package/src/{prove → prover}/zenon/tla/records.ts +0 -0
  378. /package/src/{prove → prover}/zenon/tla/rewrites.ts +0 -0
  379. /package/src/{prove → prover}/zenon/tla/sets.ts +0 -0
  380. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  381. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
  382. /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
@@ -0,0 +1,554 @@
1
+ // A port of tlapm's Module.Elab: normalization anonymizes a module unit by unit and expands each
2
+ // instance into the units of the module it instantiates.
3
+
4
+ import { TlaProofError, TlapmBugError } from "../errors";
5
+ import { lambdify } from "./action";
6
+ import type { Anonymizer } from "./anonymize";
7
+ import { isEqualHyp } from "./equality";
8
+ import {
9
+ adjoinAll,
10
+ at,
11
+ exprifySequent,
12
+ findNamed,
13
+ getAtPrefix,
14
+ getFact,
15
+ getFresh,
16
+ getLocationText,
17
+ getLocusPrefix,
18
+ getScopeHyps,
19
+ mapAccumulate,
20
+ type Defn,
21
+ type Expr,
22
+ type InstanceDefinition,
23
+ type Locus,
24
+ type Scope,
25
+ type Sequent,
26
+ type Warn,
27
+ } from "./expression";
28
+ import {
29
+ bindTheoremName,
30
+ compareNames,
31
+ getHypSize,
32
+ getUnitHyps,
33
+ substituteUnits,
34
+ type ModuleUnit,
35
+ type Mule,
36
+ } from "./module";
37
+ import { getUnique, type Counter, type Proof } from "./proof";
38
+ import type { createSimplifier } from "./simplify";
39
+ import {
40
+ consAll,
41
+ consSubstitution,
42
+ shift,
43
+ shiftExpr,
44
+ substituteExpr,
45
+ substituteHyp,
46
+ substituteSequent,
47
+ type Substitution,
48
+ } from "./substitution";
49
+ import { getScopeTime } from "./temporal";
50
+
51
+ // latestModules is the module context of the latest anonymization of an axiom, theorem or USE,
52
+ // which tlapm's anonymizer keeps using for the instances inside later definitions.
53
+ export interface Pipeline {
54
+ anonymizer: Anonymizer;
55
+ simplify: ReturnType<typeof createSimplifier>;
56
+ salts: Counter;
57
+ latestModules: Map<string, Mule>;
58
+ onWarning: Warn;
59
+ }
60
+
61
+ const lambdifyTheorem = (
62
+ pipeline: Pipeline,
63
+ scope: Scope | undefined,
64
+ name: string | undefined,
65
+ sequent: Sequent,
66
+ ) => {
67
+ try {
68
+ const lambdified = lambdify(pipeline.anonymizer, pipeline.onWarning, scope, {
69
+ kind: "Sequent",
70
+ sequent,
71
+ });
72
+ if (lambdified.kind !== "Sequent") throw new TlapmBugError();
73
+ return lambdified.sequent;
74
+ } catch (error) {
75
+ if (!(error instanceof TlaProofError) || error.failure === undefined) throw error;
76
+ const location = sequent.active.location;
77
+ const message = `${error.failure}\nCould not instantiate the theorem ${name === undefined ? "" : `named: ${name}, `}at: ${getLocationText(location)}`;
78
+ pipeline.onWarning({ text: `${getAtPrefix(location)}[ERROR]${message}`, channel: "stdout" });
79
+ pipeline.onWarning({ text: message, channel: "toolboxOnly" });
80
+ return { context: [], active: at({ kind: "Internal", builtin: "TRUE" }, sequent.active) };
81
+ }
82
+ };
83
+
84
+ const lambdifyUnit = (pipeline: Pipeline, scope: Scope | undefined, unit: ModuleUnit) => {
85
+ if (unit.kind === "Theorem") {
86
+ return { ...unit, sequent: lambdifyTheorem(pipeline, scope, unit.name, unit.sequent) };
87
+ }
88
+ if (unit.kind !== "Definition") return unit;
89
+ const definition = unit.definition;
90
+ if (definition.kind !== "Operator" && definition.kind !== "Bpragma") return unit;
91
+ const body = lambdify(pipeline.anonymizer, pipeline.onWarning, scope, definition.body);
92
+ return { ...unit, definition: { ...definition, body } };
93
+ };
94
+
95
+ // lambdify_enabled_cdot: the ENABLED and \cdot of each definition and theorem statement bind
96
+ // their variables before instantiation substitutes for them. A theorem that cannot be lambdified
97
+ // states TRUE.
98
+ const lambdifyUnits = (
99
+ pipeline: Pipeline,
100
+ scope: Scope | undefined,
101
+ units: ModuleUnit[],
102
+ ): [Scope | undefined, ModuleUnit[]] =>
103
+ mapAccumulate(scope, units, (current, unit): [Scope | undefined, ModuleUnit] => {
104
+ if (unit.kind === "Submod") {
105
+ const [inner, body] = lambdifyUnits(pipeline, current, unit.module.body);
106
+ return [inner, { ...unit, module: { ...unit.module, body } }];
107
+ }
108
+ const lambdified = lambdifyUnit(pipeline, current, unit);
109
+ return [adjoinAll(current, getUnitHyps(lambdified)), lambdified];
110
+ });
111
+
112
+ // apply_subst: each parameter declaration of the instancee gives way to its substitute.
113
+ const applyParameters = (units: ModuleUnit[], substitutes: Map<string, Expr>) => {
114
+ const body: ModuleUnit[] = [];
115
+ let size = 0;
116
+ let rest = units;
117
+ while (rest.length > 0) {
118
+ const [unit, ...tail] = rest;
119
+ const split =
120
+ unit.kind === "Constants"
121
+ ? {
122
+ name: unit.declarations[0].name,
123
+ remaining: { ...unit, declarations: unit.declarations.slice(1) },
124
+ }
125
+ : unit.kind === "Variables"
126
+ ? { name: unit.names[0], remaining: { ...unit, names: unit.names.slice(1) } }
127
+ : undefined;
128
+ if (split) {
129
+ const substitute = substitutes.get(split.name);
130
+ if (!substitute) throw new TlaProofError(`Parameter ${split.name} has no substitute`);
131
+ const isEmpty = getHypSize(split.remaining) === 0;
132
+ rest = substituteUnits(
133
+ consSubstitution(shiftExpr(size, substitute), shift(0)),
134
+ isEmpty ? tail : [split.remaining, ...tail],
135
+ );
136
+ continue;
137
+ }
138
+ body.push(unit);
139
+ size += getHypSize(unit);
140
+ rest = tail;
141
+ }
142
+ return body;
143
+ };
144
+
145
+ // resub_for: references to the instancee's own units become applications to the instance
146
+ // arguments, which the definitions now bind themselves.
147
+ const getLocalSubstitution = (
148
+ count: number,
149
+ argumentCount: number,
150
+ location: Locus | undefined,
151
+ ): Substitution => {
152
+ const args = Array.from({ length: argumentCount }, (_item, index) =>
153
+ at({ kind: "Ix", index: argumentCount - index }, { location }),
154
+ );
155
+ const parameters = Array.from({ length: argumentCount }, (_item, index) =>
156
+ at({ kind: "Ix", index: index + 1 }, { location }),
157
+ );
158
+ const locals = Array.from({ length: count }, (_item, index): Expr => {
159
+ const operator = at({ kind: "Ix", index: index + argumentCount + 1 }, { location });
160
+ return argumentCount > 0 ? at({ kind: "Apply", operator, args }, { location }) : operator;
161
+ });
162
+ return consAll([...locals, ...parameters].reverse(), shift(count + argumentCount));
163
+ };
164
+
165
+ const addParameters = (expression: Expr, args: string[]): Expr => {
166
+ const params = args.map((name) => ({ name, shape: 0 }));
167
+ if (expression.kind === "Lambda")
168
+ return { ...expression, params: [...params, ...expression.params] };
169
+ return args.length === 0
170
+ ? expression
171
+ : at({ kind: "Lambda", params, body: expression }, expression);
172
+ };
173
+
174
+ // localize: names the instancee's units under the instance name, salting its local definitions, and
175
+ // abstracts each over the instance arguments.
176
+ const localize = (
177
+ pipeline: Pipeline,
178
+ units: ModuleUnit[],
179
+ prefix: string,
180
+ instance: InstanceDefinition,
181
+ isLocal: boolean,
182
+ location: Locus | undefined,
183
+ ) => {
184
+ const getLocalizedName = (name: string) => (prefix === "" ? name : `${prefix}!${name}`);
185
+ const argumentCount = instance.args.length;
186
+ const body: ModuleUnit[] = [];
187
+ let size = 0;
188
+ let rest = units;
189
+ let isComplained = argumentCount === 0;
190
+ const complain = (text: string) => {
191
+ if (isComplained) return;
192
+ isComplained = true;
193
+ pipeline.onWarning({ text, channel: "stderr" });
194
+ };
195
+ while (rest.length > 0) {
196
+ const [unit, ...tail] = rest;
197
+ rest = tail;
198
+ const localized = (expression: Expr) =>
199
+ addParameters(
200
+ substituteExpr(getLocalSubstitution(size, argumentCount, location), expression),
201
+ instance.args,
202
+ );
203
+ switch (unit.kind) {
204
+ case "Definition": {
205
+ const definition = unit.definition;
206
+ if (definition.kind !== "Operator" && definition.kind !== "Bpragma") {
207
+ throw new TlaProofError("Module.Elab.localize");
208
+ }
209
+ const name = unit.isLocal
210
+ ? `${definition.name}$${getUnique(pipeline.salts)}`
211
+ : definition.name;
212
+ body.push({
213
+ ...unit,
214
+ definition: {
215
+ ...definition,
216
+ name: getLocalizedName(name),
217
+ body: localized(definition.body),
218
+ },
219
+ whereDefined: unit.isLocal ? "Builtin" : unit.whereDefined,
220
+ isLocal: unit.isLocal || isLocal,
221
+ });
222
+ size += 1;
223
+ continue;
224
+ }
225
+ case "Axiom": {
226
+ complain(
227
+ `${getLocusPrefix(location)}Instancing produces parametric axioms.\nSuch axioms will be forcibly hidden and cannot be cited.\n(This warning appears at-most once per INSTANCE declaration.)`,
228
+ );
229
+ const axiom: ModuleUnit = {
230
+ ...unit,
231
+ name: unit.name === undefined ? undefined : getLocalizedName(unit.name),
232
+ expression: localized(unit.expression),
233
+ };
234
+ body.push(axiom);
235
+ size += getHypSize(axiom);
236
+ continue;
237
+ }
238
+ case "Theorem": {
239
+ complain(
240
+ `${getAtPrefix(location)}Warning: Instancing produces parametric theorems.\nSuch theorems will be forcibly hidden and cannot be cited.\n(This warning appears at-most once per INSTANCE declaration.)`,
241
+ );
242
+ const expression = localized(at(exprifySequent(unit.sequent), unit));
243
+ body.push({
244
+ ...unit,
245
+ name: unit.name === undefined ? undefined : getLocalizedName(unit.name),
246
+ sequent:
247
+ expression.kind === "Sequent"
248
+ ? expression.sequent
249
+ : { context: [], active: expression },
250
+ proof: { kind: "Omitted", omission: "Elsewhere", location: unit.location },
251
+ });
252
+ size += 1;
253
+ continue;
254
+ }
255
+ case "Mutate":
256
+ if (unit.mode === "Use") rest = substituteUnits(shift(-unit.usable.facts.length), rest);
257
+ continue;
258
+ case "Submod":
259
+ continue;
260
+ default:
261
+ throw new TlaProofError("Module.Elab.localize");
262
+ }
263
+ }
264
+ return body;
265
+ };
266
+
267
+ // localize_axioms: an axiom becomes a hypothesis of each theorem after it, and a named one also a
268
+ // definition.
269
+ const localizeAxioms = (units: ModuleUnit[]) => {
270
+ const body: ModuleUnit[] = [];
271
+ let rest = units;
272
+ while (rest.length > 0) {
273
+ const [unit, ...tail] = rest;
274
+ if (unit.kind !== "Axiom") {
275
+ body.push(unit);
276
+ rest = tail;
277
+ continue;
278
+ }
279
+ const location = unit.location;
280
+ if (unit.name !== undefined) {
281
+ body.push({
282
+ kind: "Definition",
283
+ definition: { kind: "Operator", name: unit.name, body: unit.expression, location },
284
+ whereDefined: { kind: "Proof", time: "Always" },
285
+ visibility: "Visible",
286
+ isLocal: false,
287
+ location,
288
+ });
289
+ }
290
+ const hyp = getFact(
291
+ unit.name === undefined ? shiftExpr(1, unit.expression) : at({ kind: "Ix", index: 2 }, unit),
292
+ "Visible",
293
+ "Always",
294
+ location,
295
+ );
296
+ let distance = 0;
297
+ const inserted = tail.map((next): ModuleUnit => {
298
+ const size = distance;
299
+ distance += getHypSize(next);
300
+ if (next.kind !== "Theorem") return next;
301
+ const sequent = substituteSequent(shift(1), next.sequent);
302
+ return {
303
+ ...next,
304
+ sequent: { ...sequent, context: [substituteHyp(shift(size), hyp), ...sequent.context] },
305
+ axiomCount: next.axiomCount + 1,
306
+ };
307
+ });
308
+ rest = substituteUnits(shift(-1), inserted);
309
+ }
310
+ return body;
311
+ };
312
+
313
+ const getParameters = (module: Mule) =>
314
+ new Set(
315
+ module.body.flatMap((unit) =>
316
+ unit.kind === "Constants"
317
+ ? unit.declarations.map((declaration) => declaration.name)
318
+ : unit.kind === "Variables"
319
+ ? unit.names
320
+ : [],
321
+ ),
322
+ );
323
+
324
+ // Module.Elab.instantiate: the units of an instantiated module, in the context of the instance.
325
+ const instantiate = (
326
+ pipeline: Pipeline,
327
+ modules: Map<string, Mule>,
328
+ scope: Scope | undefined,
329
+ instance: InstanceDefinition,
330
+ isLocal: boolean,
331
+ prefix: string,
332
+ location: Locus | undefined,
333
+ ) => {
334
+ const module = modules.get(instance.module);
335
+ if (!module) throw new TlaProofError(`Module "${instance.module}" unknown`);
336
+ const parameters = getParameters(module);
337
+ for (const substitution of instance.substitutions) {
338
+ if (!parameters.has(substitution.name)) {
339
+ throw new TlaProofError(
340
+ `Parameter ${substitution.name} occurs in the statement \`INSTANCE ${instance.module} WITH\`, and is not declared in the module ${instance.module}`,
341
+ );
342
+ }
343
+ }
344
+ const instanceScope = adjoinAll(
345
+ scope,
346
+ instance.args.map((name) => getFresh(name, "Unknown")),
347
+ );
348
+ const substitutes = new Map(
349
+ instance.substitutions.map((entry) => [entry.name, entry.expression]),
350
+ );
351
+ for (const name of [...parameters].sort(compareNames)) {
352
+ if (substitutes.has(name)) continue;
353
+ if (!findNamed(instanceScope, name)) {
354
+ throw new TlaProofError(
355
+ `Required parameter ${name} for module ${instance.module} could not be inferred.`,
356
+ );
357
+ }
358
+ substitutes.set(name, at({ kind: "Opaque", name }, { location }));
359
+ }
360
+ const anonymized = new Map(
361
+ [...substitutes].map(([name, expression]) => [
362
+ name,
363
+ pipeline.anonymizer.expr(instanceScope, expression),
364
+ ]),
365
+ );
366
+ const body = substituteUnits(
367
+ shift((instanceScope?.size ?? 0) - (module.depth ?? 0)),
368
+ module.body.map((unit): ModuleUnit =>
369
+ unit.kind === "Theorem"
370
+ ? {
371
+ ...unit,
372
+ proof: { kind: "Omitted", omission: "Implicit", location: unit.proof.location },
373
+ }
374
+ : unit,
375
+ ),
376
+ );
377
+ const [, lambdified] = lambdifyUnits(pipeline, instanceScope, body);
378
+ return localizeAxioms(
379
+ localize(
380
+ pipeline,
381
+ applyParameters(lambdified, anonymized),
382
+ prefix,
383
+ instance,
384
+ isLocal,
385
+ location,
386
+ ),
387
+ );
388
+ };
389
+
390
+ // make_defs: the definitions among the units an INSTANCE inside a LET or DEFINE stands for.
391
+ export const expandInstance = (
392
+ pipeline: Pipeline,
393
+ scope: Scope | undefined,
394
+ definition: Extract<Defn, { kind: "Instance" }>,
395
+ ): Defn[] => {
396
+ const name = definition.instance.module;
397
+ if (!pipeline.latestModules.has(name)) {
398
+ pipeline.onWarning({
399
+ text: `${getLocusPrefix(definition.instance.location)}Module ${JSON.stringify(name)} unknown\n`,
400
+ channel: "toolbox",
401
+ });
402
+ throw new TlaProofError(`Module ${JSON.stringify(name)} unknown`, {
403
+ failure: "Module.Elab.anon#defns",
404
+ });
405
+ }
406
+ const units = instantiate(
407
+ pipeline,
408
+ pipeline.latestModules,
409
+ scope,
410
+ definition.instance,
411
+ true,
412
+ definition.name,
413
+ definition.location,
414
+ );
415
+ const definitions: Defn[] = [];
416
+ let rest = units;
417
+ while (rest.length > 0) {
418
+ const [unit, ...tail] = rest;
419
+ if (unit.kind !== "Definition") {
420
+ rest = substituteUnits(shift(-getHypSize(unit)), tail);
421
+ continue;
422
+ }
423
+ definitions.push(unit.definition);
424
+ rest = tail;
425
+ }
426
+ return definitions;
427
+ };
428
+
429
+ // Module.Elab.normalize: anonymizes each unit in the context of the ones before it, expands
430
+ // instances, merges repeated definitions, and simplifies the proofs of important modules. The
431
+ // result also joins the modules that later instances can name.
432
+ export const normalize = (
433
+ pipeline: Pipeline,
434
+ modules: Map<string, Mule>,
435
+ scope: Scope | undefined,
436
+ module: Mule,
437
+ ): Mule => {
438
+ const body: ModuleUnit[] = [];
439
+ let current = scope;
440
+ const emit = (unit: ModuleUnit) => {
441
+ body.push(unit);
442
+ current = adjoinAll(current, getUnitHyps(unit));
443
+ };
444
+ const isRedundant = (name: string | undefined) =>
445
+ name !== undefined && findNamed(current, name) !== undefined;
446
+ // Instantiated units arrive anonymized.
447
+ const queue = module.body.map((unit) => ({ unit, isAnonymized: false }));
448
+ for (let index = 0; index < queue.length; index++) {
449
+ const unit = queue[index].unit;
450
+ const expand = (instance: InstanceDefinition, isLocal: boolean, prefix: string) => {
451
+ const units = instantiate(
452
+ pipeline,
453
+ modules,
454
+ current,
455
+ instance,
456
+ isLocal,
457
+ prefix,
458
+ unit.location,
459
+ );
460
+ queue.splice(index + 1, 0, ...units.map((inner) => ({ unit: inner, isAnonymized: true })));
461
+ };
462
+ switch (unit.kind) {
463
+ case "Anoninst":
464
+ expand(unit.instance, unit.isLocal, "");
465
+ continue;
466
+ case "Definition": {
467
+ const definition = unit.definition;
468
+ if (definition.kind === "Instance") {
469
+ expand(definition.instance, unit.isLocal, definition.name);
470
+ continue;
471
+ }
472
+ const anonymized =
473
+ definition.kind === "Recursive" || queue[index].isAnonymized
474
+ ? definition
475
+ : pipeline.anonymizer.defn(current, definition);
476
+ const normalized: ModuleUnit = { ...unit, definition: anonymized };
477
+ if (definition.kind === "Recursive") {
478
+ emit(normalized);
479
+ continue;
480
+ }
481
+ const hyp = getUnitHyps(normalized)[0];
482
+ const found = findNamed(current, definition.name);
483
+ if (found?.hyp.kind === "Defn") {
484
+ const isMerged =
485
+ found.hyp.definition.kind === "Recursive" ||
486
+ isEqualHyp(substituteHyp(shift(found.depth + 1), found.hyp), hyp);
487
+ if (isMerged) {
488
+ const rest = queue.slice(index + 1);
489
+ const substituted = substituteUnits(
490
+ consSubstitution(at({ kind: "Ix", index: found.depth + 1 }, unit), shift(0)),
491
+ rest.map((entry) => entry.unit),
492
+ );
493
+ queue.splice(
494
+ index + 1,
495
+ rest.length,
496
+ ...rest.map((entry, offset) => ({ ...entry, unit: substituted[offset] })),
497
+ );
498
+ continue;
499
+ }
500
+ }
501
+ emit(normalized);
502
+ continue;
503
+ }
504
+ case "Recursives":
505
+ case "Constants":
506
+ case "Variables":
507
+ emit(unit);
508
+ continue;
509
+ case "Axiom":
510
+ if (isRedundant(unit.name)) continue;
511
+ pipeline.latestModules = new Map(modules);
512
+ emit({ ...unit, expression: pipeline.anonymizer.expr(current, unit.expression) });
513
+ continue;
514
+ case "Theorem": {
515
+ const isDuplicate = isRedundant(unit.name);
516
+ const name = isDuplicate ? `(redundant)${unit.name}` : unit.name;
517
+ const proof: Proof = isDuplicate
518
+ ? { kind: "Obvious", location: unit.proof.location }
519
+ : unit.proof;
520
+ pipeline.latestModules = new Map(modules);
521
+ const sequent = pipeline.anonymizer.sequent(current, unit.sequent);
522
+ const binding = bindTheoremName(name, sequent, unit.location);
523
+ const proofScope = adjoinAll(
524
+ adjoinAll(
525
+ current,
526
+ binding.hyps.map((hyp) => ({ ...hyp, isConstnessUnset: true })),
527
+ ),
528
+ binding.sequent.context,
529
+ );
530
+ const anonymized = pipeline.anonymizer.proof(proofScope, proof);
531
+ const simplified = module.isImportant
532
+ ? pipeline.simplify(
533
+ getScopeHyps(proofScope),
534
+ binding.sequent.active,
535
+ anonymized,
536
+ getScopeTime(binding.sequent.context, "Always"),
537
+ )
538
+ : anonymized;
539
+ emit({ ...unit, name, sequent, proof: simplified });
540
+ continue;
541
+ }
542
+ case "Mutate":
543
+ pipeline.latestModules = new Map(modules);
544
+ emit({ ...unit, usable: pipeline.anonymizer.usable(current, unit.usable) });
545
+ continue;
546
+ case "Submod":
547
+ emit({ ...unit, module: normalize(pipeline, modules, current, unit.module) });
548
+ continue;
549
+ }
550
+ }
551
+ const normalized = { ...module, body, depth: scope?.size ?? 0 };
552
+ modules.set(module.name, normalized);
553
+ return normalized;
554
+ };