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,300 @@
1
+ // Ported from Zenon's eqrel.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
+ //
3
+ // Finds the hypotheses that make a relation reflexive, symmetric or transitive. The prover then
4
+ // reasons with those properties directly, and drops the hypotheses that only state them. The
5
+ // translation to Isar proves the properties again from the hypotheses that stated them.
6
+
7
+ import { TRUE, type Expr, type Expressions } from "./expr";
8
+
9
+ export type Direction = "left" | "right";
10
+
11
+ // Where a hypothesis states a property: the conjunct at `directions`, with the relation's
12
+ // arguments bound by the quantifiers at `variables`, counted from the outermost.
13
+ export interface Origin {
14
+ formula: Expr;
15
+ directions: Direction[];
16
+ variables: number[];
17
+ }
18
+
19
+ export interface RelationInfo {
20
+ reflexive: Origin | undefined;
21
+ symmetric: Origin | undefined;
22
+ transitive: Origin | undefined;
23
+ transitiveSymmetric: Origin | undefined;
24
+ // The type of the relation's arguments.
25
+ type: string;
26
+ }
27
+
28
+ interface Bound {
29
+ name: string;
30
+ type: string;
31
+ }
32
+
33
+ // A conjunct of a hypothesis: the variables quantified around it and the literals of its
34
+ // disjunction, when they all relate two of those variables by the same symbol.
35
+ interface Leaves {
36
+ directions: Direction[];
37
+ env: Bound[];
38
+ leaves: Expr[];
39
+ type: string;
40
+ }
41
+
42
+ const getLeaves = (
43
+ exprs: Expressions,
44
+ directions: Direction[],
45
+ env: Bound[],
46
+ formula: Expr,
47
+ ): Leaves => {
48
+ const leaves: Expr[] = [];
49
+ let symbol: string | undefined = undefined;
50
+ let type = "";
51
+ const getBound = (term: Expr) =>
52
+ term.kind === "var" ? env.find((bound) => bound.name === term.symbol) : undefined;
53
+ const visitLeaf = (leaf: Expr) => {
54
+ const atom = leaf.kind === "not" ? leaf.args[0] : leaf;
55
+ if (atom.kind !== "app") return false;
56
+ const first = getBound(atom.args[0]);
57
+ const isRelation =
58
+ atom.args.length === 2 &&
59
+ (symbol === undefined || atom.symbol === symbol) &&
60
+ first !== undefined &&
61
+ getBound(atom.args[1]) !== undefined;
62
+ if (!isRelation) return false;
63
+ if (symbol === undefined) type = first.type;
64
+ symbol = atom.symbol;
65
+ leaves.unshift(leaf);
66
+ return true;
67
+ };
68
+ const visit = (disjunct: Expr): boolean => {
69
+ if (disjunct.kind === "or") return visit(disjunct.args[0]) && visit(disjunct.args[1]);
70
+ if (disjunct.kind === "imply")
71
+ return visit(exprs.enot(disjunct.args[0])) && visit(disjunct.args[1]);
72
+ if (disjunct.kind === "not") {
73
+ const operand = disjunct.args[0];
74
+ if (operand.kind === "and")
75
+ return visit(exprs.enot(operand.args[0])) && visit(exprs.enot(operand.args[1]));
76
+ if (operand.kind === "not") return visit(operand.args[0]);
77
+ if (operand.kind === "true") return true;
78
+ }
79
+ if (disjunct.kind === "false") return true;
80
+ return visitLeaf(disjunct);
81
+ };
82
+ return visit(formula)
83
+ ? { directions, env, leaves, type }
84
+ : { directions, env, leaves: [], type: "" };
85
+ };
86
+
87
+ const getConjuncts = (exprs: Expressions, formula: Expr) => {
88
+ const conjuncts: Leaves[] = [];
89
+ const visit = (directions: Direction[], env: Bound[], conjunct: Expr) => {
90
+ const left: Direction[] = [...directions, "left"];
91
+ const right: Direction[] = [...directions, "right"];
92
+ const operand = conjunct.kind === "not" ? conjunct.args[0] : undefined;
93
+ if (conjunct.kind === "and") {
94
+ visit(left, env, conjunct.args[0]);
95
+ visit(right, env, conjunct.args[1]);
96
+ } else if (conjunct.kind === "all") {
97
+ const bound = { name: conjunct.args[0].symbol, type: conjunct.symbol };
98
+ visit(directions, [bound, ...env], conjunct.args[1]);
99
+ } else if (operand?.kind === "or") {
100
+ visit(left, env, exprs.enot(operand.args[0]));
101
+ visit(right, env, exprs.enot(operand.args[1]));
102
+ } else if (operand?.kind === "imply") {
103
+ visit(left, env, operand.args[0]);
104
+ visit(right, env, exprs.enot(operand.args[1]));
105
+ } else if (operand?.kind === "ex") {
106
+ const bound = { name: operand.args[0].symbol, type: operand.symbol };
107
+ visit(directions, [bound, ...env], exprs.enot(operand.args[1]));
108
+ } else if (operand?.kind === "not") {
109
+ visit(directions, env, operand.args[0]);
110
+ } else if (conjunct.kind === "equiv") {
111
+ visit(left, env, exprs.eimply(conjunct.args[0], conjunct.args[1]));
112
+ visit(right, env, exprs.eimply(conjunct.args[1], conjunct.args[0]));
113
+ } else if (operand?.kind === "equiv") {
114
+ visit(left, env, exprs.eor(operand.args[0], operand.args[1]));
115
+ visit(right, env, exprs.eor(exprs.enot(operand.args[0]), exprs.enot(operand.args[1])));
116
+ } else conjuncts.unshift(getLeaves(exprs, directions, env, conjunct));
117
+ };
118
+ visit([], [], formula);
119
+ return conjuncts;
120
+ };
121
+
122
+ const getPair = (leaf: Expr) => {
123
+ const atom = leaf.kind === "not" ? leaf.args[0] : leaf;
124
+ const args: Expr[] = atom.args;
125
+ return [args[0].symbol, args[1].symbol];
126
+ };
127
+
128
+ // The leaves as Zenon's partition returns them: positive and negative, each reversed.
129
+ const partition = (leaves: Expr[]) => ({
130
+ positive: leaves
131
+ .filter((leaf) => leaf.kind !== "not")
132
+ .reverse()
133
+ .map(getPair),
134
+ negative: leaves
135
+ .filter((leaf) => leaf.kind === "not")
136
+ .reverse()
137
+ .map(getPair),
138
+ });
139
+
140
+ // Each check returns the variables that the translation instantiates to prove the property, or
141
+ // undefined when the conjunct doesn't state it.
142
+ const getReflexive = (leaves: Expr[]) => {
143
+ if (leaves.length !== 1 || leaves[0].kind === "not") return undefined;
144
+ const pair = getPair(leaves[0]);
145
+ return pair[0] === pair[1] ? [pair[0]] : undefined;
146
+ };
147
+
148
+ const getSymmetric = (leaves: Expr[]) => {
149
+ const parts = partition(leaves);
150
+ if (parts.positive.length !== 1 || parts.negative.length !== 1) return undefined;
151
+ const positive = parts.positive[0];
152
+ const negative = parts.negative[0];
153
+ return positive[0] === negative[1] && positive[1] === negative[0] ? negative : undefined;
154
+ };
155
+
156
+ const getTriple = (leaves: Expr[]) => {
157
+ const parts = partition(leaves);
158
+ return parts.positive.length === 1 && parts.negative.length === 2
159
+ ? { result: parts.positive[0], first: parts.negative[0], second: parts.negative[1] }
160
+ : undefined;
161
+ };
162
+
163
+ const getTransitive = (leaves: Expr[]) => {
164
+ const triple = getTriple(leaves);
165
+ if (triple === undefined) return undefined;
166
+ const result = triple.result;
167
+ const first = triple.first;
168
+ const second = triple.second;
169
+ if (first[1] === second[0] && result[0] === first[0] && result[1] === second[1])
170
+ return [result[0], first[1], result[1]];
171
+ if (second[1] === first[0] && result[0] === second[0] && result[1] === first[1])
172
+ return [result[0], first[0], result[1]];
173
+ return undefined;
174
+ };
175
+
176
+ const getTransitiveSymmetric = (leaves: Expr[]) => {
177
+ const triple = getTriple(leaves);
178
+ if (triple === undefined) return undefined;
179
+ const result = triple.result;
180
+ const first = triple.first;
181
+ const second = triple.second;
182
+ if (first[1] === second[0] && result[1] === first[0] && result[0] === second[1])
183
+ return [result[1], first[1], result[0]];
184
+ if (second[1] === first[0] && result[1] === second[0] && result[0] === first[1])
185
+ return [result[1], first[0], result[0]];
186
+ return undefined;
187
+ };
188
+
189
+ const getSymbol = (leaves: Expr[]) => {
190
+ const atom = leaves[0].kind === "not" ? leaves[0].args[0] : leaves[0];
191
+ return atom.symbol;
192
+ };
193
+
194
+ export const createRelations = (exprs: Expressions) => {
195
+ const equalityOrigin = { formula: TRUE, directions: [], variables: [] };
196
+ const relations = new Map<string, RelationInfo>([
197
+ [
198
+ "=",
199
+ {
200
+ reflexive: equalityOrigin,
201
+ symmetric: equalityOrigin,
202
+ transitive: equalityOrigin,
203
+ transitiveSymmetric: equalityOrigin,
204
+ type: "",
205
+ },
206
+ ],
207
+ ]);
208
+
209
+ const getRecord = (symbol: string) => {
210
+ const existing = relations.get(symbol);
211
+ if (existing !== undefined) return existing;
212
+ const record: RelationInfo = {
213
+ reflexive: undefined,
214
+ symmetric: undefined,
215
+ transitive: undefined,
216
+ transitiveSymmetric: undefined,
217
+ type: "",
218
+ };
219
+ relations.set(symbol, record);
220
+ return record;
221
+ };
222
+
223
+ const analyse = (formula: Expr) => {
224
+ for (const conjunct of getConjuncts(exprs, formula)) {
225
+ const leaves = conjunct.leaves;
226
+ const env = conjunct.env;
227
+ const getOrigin = (names: string[] | undefined) =>
228
+ names === undefined
229
+ ? undefined
230
+ : {
231
+ formula,
232
+ directions: conjunct.directions,
233
+ variables: names.map(
234
+ (name) => env.length - 1 - env.findIndex((bound) => bound.name === name),
235
+ ),
236
+ };
237
+ const reflexive = getOrigin(getReflexive(leaves));
238
+ const symmetric = getOrigin(getSymmetric(leaves));
239
+ const transitive = getOrigin(getTransitive(leaves));
240
+ const transitiveSymmetric = getOrigin(getTransitiveSymmetric(leaves));
241
+ if (!reflexive && !symmetric && !transitive && !transitiveSymmetric) continue;
242
+ const record = getRecord(getSymbol(leaves));
243
+ if (reflexive) record.reflexive = reflexive;
244
+ if (symmetric) record.symmetric = symmetric;
245
+ if (transitive) record.transitive = transitive;
246
+ if (transitiveSymmetric) record.transitiveSymmetric = transitiveSymmetric;
247
+ record.type = conjunct.type;
248
+ }
249
+ };
250
+
251
+ const isSubsumed = (formula: Expr) =>
252
+ getConjuncts(exprs, formula).every((conjunct) => {
253
+ const leaves = conjunct.leaves;
254
+ if (getReflexive(leaves)) return getRecord(getSymbol(leaves)).reflexive !== undefined;
255
+ if (getSymmetric(leaves)) return getRecord(getSymbol(leaves)).symmetric !== undefined;
256
+ if (getTransitive(leaves)) return getRecord(getSymbol(leaves)).transitive !== undefined;
257
+ if (getTransitiveSymmetric(leaves)) {
258
+ const record = getRecord(getSymbol(leaves));
259
+ return record.symmetric !== undefined && record.transitive !== undefined;
260
+ }
261
+ return false;
262
+ });
263
+
264
+ const get = (symbol: string) => relations.get(symbol);
265
+
266
+ return {
267
+ analyse,
268
+ isSubsumed,
269
+ isReflexive: (symbol: string) => get(symbol)?.reflexive !== undefined,
270
+ isSymmetric: (symbol: string) => {
271
+ const record = get(symbol);
272
+ return (
273
+ record !== undefined &&
274
+ (record.symmetric !== undefined ||
275
+ (record.reflexive !== undefined && record.transitiveSymmetric !== undefined))
276
+ );
277
+ },
278
+ isTransitive: (symbol: string) => {
279
+ const record = get(symbol);
280
+ return (
281
+ record !== undefined &&
282
+ (record.transitive !== undefined ||
283
+ (record.reflexive !== undefined && record.transitiveSymmetric !== undefined))
284
+ );
285
+ },
286
+ isAny: (symbol: string) => {
287
+ const record = get(symbol);
288
+ return (
289
+ record !== undefined &&
290
+ (record.reflexive !== undefined ||
291
+ record.symmetric !== undefined ||
292
+ record.transitive !== undefined)
293
+ );
294
+ },
295
+ // Where the hypotheses state a relation's properties, for the translation to Isar.
296
+ get,
297
+ };
298
+ };
299
+
300
+ export type Relations = ReturnType<typeof createRelations>;