tla-ts 0.0.4-dev.4819fb7 → 0.0.4-dev.55f2117
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.
- package/README.md +37 -126
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +33 -1
- package/dist/index.d.ts +33 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +996 -0
- package/dist/prove.js +996 -0
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/ast.ts +2 -2
- package/src/check.ts +8 -7
- package/src/{cli-options.ts → cli/options.ts} +1 -1
- package/src/{run-cli.ts → cli/run.ts} +302 -100
- package/src/cli.ts +1 -1
- package/src/codegen.ts +26 -7
- package/src/config.ts +2 -2
- package/src/environment.ts +9 -9
- package/src/errors.ts +89 -30
- package/src/evaluate.ts +58 -23
- package/src/index.ts +10 -0
- package/src/levels.ts +1 -1
- package/src/live-check.ts +1 -1
- package/src/liveness.ts +1 -1
- package/src/{obligation-action.ts → obligations/action.ts} +247 -69
- package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
- package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
- package/src/{obligations.ts → obligations/index.ts} +32 -16
- package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
- package/src/{obligation-module.ts → obligations/module.ts} +113 -121
- package/src/obligations/pickle.ts +98 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/{obligation-source.ts → obligations/source.ts} +154 -99
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +4 -20
- package/src/parallel.ts +13 -46
- package/src/parser.ts +1 -1
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -2
- package/src/{pcal-parse.ts → pcal/parse.ts} +3 -3
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +2 -2
- package/src/{pcal-translate.ts → pcal/translate.ts} +2 -2
- package/src/{pcal-validate.ts → pcal/validate.ts} +6 -6
- package/src/prove/decide-pool.ts +95 -0
- package/src/prove/deciders.ts +33 -0
- package/src/prove/first-order.ts +78 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +446 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +546 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +433 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +331 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +330 -0
- package/src/prove/isabelle/pure/name.ts +98 -0
- package/src/prove/isabelle/pure/net.ts +215 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +631 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +133 -0
- package/src/prove/isabelle/pure/simplifier.ts +106 -0
- package/src/prove/isabelle/pure/table.ts +201 -0
- package/src/prove/isabelle/pure/tactic.ts +168 -0
- package/src/prove/isabelle/pure/tactical.ts +264 -0
- package/src/prove/isabelle/pure/term-ord.ts +105 -0
- package/src/prove/isabelle/pure/term.ts +688 -0
- package/src/prove/isabelle/pure/thm.ts +783 -0
- package/src/prove/isabelle/pure/type.ts +121 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +508 -0
- package/src/prove/prep/defs.ts +33 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +529 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +22 -0
- package/src/prove/prove.ts +498 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +255 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +209 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +636 -0
- package/src/prove/smt/encode.ts +164 -0
- package/src/prove/smt/extensionality.ts +65 -0
- package/src/prove/smt/flatten.ts +112 -0
- package/src/prove/smt/format.ts +154 -0
- package/src/prove/smt/instances.ts +181 -0
- package/src/prove/smt/rewrite.ts +772 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +91 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/cache.ts +236 -0
- package/src/prove/tlapm/ocaml-marshal.ts +166 -0
- package/src/prove/tlapm/tlapm.ts +96 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +18 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +379 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +162 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +1 -1
- package/src/resolve.ts +1 -1
- package/src/runtime.ts +2 -2
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +14 -14
- package/src/{sany-levels.ts → sany/levels.ts} +2 -2
- package/src/{sany-lexer.ts → sany/lexer.ts} +1 -1
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +15 -15
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -3
- package/src/{sany-source.ts → sany/source.ts} +6 -6
- package/src/{sany-xml.ts → sany/xml.ts} +5 -5
- package/src/spec-description.ts +1 -1
- package/src/{standard-levels.ts → standard/levels.ts} +1 -1
- package/src/{standard-modules.ts → standard/modules.ts} +17 -14
- package/src/{standard-ranges.ts → standard/ranges.ts} +1 -1
- package/src/state-graph.ts +1 -1
- package/src/successors.ts +25 -6
- package/src/symmetry.ts +1 -1
- package/src/{tlc-messages.ts → tlc/messages.ts} +2 -2
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +58 -35
- package/src/{tlc-replay.ts → tlc/replay.ts} +5 -5
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +14 -8
- package/src/{tlc-version.ts → tlc/version.ts} +8 -7
- package/src/values.ts +81 -36
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -55
- package/dist/run-cli.js +0 -55
- package/src/value-sources.ts +0 -29
- /package/src/{sany-nodes.ts → sany/nodes.ts} +0 -0
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
|
@@ -0,0 +1,447 @@
|
|
|
1
|
+
// Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
|
|
2
|
+
//
|
|
3
|
+
// Rewriting a subterm: unfolding a definition, evaluating a function application, IF, CASE or a
|
|
4
|
+
// formula used as a term, or replacing the subterm with an equal one from the branch.
|
|
5
|
+
|
|
6
|
+
import { TlaZenonError } from "../../../errors";
|
|
7
|
+
import {
|
|
8
|
+
FALSE,
|
|
9
|
+
isApp,
|
|
10
|
+
isRelation,
|
|
11
|
+
TRUE,
|
|
12
|
+
type BinderExpr,
|
|
13
|
+
type Expr,
|
|
14
|
+
type Expressions,
|
|
15
|
+
type VarExpr,
|
|
16
|
+
} from "../expr";
|
|
17
|
+
import type { Index } from "../index-table";
|
|
18
|
+
import type { Node } from "../node";
|
|
19
|
+
import { makeRule, type Rule } from "../proof";
|
|
20
|
+
import {
|
|
21
|
+
domain,
|
|
22
|
+
equal,
|
|
23
|
+
fapply,
|
|
24
|
+
getPairs,
|
|
25
|
+
isVariable,
|
|
26
|
+
makeNatural,
|
|
27
|
+
member,
|
|
28
|
+
type Item,
|
|
29
|
+
type TlaContext,
|
|
30
|
+
} from "./terms";
|
|
31
|
+
|
|
32
|
+
// OCaml's int_of_string, for the numerals that tlapm writes as variables.
|
|
33
|
+
const parseInteger = (text: string) =>
|
|
34
|
+
/^[-+]?(0[xX][0-9a-fA-F_]+|0[oO][0-7_]+|0[bB][01_]+|0[uU][0-9_]+|[0-9][0-9_]*)$/.test(text)
|
|
35
|
+
? Number(text.replace(/_/g, "").replace(/^([-+]?)0[uU]/, "$1"))
|
|
36
|
+
: undefined;
|
|
37
|
+
|
|
38
|
+
const getNaturalConstant = (expression: Expr): number | undefined => {
|
|
39
|
+
let accumulator = 0;
|
|
40
|
+
let current = expression;
|
|
41
|
+
while (isApp(current, "TLA.fapply", 2) && isVariable(current.args[0], "TLA.Succ")) {
|
|
42
|
+
accumulator++;
|
|
43
|
+
current = current.args[1];
|
|
44
|
+
}
|
|
45
|
+
if (current.kind !== "var") return undefined;
|
|
46
|
+
const value = parseInteger(current.symbol);
|
|
47
|
+
return value === undefined ? undefined : accumulator + value;
|
|
48
|
+
};
|
|
49
|
+
|
|
50
|
+
const isInOneTo = (term: Expr, maximum: number) => {
|
|
51
|
+
const value = getNaturalConstant(term);
|
|
52
|
+
return value !== undefined && value > 0 && value <= maximum;
|
|
53
|
+
};
|
|
54
|
+
|
|
55
|
+
const getCaseBranches = (
|
|
56
|
+
exprs: Expressions,
|
|
57
|
+
fill: (term: Expr) => Expr,
|
|
58
|
+
args: Expr[],
|
|
59
|
+
condition: Expr,
|
|
60
|
+
): Expr[][] => {
|
|
61
|
+
if (args.length === 0) return [[condition]];
|
|
62
|
+
if (args.length === 1) return [[condition, fill(args[0])]];
|
|
63
|
+
const rest = getCaseBranches(
|
|
64
|
+
exprs,
|
|
65
|
+
fill,
|
|
66
|
+
args.slice(2),
|
|
67
|
+
exprs.eand(exprs.enot(args[0]), condition),
|
|
68
|
+
);
|
|
69
|
+
return [[args[0], fill(args[1])], ...rest];
|
|
70
|
+
};
|
|
71
|
+
|
|
72
|
+
type MakeRewrite = (rule: Rule, added: Expr[], branches: Expr[][]) => Item[];
|
|
73
|
+
|
|
74
|
+
const SET_HEADS = [
|
|
75
|
+
"TLA.emptyset",
|
|
76
|
+
"TLA.upair",
|
|
77
|
+
"TLA.addElt",
|
|
78
|
+
"TLA.set",
|
|
79
|
+
"TLA.SUBSET",
|
|
80
|
+
"TLA.UNION",
|
|
81
|
+
"TLA.cup",
|
|
82
|
+
"TLA.cap",
|
|
83
|
+
"TLA.setminus",
|
|
84
|
+
"TLA.subsetOf",
|
|
85
|
+
"TLA.setOfAll",
|
|
86
|
+
"TLA.FuncSet",
|
|
87
|
+
"TLA.Product",
|
|
88
|
+
];
|
|
89
|
+
|
|
90
|
+
const getRewrites = (
|
|
91
|
+
context: TlaContext,
|
|
92
|
+
isInTerm: boolean,
|
|
93
|
+
hole: VarExpr,
|
|
94
|
+
frame: Expr,
|
|
95
|
+
term: Expr,
|
|
96
|
+
make: MakeRewrite,
|
|
97
|
+
): Item[] => {
|
|
98
|
+
const exprs = context.exprs;
|
|
99
|
+
const index = context.index;
|
|
100
|
+
const lambda = exprs.elam(hole, "", frame);
|
|
101
|
+
const fill = (inner: Expr) => exprs.substitute([[hole, inner]], frame);
|
|
102
|
+
const makeBoolCase = (getRule: (prefix: [Expr, Expr, Expr, Expr, Expr, Expr]) => Rule) => {
|
|
103
|
+
const isTrue = equal(exprs, term, TRUE);
|
|
104
|
+
const whenTrue = fill(TRUE);
|
|
105
|
+
const isFalse = equal(exprs, term, FALSE);
|
|
106
|
+
const whenFalse = fill(FALSE);
|
|
107
|
+
return make(
|
|
108
|
+
getRule([fill(term), isTrue, whenTrue, isFalse, whenFalse, lambda]),
|
|
109
|
+
[],
|
|
110
|
+
[
|
|
111
|
+
[isTrue, whenTrue],
|
|
112
|
+
[isFalse, whenFalse],
|
|
113
|
+
],
|
|
114
|
+
);
|
|
115
|
+
};
|
|
116
|
+
// Rewrites the term with the equalities on the branch whose other side has one of these heads.
|
|
117
|
+
const makeEqualityRewrites = (wrapped: Expr, heads: string[], subterm: Expr) => {
|
|
118
|
+
const hasGoodHead = (other: Expr) =>
|
|
119
|
+
(other.kind === "app" || other.kind === "var") &&
|
|
120
|
+
(heads.length === 0 || heads.includes(other.symbol));
|
|
121
|
+
const rights = index.findEqualRight(subterm).filter(hasGoodHead);
|
|
122
|
+
const lefts = index.findEqualLeft(subterm).filter(hasGoodHead);
|
|
123
|
+
const leftToRight = rights.flatMap((other) =>
|
|
124
|
+
make(
|
|
125
|
+
makeRule("congruence_lr", [wrapped, subterm, other]),
|
|
126
|
+
[equal(exprs, subterm, other)],
|
|
127
|
+
[[exprs.apply(wrapped, other)]],
|
|
128
|
+
),
|
|
129
|
+
);
|
|
130
|
+
const rightToLeft = lefts.flatMap((other) =>
|
|
131
|
+
make(
|
|
132
|
+
makeRule("congruence_rl", [wrapped, subterm, other]),
|
|
133
|
+
[equal(exprs, other, subterm)],
|
|
134
|
+
[[exprs.apply(wrapped, other)]],
|
|
135
|
+
),
|
|
136
|
+
);
|
|
137
|
+
return [...leftToRight, ...rightToLeft];
|
|
138
|
+
};
|
|
139
|
+
const makeHoleRewrites = (symbol: string, heads: string[], subterm: Expr, other?: Expr) => {
|
|
140
|
+
const inner = exprs.newVar();
|
|
141
|
+
const wrapped = exprs.elam(
|
|
142
|
+
inner,
|
|
143
|
+
"",
|
|
144
|
+
fill(exprs.eapp(symbol, other === undefined ? [inner] : [other, inner])),
|
|
145
|
+
);
|
|
146
|
+
return makeEqualityRewrites(wrapped, heads, subterm);
|
|
147
|
+
};
|
|
148
|
+
|
|
149
|
+
if (isInTerm && index.isMember(term)) {
|
|
150
|
+
const replaced = fill(TRUE);
|
|
151
|
+
return make(
|
|
152
|
+
makeRule("trueistrue", [fill(term), term, replaced, lambda, term]),
|
|
153
|
+
[term],
|
|
154
|
+
[[replaced]],
|
|
155
|
+
);
|
|
156
|
+
}
|
|
157
|
+
if (isApp(term, "$notequiv", 2)) return [];
|
|
158
|
+
if (isInTerm && (term.kind === "var" || term.kind === "app")) {
|
|
159
|
+
const definition = index.getDefinition(term.symbol);
|
|
160
|
+
if (definition !== undefined) {
|
|
161
|
+
if (term.kind === "var") {
|
|
162
|
+
if (definition.params.length !== 0) return [];
|
|
163
|
+
const unfolded = fill(definition.body);
|
|
164
|
+
return make(
|
|
165
|
+
{ name: "definition", definition, args: [fill(term), unfolded] },
|
|
166
|
+
[],
|
|
167
|
+
[[unfolded]],
|
|
168
|
+
);
|
|
169
|
+
}
|
|
170
|
+
if (definition.params.length !== term.args.length) return [];
|
|
171
|
+
const body = exprs.substituteSecondOrder(
|
|
172
|
+
definition.params.map((param, position) => [param, term.args[position]]),
|
|
173
|
+
definition.body,
|
|
174
|
+
);
|
|
175
|
+
if (body === undefined) throw new TlaZenonError("Zenon: higher-order definition");
|
|
176
|
+
const unfolded = fill(body);
|
|
177
|
+
return make(
|
|
178
|
+
{ name: "definition", definition, args: [fill(term), unfolded] },
|
|
179
|
+
[],
|
|
180
|
+
[[unfolded]],
|
|
181
|
+
);
|
|
182
|
+
}
|
|
183
|
+
}
|
|
184
|
+
if (isApp(term, "TLA.fapply", 2)) {
|
|
185
|
+
const fcn = term.args[0];
|
|
186
|
+
const argument = term.args[1];
|
|
187
|
+
if (isApp(fcn, "TLA.Fcn", 2) && fcn.args[1].kind === "lam") {
|
|
188
|
+
const body = fcn.args[1];
|
|
189
|
+
const outside = exprs.enot(member(exprs, argument, fcn.args[0]));
|
|
190
|
+
const applied = fill(exprs.substitute([[body.args[0], argument]], body.args[1]));
|
|
191
|
+
return make(
|
|
192
|
+
makeRule("fapplyfcn", [fill(term), outside, applied, lambda, fcn.args[0], body, argument]),
|
|
193
|
+
[],
|
|
194
|
+
[[outside], [applied]],
|
|
195
|
+
);
|
|
196
|
+
}
|
|
197
|
+
if (isApp(fcn, "TLA.except", 3)) {
|
|
198
|
+
const base = fcn.args[0];
|
|
199
|
+
const point = fcn.args[1];
|
|
200
|
+
const value = fcn.args[2];
|
|
201
|
+
const inDomain = member(exprs, argument, domain(exprs, base));
|
|
202
|
+
const isPoint = equal(exprs, point, argument);
|
|
203
|
+
const changed = fill(value);
|
|
204
|
+
const isOther = exprs.enot(equal(exprs, point, argument));
|
|
205
|
+
const unchanged = fill(fapply(exprs, base, argument));
|
|
206
|
+
const outside = exprs.enot(inDomain);
|
|
207
|
+
return make(
|
|
208
|
+
makeRule("fapplyexcept", [
|
|
209
|
+
fill(term),
|
|
210
|
+
inDomain,
|
|
211
|
+
isPoint,
|
|
212
|
+
changed,
|
|
213
|
+
inDomain,
|
|
214
|
+
isOther,
|
|
215
|
+
unchanged,
|
|
216
|
+
outside,
|
|
217
|
+
lambda,
|
|
218
|
+
base,
|
|
219
|
+
point,
|
|
220
|
+
value,
|
|
221
|
+
argument,
|
|
222
|
+
]),
|
|
223
|
+
[],
|
|
224
|
+
[[inDomain, isPoint, changed], [inDomain, isOther, unchanged], [outside]],
|
|
225
|
+
);
|
|
226
|
+
}
|
|
227
|
+
if (isApp(fcn, "TLA.tuple") && isInOneTo(argument, fcn.args.length)) {
|
|
228
|
+
const component = fcn.args[(getNaturalConstant(argument) ?? 0) - 1];
|
|
229
|
+
const replaced = fill(component);
|
|
230
|
+
return make(
|
|
231
|
+
makeRule("tuple_access", [fill(term), replaced, lambda, term, component]),
|
|
232
|
+
[],
|
|
233
|
+
[[replaced]],
|
|
234
|
+
);
|
|
235
|
+
}
|
|
236
|
+
if (isApp(fcn, "TLA.record")) {
|
|
237
|
+
const field = getPairs(fcn.args).find((pair) => pair[0] === argument);
|
|
238
|
+
if (field === undefined) return [];
|
|
239
|
+
const replaced = fill(field[1]);
|
|
240
|
+
return make(
|
|
241
|
+
makeRule("record_access", [fill(term), replaced, lambda, term, field[1]]),
|
|
242
|
+
[],
|
|
243
|
+
[[replaced]],
|
|
244
|
+
);
|
|
245
|
+
}
|
|
246
|
+
}
|
|
247
|
+
if (isApp(term, "TLA.DOMAIN", 1)) {
|
|
248
|
+
const fcn = term.args[0];
|
|
249
|
+
if (isApp(fcn, "TLA.Fcn", 2)) {
|
|
250
|
+
const replaced = fill(fcn.args[0]);
|
|
251
|
+
return make(
|
|
252
|
+
makeRule("domain_fcn", [fill(term), replaced, lambda, fcn.args[0], fcn.args[1]]),
|
|
253
|
+
[],
|
|
254
|
+
[[replaced]],
|
|
255
|
+
);
|
|
256
|
+
}
|
|
257
|
+
if (isApp(fcn, "TLA.except", 3)) {
|
|
258
|
+
const replaced = fill(domain(exprs, fcn.args[0]));
|
|
259
|
+
return make(
|
|
260
|
+
makeRule("domain_except", [
|
|
261
|
+
fill(term),
|
|
262
|
+
replaced,
|
|
263
|
+
lambda,
|
|
264
|
+
fcn.args[0],
|
|
265
|
+
fcn.args[1],
|
|
266
|
+
fcn.args[2],
|
|
267
|
+
]),
|
|
268
|
+
[],
|
|
269
|
+
[[replaced]],
|
|
270
|
+
);
|
|
271
|
+
}
|
|
272
|
+
if (isApp(fcn, "TLA.record")) {
|
|
273
|
+
const labels = exprs.eapp(
|
|
274
|
+
"TLA.set",
|
|
275
|
+
getPairs(fcn.args).map((pair) => pair[0]),
|
|
276
|
+
);
|
|
277
|
+
const replaced = fill(labels);
|
|
278
|
+
return make(
|
|
279
|
+
makeRule("record_domain", [fill(term), replaced, lambda, term, labels]),
|
|
280
|
+
[],
|
|
281
|
+
[[replaced]],
|
|
282
|
+
);
|
|
283
|
+
}
|
|
284
|
+
return makeHoleRewrites("TLA.DOMAIN", ["TLA.Fcn", "TLA.except", "TLA.record"], fcn);
|
|
285
|
+
}
|
|
286
|
+
if (isInTerm) {
|
|
287
|
+
if (term.kind === "not")
|
|
288
|
+
return makeBoolCase((prefix) => makeRule("boolcase_not", [...prefix, term.args[0]]));
|
|
289
|
+
if (term.kind === "and")
|
|
290
|
+
return makeBoolCase((prefix) => makeRule("boolcase_and", [...prefix, ...term.args]));
|
|
291
|
+
if (term.kind === "or")
|
|
292
|
+
return makeBoolCase((prefix) => makeRule("boolcase_or", [...prefix, ...term.args]));
|
|
293
|
+
if (term.kind === "imply")
|
|
294
|
+
return makeBoolCase((prefix) => makeRule("boolcase_imply", [...prefix, ...term.args]));
|
|
295
|
+
if (term.kind === "equiv")
|
|
296
|
+
return makeBoolCase((prefix) => makeRule("boolcase_equiv", [...prefix, ...term.args]));
|
|
297
|
+
if (isRelation(term) && term.symbol === "=")
|
|
298
|
+
return makeBoolCase((prefix) =>
|
|
299
|
+
makeRule("boolcase_equal", [...prefix, term.args[0], term.args[1]]),
|
|
300
|
+
);
|
|
301
|
+
if (term.kind === "all" || term.kind === "ex") {
|
|
302
|
+
const predicate = exprs.elam(term.args[0], term.symbol, term.args[1]);
|
|
303
|
+
return makeBoolCase((prefix) =>
|
|
304
|
+
makeRule(term.kind === "all" ? "boolcase_all" : "boolcase_ex", [...prefix, predicate]),
|
|
305
|
+
);
|
|
306
|
+
}
|
|
307
|
+
}
|
|
308
|
+
if (isApp(term, "TLA.cond", 3)) {
|
|
309
|
+
const condition = term.args[0];
|
|
310
|
+
const whenTrue = term.args[1];
|
|
311
|
+
const whenFalse = term.args[2];
|
|
312
|
+
if (condition.kind === "true") {
|
|
313
|
+
const replaced = fill(whenTrue);
|
|
314
|
+
return make(
|
|
315
|
+
makeRule("iftrue", [fill(term), replaced, lambda, whenTrue, whenFalse]),
|
|
316
|
+
[],
|
|
317
|
+
[[replaced]],
|
|
318
|
+
);
|
|
319
|
+
}
|
|
320
|
+
if (condition.kind === "false") {
|
|
321
|
+
const replaced = fill(whenFalse);
|
|
322
|
+
return make(
|
|
323
|
+
makeRule("iffalse", [fill(term), replaced, lambda, whenTrue, whenFalse]),
|
|
324
|
+
[],
|
|
325
|
+
[[replaced]],
|
|
326
|
+
);
|
|
327
|
+
}
|
|
328
|
+
const thenBranch = fill(whenTrue);
|
|
329
|
+
const negated = exprs.enot(condition);
|
|
330
|
+
const elseBranch = fill(whenFalse);
|
|
331
|
+
return make(
|
|
332
|
+
makeRule("ifthenelse", [
|
|
333
|
+
fill(term),
|
|
334
|
+
condition,
|
|
335
|
+
thenBranch,
|
|
336
|
+
negated,
|
|
337
|
+
elseBranch,
|
|
338
|
+
lambda,
|
|
339
|
+
condition,
|
|
340
|
+
whenTrue,
|
|
341
|
+
whenFalse,
|
|
342
|
+
]),
|
|
343
|
+
[],
|
|
344
|
+
[
|
|
345
|
+
[condition, thenBranch],
|
|
346
|
+
[negated, elseBranch],
|
|
347
|
+
],
|
|
348
|
+
);
|
|
349
|
+
}
|
|
350
|
+
if (isApp(term, "TLA.CASE")) {
|
|
351
|
+
const branches = getCaseBranches(exprs, fill, term.args, TRUE);
|
|
352
|
+
const filled = fill(term);
|
|
353
|
+
return make(makeRule("case", [filled, lambda, ...branches.flat()]), [filled], branches);
|
|
354
|
+
}
|
|
355
|
+
if (term.kind === "tau" && !hasExistential(exprs, index, term)) {
|
|
356
|
+
const exists = exprs.eex(term.args[0], term.symbol, term.args[1]);
|
|
357
|
+
return make(makeRule("cut", [exists]), [], [[exists], [exprs.enot(exists)]]);
|
|
358
|
+
}
|
|
359
|
+
if (isApp(term, "TLA.Len", 1)) {
|
|
360
|
+
const sequence = term.args[0];
|
|
361
|
+
if (isApp(sequence, "TLA.tuple")) {
|
|
362
|
+
const length = makeNatural(exprs, sequence.args.length);
|
|
363
|
+
const replaced = fill(length);
|
|
364
|
+
return make(
|
|
365
|
+
makeRule("tuple_len", [fill(term), replaced, lambda, term, length]),
|
|
366
|
+
[],
|
|
367
|
+
[[replaced]],
|
|
368
|
+
);
|
|
369
|
+
}
|
|
370
|
+
return makeHoleRewrites("TLA.Len", ["TLA.tuple"], sequence);
|
|
371
|
+
}
|
|
372
|
+
if (isApp(term, "TLA.isASeq", 1))
|
|
373
|
+
return makeHoleRewrites("TLA.isASeq", ["TLA.tuple"], term.args[0]);
|
|
374
|
+
if (isApp(term, "TLA.in", 2)) {
|
|
375
|
+
const set = term.args[1];
|
|
376
|
+
return makeHoleRewrites("TLA.in", set.kind === "var" ? [] : SET_HEADS, set, term.args[0]);
|
|
377
|
+
}
|
|
378
|
+
if (isApp(term, "TLA.isAFcn", 1))
|
|
379
|
+
return makeHoleRewrites(
|
|
380
|
+
"TLA.isAFcn",
|
|
381
|
+
["TLA.Fcn", "TLA.except", "TLA.oneArg", "TLA.extend", "TLA.record"],
|
|
382
|
+
term.args[0],
|
|
383
|
+
);
|
|
384
|
+
return [];
|
|
385
|
+
};
|
|
386
|
+
|
|
387
|
+
const hasExistential = (exprs: Expressions, index: Index, choice: BinderExpr) => {
|
|
388
|
+
const body = choice.args[1];
|
|
389
|
+
if (body.kind === "not")
|
|
390
|
+
return (
|
|
391
|
+
index.isMember(exprs.eex(choice.args[0], choice.symbol, body)) ||
|
|
392
|
+
index.isMember(exprs.enot(exprs.eall(choice.args[0], choice.symbol, body.args[0])))
|
|
393
|
+
);
|
|
394
|
+
return index.isMember(exprs.eex(choice.args[0], choice.symbol, body));
|
|
395
|
+
};
|
|
396
|
+
|
|
397
|
+
// Zenon's find_rewrites: the rewrites of the outermost subterm that has some, looking through
|
|
398
|
+
// applications and negations.
|
|
399
|
+
const findRewrites = (
|
|
400
|
+
context: TlaContext,
|
|
401
|
+
isInTerm: boolean,
|
|
402
|
+
hole: VarExpr,
|
|
403
|
+
frame: Expr,
|
|
404
|
+
term: Expr,
|
|
405
|
+
make: MakeRewrite,
|
|
406
|
+
): Item[] => {
|
|
407
|
+
const exprs = context.exprs;
|
|
408
|
+
const local = getRewrites(context, isInTerm, hole, frame, term, make);
|
|
409
|
+
if (local.length > 0) return local;
|
|
410
|
+
if (isApp(term, "$notequiv", 2)) return [];
|
|
411
|
+
if (term.kind === "app") {
|
|
412
|
+
for (let position = 0; position < term.args.length; position++) {
|
|
413
|
+
const args = [...term.args];
|
|
414
|
+
args[position] = hole;
|
|
415
|
+
const inner = exprs.substitute([[hole, exprs.eapp(term.symbol, args)]], frame);
|
|
416
|
+
const found = findRewrites(context, true, hole, inner, term.args[position], make);
|
|
417
|
+
if (found.length > 0) return found;
|
|
418
|
+
}
|
|
419
|
+
return [];
|
|
420
|
+
}
|
|
421
|
+
if (term.kind === "not")
|
|
422
|
+
return findRewrites(
|
|
423
|
+
context,
|
|
424
|
+
false,
|
|
425
|
+
hole,
|
|
426
|
+
exprs.substitute([[hole, exprs.enot(hole)]], frame),
|
|
427
|
+
term.args[0],
|
|
428
|
+
make,
|
|
429
|
+
);
|
|
430
|
+
return [];
|
|
431
|
+
};
|
|
432
|
+
|
|
433
|
+
export const getRewriteNodes = (context: TlaContext, formula: Expr, goalness: number): Item[] => {
|
|
434
|
+
const exprs = context.exprs;
|
|
435
|
+
const make: MakeRewrite = (rule, added, branches) => {
|
|
436
|
+
const node: Node = {
|
|
437
|
+
conclusions: rule.name === "cut" ? added : [formula, ...added],
|
|
438
|
+
rule,
|
|
439
|
+
priority: "arity",
|
|
440
|
+
goalness,
|
|
441
|
+
branches,
|
|
442
|
+
};
|
|
443
|
+
return rule.name === "ifthenelse" ? [node, "stop"] : [node];
|
|
444
|
+
};
|
|
445
|
+
const hole = exprs.newVar();
|
|
446
|
+
return findRewrites(context, false, hole, hole, formula, make);
|
|
447
|
+
};
|