tla-ts 0.0.4-dev.0be9567 → 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 (311) 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 +35 -1
  6. package/dist/index.d.ts +35 -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/errors.ts +86 -0
  27. package/src/evaluate.ts +54 -19
  28. package/src/index.ts +10 -0
  29. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  30. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  31. package/src/obligations/ctx.ts +64 -0
  32. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  33. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  34. package/src/{obligation-format.ts → obligations/format.ts} +6 -5
  35. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  36. package/src/{obligations.ts → obligations/index.ts} +28 -12
  37. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  38. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  39. package/src/obligations/pickle.ts +100 -0
  40. package/src/obligations/pragma.ts +189 -0
  41. package/src/{obligation-printer.ts → obligations/printer.ts} +9 -63
  42. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  43. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  44. package/src/obligations/temporal.ts +319 -0
  45. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  46. package/src/ocaml-marshal.ts +166 -0
  47. package/src/parallel-worker.ts +2 -18
  48. package/src/parallel.ts +10 -43
  49. package/src/prove/decide-pool.ts +100 -0
  50. package/src/prove/deciders.ts +33 -0
  51. package/src/prove/isabelle/LICENSE +36 -0
  52. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  53. package/src/prove/isabelle/decide.ts +47 -0
  54. package/src/prove/isabelle/encode.ts +508 -0
  55. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  56. package/src/prove/isabelle/isar/method.ts +367 -0
  57. package/src/prove/isabelle/isar/proof.ts +28 -0
  58. package/src/prove/isabelle/isar/statement.ts +57 -0
  59. package/src/prove/isabelle/isar/theory.ts +192 -0
  60. package/src/prove/isabelle/isar/type-check.ts +278 -0
  61. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  62. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  63. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  64. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  65. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  66. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  67. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  68. package/src/prove/isabelle/provers/classical.ts +389 -0
  69. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  70. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  71. package/src/prove/isabelle/pure/consts.ts +32 -0
  72. package/src/prove/isabelle/pure/conv.ts +79 -0
  73. package/src/prove/isabelle/pure/drule.ts +264 -0
  74. package/src/prove/isabelle/pure/envir.ts +363 -0
  75. package/src/prove/isabelle/pure/goal.ts +53 -0
  76. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  77. package/src/prove/isabelle/pure/list.ts +12 -0
  78. package/src/prove/isabelle/pure/logic.ts +402 -0
  79. package/src/prove/isabelle/pure/name.ts +110 -0
  80. package/src/prove/isabelle/pure/net.ts +262 -0
  81. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  82. package/src/prove/isabelle/pure/pattern.ts +650 -0
  83. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  84. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  85. package/src/prove/isabelle/pure/search.ts +68 -0
  86. package/src/prove/isabelle/pure/seq.ts +156 -0
  87. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  88. package/src/prove/isabelle/pure/table.ts +208 -0
  89. package/src/prove/isabelle/pure/tactic.ts +276 -0
  90. package/src/prove/isabelle/pure/tactical.ts +347 -0
  91. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  92. package/src/prove/isabelle/pure/term.ts +808 -0
  93. package/src/prove/isabelle/pure/thm.ts +806 -0
  94. package/src/prove/isabelle/pure/type.ts +133 -0
  95. package/src/prove/isabelle/pure/unify.ts +753 -0
  96. package/src/prove/isabelle/pure/variable.ts +25 -0
  97. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  98. package/src/prove/isabelle/tla/context.ts +74 -0
  99. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  100. package/src/prove/isabelle/tla/logic.ts +215 -0
  101. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  102. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  103. package/src/prove/ocaml.ts +22 -0
  104. package/src/prove/prep/action.ts +520 -0
  105. package/src/prove/prep/defs.ts +33 -0
  106. package/src/prove/prep/elab.ts +156 -0
  107. package/src/prove/prep/enabled-axioms.ts +189 -0
  108. package/src/prove/prep/enabled.ts +43 -0
  109. package/src/prove/prep/fingerprint.ts +388 -0
  110. package/src/prove/prep/flatten.ts +70 -0
  111. package/src/prove/prep/level-comparison.ts +552 -0
  112. package/src/prove/prep/md5.ts +67 -0
  113. package/src/prove/prep/pragma.ts +221 -0
  114. package/src/prove/prep/trivial.ts +22 -0
  115. package/src/prove/prove-worker.ts +27 -0
  116. package/src/prove/prove.ts +518 -0
  117. package/src/prove/ptl/decide.ts +68 -0
  118. package/src/prove/ptl/encode.ts +256 -0
  119. package/src/prove/ptl/sat.ts +151 -0
  120. package/src/prove/ptl/tableau.ts +276 -0
  121. package/src/prove/smt/axiomatize.ts +69 -0
  122. package/src/prove/smt/axioms.ts +210 -0
  123. package/src/prove/smt/context.ts +108 -0
  124. package/src/prove/smt/data.ts +665 -0
  125. package/src/prove/smt/encode.ts +169 -0
  126. package/src/prove/smt/extensionality.ts +63 -0
  127. package/src/prove/smt/flatten.ts +127 -0
  128. package/src/prove/smt/format.ts +143 -0
  129. package/src/prove/smt/instances.ts +182 -0
  130. package/src/prove/smt/rewrite.ts +784 -0
  131. package/src/prove/smt/simplify.ts +57 -0
  132. package/src/prove/smt/solver/act-cache.ts +265 -0
  133. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  134. package/src/prove/smt/solver/array.ts +22 -0
  135. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  136. package/src/prove/smt/solver/ast-lt.ts +157 -0
  137. package/src/prove/smt/solver/ast-util.ts +147 -0
  138. package/src/prove/smt/solver/ast.ts +1315 -0
  139. package/src/prove/smt/solver/auf-solver.ts +572 -0
  140. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  141. package/src/prove/smt/solver/cg-table.ts +175 -0
  142. package/src/prove/smt/solver/clause.ts +276 -0
  143. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  144. package/src/prove/smt/solver/context.ts +1292 -0
  145. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  146. package/src/prove/smt/solver/der.ts +224 -0
  147. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  148. package/src/prove/smt/solver/e-matching.ts +659 -0
  149. package/src/prove/smt/solver/enode.ts +259 -0
  150. package/src/prove/smt/solver/expr-ref.ts +21 -0
  151. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  152. package/src/prove/smt/solver/fingerprints.ts +92 -0
  153. package/src/prove/smt/solver/flat-literals.ts +51 -0
  154. package/src/prove/smt/solver/goal.ts +138 -0
  155. package/src/prove/smt/solver/hash.ts +173 -0
  156. package/src/prove/smt/solver/hashtable.ts +166 -0
  157. package/src/prove/smt/solver/internalizer.ts +1381 -0
  158. package/src/prove/smt/solver/lbool.ts +5 -0
  159. package/src/prove/smt/solver/literal.ts +24 -0
  160. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  161. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  162. package/src/prove/smt/solver/lp/containers.ts +296 -0
  163. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  164. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  165. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  166. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  167. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  168. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  169. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  170. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  171. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  172. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  173. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  174. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  175. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  176. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  177. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  178. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  179. package/src/prove/smt/solver/lp/nex.ts +120 -0
  180. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  181. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  182. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  183. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  184. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  185. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  186. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  187. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  188. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  189. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  190. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  191. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  192. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  193. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  194. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  195. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  196. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  197. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  198. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  199. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  200. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  201. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  202. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  203. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  204. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  205. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  206. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  207. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  208. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  209. package/src/prove/smt/solver/model-checker.ts +347 -0
  210. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  211. package/src/prove/smt/solver/model-finder.ts +155 -0
  212. package/src/prove/smt/solver/model-generator.ts +97 -0
  213. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  214. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  215. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  216. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  217. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  218. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  219. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  220. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  221. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  222. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  223. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  224. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  225. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  226. package/src/prove/smt/solver/nnf.ts +469 -0
  227. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  228. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  229. package/src/prove/smt/solver/propagate-values.ts +83 -0
  230. package/src/prove/smt/solver/proto-model.ts +551 -0
  231. package/src/prove/smt/solver/pull-quant.ts +139 -0
  232. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  233. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  234. package/src/prove/smt/solver/qe-lite.ts +381 -0
  235. package/src/prove/smt/solver/qi-queue.ts +362 -0
  236. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  237. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  238. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  239. package/src/prove/smt/solver/random-gen.ts +10 -0
  240. package/src/prove/smt/solver/rational.ts +165 -0
  241. package/src/prove/smt/solver/ref-vector.ts +62 -0
  242. package/src/prove/smt/solver/relevancy.ts +247 -0
  243. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  244. package/src/prove/smt/solver/rewriter.ts +843 -0
  245. package/src/prove/smt/solver/rlimit.ts +79 -0
  246. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  247. package/src/prove/smt/solver/solver.ts +71 -0
  248. package/src/prove/smt/solver/sort.ts +35 -0
  249. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  250. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  251. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  252. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  253. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  254. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  255. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  256. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  257. package/src/prove/smt/solver/theory-lra.ts +56 -0
  258. package/src/prove/smt/solver/var-subst.ts +258 -0
  259. package/src/prove/smt/solver/z3-license.txt +10 -0
  260. package/src/prove/smt/table.ts +170 -0
  261. package/src/prove/tlapm/tlapm.ts +97 -0
  262. package/src/prove/tlaps-module.ts +510 -0
  263. package/src/prove/verdict.ts +18 -0
  264. package/src/prove/zenon/LICENSE +32 -0
  265. package/src/prove/zenon/check/check.ts +105 -0
  266. package/src/prove/zenon/check/definitions.ts +144 -0
  267. package/src/prove/zenon/check/equality.ts +182 -0
  268. package/src/prove/zenon/check/functions.ts +62 -0
  269. package/src/prove/zenon/check/keys.ts +125 -0
  270. package/src/prove/zenon/check/propositional.ts +104 -0
  271. package/src/prove/zenon/check/records.ts +188 -0
  272. package/src/prove/zenon/check/relations.ts +121 -0
  273. package/src/prove/zenon/check/rewrites.ts +224 -0
  274. package/src/prove/zenon/check/sets.ts +302 -0
  275. package/src/prove/zenon/check/terms.ts +127 -0
  276. package/src/prove/zenon/check/tla.ts +126 -0
  277. package/src/prove/zenon/decide.ts +113 -0
  278. package/src/prove/zenon/encode.ts +444 -0
  279. package/src/prove/zenon/eqrel.ts +300 -0
  280. package/src/prove/zenon/equality-rules.ts +435 -0
  281. package/src/prove/zenon/expr.ts +551 -0
  282. package/src/prove/zenon/index-table.ts +350 -0
  283. package/src/prove/zenon/isar-case.ts +513 -0
  284. package/src/prove/zenon/isar.ts +1249 -0
  285. package/src/prove/zenon/limits.ts +15 -0
  286. package/src/prove/zenon/llproof.ts +173 -0
  287. package/src/prove/zenon/mltoll.ts +1566 -0
  288. package/src/prove/zenon/node.ts +297 -0
  289. package/src/prove/zenon/ocaml.ts +169 -0
  290. package/src/prove/zenon/parse.ts +247 -0
  291. package/src/prove/zenon/phrase.ts +191 -0
  292. package/src/prove/zenon/proof.ts +198 -0
  293. package/src/prove/zenon/propositional-rules.ts +387 -0
  294. package/src/prove/zenon/rules.ts +94 -0
  295. package/src/prove/zenon/search.ts +288 -0
  296. package/src/prove/zenon/tla/functions.ts +151 -0
  297. package/src/prove/zenon/tla/llproof.ts +480 -0
  298. package/src/prove/zenon/tla/records.ts +225 -0
  299. package/src/prove/zenon/tla/rewrites.ts +447 -0
  300. package/src/prove/zenon/tla/sets.ts +304 -0
  301. package/src/prove/zenon/tla/terms.ts +181 -0
  302. package/src/prove/zenon/tla/tla.ts +506 -0
  303. package/src/run-cli.ts +338 -62
  304. package/src/successors.ts +24 -5
  305. package/src/tlapm-cache.ts +244 -0
  306. package/src/tlc-random.ts +55 -32
  307. package/src/tlc-version.ts +8 -7
  308. package/src/values.ts +47 -4
  309. package/src/worker.ts +65 -0
  310. package/dist/parallel.cjs +0 -12
  311. package/dist/parallel.js +0 -12
@@ -0,0 +1,508 @@
1
+ // Ported from tlapm's src/backend/isabelle.ml (BSD licensed, see LICENSE-tlapm).
2
+ // An obligation as the Isabelle/TLA+ theory tlapm writes for Isabelle to prove with a tactic.
3
+
4
+ import { TlapmBugError, TlaProverError, TlaUnsupportedError } from "../../errors";
5
+ import { createContext, getBoundName, popNames, pushName } from "../../obligations/ctx";
6
+ import {
7
+ shiftExpr,
8
+ type Bound,
9
+ type Builtin,
10
+ type Expr,
11
+ type Sequent,
12
+ } from "../../obligations/expression";
13
+ import { pickle } from "../../obligations/pickle";
14
+
15
+ const cook = (name: string) => `is${pickle(name)}`;
16
+
17
+ const ATOMS: Partial<Record<Builtin, string>> = {
18
+ TRUE: "TRUE",
19
+ FALSE: "FALSE",
20
+ STRING: "STRING",
21
+ BOOLEAN: "BOOLEAN",
22
+ Nat: "Nat",
23
+ Int: "Int",
24
+ Real: cook("Real"),
25
+ Infinity: cook("Infinity"),
26
+ Any: "Any",
27
+ };
28
+
29
+ const UNARY: Partial<Record<Builtin, string>> = {
30
+ Neg: "~",
31
+ DOMAIN: "DOMAIN",
32
+ SUBSET: "SUBSET",
33
+ UNION: "UNION",
34
+ };
35
+
36
+ const BINARY: Partial<Record<Builtin, string>> = {
37
+ Implies: "\\<Rightarrow>",
38
+ Equiv: "\\<Leftrightarrow>",
39
+ Conj: "\\<and>",
40
+ Disj: "\\<or>",
41
+ Eq: "=",
42
+ Neq: "\\<noteq>",
43
+ Subseteq: "\\<subseteq>",
44
+ Mem: "\\<in>",
45
+ Notmem: "\\<notin>",
46
+ Setminus: "\\\\",
47
+ Cap: "\\<inter>",
48
+ Cup: "\\<union>",
49
+ OneArg: ":>",
50
+ Extend: "@@",
51
+ };
52
+
53
+ const NONFIX: Partial<Record<Builtin, [string, number]>> = {
54
+ Plus: ["addint", 2],
55
+ Minus: ["subint", 2],
56
+ Uminus: ["minus", 1],
57
+ Times: ["mult", 2],
58
+ Ratio: [cook("/"), 2],
59
+ Quotient: [cook("\\div"), 2],
60
+ Remainder: [cook("%"), 2],
61
+ Exp: [cook("^"), 2],
62
+ Lteq: ["leq", 2],
63
+ Lt: ["less", 2],
64
+ Gteq: ["geq", 2],
65
+ Gt: ["greater", 2],
66
+ Range: ["intvl", 2],
67
+ Seq: ["Seq", 1],
68
+ Len: ["Len", 1],
69
+ BSeq: ["BSeq", 1],
70
+ Cat: [cook("\\circ"), 2],
71
+ Append: ["Append", 2],
72
+ Head: ["Head", 1],
73
+ Tail: ["Tail", 1],
74
+ SubSeq: ["SubSeq", 3],
75
+ SelectSeq: ["SelectSeq", 2],
76
+ Print: ["Print", 2],
77
+ PrintT: ["PrintT", 1],
78
+ Assert: ["Assert", 2],
79
+ JavaTime: ["JavaTime", 0],
80
+ TLCGet: ["TLCGet", 1],
81
+ TLCSet: ["TLCSet", 2],
82
+ Permutations: ["Permutations", 1],
83
+ SortSeq: ["SortSeq", 2],
84
+ RandomElement: ["RandomElement", 1],
85
+ ToString: ["ToString", 1],
86
+ };
87
+
88
+ // The temporal operators Isabelle/TLA+ has no counterpart for, by the name tlapm reports.
89
+ const TEMPORAL: Partial<Record<Builtin, [string, number]>> = {
90
+ Leadsto: ["Leadsto", 2],
91
+ ENABLED: ["ENABLED", 1],
92
+ Cdot: ["\\cdot", 2],
93
+ Actplus: ["-+->", 2],
94
+ BoxTrue: ["[]", 1],
95
+ BoxFalse: ["[]", 1],
96
+ Diamond: ["<>", 1],
97
+ };
98
+
99
+ // thy_header's tdoms_table: the operators the theory declares, with their arities.
100
+ const DECLARED: [string, number][] = [
101
+ ["Real", 0],
102
+ ["/", 2],
103
+ ["\\div", 2],
104
+ ["%", 2],
105
+ ["..", 2],
106
+ ["Infinity", 0],
107
+ ["[]", 1],
108
+ ["<>", 1],
109
+ ];
110
+
111
+ const HEADER = [
112
+ "consts",
113
+ ...DECLARED.map(
114
+ ([name, arity]) =>
115
+ ` "${cook(name)}" :: ${arity === 0 ? "c" : `"[${Array(arity).fill("c").join(",")}] => c"`}`,
116
+ ),
117
+ "",
118
+ ].join("\n");
119
+
120
+ // tlapm raises Unsupported for what Isabelle/TLA+ can't express, which omits a fact and fails the
121
+ // obligation anywhere else.
122
+ const unsupported = (message: string): never => {
123
+ throw new TlaUnsupportedError(message);
124
+ };
125
+
126
+ const getSuccessors = (integer: string) => {
127
+ const count = Number.parseInt(integer, 10);
128
+ return `${"succ[".repeat(count)}0${"]".repeat(count)}`;
129
+ };
130
+
131
+ // thy_header.
132
+ const getTheoryHeader = (name: string, isVerbose: boolean) => [
133
+ "(* automatically generated -- do not edit manually *)",
134
+ `theory ${name} imports Constant Zenon begin`,
135
+ ...(isVerbose ? ['ML_command \\<open> writeln ("*** TLAPS PARSED\\n"); \\<close>'] : []),
136
+ HEADER,
137
+ ];
138
+
139
+ // pp_print_expr on an obligation after Backend.Prep has shipped it.
140
+ const printLemma = (sequent: Sequent) => {
141
+ const context = createContext();
142
+ const adjoin = (name: string) => pushName(context, pickle(name));
143
+ const bump = () => pushName(context, "");
144
+ const state = { isAssumed: false };
145
+
146
+ // A binder's name binds in what prints inside it.
147
+ const withBound = (name: string, print: (bound: string) => string) => {
148
+ const doc = print(adjoin(name));
149
+ popNames(context, 1);
150
+ return doc;
151
+ };
152
+
153
+ // pp_print_expr: every expression, apart from the obligation's sequent, prints in parentheses.
154
+ const printExpr = (expression: Expr) => `(${formatExpr(expression)})`;
155
+ const delimited = (args: Expr[]) => args.map(printExpr).join(", ");
156
+ const nonfix = (name: string, args: Expr[]) => `(${name} (${delimited(args)}))`;
157
+
158
+ const printInternal = (builtin: Builtin, args: Expr[]): string => {
159
+ const atom = ATOMS[builtin];
160
+ if (atom !== undefined && args.length === 0) return atom;
161
+ const unary = UNARY[builtin];
162
+ if (unary !== undefined && args.length === 1) return `(${unary} ${printExpr(args[0])})`;
163
+ const binary = BINARY[builtin];
164
+ if (binary !== undefined && args.length === 2)
165
+ return `(${printExpr(args[0])} ${binary} ${printExpr(args[1])})`;
166
+ const operator = NONFIX[builtin];
167
+ if (operator && operator[1] === args.length) return nonfix(operator[0], args);
168
+ if (builtin === "Unprimable" && args.length === 1) return printExpr(args[0]);
169
+ // tlapm prints an irregular expression as the hash of its TLA+ text, but never makes one.
170
+ if (builtin === "Irregular" && args.length === 1) return unsupported("Irregular");
171
+ const isFrontend = builtin === "Prime" || builtin === "StrongPrime" || builtin === "UNCHANGED";
172
+ if (isFrontend && args.length === 1) throw new TlapmBugError();
173
+ const temporal = TEMPORAL[builtin];
174
+ if (temporal && temporal[1] === args.length)
175
+ throw new TlaProverError(`Unsupported operator \`${temporal[0]}\`.\n`);
176
+ throw new TlaProverError("Backend.Isabelle.pp_apply");
177
+ };
178
+
179
+ const printApply = (operator: Expr, args: Expr[]): string => {
180
+ switch (operator.kind) {
181
+ case "Ix": {
182
+ const name = getBoundName(context, operator.index);
183
+ if (operator.index <= 0 || name === undefined) throw new TlapmBugError();
184
+ return args.length === 0 ? name : `(${name} (${delimited(args)}))`;
185
+ }
186
+ case "Opaque": {
187
+ const name = pickle(operator.name);
188
+ return args.length === 0 ? `(${name} :: c)` : `(${name} (${delimited(args)}) :: c)`;
189
+ }
190
+ case "Internal":
191
+ return printInternal(operator.builtin, args);
192
+ // tlapm prints a lambda without the arguments it's applied to.
193
+ case "Lambda": {
194
+ const names = operator.params.map((param) => `${adjoin(param.name)} `).join("");
195
+ const doc = `\\<lambda> ${names}. ${printExpr(operator.body)}`;
196
+ popNames(context, operator.params.length);
197
+ return doc;
198
+ }
199
+ default:
200
+ throw new TlapmBugError();
201
+ }
202
+ };
203
+
204
+ // The first bound binds around a quantifier over the others, which move under it.
205
+ const printQuant = (quantifier: "Forall" | "Exists", bounds: Bound[], body: Expr): string => {
206
+ const [bound, ...rest] = bounds;
207
+ if (!bound) return formatExpr(body);
208
+ const undittoed =
209
+ rest[0]?.domain.kind === "Ditto"
210
+ ? [{ ...rest[0], domain: bound.domain }, ...rest.slice(1)]
211
+ : rest;
212
+ const inner: Expr =
213
+ undittoed.length === 0
214
+ ? body
215
+ : {
216
+ kind: "Quant",
217
+ quantifier,
218
+ bounds: undittoed.map((other) =>
219
+ other.domain.kind === "Domain"
220
+ ? {
221
+ ...other,
222
+ domain: { kind: "Domain", expression: shiftExpr(1, other.domain.expression) },
223
+ }
224
+ : other,
225
+ ),
226
+ body,
227
+ location: body.location,
228
+ };
229
+ const symbol = quantifier === "Forall" ? "\\<forall>" : "\\<exists>";
230
+ if (bound.domain.kind === "NoDomain")
231
+ return withBound(bound.name, (name) => `${symbol}${name} : ${printExpr(inner)}`);
232
+ if (bound.domain.kind !== "Domain") throw new TlapmBugError();
233
+ const domain = printExpr(bound.domain.expression);
234
+ return withBound(
235
+ bound.name,
236
+ (name) => `${symbol} ${name} \\<in> ${domain} : ${printExpr(inner)}`,
237
+ );
238
+ };
239
+
240
+ // pp_print_sequent_inner: a sequent inside an expression, as a meta-level implication.
241
+ const printNestedSequent = (sequent: Sequent): string => {
242
+ const [hyp, ...rest] = sequent.context;
243
+ if (!hyp) return printExpr(sequent.active);
244
+ const printRest = () => printNestedSequent({ context: rest, active: sequent.active });
245
+ switch (hyp.kind) {
246
+ case "Flex":
247
+ return withBound(hyp.name, (name) => `(\\<And> ${name} ${name}'.${printRest()})`);
248
+ case "Fresh": {
249
+ if (hyp.domain && hyp.domainVisibility === "Visible") {
250
+ const domain = printExpr(hyp.domain);
251
+ return withBound(
252
+ hyp.name,
253
+ (name) =>
254
+ `(\\<And> ${name} :: c. ${name} \\<in> ${domain} \\<Longrightarrow> ${printRest()})`,
255
+ );
256
+ }
257
+ const shape = `${"c => ".repeat(hyp.shape)}c`;
258
+ return withBound(hyp.name, (name) => `(\\<And> ${name} :: ${shape}. ${printRest()})`);
259
+ }
260
+ case "Fact": {
261
+ const fact = hyp.visibility === "Visible" ? printExpr(hyp.expression) : undefined;
262
+ bump();
263
+ const doc = fact ? `(${fact} \\<Longrightarrow> ${printRest()})` : printRest();
264
+ popNames(context, 1);
265
+ return doc;
266
+ }
267
+ case "Defn":
268
+ return unsupported("Inner definition");
269
+ }
270
+ };
271
+
272
+ const formatExpr = (expression: Expr): string => {
273
+ switch (expression.kind) {
274
+ case "Ix":
275
+ case "Internal":
276
+ case "Opaque":
277
+ case "Lambda":
278
+ return printApply(expression, []);
279
+ case "Apply":
280
+ return printApply(expression.operator, expression.args);
281
+ case "Bang":
282
+ throw new TlaProverError("Backend.Isabelle.module");
283
+ case "Sequent":
284
+ return printNestedSequent(expression.sequent);
285
+ case "With":
286
+ case "Parens":
287
+ return formatExpr(expression.expression);
288
+ case "Let":
289
+ return unsupported("LET");
290
+ case "List":
291
+ if (expression.bullet === "Refs" && expression.items.length === 0) return "TRUE";
292
+ if (expression.bullet === "Refs" && expression.items.length === 1)
293
+ return formatExpr(expression.items[0]);
294
+ return expression.items.map(printExpr).join(expression.bullet === "Or" ? " | " : " & ");
295
+ case "If":
296
+ return `cond(${printExpr(expression.condition)}, ${printExpr(expression.consequent)}, ${printExpr(expression.alternative)})`;
297
+ case "Quant":
298
+ return printQuant(expression.quantifier, expression.bounds, expression.body);
299
+ case "Tquant":
300
+ return unsupported(expression.quantifier === "Forall" ? "\\\\AA" : "\\\\EE");
301
+ case "Choose": {
302
+ const body = expression.body;
303
+ if (!expression.domain)
304
+ return withBound(expression.name, (name) => `Choice(%${name}. ${printExpr(body)})`);
305
+ const domain = printExpr(expression.domain);
306
+ return withBound(
307
+ expression.name,
308
+ (name) => `bChoice(${domain}, %${name}. ${printExpr(body)})`,
309
+ );
310
+ }
311
+ case "SetSt": {
312
+ const body = expression.body;
313
+ const domain = printExpr(expression.domain);
314
+ return withBound(
315
+ expression.name,
316
+ (name) => `subsetOf(${domain}, %${name}. ${printExpr(body)})`,
317
+ );
318
+ }
319
+ case "SetOf": {
320
+ const element = expression.element;
321
+ const [bound] = expression.bounds;
322
+ if (!bound) throw new TlapmBugError();
323
+ if (expression.bounds.length !== 1 || bound.domain.kind !== "Domain")
324
+ return unsupported("SetOf (multiple declared constants)");
325
+ const domain = printExpr(bound.domain.expression);
326
+ return withBound(
327
+ bound.name,
328
+ (name) => `setOfAll(${domain}, %${name}. ${printExpr(element)})`,
329
+ );
330
+ }
331
+ case "SetEnum":
332
+ return `{${delimited(expression.elements)}}`;
333
+ case "Fcn": {
334
+ const body = expression.body;
335
+ const [bound] = expression.bounds;
336
+ if (!bound || expression.bounds.length !== 1)
337
+ return unsupported("function (multiple declared constants)");
338
+ if (bound.domain.kind === "Ditto") throw new TlapmBugError();
339
+ const domain =
340
+ bound.domain.kind === "Domain" ? printExpr(bound.domain.expression) : undefined;
341
+ return withBound(bound.name, (name) => {
342
+ const printed = domain === undefined ? name : ` ${name} \\<in> ${domain} `;
343
+ return `[${printed} \\<mapsto> ${printExpr(body)}]`;
344
+ });
345
+ }
346
+ case "FcnApp": {
347
+ const fcn = printExpr(expression.function);
348
+ return expression.args.length === 1
349
+ ? `fapply (${fcn}, ${printExpr(expression.args[0])})`
350
+ : `fapply (${fcn}, <<${delimited(expression.args)}>>)`;
351
+ }
352
+ case "Arrow":
353
+ return `[${printExpr(expression.domain)} \\<rightarrow> ${printExpr(expression.range)}]`;
354
+ case "Rect":
355
+ return `[${expression.fields.map((field) => `''${field.name}'' : ${printExpr(field.value)}`).join(", ")}]`;
356
+ case "Record":
357
+ return `(${expression.fields.map((field) => `(''${field.name}'' :> ${printExpr(field.value)})`).join(" @@ ")})`;
358
+ case "Except": {
359
+ const specs = expression.specs.map((spec) => {
360
+ const trail = spec.trail
361
+ .map((point) =>
362
+ point.kind === "Dot" ? `[''${point.field}'']` : `[${printExpr(point.expression)}]`,
363
+ )
364
+ .join("");
365
+ return `!${trail} = ${printExpr(spec.value)}`;
366
+ });
367
+ return `[${printExpr(expression.function)} EXCEPT ${specs.join(", ")}]`;
368
+ }
369
+ case "Dot":
370
+ return `fapply (${printExpr(expression.expression)}, (''${expression.field}''))`;
371
+ case "Tuple":
372
+ return `<<${delimited(expression.elements)}>>`;
373
+ case "Product":
374
+ return expression.factors.length === 2
375
+ ? `(${printExpr(expression.factors[0])} \\<times> ${printExpr(expression.factors[1])})`
376
+ : `Product(\\<langle>${delimited(expression.factors)}\\<rangle>)`;
377
+ case "Sub":
378
+ case "Tsub": {
379
+ const suffix = expression.kind === "Sub" ? "sub" : "tsub";
380
+ const name = expression.modal === "Box" ? cook(`a'box'${suffix}`) : `a'dia'${suffix}`;
381
+ return `${name}(${printExpr(expression.action)},${printExpr(expression.subscript)})`;
382
+ }
383
+ case "Fair":
384
+ return `${cook(expression.fairness === "Weak" ? "a'wf" : "a'sf")}(${printExpr(expression.subscript)},${printExpr(expression.action)})`;
385
+ case "Case": {
386
+ const conditions = delimited(expression.arms.map((arm) => arm.condition));
387
+ const bodies = delimited(expression.arms.map((arm) => arm.body));
388
+ return expression.other
389
+ ? `CaseOther(<<${conditions}>>,<<${bodies}>>,${printExpr(expression.other)})`
390
+ : `Case(<<${conditions}>>,<<${bodies}>>)`;
391
+ }
392
+ case "String":
393
+ return `''${expression.value}''`;
394
+ case "Num":
395
+ if (expression.fraction !== "") return unsupported("real constants");
396
+ return `(${getSuccessors(expression.integer)})`;
397
+ case "At":
398
+ throw new TlapmBugError();
399
+ }
400
+ };
401
+
402
+ // tlapm prints a fact to a formatter that drops its output first, to omit an unsupported one.
403
+ const getFact = (expression: Expr) => {
404
+ const depth = context.stack.length;
405
+ try {
406
+ return printExpr(expression);
407
+ } catch (error) {
408
+ if (!(error instanceof TlaUnsupportedError)) throw error;
409
+ popNames(context, context.stack.length - depth);
410
+ return error;
411
+ }
412
+ };
413
+
414
+ // pp_print_sequent_outer: the obligation's sequent as the fixes, assumes and shows of a lemma. A
415
+ // pragma's definition ends it, without the goal.
416
+ const printSequent = (sequent: Sequent) => {
417
+ const lines: string[] = [];
418
+ for (const hyp of sequent.context) {
419
+ switch (hyp.kind) {
420
+ case "Flex": {
421
+ const name = adjoin(hyp.name);
422
+ lines.push(`fixes ${name} ${name}'`);
423
+ break;
424
+ }
425
+ case "Fresh": {
426
+ const domain =
427
+ hyp.domain && hyp.domainVisibility === "Visible" ? printExpr(hyp.domain) : undefined;
428
+ const name = adjoin(hyp.name);
429
+ lines.push(`fixes ${name}`);
430
+ if (domain === undefined) break;
431
+ state.isAssumed = true;
432
+ lines.push(`assumes ${name}_in : "(${name} \\<in> ${domain})"`);
433
+ break;
434
+ }
435
+ case "Fact": {
436
+ const count = context.stack.length;
437
+ const fact = hyp.visibility === "Visible" ? getFact(hyp.expression) : undefined;
438
+ bump();
439
+ if (fact instanceof TlaUnsupportedError) {
440
+ lines.push(`(* omitted temporal assumption : ${fact.message} *)`);
441
+ break;
442
+ }
443
+ if (fact === undefined) break;
444
+ state.isAssumed = true;
445
+ lines.push(`assumes v'${count}: "${fact}"`);
446
+ break;
447
+ }
448
+ case "Defn":
449
+ if (hyp.definition.kind === "Bpragma") return lines.map((line) => `${line}\n`).join("");
450
+ lines.push(`(* usable definition ${hyp.definition.name} suppressed *)`);
451
+ adjoin(hyp.definition.name);
452
+ break;
453
+ }
454
+ }
455
+ return [...lines, `shows "${printExpr(sequent.active)}"`].join("\n");
456
+ };
457
+
458
+ try {
459
+ return { text: printSequent(sequent), isAssumed: state.isAssumed };
460
+ } catch (error) {
461
+ if (!(error instanceof TlaUnsupportedError)) throw error;
462
+ throw new TlaProverError(`isabelle : unsupported operator ${error.message}`);
463
+ }
464
+ };
465
+
466
+ // thy_temp: the theory tlapm writes for Isabelle to prove obligation id.
467
+ export const encodeIsabelle = (
468
+ id: number,
469
+ sequent: Sequent,
470
+ tactic: string,
471
+ theoryName: string,
472
+ ): string => {
473
+ const lemma = printLemma(sequent);
474
+ return [
475
+ ...getTheoryHeader(theoryName, false),
476
+ `lemma ob'${id}:`,
477
+ `${lemma.text}(is "PROP ?ob'${id}")`,
478
+ "proof -",
479
+ `show "PROP ?ob'${id}"`,
480
+ `${lemma.isAssumed ? "using assms " : ""}by ${tactic}`,
481
+ "qed",
482
+ "end",
483
+ "",
484
+ ].join("\n");
485
+ };
486
+
487
+ interface IsabelleProof {
488
+ id: number;
489
+ sequent: Sequent;
490
+ tactic: string;
491
+ }
492
+
493
+ // Isabelle.thy_init, thy_write and thy_close.
494
+ export const encodeIsabelleTheory = (name: string, proofs: IsabelleProof[]) =>
495
+ [
496
+ ...getTheoryHeader(name, true),
497
+ ...proofs.flatMap((proof) => [
498
+ `lemma ob'${proof.id}:`,
499
+ `${printLemma(proof.sequent).text}(is "PROP ?ob'${proof.id}")`,
500
+ "proof -",
501
+ `ML_command \\<open> writeln "*** TLAPS ENTER ${proof.id}"; \\<close>`,
502
+ `show "PROP ?ob'${proof.id}"`,
503
+ `using assms by ${proof.tactic}`,
504
+ `ML_command \\<open> writeln "*** TLAPS EXIT ${proof.id}"; \\<close> qed`,
505
+ ]),
506
+ "end",
507
+ "",
508
+ ].join("\n");