tla-ts 0.0.4-dev.7c70fed → 0.0.4-dev.8fefa42

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 (308) hide show
  1. package/README.md +62 -70
  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 +515 -0
  15. package/dist/prove.js +515 -0
  16. package/dist/run-cli.cjs +30 -47
  17. package/dist/run-cli.js +30 -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-generate.ts → obligations/generate.ts} +134 -61
  35. package/src/{obligations.ts → obligations/index.ts} +26 -12
  36. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  37. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  38. package/src/obligations/pickle.ts +100 -0
  39. package/src/obligations/pragma.ts +189 -0
  40. package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
  41. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  42. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  43. package/src/obligations/temporal.ts +319 -0
  44. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  45. package/src/parallel-worker.ts +2 -18
  46. package/src/parallel.ts +10 -43
  47. package/src/prove/decide-pool.ts +100 -0
  48. package/src/prove/deciders.ts +27 -0
  49. package/src/prove/isabelle/LICENSE +36 -0
  50. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  51. package/src/prove/isabelle/decide.ts +47 -0
  52. package/src/prove/isabelle/encode.ts +477 -0
  53. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  54. package/src/prove/isabelle/isar/method.ts +367 -0
  55. package/src/prove/isabelle/isar/proof.ts +28 -0
  56. package/src/prove/isabelle/isar/statement.ts +57 -0
  57. package/src/prove/isabelle/isar/theory.ts +192 -0
  58. package/src/prove/isabelle/isar/type-check.ts +278 -0
  59. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  60. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  61. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  62. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  63. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  64. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  65. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  66. package/src/prove/isabelle/provers/classical.ts +389 -0
  67. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  68. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  69. package/src/prove/isabelle/pure/consts.ts +32 -0
  70. package/src/prove/isabelle/pure/conv.ts +79 -0
  71. package/src/prove/isabelle/pure/drule.ts +264 -0
  72. package/src/prove/isabelle/pure/envir.ts +363 -0
  73. package/src/prove/isabelle/pure/goal.ts +53 -0
  74. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  75. package/src/prove/isabelle/pure/list.ts +12 -0
  76. package/src/prove/isabelle/pure/logic.ts +402 -0
  77. package/src/prove/isabelle/pure/name.ts +110 -0
  78. package/src/prove/isabelle/pure/net.ts +262 -0
  79. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  80. package/src/prove/isabelle/pure/pattern.ts +650 -0
  81. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  82. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  83. package/src/prove/isabelle/pure/search.ts +68 -0
  84. package/src/prove/isabelle/pure/seq.ts +156 -0
  85. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  86. package/src/prove/isabelle/pure/table.ts +208 -0
  87. package/src/prove/isabelle/pure/tactic.ts +276 -0
  88. package/src/prove/isabelle/pure/tactical.ts +347 -0
  89. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  90. package/src/prove/isabelle/pure/term.ts +808 -0
  91. package/src/prove/isabelle/pure/thm.ts +806 -0
  92. package/src/prove/isabelle/pure/type.ts +133 -0
  93. package/src/prove/isabelle/pure/unify.ts +753 -0
  94. package/src/prove/isabelle/pure/variable.ts +25 -0
  95. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  96. package/src/prove/isabelle/tla/context.ts +74 -0
  97. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  98. package/src/prove/isabelle/tla/logic.ts +215 -0
  99. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  100. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  101. package/src/prove/ocaml.ts +22 -0
  102. package/src/prove/prep/action.ts +520 -0
  103. package/src/prove/prep/defs.ts +27 -0
  104. package/src/prove/prep/elab.ts +156 -0
  105. package/src/prove/prep/enabled-axioms.ts +189 -0
  106. package/src/prove/prep/enabled.ts +43 -0
  107. package/src/prove/prep/fingerprint.ts +388 -0
  108. package/src/prove/prep/flatten.ts +70 -0
  109. package/src/prove/prep/level-comparison.ts +552 -0
  110. package/src/prove/prep/md5.ts +67 -0
  111. package/src/prove/prep/pragma.ts +221 -0
  112. package/src/prove/prep/trivial.ts +22 -0
  113. package/src/prove/prove-worker.ts +29 -0
  114. package/src/prove/prove.ts +417 -0
  115. package/src/prove/ptl/decide.ts +68 -0
  116. package/src/prove/ptl/encode.ts +256 -0
  117. package/src/prove/ptl/sat.ts +151 -0
  118. package/src/prove/ptl/tableau.ts +276 -0
  119. package/src/prove/smt/axiomatize.ts +69 -0
  120. package/src/prove/smt/axioms.ts +210 -0
  121. package/src/prove/smt/context.ts +108 -0
  122. package/src/prove/smt/data.ts +665 -0
  123. package/src/prove/smt/encode.ts +169 -0
  124. package/src/prove/smt/extensionality.ts +63 -0
  125. package/src/prove/smt/flatten.ts +127 -0
  126. package/src/prove/smt/format.ts +143 -0
  127. package/src/prove/smt/instances.ts +182 -0
  128. package/src/prove/smt/rewrite.ts +784 -0
  129. package/src/prove/smt/simplify.ts +57 -0
  130. package/src/prove/smt/solver/act-cache.ts +265 -0
  131. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  132. package/src/prove/smt/solver/array.ts +22 -0
  133. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  134. package/src/prove/smt/solver/ast-lt.ts +157 -0
  135. package/src/prove/smt/solver/ast-util.ts +147 -0
  136. package/src/prove/smt/solver/ast.ts +1315 -0
  137. package/src/prove/smt/solver/auf-solver.ts +572 -0
  138. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  139. package/src/prove/smt/solver/cg-table.ts +175 -0
  140. package/src/prove/smt/solver/clause.ts +276 -0
  141. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  142. package/src/prove/smt/solver/context.ts +1292 -0
  143. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  144. package/src/prove/smt/solver/der.ts +224 -0
  145. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  146. package/src/prove/smt/solver/e-matching.ts +659 -0
  147. package/src/prove/smt/solver/enode.ts +259 -0
  148. package/src/prove/smt/solver/expr-ref.ts +21 -0
  149. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  150. package/src/prove/smt/solver/fingerprints.ts +92 -0
  151. package/src/prove/smt/solver/flat-literals.ts +51 -0
  152. package/src/prove/smt/solver/goal.ts +138 -0
  153. package/src/prove/smt/solver/hash.ts +173 -0
  154. package/src/prove/smt/solver/hashtable.ts +166 -0
  155. package/src/prove/smt/solver/internalizer.ts +1381 -0
  156. package/src/prove/smt/solver/lbool.ts +5 -0
  157. package/src/prove/smt/solver/literal.ts +24 -0
  158. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  159. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  160. package/src/prove/smt/solver/lp/containers.ts +296 -0
  161. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  162. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  163. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  164. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  165. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  166. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  167. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  168. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  169. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  170. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  171. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  172. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  173. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  174. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  175. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  176. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  177. package/src/prove/smt/solver/lp/nex.ts +120 -0
  178. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  179. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  180. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  181. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  182. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  183. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  184. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  185. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  186. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  187. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  188. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  189. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  190. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  191. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  192. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  193. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  194. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  195. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  196. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  197. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  198. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  199. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  200. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  201. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  202. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  203. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  204. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  205. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  206. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  207. package/src/prove/smt/solver/model-checker.ts +347 -0
  208. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  209. package/src/prove/smt/solver/model-finder.ts +155 -0
  210. package/src/prove/smt/solver/model-generator.ts +97 -0
  211. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  212. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  213. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  214. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  215. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  216. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  217. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  218. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  219. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  220. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  221. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  222. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  223. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  224. package/src/prove/smt/solver/nnf.ts +469 -0
  225. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  226. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  227. package/src/prove/smt/solver/propagate-values.ts +83 -0
  228. package/src/prove/smt/solver/proto-model.ts +551 -0
  229. package/src/prove/smt/solver/pull-quant.ts +139 -0
  230. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  231. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  232. package/src/prove/smt/solver/qe-lite.ts +381 -0
  233. package/src/prove/smt/solver/qi-queue.ts +362 -0
  234. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  235. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  236. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  237. package/src/prove/smt/solver/random-gen.ts +10 -0
  238. package/src/prove/smt/solver/rational.ts +165 -0
  239. package/src/prove/smt/solver/ref-vector.ts +62 -0
  240. package/src/prove/smt/solver/relevancy.ts +247 -0
  241. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  242. package/src/prove/smt/solver/rewriter.ts +843 -0
  243. package/src/prove/smt/solver/rlimit.ts +79 -0
  244. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  245. package/src/prove/smt/solver/solver.ts +71 -0
  246. package/src/prove/smt/solver/sort.ts +35 -0
  247. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  248. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  249. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  250. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  251. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  252. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  253. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  254. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  255. package/src/prove/smt/solver/theory-lra.ts +56 -0
  256. package/src/prove/smt/solver/var-subst.ts +258 -0
  257. package/src/prove/smt/solver/z3-license.txt +10 -0
  258. package/src/prove/smt/table.ts +170 -0
  259. package/src/prove/tlapm/tlapm.ts +96 -0
  260. package/src/prove/tlaps-module.ts +510 -0
  261. package/src/prove/verdict.ts +13 -0
  262. package/src/prove/zenon/LICENSE +32 -0
  263. package/src/prove/zenon/check/check.ts +105 -0
  264. package/src/prove/zenon/check/definitions.ts +144 -0
  265. package/src/prove/zenon/check/equality.ts +182 -0
  266. package/src/prove/zenon/check/functions.ts +62 -0
  267. package/src/prove/zenon/check/keys.ts +125 -0
  268. package/src/prove/zenon/check/propositional.ts +104 -0
  269. package/src/prove/zenon/check/records.ts +188 -0
  270. package/src/prove/zenon/check/relations.ts +121 -0
  271. package/src/prove/zenon/check/rewrites.ts +224 -0
  272. package/src/prove/zenon/check/sets.ts +302 -0
  273. package/src/prove/zenon/check/terms.ts +127 -0
  274. package/src/prove/zenon/check/tla.ts +126 -0
  275. package/src/prove/zenon/decide.ts +113 -0
  276. package/src/prove/zenon/encode.ts +444 -0
  277. package/src/prove/zenon/eqrel.ts +300 -0
  278. package/src/prove/zenon/equality-rules.ts +435 -0
  279. package/src/prove/zenon/expr.ts +551 -0
  280. package/src/prove/zenon/index-table.ts +350 -0
  281. package/src/prove/zenon/isar-case.ts +513 -0
  282. package/src/prove/zenon/isar.ts +1249 -0
  283. package/src/prove/zenon/limits.ts +15 -0
  284. package/src/prove/zenon/llproof.ts +173 -0
  285. package/src/prove/zenon/mltoll.ts +1566 -0
  286. package/src/prove/zenon/node.ts +297 -0
  287. package/src/prove/zenon/ocaml.ts +169 -0
  288. package/src/prove/zenon/parse.ts +247 -0
  289. package/src/prove/zenon/phrase.ts +191 -0
  290. package/src/prove/zenon/proof.ts +198 -0
  291. package/src/prove/zenon/propositional-rules.ts +387 -0
  292. package/src/prove/zenon/rules.ts +94 -0
  293. package/src/prove/zenon/search.ts +288 -0
  294. package/src/prove/zenon/tla/functions.ts +151 -0
  295. package/src/prove/zenon/tla/llproof.ts +480 -0
  296. package/src/prove/zenon/tla/records.ts +225 -0
  297. package/src/prove/zenon/tla/rewrites.ts +447 -0
  298. package/src/prove/zenon/tla/sets.ts +304 -0
  299. package/src/prove/zenon/tla/terms.ts +181 -0
  300. package/src/prove/zenon/tla/tla.ts +506 -0
  301. package/src/run-cli.ts +73 -20
  302. package/src/successors.ts +24 -5
  303. package/src/tlc-version.ts +8 -7
  304. package/src/values.ts +47 -4
  305. package/src/worker.ts +65 -0
  306. package/dist/parallel.cjs +0 -12
  307. package/dist/parallel.js +0 -12
  308. /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
@@ -0,0 +1,353 @@
1
+ // Ported from Isabelle2025's Pure/raw_simplifier.ML, the simpset and its rewrite rules. Copyright
2
+ // (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see
3
+ // LICENSE.
4
+ //
5
+ // Isabelle/TLA+ declares no congruence procedures, so the simpset leaves them out.
6
+
7
+ import { TlaIsabelleError } from "../../../errors";
8
+ import { etaContract } from "./envir";
9
+ import { symmetricThm } from "./drule";
10
+ import { destEquals, isEquals, occs, stripImpConcl, stripImpPrems } from "./logic";
11
+ import { deleteTermSafe, emptyNet, insertNet, keyOfTerm, type Net } from "./net";
12
+ import { isFirstOrder, isPattern, matches } from "./pattern";
13
+ import { emptyTable, type Table } from "./table";
14
+ import { emptyTEnv } from "./envir";
15
+ import { emptyTyEnv } from "./type";
16
+ import {
17
+ aconv,
18
+ existsSubterm,
19
+ existsType,
20
+ foldVars,
21
+ eqTyp,
22
+ headOf,
23
+ type Term,
24
+ type Typ,
25
+ type Var,
26
+ } from "./term";
27
+ import { rs, type Thm } from "./thm";
28
+ import { eqThmProp, noTac, type GoalTactic } from "./tactical";
29
+ import type { Limits } from "./interrupt";
30
+
31
+ export interface Rrule {
32
+ readonly thm: Thm;
33
+ readonly lhs: Term;
34
+ readonly elhs: Term;
35
+ readonly extra: boolean;
36
+ readonly fo: boolean;
37
+ readonly perm: boolean;
38
+ }
39
+
40
+ export interface Procedure {
41
+ readonly name: string;
42
+ readonly lhs: Term;
43
+ readonly proc: (context: SimpContext, term: Term) => Thm | undefined;
44
+ }
45
+
46
+ export interface Solver {
47
+ readonly name: string;
48
+ readonly tactic: (context: SimpContext) => GoalTactic;
49
+ }
50
+
51
+ export interface MkRews {
52
+ readonly mk: (thm: Thm, context: SimpContext) => Thm[];
53
+ readonly mkEqTrue: (thm: Thm) => Thm | undefined;
54
+ }
55
+
56
+ export interface CongName {
57
+ readonly isConst: boolean;
58
+ readonly name: string;
59
+ }
60
+
61
+ export interface Simpset {
62
+ readonly rules: Net<Rrule>;
63
+ readonly prems: readonly Thm[];
64
+ readonly depth: number;
65
+ readonly congs: Table<string, Thm>;
66
+ readonly weakCongs: readonly CongName[];
67
+ readonly simprocs: Net<Procedure>;
68
+ readonly mkRews: MkRews;
69
+ readonly subgoalTac: (context: SimpContext) => GoalTactic;
70
+ readonly loopTacs: readonly {
71
+ readonly name: string;
72
+ readonly tactic: (context: SimpContext) => GoalTactic;
73
+ }[];
74
+ readonly unsafeSolvers: readonly Solver[];
75
+ readonly safeSolvers: readonly Solver[];
76
+ }
77
+
78
+ // The part of an Isabelle proof context that the simplifier reads: the simpset, the time limits,
79
+ // and the counter that names the free variables standing for bound ones.
80
+ export interface SimpContext {
81
+ readonly limits: Limits;
82
+ readonly simpset: Simpset;
83
+ readonly bounds: number;
84
+ }
85
+
86
+ export const SIMP_DEPTH_LIMIT = 40;
87
+
88
+ export const congKey = (name: CongName) => `${name.isConst ? "1" : "0"}${name.name}`;
89
+
90
+ export const congName = (term: Term): CongName | undefined =>
91
+ term.kind === "Const"
92
+ ? { isConst: true, name: term.name }
93
+ : term.kind === "Free"
94
+ ? { isConst: false, name: term.name }
95
+ : undefined;
96
+
97
+ const varsOf = (term: Term) => foldVars((atom, result: Var[]) => [...result, atom], term, []);
98
+
99
+ const hasVar = (vars: readonly Var[], variable: Var) =>
100
+ vars.some(
101
+ (other) =>
102
+ other.name === variable.name &&
103
+ other.index === variable.index &&
104
+ eqTyp(other.type, variable.type),
105
+ );
106
+
107
+ const addTVarKeys = (type: Typ, keys: Set<string>) => {
108
+ if (type.kind === "TVar") keys.add(`${type.index}:${type.name}`);
109
+ if (type.kind === "Type") for (const arg of type.args) addTVarKeys(arg, keys);
110
+ return keys;
111
+ };
112
+
113
+ const hasNewTVar = (type: Typ, keys: ReadonlySet<string>): boolean => {
114
+ if (type.kind === "TVar") return !keys.has(`${type.index}:${type.name}`);
115
+ if (type.kind === "Type") return type.args.some((arg) => hasNewTVar(arg, keys));
116
+ return false;
117
+ };
118
+
119
+ // rewrite_rule_extra_vars: whether the right-hand sides have variables outside the left-hand side
120
+ // and the premises.
121
+ export const rewriteRuleExtraVars = (
122
+ prems: readonly Term[],
123
+ elhs: Term,
124
+ erhss: readonly Term[],
125
+ ) => {
126
+ const terms = [elhs, ...prems];
127
+ const vars = terms.flatMap(varsOf);
128
+ const tvars = new Set<string>();
129
+ for (const term of terms)
130
+ existsType((type) => {
131
+ addTVarKeys(type, tvars);
132
+ return false;
133
+ }, term);
134
+ return erhss.some(
135
+ (erhs) =>
136
+ existsType((type) => hasNewTVar(type, tvars), erhs) ||
137
+ existsSubterm((sub) => sub.kind === "Var" && !hasVar(vars, sub), erhs),
138
+ );
139
+ };
140
+
141
+ const mkRrule2 = (thm: Thm, lhs: Term, elhs: Term, perm: boolean): Rrule => ({
142
+ thm,
143
+ lhs,
144
+ elhs,
145
+ extra: rewriteRuleExtraVars([], elhs, [
146
+ ...thm.tpairs.flatMap((pair) => [pair[0], pair[1]]),
147
+ thm.prop,
148
+ ]),
149
+ fo: isFirstOrder(elhs) || !isPattern(elhs),
150
+ perm,
151
+ });
152
+
153
+ const vperm = (left: Term, right: Term): boolean => {
154
+ if (left.kind === "Var" && right.kind === "Var") return true;
155
+ if (left.kind === "Abs" && right.kind === "Abs") return vperm(left.body, right.body);
156
+ if (left.kind === "App" && right.kind === "App")
157
+ return vperm(left.fun, right.fun) && vperm(left.arg, right.arg);
158
+ return aconvExact(left, right);
159
+ };
160
+
161
+ const aconvExact = (left: Term, right: Term): boolean => {
162
+ if (left.kind !== right.kind) return false;
163
+ switch (left.kind) {
164
+ case "Const":
165
+ case "Free":
166
+ return right.kind === left.kind && left.name === right.name && eqTyp(left.type, right.type);
167
+ case "Var":
168
+ return (
169
+ right.kind === "Var" &&
170
+ left.name === right.name &&
171
+ left.index === right.index &&
172
+ eqTyp(left.type, right.type)
173
+ );
174
+ case "Bound":
175
+ return right.kind === "Bound" && left.index === right.index;
176
+ case "Abs":
177
+ return (
178
+ right.kind === "Abs" &&
179
+ left.name === right.name &&
180
+ eqTyp(left.type, right.type) &&
181
+ aconvExact(left.body, right.body)
182
+ );
183
+ case "App":
184
+ return (
185
+ right.kind === "App" && aconvExact(left.fun, right.fun) && aconvExact(left.arg, right.arg)
186
+ );
187
+ }
188
+ };
189
+
190
+ const isVarPerm = (left: Term, right: Term) => {
191
+ if (!vperm(left, right)) return false;
192
+ const leftVars = varsOf(left);
193
+ const rightVars = varsOf(right);
194
+ return (
195
+ leftVars.every((variable) => hasVar(rightVars, variable)) &&
196
+ rightVars.every((variable) => hasVar(leftVars, variable))
197
+ );
198
+ };
199
+
200
+ interface Decomposed {
201
+ readonly prems: Term[];
202
+ readonly lhs: Term;
203
+ readonly elhs: Term;
204
+ readonly rhs: Term;
205
+ readonly perm: boolean;
206
+ }
207
+
208
+ export const decompSimp = (thm: Thm): Decomposed => {
209
+ const prems = stripImpPrems(thm.prop);
210
+ const concl = stripImpConcl(thm.prop);
211
+ if (!isEquals(concl)) throw new TlaIsabelleError("ERROR", "Rewrite rule not a meta-equality");
212
+ const [lhs, rhs] = destEquals(concl);
213
+ const elhs = etaContract(lhs);
214
+ const erhs = etaContract(rhs);
215
+ const perm = isVarPerm(elhs, erhs) && !aconv(elhs, erhs) && elhs.kind !== "Var";
216
+ return { prems, lhs, elhs, rhs, perm };
217
+ };
218
+
219
+ interface RawRrule {
220
+ readonly thm: Thm;
221
+ readonly lhs: Term;
222
+ readonly elhs: Term;
223
+ readonly perm: boolean;
224
+ }
225
+
226
+ const mkEqTrue = (context: SimpContext, thm: Thm): RawRrule[] => {
227
+ const eqTrue = context.simpset.mkRews.mkEqTrue(thm);
228
+ if (eqTrue === undefined) return [];
229
+ const decomposed = decompSimp(eqTrue);
230
+ return [{ thm: eqTrue, lhs: decomposed.lhs, elhs: decomposed.elhs, perm: false }];
231
+ };
232
+
233
+ const rruleEqTrue = (
234
+ context: SimpContext,
235
+ thm: Thm,
236
+ lhs: Term,
237
+ elhs: Term,
238
+ rhs: Term,
239
+ original: Thm,
240
+ ): RawRrule[] => {
241
+ const rrule = { thm, lhs, elhs, perm: false };
242
+ return rewriteRuleExtraVars([], lhs, [rhs]) ? [...mkEqTrue(context, original), rrule] : [rrule];
243
+ };
244
+
245
+ const mkRrule = (context: SimpContext, thm: Thm): RawRrule[] => {
246
+ const decomposed = decompSimp(thm);
247
+ if (decomposed.perm) return [{ thm, lhs: decomposed.lhs, elhs: decomposed.elhs, perm: true }];
248
+ if (
249
+ rewriteRuleExtraVars(decomposed.prems, decomposed.lhs, [decomposed.rhs]) ||
250
+ decomposed.elhs.kind === "Var"
251
+ )
252
+ return mkEqTrue(context, thm);
253
+ return rruleEqTrue(context, thm, decomposed.lhs, decomposed.elhs, decomposed.rhs, thm);
254
+ };
255
+
256
+ // default_reorient: catches looping rules and stupid orientations.
257
+ const defaultReorient = (prems: readonly Term[], lhs: Term, rhs: Term) =>
258
+ rewriteRuleExtraVars(prems, lhs, [rhs]) ||
259
+ headOf(lhs).kind === "Var" ||
260
+ [rhs, ...prems].some((term) => occs(lhs, term)) ||
261
+ (prems.length === 0 && matches(lhs, rhs, emptyTyEnv, emptyTEnv)) ||
262
+ (lhs.kind === "Const" && rhs.kind !== "Const");
263
+
264
+ const orientRrule = (context: SimpContext, thm: Thm): RawRrule[] => {
265
+ const decomposed = decompSimp(thm);
266
+ if (decomposed.perm) return [{ thm, lhs: decomposed.lhs, elhs: decomposed.elhs, perm: true }];
267
+ if (!defaultReorient(decomposed.prems, decomposed.lhs, decomposed.rhs))
268
+ return rruleEqTrue(context, thm, decomposed.lhs, decomposed.elhs, decomposed.rhs, thm);
269
+ if (defaultReorient(decomposed.prems, decomposed.rhs, decomposed.lhs))
270
+ return mkEqTrue(context, thm);
271
+ const symmetric = (() => {
272
+ try {
273
+ return rs(thm, symmetricThm);
274
+ } catch (error) {
275
+ if (error instanceof TlaIsabelleError && error.exception === "THM") return undefined;
276
+ throw error;
277
+ }
278
+ })();
279
+ if (symmetric === undefined) return [];
280
+ const flipped = decompSimp(symmetric);
281
+ return rruleEqTrue(context, symmetric, flipped.lhs, flipped.elhs, flipped.rhs, thm);
282
+ };
283
+
284
+ // extract_safe_rrules: the rewrite rules of an assumption, oriented to avoid loops.
285
+ export const extractSafeRrules = (context: SimpContext, thm: Thm): RawRrule[] =>
286
+ context.simpset.mkRews.mk(thm, context).flatMap((rew) => orientRrule(context, rew));
287
+
288
+ const eqRrule = (left: Rrule, right: Rrule) => eqThmProp(left.thm, right.thm);
289
+
290
+ export const insertRrule = (raw: RawRrule, simpset: Simpset): Simpset => {
291
+ const rrule = mkRrule2(raw.thm, raw.lhs, raw.elhs, raw.perm);
292
+ const rules = insertNet(eqRrule, keyOfTerm(rrule.elhs), rrule, simpset.rules);
293
+ return rules === undefined ? simpset : { ...simpset, rules };
294
+ };
295
+
296
+ export const delRrule = (raw: RawRrule, simpset: Simpset): Simpset => {
297
+ const rrule = mkRrule2(raw.thm, raw.lhs, raw.elhs, raw.perm);
298
+ return { ...simpset, rules: deleteTermSafe(eqRrule, rrule.elhs, rrule, simpset.rules) };
299
+ };
300
+
301
+ export const addSimps = (context: SimpContext, thms: readonly Thm[]): Simpset =>
302
+ thms
303
+ .flatMap((thm) => context.simpset.mkRews.mk(thm, context))
304
+ .flatMap((rew) => mkRrule(context, rew))
305
+ .reduce((simpset, raw) => insertRrule(raw, simpset), context.simpset);
306
+
307
+ export const delSimps = (context: SimpContext, thms: readonly Thm[]): Simpset =>
308
+ thms
309
+ .flatMap((thm) => context.simpset.mkRews.mk(thm, context))
310
+ .flatMap((rew) => mkRrule(context, rew))
311
+ .reduce((simpset, raw) => delRrule(raw, simpset), context.simpset);
312
+
313
+ // mk_procrule: the rewrite rule a simplification procedure proves.
314
+ export const mkProcrule = (thm: Thm): Rrule[] => {
315
+ const decomposed = decompSimp(thm);
316
+ if (rewriteRuleExtraVars(decomposed.prems, decomposed.lhs, [decomposed.rhs])) return [];
317
+ return [mkRrule2(thm, decomposed.lhs, decomposed.elhs, false)];
318
+ };
319
+
320
+ export const addPrems = (thms: readonly Thm[], simpset: Simpset): Simpset => ({
321
+ ...simpset,
322
+ prems: [...thms, ...simpset.prems],
323
+ });
324
+
325
+ // Rebuilds a rule net from Net.entries, as the reference simpset lists them.
326
+ export const rulesFromEntries = (thms: readonly Thm[]): Net<Rrule> =>
327
+ thms.reduceRight<Net<Rrule>>((net, thm) => {
328
+ const decomposed = decompSimp(thm);
329
+ const rrule = mkRrule2(thm, decomposed.lhs, decomposed.elhs, decomposed.perm);
330
+ return insertNet(() => false, keyOfTerm(rrule.elhs), rrule, net) ?? net;
331
+ }, emptyNet);
332
+
333
+ export const emptyCongs: Table<string, Thm> = emptyTable((left: string, right: string) =>
334
+ left === right ? 0 : left < right ? -1 : 1,
335
+ );
336
+
337
+ // empty_ss: rewrites with meta-equalities only, and solves no subgoal.
338
+ export const emptySimpset: Simpset = {
339
+ rules: emptyNet,
340
+ prems: [],
341
+ depth: 0,
342
+ congs: emptyCongs,
343
+ weakCongs: [],
344
+ simprocs: emptyNet,
345
+ mkRews: {
346
+ mk: (thm) => (isEquals(stripImpConcl(thm.prop)) ? [thm] : []),
347
+ mkEqTrue: () => undefined,
348
+ },
349
+ subgoalTac: () => () => noTac,
350
+ loopTacs: [],
351
+ unsafeSolvers: [],
352
+ safeSolvers: [],
353
+ };