tla-ts 0.0.4-dev.2be6058 → 0.0.4-dev.43f28be

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 (313) hide show
  1. package/README.md +27 -141
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +37 -1
  6. package/dist/index.d.ts +37 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +996 -0
  15. package/dist/prove.js +996 -0
  16. package/dist/run-cli.cjs +517 -47
  17. package/dist/run-cli.js +517 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/check.ts +1 -0
  26. package/src/codegen.ts +26 -7
  27. package/src/errors.ts +86 -0
  28. package/src/evaluate.ts +255 -56
  29. package/src/index.ts +10 -0
  30. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  31. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  32. package/src/obligations/ctx.ts +64 -0
  33. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  34. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  35. package/src/{obligation-format.ts → obligations/format.ts} +6 -5
  36. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  37. package/src/{obligations.ts → obligations/index.ts} +28 -12
  38. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  39. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  40. package/src/obligations/pickle.ts +100 -0
  41. package/src/obligations/pragma.ts +189 -0
  42. package/src/{obligation-printer.ts → obligations/printer.ts} +9 -63
  43. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  44. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  45. package/src/obligations/temporal.ts +319 -0
  46. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  47. package/src/ocaml-marshal.ts +166 -0
  48. package/src/parallel-worker.ts +2 -18
  49. package/src/parallel.ts +10 -43
  50. package/src/prove/decide-pool.ts +100 -0
  51. package/src/prove/deciders.ts +33 -0
  52. package/src/prove/isabelle/LICENSE +36 -0
  53. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  54. package/src/prove/isabelle/decide.ts +47 -0
  55. package/src/prove/isabelle/encode.ts +508 -0
  56. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  57. package/src/prove/isabelle/isar/method.ts +367 -0
  58. package/src/prove/isabelle/isar/proof.ts +28 -0
  59. package/src/prove/isabelle/isar/statement.ts +57 -0
  60. package/src/prove/isabelle/isar/theory.ts +192 -0
  61. package/src/prove/isabelle/isar/type-check.ts +278 -0
  62. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  63. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  64. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  65. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  66. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  67. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  68. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  69. package/src/prove/isabelle/provers/classical.ts +389 -0
  70. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  71. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  72. package/src/prove/isabelle/pure/consts.ts +32 -0
  73. package/src/prove/isabelle/pure/conv.ts +79 -0
  74. package/src/prove/isabelle/pure/drule.ts +264 -0
  75. package/src/prove/isabelle/pure/envir.ts +363 -0
  76. package/src/prove/isabelle/pure/goal.ts +53 -0
  77. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  78. package/src/prove/isabelle/pure/list.ts +12 -0
  79. package/src/prove/isabelle/pure/logic.ts +402 -0
  80. package/src/prove/isabelle/pure/name.ts +110 -0
  81. package/src/prove/isabelle/pure/net.ts +262 -0
  82. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  83. package/src/prove/isabelle/pure/pattern.ts +650 -0
  84. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  85. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  86. package/src/prove/isabelle/pure/search.ts +68 -0
  87. package/src/prove/isabelle/pure/seq.ts +156 -0
  88. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  89. package/src/prove/isabelle/pure/table.ts +208 -0
  90. package/src/prove/isabelle/pure/tactic.ts +276 -0
  91. package/src/prove/isabelle/pure/tactical.ts +347 -0
  92. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  93. package/src/prove/isabelle/pure/term.ts +808 -0
  94. package/src/prove/isabelle/pure/thm.ts +806 -0
  95. package/src/prove/isabelle/pure/type.ts +133 -0
  96. package/src/prove/isabelle/pure/unify.ts +753 -0
  97. package/src/prove/isabelle/pure/variable.ts +25 -0
  98. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  99. package/src/prove/isabelle/tla/context.ts +74 -0
  100. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  101. package/src/prove/isabelle/tla/logic.ts +215 -0
  102. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  103. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  104. package/src/prove/ocaml.ts +22 -0
  105. package/src/prove/prep/action.ts +520 -0
  106. package/src/prove/prep/defs.ts +33 -0
  107. package/src/prove/prep/elab.ts +156 -0
  108. package/src/prove/prep/enabled-axioms.ts +189 -0
  109. package/src/prove/prep/enabled.ts +43 -0
  110. package/src/prove/prep/fingerprint.ts +388 -0
  111. package/src/prove/prep/flatten.ts +70 -0
  112. package/src/prove/prep/level-comparison.ts +552 -0
  113. package/src/prove/prep/md5.ts +67 -0
  114. package/src/prove/prep/pragma.ts +221 -0
  115. package/src/prove/prep/trivial.ts +22 -0
  116. package/src/prove/prove-worker.ts +27 -0
  117. package/src/prove/prove.ts +518 -0
  118. package/src/prove/ptl/decide.ts +68 -0
  119. package/src/prove/ptl/encode.ts +256 -0
  120. package/src/prove/ptl/sat.ts +151 -0
  121. package/src/prove/ptl/tableau.ts +276 -0
  122. package/src/prove/smt/axiomatize.ts +69 -0
  123. package/src/prove/smt/axioms.ts +210 -0
  124. package/src/prove/smt/context.ts +108 -0
  125. package/src/prove/smt/data.ts +665 -0
  126. package/src/prove/smt/encode.ts +169 -0
  127. package/src/prove/smt/extensionality.ts +63 -0
  128. package/src/prove/smt/flatten.ts +127 -0
  129. package/src/prove/smt/format.ts +143 -0
  130. package/src/prove/smt/instances.ts +182 -0
  131. package/src/prove/smt/rewrite.ts +784 -0
  132. package/src/prove/smt/simplify.ts +57 -0
  133. package/src/prove/smt/solver/act-cache.ts +265 -0
  134. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  135. package/src/prove/smt/solver/array.ts +22 -0
  136. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  137. package/src/prove/smt/solver/ast-lt.ts +157 -0
  138. package/src/prove/smt/solver/ast-util.ts +147 -0
  139. package/src/prove/smt/solver/ast.ts +1315 -0
  140. package/src/prove/smt/solver/auf-solver.ts +572 -0
  141. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  142. package/src/prove/smt/solver/cg-table.ts +175 -0
  143. package/src/prove/smt/solver/clause.ts +276 -0
  144. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  145. package/src/prove/smt/solver/context.ts +1292 -0
  146. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  147. package/src/prove/smt/solver/der.ts +224 -0
  148. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  149. package/src/prove/smt/solver/e-matching.ts +659 -0
  150. package/src/prove/smt/solver/enode.ts +259 -0
  151. package/src/prove/smt/solver/expr-ref.ts +21 -0
  152. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  153. package/src/prove/smt/solver/fingerprints.ts +92 -0
  154. package/src/prove/smt/solver/flat-literals.ts +51 -0
  155. package/src/prove/smt/solver/goal.ts +138 -0
  156. package/src/prove/smt/solver/hash.ts +173 -0
  157. package/src/prove/smt/solver/hashtable.ts +166 -0
  158. package/src/prove/smt/solver/internalizer.ts +1381 -0
  159. package/src/prove/smt/solver/lbool.ts +5 -0
  160. package/src/prove/smt/solver/literal.ts +24 -0
  161. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  162. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  163. package/src/prove/smt/solver/lp/containers.ts +296 -0
  164. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  165. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  166. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  167. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  168. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  169. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  170. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  171. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  172. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  173. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  174. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  175. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  176. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  177. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  178. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  179. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  180. package/src/prove/smt/solver/lp/nex.ts +120 -0
  181. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  182. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  183. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  184. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  185. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  186. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  187. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  188. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  189. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  190. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  191. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  192. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  193. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  194. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  195. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  196. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  197. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  198. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  199. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  200. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  201. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  202. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  203. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  204. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  205. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  206. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  207. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  208. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  209. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  210. package/src/prove/smt/solver/model-checker.ts +347 -0
  211. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  212. package/src/prove/smt/solver/model-finder.ts +155 -0
  213. package/src/prove/smt/solver/model-generator.ts +97 -0
  214. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  215. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  216. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  217. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  218. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  219. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  220. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  221. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  222. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  223. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  224. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  225. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  226. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  227. package/src/prove/smt/solver/nnf.ts +469 -0
  228. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  229. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  230. package/src/prove/smt/solver/propagate-values.ts +83 -0
  231. package/src/prove/smt/solver/proto-model.ts +551 -0
  232. package/src/prove/smt/solver/pull-quant.ts +139 -0
  233. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  234. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  235. package/src/prove/smt/solver/qe-lite.ts +381 -0
  236. package/src/prove/smt/solver/qi-queue.ts +362 -0
  237. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  238. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  239. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  240. package/src/prove/smt/solver/random-gen.ts +10 -0
  241. package/src/prove/smt/solver/rational.ts +165 -0
  242. package/src/prove/smt/solver/ref-vector.ts +62 -0
  243. package/src/prove/smt/solver/relevancy.ts +247 -0
  244. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  245. package/src/prove/smt/solver/rewriter.ts +843 -0
  246. package/src/prove/smt/solver/rlimit.ts +79 -0
  247. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  248. package/src/prove/smt/solver/solver.ts +71 -0
  249. package/src/prove/smt/solver/sort.ts +35 -0
  250. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  251. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  252. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  253. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  254. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  255. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  256. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  257. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  258. package/src/prove/smt/solver/theory-lra.ts +56 -0
  259. package/src/prove/smt/solver/var-subst.ts +258 -0
  260. package/src/prove/smt/solver/z3-license.txt +10 -0
  261. package/src/prove/smt/table.ts +170 -0
  262. package/src/prove/tlapm/tlapm.ts +97 -0
  263. package/src/prove/tlaps-module.ts +510 -0
  264. package/src/prove/verdict.ts +18 -0
  265. package/src/prove/zenon/LICENSE +32 -0
  266. package/src/prove/zenon/check/check.ts +105 -0
  267. package/src/prove/zenon/check/definitions.ts +144 -0
  268. package/src/prove/zenon/check/equality.ts +182 -0
  269. package/src/prove/zenon/check/functions.ts +62 -0
  270. package/src/prove/zenon/check/keys.ts +125 -0
  271. package/src/prove/zenon/check/propositional.ts +104 -0
  272. package/src/prove/zenon/check/records.ts +188 -0
  273. package/src/prove/zenon/check/relations.ts +121 -0
  274. package/src/prove/zenon/check/rewrites.ts +224 -0
  275. package/src/prove/zenon/check/sets.ts +302 -0
  276. package/src/prove/zenon/check/terms.ts +127 -0
  277. package/src/prove/zenon/check/tla.ts +126 -0
  278. package/src/prove/zenon/decide.ts +113 -0
  279. package/src/prove/zenon/encode.ts +444 -0
  280. package/src/prove/zenon/eqrel.ts +300 -0
  281. package/src/prove/zenon/equality-rules.ts +435 -0
  282. package/src/prove/zenon/expr.ts +551 -0
  283. package/src/prove/zenon/index-table.ts +350 -0
  284. package/src/prove/zenon/isar-case.ts +513 -0
  285. package/src/prove/zenon/isar.ts +1249 -0
  286. package/src/prove/zenon/limits.ts +15 -0
  287. package/src/prove/zenon/llproof.ts +173 -0
  288. package/src/prove/zenon/mltoll.ts +1566 -0
  289. package/src/prove/zenon/node.ts +297 -0
  290. package/src/prove/zenon/ocaml.ts +169 -0
  291. package/src/prove/zenon/parse.ts +247 -0
  292. package/src/prove/zenon/phrase.ts +191 -0
  293. package/src/prove/zenon/proof.ts +198 -0
  294. package/src/prove/zenon/propositional-rules.ts +387 -0
  295. package/src/prove/zenon/rules.ts +94 -0
  296. package/src/prove/zenon/search.ts +288 -0
  297. package/src/prove/zenon/tla/functions.ts +151 -0
  298. package/src/prove/zenon/tla/llproof.ts +480 -0
  299. package/src/prove/zenon/tla/records.ts +225 -0
  300. package/src/prove/zenon/tla/rewrites.ts +447 -0
  301. package/src/prove/zenon/tla/sets.ts +304 -0
  302. package/src/prove/zenon/tla/terms.ts +181 -0
  303. package/src/prove/zenon/tla/tla.ts +506 -0
  304. package/src/run-cli.ts +338 -62
  305. package/src/standard-modules.ts +5 -2
  306. package/src/successors.ts +25 -6
  307. package/src/tlapm-cache.ts +244 -0
  308. package/src/tlc-random.ts +55 -32
  309. package/src/tlc-version.ts +8 -7
  310. package/src/values.ts +97 -47
  311. package/src/worker.ts +65 -0
  312. package/dist/parallel.cjs +0 -12
  313. package/dist/parallel.js +0 -12
@@ -0,0 +1,156 @@
1
+ // A port of tlapm's Expr.Elab.normalize, which the backends run on each obligation after expanding
2
+ // its definitions: LET definitions are inlined, and the updates of an EXCEPT fold into the
3
+ // function they update.
4
+
5
+ import { TlaProofError } from "../../errors";
6
+ import {
7
+ at,
8
+ consSubstitution,
9
+ createContextMap,
10
+ getChildren,
11
+ isEqualExpr,
12
+ mapChildren,
13
+ mapExceptSpecs,
14
+ mapHyp,
15
+ shift,
16
+ substituteExpr,
17
+ type Expr,
18
+ type ExceptPoint,
19
+ type Hyp,
20
+ type Sequent,
21
+ } from "../../obligations/expression";
22
+
23
+ type ExceptExpr = Extract<Expr, { kind: "Except" }>;
24
+
25
+ type ExceptSpec = ExceptExpr["specs"][number];
26
+
27
+ const TEMPORAL_BUILTINS = new Set(["BoxTrue", "BoxFalse", "Diamond", "Actplus", "Leadsto", "Cdot"]);
28
+
29
+ // The expressions of a hypothesis that Visit.iter visits, none for a hidden one.
30
+ const getVisitedExprs = (hyp: Hyp): Expr[] => {
31
+ switch (hyp.kind) {
32
+ case "Fresh":
33
+ return hyp.domain ? [hyp.domain] : [];
34
+ case "Flex":
35
+ return [];
36
+ case "Defn":
37
+ return hyp.visibility === "Hidden" ||
38
+ (hyp.definition.kind !== "Operator" && hyp.definition.kind !== "Bpragma")
39
+ ? []
40
+ : [hyp.definition.body];
41
+ case "Fact":
42
+ return hyp.visibility === "Hidden" ? [] : [hyp.expression];
43
+ }
44
+ };
45
+
46
+ // non_temporal: no temporal operator, but in hidden hypotheses.
47
+ export const isNonTemporal = (expression: Expr): boolean => {
48
+ if (expression.kind === "Tsub" || expression.kind === "Fair") return false;
49
+ if (
50
+ expression.kind === "Apply" &&
51
+ expression.operator.kind === "Internal" &&
52
+ TEMPORAL_BUILTINS.has(expression.operator.builtin)
53
+ )
54
+ return false;
55
+ if (expression.kind === "Sequent") {
56
+ const sequent = expression.sequent;
57
+ return [...sequent.context.flatMap(getVisitedExprs), sequent.active].every(isNonTemporal);
58
+ }
59
+ return getChildren(expression).every(isNonTemporal);
60
+ };
61
+
62
+ // let_normalize: each LET definition is substituted into the rest of the LET.
63
+ const normalizeLet = (expression: Expr): Expr => {
64
+ if (expression.kind !== "Let") return mapChildren(expression, normalizeLet);
65
+ const [definition, ...definitions] = expression.definitions;
66
+ if (!definition) return normalizeLet(expression.body);
67
+ if (definition.kind !== "Operator" && definition.kind !== "Bpragma") {
68
+ throw new TlaProofError(
69
+ definition.kind === "Instance"
70
+ ? "Found INSTANCE in Expr.Elab.let_normalize, all INSTANCE statements have been replaced with definitions in Module.Elab "
71
+ : "Expr.Elab.let_normalize",
72
+ );
73
+ }
74
+ const operator = normalizeLet(definition.body);
75
+ const rest: Expr = { ...expression, definitions };
76
+ return normalizeLet(substituteExpr(consSubstitution(operator, shift(0)), rest));
77
+ };
78
+
79
+ const getAccess = (base: Expr, point: ExceptPoint): Expr =>
80
+ point.kind === "Dot"
81
+ ? at({ kind: "Dot", expression: base, field: point.field }, base)
82
+ : at({ kind: "FcnApp", function: base, args: [point.expression] }, base);
83
+
84
+ const isSameHead = (left: ExceptPoint, right: ExceptPoint) =>
85
+ left.kind === "Dot"
86
+ ? right.kind === "Dot" && left.field === right.field
87
+ : right.kind === "Apply" && isEqualExpr(left.expression, right.expression);
88
+
89
+ // The field of a record constructor that a point names, as a field or as a string argument.
90
+ const getRecordField = (record: Expr, point: ExceptPoint) => {
91
+ const name =
92
+ point.kind === "Dot"
93
+ ? point.field
94
+ : point.expression.kind === "String"
95
+ ? point.expression.value
96
+ : undefined;
97
+ return record.kind === "Record" && name !== undefined
98
+ ? record.fields.find((field) => field.name === name)
99
+ : undefined;
100
+ };
101
+
102
+ // except_normalize: [f EXCEPT p1 = b1, ...] folds left to right into f, sharing each prefix of
103
+ // adjacent updates and updating a record constructor in place on a field it has.
104
+ const normalizeExcept = (expression: Expr): Expr => {
105
+ if (expression.kind !== "Except") return mapChildren(expression, normalizeExcept);
106
+ const except = expression;
107
+ const select = (base: Expr, point: ExceptPoint) =>
108
+ getRecordField(base, point)?.value ?? getAccess(base, point);
109
+ const update = (base: Expr, point: ExceptPoint, value: Expr): Expr => {
110
+ const field = getRecordField(base, point);
111
+ if (base.kind !== "Record" || !field)
112
+ return at({ kind: "Except", function: base, specs: [{ trail: [point], value }] }, except);
113
+ const fields = base.fields.map((entry) =>
114
+ entry.name === field.name ? { name: entry.name, value } : entry,
115
+ );
116
+ return at({ kind: "Record", fields }, base);
117
+ };
118
+ const apply = (base: Expr, specs: ExceptSpec[]): Expr => {
119
+ const [first, ...others] = specs;
120
+ if (!first) return base;
121
+ if (first.trail.length === 0) return apply(first.value, others);
122
+ const head = first.trail[0];
123
+ const end = specs.findIndex(
124
+ (spec) => spec.trail.length === 0 || !isSameHead(spec.trail[0], head),
125
+ );
126
+ const count = end === -1 ? specs.length : end;
127
+ const tails = specs
128
+ .slice(0, count)
129
+ .map((spec) => ({ trail: spec.trail.slice(1), value: spec.value }));
130
+ return apply(update(base, head, apply(select(base, head), tails)), specs.slice(count));
131
+ };
132
+ return apply(normalizeExcept(except.function), mapExceptSpecs(except.specs, normalizeExcept));
133
+ };
134
+
135
+ // let_normalize on each hypothesis, and whether the context so far is non_temporal.
136
+ const normalizeLetContext = createContextMap(true, (isContextNonTemporal, hyp) => [
137
+ isContextNonTemporal && getVisitedExprs(hyp).every(isNonTemporal),
138
+ mapHyp(hyp, normalizeLet, "all"),
139
+ ]);
140
+
141
+ const normalizeExceptContext = createContextMap(undefined, (_state, hyp) => [
142
+ undefined,
143
+ mapHyp(hyp, normalizeExcept, "all"),
144
+ ]);
145
+
146
+ // normalize, on an obligation as a sequent expression, as Backend.Prep.normalize_expr calls it.
147
+ export const normalizeSequent = (sequent: Sequent): Sequent => {
148
+ const inlined = normalizeLetContext(sequent.context);
149
+ const active = normalizeLet(sequent.active);
150
+ return inlined.state && isNonTemporal(sequent.active)
151
+ ? {
152
+ context: normalizeExceptContext(sequent.context, inlined.context).context,
153
+ active: normalizeExcept(active),
154
+ }
155
+ : { context: inlined.context, active };
156
+ };
@@ -0,0 +1,189 @@
1
+ // Expr.Action.implication_to_enabled, the ENABLEDaxioms frontend: it proves a rule about ENABLED
2
+ // from facts of the form the rule needs.
3
+
4
+ import { TlapmBugError, TlaProverError } from "../../errors";
5
+ import {
6
+ adjoin,
7
+ adjoinAll,
8
+ getScopeAt,
9
+ isEqualExpr,
10
+ mapScoped,
11
+ shiftExpr,
12
+ type Builtin,
13
+ type Expr,
14
+ type Scope,
15
+ type Sequent,
16
+ } from "../../obligations/expression";
17
+ import { getLevelInfo } from "../../obligations/levels";
18
+
19
+ interface Rule {
20
+ name: string;
21
+ left: Expr;
22
+ right: Expr;
23
+ }
24
+
25
+ const TRUE: Expr = { kind: "Internal", builtin: "TRUE" };
26
+
27
+ const getOperands = (expression: Expr, builtin: Builtin) =>
28
+ expression.kind === "Apply" &&
29
+ expression.operator.kind === "Internal" &&
30
+ expression.operator.builtin === builtin &&
31
+ expression.args.length === 2
32
+ ? expression.args
33
+ : undefined;
34
+
35
+ const getEnabled = (expression: Expr) =>
36
+ expression.kind === "Apply" &&
37
+ expression.operator.kind === "Internal" &&
38
+ expression.operator.builtin === "ENABLED" &&
39
+ expression.args.length === 1
40
+ ? expression.args[0]
41
+ : undefined;
42
+
43
+ // Both operands of the connective, when each is an ENABLED.
44
+ const getEnabledOperands = (expression: Expr, builtin: Builtin) => {
45
+ const operands = getOperands(expression, builtin);
46
+ const left = operands && getEnabled(operands[0]);
47
+ const right = operands && getEnabled(operands[1]);
48
+ return left && right ? [left, right] : undefined;
49
+ };
50
+
51
+ // E_visit.collect_primed_vars: the variables under a prime, an UNCHANGED, or a subscript.
52
+ const getPrimedVariables = (scope: Scope | undefined, expression: Expr) => {
53
+ const names = new Set<string>();
54
+ const visit = (state: { scope: Scope | undefined; isPrimed: boolean }, inner: Expr): Expr => {
55
+ const primed = { ...state, isPrimed: true };
56
+ const operator = inner.kind === "Apply" && inner.operator.kind === "Internal" && inner.operator;
57
+ const builtin = operator && operator.builtin;
58
+ const args = inner.kind === "Apply" ? inner.args : [];
59
+ const isScoped =
60
+ (builtin === "Prime" && args.length === 1) ||
61
+ builtin === "ENABLED" ||
62
+ (builtin === "Cdot" && args.length === 2) ||
63
+ (builtin === "UNCHANGED" && args.length === 1) ||
64
+ inner.kind === "Sub";
65
+ if (isScoped && state.isPrimed) throw new TlapmBugError();
66
+ if (builtin === "Prime" && args.length === 1) visit(primed, args[0]);
67
+ else if (builtin === "Cdot" && args.length === 2) visit(state, args[1]);
68
+ else if (builtin === "UNCHANGED" && args.length === 1) visit(primed, args[0]);
69
+ else if (inner.kind === "Sub") {
70
+ visit(state, inner.action);
71
+ visit(primed, inner.subscript);
72
+ } else if (inner.kind === "Ix") {
73
+ const hyp = getScopeAt(state.scope, inner.index - 1)?.hyp;
74
+ if (!hyp) throw new TlapmBugError();
75
+ if (hyp.kind === "Flex" && state.isPrimed) names.add(hyp.name);
76
+ } else if (builtin !== "ENABLED") {
77
+ mapScoped(state, inner, visit, (current, hyp) => ({
78
+ ...current,
79
+ scope: adjoin(current.scope, hyp),
80
+ }));
81
+ }
82
+ return inner;
83
+ };
84
+ visit({ scope, isPrimed: false }, expression);
85
+ return names;
86
+ };
87
+
88
+ const isDisjoint = (scope: Scope | undefined, left: Expr, right: Expr) => {
89
+ const leftNames = getPrimedVariables(scope, left);
90
+ return [...getPrimedVariables(scope, right)].every((name) => !leftNames.has(name));
91
+ };
92
+
93
+ // check_active: the rule the goal's form calls for, with the operands the facts must mention.
94
+ const getRule = (scope: Scope | undefined, goal: Expr): Rule | undefined => {
95
+ const getLevelOf = (expression: Expr) => getLevelInfo(scope, expression).level;
96
+ const assertActions = (left: Expr, right: Expr) => {
97
+ if (getLevelOf(left) > 2 || getLevelOf(right) > 2) throw new TlapmBugError();
98
+ };
99
+ const enabled = getEnabled(goal);
100
+ const enabledDisjunction = enabled && getOperands(enabled, "Disj");
101
+ if (enabledDisjunction) {
102
+ assertActions(enabledDisjunction[0], enabledDisjunction[1]);
103
+ return { name: "abdisj_inverse", left: enabledDisjunction[0], right: enabledDisjunction[1] };
104
+ }
105
+ const disjunction = getEnabledOperands(goal, "Disj");
106
+ if (disjunction) {
107
+ assertActions(disjunction[0], disjunction[1]);
108
+ return { name: "abdisj", left: disjunction[0], right: disjunction[1] };
109
+ }
110
+ const enabledConjunction = enabled && getOperands(enabled, "Conj");
111
+ if (enabledConjunction) {
112
+ const left = enabledConjunction[0];
113
+ const right = enabledConjunction[1];
114
+ const isApart = isDisjoint(scope, left, right);
115
+ assertActions(left, right);
116
+ if (!isApart) return undefined;
117
+ return { name: getLevelOf(left) === 2 ? "abconj_inverse" : "pconj_inverse", left, right };
118
+ }
119
+ const conjunction = getEnabledOperands(goal, "Conj");
120
+ if (conjunction) {
121
+ return isDisjoint(scope, conjunction[0], conjunction[1])
122
+ ? { name: "abconj", left: conjunction[0], right: conjunction[1] }
123
+ : undefined;
124
+ }
125
+ const operands = getOperands(goal, "Conj");
126
+ const action = operands && getEnabled(operands[1]);
127
+ if (operands && action) {
128
+ return getLevelOf(operands[0]) <= 1 && getLevelOf(action) <= 2
129
+ ? { name: "pconj", left: operands[0], right: action }
130
+ : undefined;
131
+ }
132
+ const equivalence = getEnabledOperands(goal, "Equiv") ?? getEnabledOperands(goal, "Eq");
133
+ if (equivalence) return { name: "equiv", left: equivalence[0], right: equivalence[1] };
134
+ const implication = getEnabledOperands(goal, "Implies");
135
+ return implication && { name: "implies", left: implication[0], right: implication[1] };
136
+ };
137
+
138
+ // implication_to_enabled: the goal follows by the rule its form calls for when a visible fact is
139
+ // the rule's premise and others say that both operands are in BOOLEAN, or the premise is an
140
+ // equivalence. The goal then becomes TRUE; otherwise tlapm records the obligation as not tried.
141
+ export const implicationToEnabled = (sequent: Sequent): Sequent => {
142
+ const goalScope = adjoinAll(undefined, sequent.context);
143
+ const rule = getRule(goalScope, sequent.active);
144
+ const found = { isPremise: false, isLeftBoolean: false, isRightBoolean: false };
145
+ sequent.context.forEach((hyp, index) => {
146
+ if (!rule || hyp.kind !== "Fact" || hyp.visibility !== "Visible") return;
147
+ const amount = sequent.context.length - index;
148
+ const fact = hyp.expression;
149
+ const isLeft = (expression: Expr) => isEqualExpr(shiftExpr(amount, expression), rule.left);
150
+ const isRight = (expression: Expr) => isEqualExpr(shiftExpr(amount, expression), rule.right);
151
+ const isPair = (operands: Expr[] | undefined, names: string[]) =>
152
+ operands !== undefined &&
153
+ isLeft(operands[0]) &&
154
+ isRight(operands[1]) &&
155
+ names.includes(rule.name);
156
+ const enabled = getEnabled(fact);
157
+ const enabledConjunction = enabled && getOperands(enabled, "Conj");
158
+ const conjunction = getOperands(fact, "Conj");
159
+ const action = conjunction && getEnabled(conjunction[1]);
160
+ const membership = getOperands(fact, "Mem");
161
+ const isBoolean = membership?.[1].kind === "Internal" && membership[1].builtin === "BOOLEAN";
162
+ if (
163
+ isPair(enabledConjunction, ["pconj"]) ||
164
+ isPair(enabled && getOperands(enabled, "Disj"), ["abdisj"]) ||
165
+ isPair(getEnabledOperands(fact, "Disj"), ["abdisj_inverse"]) ||
166
+ isPair(enabledConjunction, ["abconj"]) ||
167
+ isPair(getEnabledOperands(fact, "Conj"), ["abconj_inverse", "pconj_inverse"]) ||
168
+ isPair(conjunction && action && [conjunction[0], action], ["pconj_inverse"])
169
+ ) {
170
+ found.isPremise = true;
171
+ } else if (isPair(getOperands(fact, "Equiv"), ["equiv"])) {
172
+ found.isPremise = true;
173
+ found.isLeftBoolean = true;
174
+ found.isRightBoolean = true;
175
+ } else if (isPair(getOperands(fact, "Eq"), ["equiv"])) {
176
+ found.isPremise = true;
177
+ } else if (membership && isBoolean && isLeft(membership[0])) {
178
+ found.isLeftBoolean = true;
179
+ } else if (membership && isBoolean && isRight(membership[0])) {
180
+ found.isRightBoolean = true;
181
+ } else if (isPair(getOperands(fact, "Implies"), ["implies"])) {
182
+ found.isPremise = true;
183
+ }
184
+ });
185
+ if (!found.isPremise || !found.isLeftBoolean || !found.isRightBoolean) {
186
+ throw new TlaProverError("ENABLEDaxioms proof directive did not succeed.\n");
187
+ }
188
+ return { ...sequent, active: TRUE };
189
+ };
@@ -0,0 +1,43 @@
1
+ import { TlapmBugError } from "../../errors";
2
+ import { expandActionOperators, lambdify } from "../../obligations/action";
3
+ import { createAnonymizer } from "../../obligations/anon";
4
+ import type { Expr, Sequent } from "../../obligations/expression";
5
+ import { implicationToEnabled } from "./enabled-axioms";
6
+ import { checkLevelChange } from "./level-comparison";
7
+
8
+ // expand_enabled_cdot: the first frontend the methods cite, in tlapm's order, transforms the
9
+ // obligation. Its soundness checks throw a TlaProverError, as tlapm then runs no backend.
10
+ export const expandEnabledCdot = (sequent: Sequent, frontends: Set<string>): Sequent => {
11
+ const isEnabled = frontends.has("expandenabled");
12
+ const isCdot = frontends.has("expandcdot");
13
+ const isAutoUse = frontends.has("autouse");
14
+ const isLambdify = frontends.has("lambdify");
15
+ if (!isEnabled && !isCdot && !isLambdify) {
16
+ if (frontends.has("levelcomparison")) return checkLevelChange(sequent);
17
+ if (frontends.has("enabledaxioms")) return implicationToEnabled(sequent);
18
+ return sequent;
19
+ }
20
+ // Expr.Anon's anon, which only meets the names that lambdification binds.
21
+ const anonymizer = createAnonymizer(
22
+ { value: 0 },
23
+ () => {
24
+ throw new TlapmBugError();
25
+ },
26
+ () => {},
27
+ );
28
+ const expression: Expr = { kind: "Sequent", sequent };
29
+ const result =
30
+ isEnabled || isCdot
31
+ ? expandActionOperators(anonymizer, () => {}, undefined, expression, {
32
+ isEnabled,
33
+ isCdot,
34
+ isAutoUse,
35
+ })
36
+ : lambdify(anonymizer, () => {}, undefined, expression, {
37
+ isEnabled: true,
38
+ isCdot: true,
39
+ isAutoUse,
40
+ });
41
+ if (result.kind !== "Sequent") throw new TlapmBugError();
42
+ return result.sequent;
43
+ };