tla-ts 0.0.4-dev.702eb98 → 0.0.4-dev.7714e32
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 +32 -6
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +27 -27
- package/dist/deciders.js +34 -34
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +12 -14
- package/dist/index.d.ts +12 -14
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +516 -25
- package/dist/prove.js +518 -27
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +76 -86
- package/dist/transfer.js +73 -83
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +1 -1
- package/src/ast.ts +2 -2
- package/src/bags.ts +22 -23
- package/src/builtins.ts +16 -8
- package/src/check.ts +131 -1154
- package/src/{cli-options.ts → cli/options.ts} +54 -9
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/{run-cli.ts → cli/tlc.ts} +112 -761
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +1 -1
- package/src/codegen.ts +17 -15
- package/src/config.ts +5 -5
- package/src/dependencies.ts +4 -6
- package/src/environment.ts +55 -60
- package/src/errors.ts +12 -36
- package/src/evaluate.ts +81 -101
- package/src/exit-codes.ts +1 -1
- package/src/fingerprints.ts +3 -3
- package/src/index.ts +2 -2
- package/src/instances.ts +56 -46
- package/src/java-overrides.ts +79 -41
- package/src/json.ts +31 -36
- package/src/levels.ts +10 -13
- package/src/{live-check.ts → liveness-checker.ts} +169 -142
- package/src/liveness.ts +38 -34
- package/src/obligations/action.ts +58 -105
- package/src/obligations/{anon.ts → anonymize.ts} +44 -52
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +42 -530
- package/src/obligations/format.ts +7 -8
- package/src/obligations/generate.ts +93 -783
- package/src/obligations/index.ts +23 -23
- package/src/obligations/levels.ts +38 -44
- package/src/obligations/module.ts +106 -729
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +35 -29
- package/src/obligations/printer.ts +98 -209
- package/src/obligations/proof.ts +0 -1
- package/src/obligations/regroup.ts +100 -0
- package/src/obligations/simplify.ts +668 -0
- package/src/obligations/source.ts +92 -192
- package/src/obligations/{deref.ts → subexpression.ts} +82 -113
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +32 -30
- package/src/obligations/tuples.ts +37 -53
- package/src/parallel-worker.ts +37 -33
- package/src/parallel.ts +30 -24
- package/src/parser.ts +67 -74
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
- package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
- package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
- package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
- package/src/{prove → prover}/decide-pool.ts +14 -19
- package/src/{prove → prover}/deciders.ts +7 -1
- package/src/{obligations/pickle.ts → prover/first-order.ts} +79 -4
- package/src/{prove → prover}/isabelle/decide.ts +3 -6
- package/src/{prove → prover}/isabelle/encode.ts +106 -138
- package/src/{prove → prover}/isabelle/isar/inner-syntax.ts +1 -1
- package/src/{prove → prover}/isabelle/isar/method.ts +3 -3
- package/src/{prove → prover}/isabelle/isar/type-check.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/blast/blast.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/blast/branch.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/blast/term.ts +3 -4
- package/src/{prove → prover}/isabelle/provers/clasimp.ts +1 -1
- package/src/{prove → prover}/isabelle/provers/classical.ts +3 -3
- package/src/{prove → prover}/isabelle/provers/hypsubst.ts +1 -9
- package/src/{prove → prover}/isabelle/pure/conv.ts +1 -1
- package/src/{prove → prover}/isabelle/pure/drule.ts +2 -2
- package/src/{prove → prover}/isabelle/pure/envir.ts +3 -35
- package/src/{prove → prover}/isabelle/pure/logic.ts +4 -76
- package/src/{prove → prover}/isabelle/pure/name.ts +1 -13
- package/src/{prove → prover}/isabelle/pure/net.ts +2 -49
- package/src/{prove → prover}/isabelle/pure/pattern.ts +3 -22
- package/src/{prove → prover}/isabelle/pure/raw-simplifier.ts +3 -18
- package/src/{prove → prover}/isabelle/pure/seq.ts +0 -23
- package/src/{prove → prover}/isabelle/pure/simplifier.ts +2 -8
- package/src/{prove → prover}/isabelle/pure/table.ts +1 -8
- package/src/{prove → prover}/isabelle/pure/tactic.ts +5 -113
- package/src/{prove → prover}/isabelle/pure/tactical.ts +1 -84
- package/src/{prove → prover}/isabelle/pure/term-ord.ts +1 -55
- package/src/{prove → prover}/isabelle/pure/term.ts +8 -128
- package/src/{prove → prover}/isabelle/pure/thm.ts +4 -27
- package/src/{prove → prover}/isabelle/pure/type.ts +0 -12
- package/src/{prove → prover}/isabelle/pure/unify.ts +1 -1
- package/src/{prove → prover}/isabelle/tla/classical-setup.ts +1 -1
- package/src/{prove → prover}/ocaml.ts +1 -1
- package/src/{prove → prover}/prep/action.ts +54 -66
- package/src/{prove → prover}/prep/enabled-axioms.ts +2 -2
- package/src/{prove → prover}/prep/fingerprint.ts +3 -3
- package/src/{prove → prover}/prep/level-comparison.ts +15 -38
- package/src/{prove → prover}/prep/md5.ts +2 -9
- package/src/{prove/prep/pragma.ts → prover/prep/methods.ts} +4 -4
- package/src/prover/prep/normalize.ts +309 -0
- package/src/{prove → prover}/prove-worker.ts +4 -11
- package/src/prover/prove.ts +492 -0
- package/src/{prove → prover}/ptl/encode.ts +19 -31
- package/src/{prove → prover}/smt/axioms.ts +78 -79
- package/src/{prove → prover}/smt/data.ts +16 -45
- package/src/{prove → prover}/smt/encode.ts +134 -28
- package/src/{prove → prover}/smt/extensionality.ts +14 -12
- package/src/{prove → prover}/smt/flatten.ts +3 -18
- package/src/{prove → prover}/smt/format.ts +14 -3
- package/src/{prove → prover}/smt/instances.ts +4 -5
- package/src/{prove → prover}/smt/rewrite.ts +41 -59
- package/src/{prove → prover}/smt/solver/ast-util.ts +0 -56
- package/src/{prove → prover}/smt/solver/case-split-queue.ts +1 -1
- package/src/{prove → prover}/smt/solver/enode.ts +1 -1
- package/src/{prove → prover}/smt/solver/lp/dep-intervals.ts +0 -14
- package/src/{prove → prover}/smt/solver/model-macro-solver.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/algebraic.ts +3 -3
- package/src/{prove → prover}/smt/solver/nlsat/atoms.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/explain.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/interval-set.ts +1 -1
- package/src/{prove → prover}/smt/solver/nlsat/levelwise.ts +4 -7
- package/src/{prove → prover}/smt/solver/nlsat/polynomial.ts +4 -4
- package/src/{prove → prover}/smt/solver/nlsat/upolynomial.ts +2 -2
- package/src/{prove → prover}/smt/solver/pattern-inference.ts +1 -1
- package/src/{prove → prover}/smt/solver/relevancy.ts +2 -2
- package/src/{prove → prover}/smt/solver/rewriter.ts +1 -1
- package/src/{prove → prover}/smt/solver/solver.ts +2 -2
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/{prove → prover}/tlapm/tlapm.ts +1 -2
- package/src/prover/verdict.ts +13 -0
- package/src/{prove → prover}/zenon/decide.ts +5 -11
- package/src/{prove → prover}/zenon/encode.ts +40 -106
- package/src/{prove → prover}/zenon/eqrel.ts +1 -1
- package/src/{prove → prover}/zenon/equality-rules.ts +1 -1
- package/src/{prove → prover}/zenon/expr.ts +2 -2
- package/src/{prove → prover}/zenon/index-table.ts +1 -1
- package/src/{prove → prover}/zenon/isar.ts +1 -1
- package/src/{prove → prover}/zenon/llproof.ts +1 -1
- package/src/{prove → prover}/zenon/mltoll.ts +1 -1
- package/src/{prove → prover}/zenon/node.ts +1 -1
- package/src/{prove → prover}/zenon/search.ts +1 -1
- package/src/{prove → prover}/zenon/tla/terms.ts +1 -20
- package/src/{prove → prover}/zenon/tla/tla.ts +1 -1
- package/src/randomization.ts +19 -24
- package/src/resolve.ts +15 -22
- package/src/runtime.ts +8 -8
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +38 -55
- package/src/{sany-levels.ts → sany/levels.ts} +45 -48
- package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +16 -17
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
- package/src/{sany-source.ts → sany/source.ts} +6 -7
- package/src/{sany-xml.ts → sany/xml.ts} +5 -6
- package/src/search.ts +969 -0
- package/src/spec-description.ts +26 -20
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +16 -20
- package/src/state-graph.ts +9 -8
- package/src/substitution-levels.ts +2 -2
- package/src/successors.ts +16 -19
- package/src/symmetry.ts +1 -1
- package/src/tableau.ts +6 -7
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +3 -213
- package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
- package/src/transfer.ts +32 -32
- package/src/values.ts +72 -67
- package/src/worker.ts +1 -4
- package/dist/run-cli.cjs +0 -38
- package/dist/run-cli.js +0 -38
- package/src/canonical.ts +0 -40
- package/src/obligations/ctx.ts +0 -64
- package/src/prove/prep/defs.ts +0 -27
- package/src/prove/prep/elab.ts +0 -156
- package/src/prove/prep/enabled.ts +0 -43
- package/src/prove/prep/flatten.ts +0 -70
- package/src/prove/prep/trivial.ts +0 -22
- package/src/prove/prove.ts +0 -417
- package/src/prove/smt/axiomatize.ts +0 -69
- package/src/prove/smt/simplify.ts +0 -57
- package/src/prove/verdict.ts +0 -13
- package/src/standard-ranges.ts +0 -116
- package/src/value-sources.ts +0 -29
- /package/src/{prove → prover}/isabelle/LICENSE +0 -0
- /package/src/{prove → prover}/isabelle/LICENSE-tlapm +0 -0
- /package/src/{prove → prover}/isabelle/isar/proof.ts +0 -0
- /package/src/{prove → prover}/isabelle/isar/statement.ts +0 -0
- /package/src/{prove → prover}/isabelle/isar/theory.ts +0 -0
- /package/src/{prove → prover}/isabelle/provers/blast/prove.ts +0 -0
- /package/src/{prove → prover}/isabelle/provers/blast/rules.ts +0 -0
- /package/src/{prove → prover}/isabelle/provers/blast/state.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/bicompose.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/consts.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/goal.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/interrupt.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/list.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/object-logic.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/rewriter.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/search.ts +0 -0
- /package/src/{prove → prover}/isabelle/pure/variable.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/context.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/logic-data.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/logic.ts +0 -0
- /package/src/{prove → prover}/isabelle/tla/simpdata.ts +0 -0
- /package/src/{prove → prover}/isabelle/tools/intuitionistic.ts +0 -0
- /package/src/{prove → prover}/ptl/decide.ts +0 -0
- /package/src/{prove → prover}/ptl/sat.ts +0 -0
- /package/src/{prove → prover}/ptl/tableau.ts +0 -0
- /package/src/{prove → prover}/smt/context.ts +0 -0
- /package/src/{prove → prover}/smt/solver/act-cache.ts +0 -0
- /package/src/{prove → prover}/smt/solver/arith-rewriter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/array.ts +0 -0
- /package/src/{prove → prover}/smt/solver/asserted-formulas.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ast-lt.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ast.ts +0 -0
- /package/src/{prove → prover}/smt/solver/auf-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/cg-table.ts +0 -0
- /package/src/{prove → prover}/smt/solver/clause.ts +0 -0
- /package/src/{prove → prover}/smt/solver/conflict-resolution.ts +0 -0
- /package/src/{prove → prover}/smt/solver/context.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ctx-simplify.ts +0 -0
- /package/src/{prove → prover}/smt/solver/der.ts +0 -0
- /package/src/{prove → prover}/smt/solver/dyn-ack.ts +0 -0
- /package/src/{prove → prover}/smt/solver/e-matching.ts +0 -0
- /package/src/{prove → prover}/smt/solver/expr-ref.ts +0 -0
- /package/src/{prove → prover}/smt/solver/expr-safe-replace.ts +0 -0
- /package/src/{prove → prover}/smt/solver/fingerprints.ts +0 -0
- /package/src/{prove → prover}/smt/solver/flat-literals.ts +0 -0
- /package/src/{prove → prover}/smt/solver/goal.ts +0 -0
- /package/src/{prove → prover}/smt/solver/hash.ts +0 -0
- /package/src/{prove → prover}/smt/solver/hashtable.ts +0 -0
- /package/src/{prove → prover}/smt/solver/internalizer.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lbool.ts +0 -0
- /package/src/{prove → prover}/smt/solver/literal.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/bound-propagator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/constraints.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/containers.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/core-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/cross-nested.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/dependency.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/dioph-eq.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/explanation.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/gomory.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/hnf-cutter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/hnf.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/int-cube.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/int-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/lar-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/lar-term.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/lp-settings.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/maximize-term.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nex-creator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nex.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-backoff.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-basics.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-core.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-divisions.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-emonics.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-factorization.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-grobner.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-horner.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-intervals.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-monomial-bounds.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-monotone.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-order.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-patcher.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-tangents.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-throttle.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-types.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nla-var-eqs.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/nra-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/numeric-pair.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd-interval.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd-simplifier.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd-solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/pdd.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/random-updater.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/static-matrix.ts +0 -0
- /package/src/{prove → prover}/smt/solver/lp/union-find.ts +0 -0
- /package/src/{prove → prover}/smt/solver/mam-compiler.ts +0 -0
- /package/src/{prove → prover}/smt/solver/mam-interpreter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/maximize-ac-sharing.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-checker.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-evaluator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-finder.ts +0 -0
- /package/src/{prove → prover}/smt/solver/model-generator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/evaluator.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/mpbq.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/solver.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/types.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nlsat/upolynomial-factorization.ts +0 -0
- /package/src/{prove → prover}/smt/solver/nnf.ts +0 -0
- /package/src/{prove → prover}/smt/solver/poly-rewriter.ts +0 -0
- /package/src/{prove → prover}/smt/solver/propagate-values.ts +0 -0
- /package/src/{prove → prover}/smt/solver/proto-model.ts +0 -0
- /package/src/{prove → prover}/smt/solver/pull-quant.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qe-lite-der.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qe-lite-fm.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qe-lite.ts +0 -0
- /package/src/{prove → prover}/smt/solver/qi-queue.ts +0 -0
- /package/src/{prove → prover}/smt/solver/quant-tactics.ts +0 -0
- /package/src/{prove → prover}/smt/solver/quantifier-analyzer.ts +0 -0
- /package/src/{prove → prover}/smt/solver/quantifier-manager.ts +0 -0
- /package/src/{prove → prover}/smt/solver/random-gen.ts +0 -0
- /package/src/{prove → prover}/smt/solver/rational.ts +0 -0
- /package/src/{prove → prover}/smt/solver/ref-vector.ts +0 -0
- /package/src/{prove → prover}/smt/solver/rewriter-tpl.ts +0 -0
- /package/src/{prove → prover}/smt/solver/rlimit.ts +0 -0
- /package/src/{prove → prover}/smt/solver/smtlib-parser.ts +0 -0
- /package/src/{prove → prover}/smt/solver/sort.ts +0 -0
- /package/src/{prove → prover}/smt/solver/sticky-generations.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-axioms.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-bounds.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-final-check.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-internalize.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-model.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-propagate.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra-state.ts +0 -0
- /package/src/{prove → prover}/smt/solver/theory-lra.ts +0 -0
- /package/src/{prove → prover}/smt/solver/var-subst.ts +0 -0
- /package/src/{prove → prover}/smt/solver/z3-license.txt +0 -0
- /package/src/{prove → prover}/smt/table.ts +0 -0
- /package/src/{prove → prover}/tlaps-module.ts +0 -0
- /package/src/{prove → prover}/zenon/LICENSE +0 -0
- /package/src/{prove → prover}/zenon/check/check.ts +0 -0
- /package/src/{prove → prover}/zenon/check/definitions.ts +0 -0
- /package/src/{prove → prover}/zenon/check/equality.ts +0 -0
- /package/src/{prove → prover}/zenon/check/functions.ts +0 -0
- /package/src/{prove → prover}/zenon/check/keys.ts +0 -0
- /package/src/{prove → prover}/zenon/check/propositional.ts +0 -0
- /package/src/{prove → prover}/zenon/check/records.ts +0 -0
- /package/src/{prove → prover}/zenon/check/relations.ts +0 -0
- /package/src/{prove → prover}/zenon/check/rewrites.ts +0 -0
- /package/src/{prove → prover}/zenon/check/sets.ts +0 -0
- /package/src/{prove → prover}/zenon/check/terms.ts +0 -0
- /package/src/{prove → prover}/zenon/check/tla.ts +0 -0
- /package/src/{prove → prover}/zenon/isar-case.ts +0 -0
- /package/src/{prove → prover}/zenon/limits.ts +0 -0
- /package/src/{prove → prover}/zenon/ocaml.ts +0 -0
- /package/src/{prove → prover}/zenon/parse.ts +0 -0
- /package/src/{prove → prover}/zenon/phrase.ts +0 -0
- /package/src/{prove → prover}/zenon/proof.ts +0 -0
- /package/src/{prove → prover}/zenon/propositional-rules.ts +0 -0
- /package/src/{prove → prover}/zenon/rules.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/functions.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/llproof.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/records.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/rewrites.ts +0 -0
- /package/src/{prove → prover}/zenon/tla/sets.ts +0 -0
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
- /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
|
@@ -2,15 +2,9 @@
|
|
|
2
2
|
// An obligation as the Isabelle/TLA+ theory tlapm writes for Isabelle to prove with a tactic.
|
|
3
3
|
|
|
4
4
|
import { TlapmBugError, TlaProverError, TlaUnsupportedError } from "../../errors";
|
|
5
|
-
import { createContext, getBoundName, popNames, pushName } from "../../obligations/
|
|
6
|
-
import {
|
|
7
|
-
|
|
8
|
-
type Bound,
|
|
9
|
-
type Builtin,
|
|
10
|
-
type Expr,
|
|
11
|
-
type Sequent,
|
|
12
|
-
} from "../../obligations/expression";
|
|
13
|
-
import { pickle } from "../../obligations/pickle";
|
|
5
|
+
import { createContext, getBoundName, popNames, pushName } from "../../obligations/printer";
|
|
6
|
+
import type { Bound, Builtin, Expr, Sequent } from "../../obligations/expression";
|
|
7
|
+
import { getUnprintableError, pickle, printFact, splitFirstBound } from "../first-order";
|
|
14
8
|
|
|
15
9
|
const cook = (name: string) => `is${pickle(name)}`;
|
|
16
10
|
|
|
@@ -85,17 +79,6 @@ const NONFIX: Partial<Record<Builtin, [string, number]>> = {
|
|
|
85
79
|
ToString: ["ToString", 1],
|
|
86
80
|
};
|
|
87
81
|
|
|
88
|
-
// The temporal operators Isabelle/TLA+ has no counterpart for, by the name tlapm reports.
|
|
89
|
-
const TEMPORAL: Partial<Record<Builtin, [string, number]>> = {
|
|
90
|
-
Leadsto: ["Leadsto", 2],
|
|
91
|
-
ENABLED: ["ENABLED", 1],
|
|
92
|
-
Cdot: ["\\cdot", 2],
|
|
93
|
-
Actplus: ["-+->", 2],
|
|
94
|
-
BoxTrue: ["[]", 1],
|
|
95
|
-
BoxFalse: ["[]", 1],
|
|
96
|
-
Diamond: ["<>", 1],
|
|
97
|
-
};
|
|
98
|
-
|
|
99
82
|
// thy_header's tdoms_table: the operators the theory declares, with their arities.
|
|
100
83
|
const DECLARED: [string, number][] = [
|
|
101
84
|
["Real", 0],
|
|
@@ -111,41 +94,36 @@ const DECLARED: [string, number][] = [
|
|
|
111
94
|
const HEADER = [
|
|
112
95
|
"consts",
|
|
113
96
|
...DECLARED.map(
|
|
114
|
-
(
|
|
115
|
-
` "${cook(
|
|
97
|
+
(declared) =>
|
|
98
|
+
` "${cook(declared[0])}" :: ${declared[1] === 0 ? "c" : `"[${Array(declared[1]).fill("c").join(",")}] => c"`}`,
|
|
116
99
|
),
|
|
117
100
|
"",
|
|
118
101
|
].join("\n");
|
|
119
102
|
|
|
120
|
-
// tlapm raises Unsupported for what Isabelle/TLA+ can't express, which omits a fact and fails the
|
|
121
|
-
// obligation anywhere else.
|
|
122
|
-
const unsupported = (message: string): never => {
|
|
123
|
-
throw new TlaUnsupportedError(message);
|
|
124
|
-
};
|
|
125
|
-
|
|
126
103
|
const getSuccessors = (integer: string) => {
|
|
127
104
|
const count = Number.parseInt(integer, 10);
|
|
128
105
|
return `${"succ[".repeat(count)}0${"]".repeat(count)}`;
|
|
129
106
|
};
|
|
130
107
|
|
|
131
|
-
//
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
108
|
+
// thy_header.
|
|
109
|
+
const getTheoryHeader = (name: string, isVerbose: boolean) => [
|
|
110
|
+
"(* automatically generated -- do not edit manually *)",
|
|
111
|
+
`theory ${name} imports Constant Zenon begin`,
|
|
112
|
+
...(isVerbose ? ['ML_command \\<open> writeln ("*** TLAPS PARSED\\n"); \\<close>'] : []),
|
|
113
|
+
HEADER,
|
|
114
|
+
];
|
|
115
|
+
|
|
116
|
+
// pp_print_expr on an obligation after Backend.Prep has shipped it.
|
|
117
|
+
const printLemma = (sequent: Sequent) => {
|
|
139
118
|
const context = createContext();
|
|
140
119
|
const adjoin = (name: string) => pushName(context, pickle(name));
|
|
141
120
|
const bump = () => pushName(context, "");
|
|
142
|
-
const state = { isAssumed: false };
|
|
143
121
|
|
|
144
122
|
// A binder's name binds in what prints inside it.
|
|
145
123
|
const withBound = (name: string, print: (bound: string) => string) => {
|
|
146
|
-
const
|
|
124
|
+
const printed = print(adjoin(name));
|
|
147
125
|
popNames(context, 1);
|
|
148
|
-
return
|
|
126
|
+
return printed;
|
|
149
127
|
};
|
|
150
128
|
|
|
151
129
|
// pp_print_expr: every expression, apart from the obligation's sequent, prints in parentheses.
|
|
@@ -165,13 +143,8 @@ export const encodeIsabelle = (
|
|
|
165
143
|
if (operator && operator[1] === args.length) return nonfix(operator[0], args);
|
|
166
144
|
if (builtin === "Unprimable" && args.length === 1) return printExpr(args[0]);
|
|
167
145
|
// tlapm prints an irregular expression as the hash of its TLA+ text, but never makes one.
|
|
168
|
-
if (builtin === "Irregular" && args.length === 1)
|
|
169
|
-
|
|
170
|
-
if (isFrontend && args.length === 1) throw new TlapmBugError();
|
|
171
|
-
const temporal = TEMPORAL[builtin];
|
|
172
|
-
if (temporal && temporal[1] === args.length)
|
|
173
|
-
throw new TlaProverError(`Unsupported operator \`${temporal[0]}\`.\n`);
|
|
174
|
-
throw new TlaProverError("Backend.Isabelle.pp_apply");
|
|
146
|
+
if (builtin === "Irregular" && args.length === 1) throw new TlaUnsupportedError("Irregular");
|
|
147
|
+
throw getUnprintableError(builtin, args.length, "Backend.Isabelle.pp_apply");
|
|
175
148
|
};
|
|
176
149
|
|
|
177
150
|
const printApply = (operator: Expr, args: Expr[]): string => {
|
|
@@ -190,56 +163,35 @@ export const encodeIsabelle = (
|
|
|
190
163
|
// tlapm prints a lambda without the arguments it's applied to.
|
|
191
164
|
case "Lambda": {
|
|
192
165
|
const names = operator.params.map((param) => `${adjoin(param.name)} `).join("");
|
|
193
|
-
const
|
|
166
|
+
const printed = `\\<lambda> ${names}. ${printExpr(operator.body)}`;
|
|
194
167
|
popNames(context, operator.params.length);
|
|
195
|
-
return
|
|
168
|
+
return printed;
|
|
196
169
|
}
|
|
197
170
|
default:
|
|
198
171
|
throw new TlapmBugError();
|
|
199
172
|
}
|
|
200
173
|
};
|
|
201
174
|
|
|
202
|
-
// The first bound binds around a quantifier over the others, which move under it.
|
|
203
175
|
const printQuant = (quantifier: "Forall" | "Exists", bounds: Bound[], body: Expr): string => {
|
|
204
|
-
|
|
205
|
-
|
|
206
|
-
const undittoed =
|
|
207
|
-
rest[0]?.domain.kind === "Ditto"
|
|
208
|
-
? [{ ...rest[0], domain: bound.domain }, ...rest.slice(1)]
|
|
209
|
-
: rest;
|
|
210
|
-
const inner: Expr =
|
|
211
|
-
undittoed.length === 0
|
|
212
|
-
? body
|
|
213
|
-
: {
|
|
214
|
-
kind: "Quant",
|
|
215
|
-
quantifier,
|
|
216
|
-
bounds: undittoed.map((other) =>
|
|
217
|
-
other.domain.kind === "Domain"
|
|
218
|
-
? {
|
|
219
|
-
...other,
|
|
220
|
-
domain: { kind: "Domain", expression: shiftExpr(1, other.domain.expression) },
|
|
221
|
-
}
|
|
222
|
-
: other,
|
|
223
|
-
),
|
|
224
|
-
body,
|
|
225
|
-
location: body.location,
|
|
226
|
-
};
|
|
176
|
+
if (bounds.length === 0) return formatExpr(body);
|
|
177
|
+
const split = splitFirstBound(quantifier, bounds, body);
|
|
227
178
|
const symbol = quantifier === "Forall" ? "\\<forall>" : "\\<exists>";
|
|
228
|
-
if (
|
|
229
|
-
return withBound(
|
|
230
|
-
if (
|
|
231
|
-
const domain = printExpr(
|
|
179
|
+
if (split.first.domain.kind === "NoDomain")
|
|
180
|
+
return withBound(split.first.name, (name) => `${symbol}${name} : ${printExpr(split.inner)}`);
|
|
181
|
+
if (split.first.domain.kind !== "Domain") throw new TlapmBugError();
|
|
182
|
+
const domain = printExpr(split.first.domain.expression);
|
|
232
183
|
return withBound(
|
|
233
|
-
|
|
234
|
-
(name) => `${symbol} ${name} \\<in> ${domain} : ${printExpr(inner)}`,
|
|
184
|
+
split.first.name,
|
|
185
|
+
(name) => `${symbol} ${name} \\<in> ${domain} : ${printExpr(split.inner)}`,
|
|
235
186
|
);
|
|
236
187
|
};
|
|
237
188
|
|
|
238
189
|
// pp_print_sequent_inner: a sequent inside an expression, as a meta-level implication.
|
|
239
190
|
const printNestedSequent = (sequent: Sequent): string => {
|
|
240
|
-
|
|
241
|
-
|
|
242
|
-
const printRest = () =>
|
|
191
|
+
if (sequent.context.length === 0) return printExpr(sequent.active);
|
|
192
|
+
const hyp = sequent.context[0];
|
|
193
|
+
const printRest = () =>
|
|
194
|
+
printNestedSequent({ context: sequent.context.slice(1), active: sequent.active });
|
|
243
195
|
switch (hyp.kind) {
|
|
244
196
|
case "Flex":
|
|
245
197
|
return withBound(hyp.name, (name) => `(\\<And> ${name} ${name}'.${printRest()})`);
|
|
@@ -258,12 +210,12 @@ export const encodeIsabelle = (
|
|
|
258
210
|
case "Fact": {
|
|
259
211
|
const fact = hyp.visibility === "Visible" ? printExpr(hyp.expression) : undefined;
|
|
260
212
|
bump();
|
|
261
|
-
const
|
|
213
|
+
const printed = fact ? `(${fact} \\<Longrightarrow> ${printRest()})` : printRest();
|
|
262
214
|
popNames(context, 1);
|
|
263
|
-
return
|
|
215
|
+
return printed;
|
|
264
216
|
}
|
|
265
217
|
case "Defn":
|
|
266
|
-
|
|
218
|
+
throw new TlaUnsupportedError("Inner definition");
|
|
267
219
|
}
|
|
268
220
|
};
|
|
269
221
|
|
|
@@ -284,7 +236,7 @@ export const encodeIsabelle = (
|
|
|
284
236
|
case "Parens":
|
|
285
237
|
return formatExpr(expression.expression);
|
|
286
238
|
case "Let":
|
|
287
|
-
|
|
239
|
+
throw new TlaUnsupportedError("LET");
|
|
288
240
|
case "List":
|
|
289
241
|
if (expression.bullet === "Refs" && expression.items.length === 0) return "TRUE";
|
|
290
242
|
if (expression.bullet === "Refs" && expression.items.length === 1)
|
|
@@ -295,57 +247,56 @@ export const encodeIsabelle = (
|
|
|
295
247
|
case "Quant":
|
|
296
248
|
return printQuant(expression.quantifier, expression.bounds, expression.body);
|
|
297
249
|
case "Tquant":
|
|
298
|
-
|
|
250
|
+
throw new TlaUnsupportedError(expression.quantifier === "Forall" ? "\\\\AA" : "\\\\EE");
|
|
299
251
|
case "Choose": {
|
|
300
|
-
const body = expression.body;
|
|
301
252
|
if (!expression.domain)
|
|
302
|
-
return withBound(
|
|
253
|
+
return withBound(
|
|
254
|
+
expression.name,
|
|
255
|
+
(name) => `Choice(%${name}. ${printExpr(expression.body)})`,
|
|
256
|
+
);
|
|
303
257
|
const domain = printExpr(expression.domain);
|
|
304
258
|
return withBound(
|
|
305
259
|
expression.name,
|
|
306
|
-
(name) => `bChoice(${domain}, %${name}. ${printExpr(body)})`,
|
|
260
|
+
(name) => `bChoice(${domain}, %${name}. ${printExpr(expression.body)})`,
|
|
307
261
|
);
|
|
308
262
|
}
|
|
309
263
|
case "SetSt": {
|
|
310
|
-
const body = expression.body;
|
|
311
264
|
const domain = printExpr(expression.domain);
|
|
312
265
|
return withBound(
|
|
313
266
|
expression.name,
|
|
314
|
-
(name) => `subsetOf(${domain}, %${name}. ${printExpr(body)})`,
|
|
267
|
+
(name) => `subsetOf(${domain}, %${name}. ${printExpr(expression.body)})`,
|
|
315
268
|
);
|
|
316
269
|
}
|
|
317
270
|
case "SetOf": {
|
|
318
|
-
|
|
319
|
-
const
|
|
320
|
-
if (!bound) throw new TlapmBugError();
|
|
271
|
+
if (expression.bounds.length === 0) throw new TlapmBugError();
|
|
272
|
+
const bound = expression.bounds[0];
|
|
321
273
|
if (expression.bounds.length !== 1 || bound.domain.kind !== "Domain")
|
|
322
|
-
|
|
274
|
+
throw new TlaUnsupportedError("SetOf (multiple declared constants)");
|
|
323
275
|
const domain = printExpr(bound.domain.expression);
|
|
324
276
|
return withBound(
|
|
325
277
|
bound.name,
|
|
326
|
-
(name) => `setOfAll(${domain}, %${name}. ${printExpr(element)})`,
|
|
278
|
+
(name) => `setOfAll(${domain}, %${name}. ${printExpr(expression.element)})`,
|
|
327
279
|
);
|
|
328
280
|
}
|
|
329
281
|
case "SetEnum":
|
|
330
282
|
return `{${delimited(expression.elements)}}`;
|
|
331
283
|
case "Fcn": {
|
|
332
|
-
const
|
|
333
|
-
|
|
334
|
-
|
|
335
|
-
return unsupported("function (multiple declared constants)");
|
|
284
|
+
const bound = expression.bounds[0];
|
|
285
|
+
if (expression.bounds.length !== 1)
|
|
286
|
+
throw new TlaUnsupportedError("function (multiple declared constants)");
|
|
336
287
|
if (bound.domain.kind === "Ditto") throw new TlapmBugError();
|
|
337
288
|
const domain =
|
|
338
289
|
bound.domain.kind === "Domain" ? printExpr(bound.domain.expression) : undefined;
|
|
339
290
|
return withBound(bound.name, (name) => {
|
|
340
291
|
const printed = domain === undefined ? name : ` ${name} \\<in> ${domain} `;
|
|
341
|
-
return `[${printed} \\<mapsto> ${printExpr(body)}]`;
|
|
292
|
+
return `[${printed} \\<mapsto> ${printExpr(expression.body)}]`;
|
|
342
293
|
});
|
|
343
294
|
}
|
|
344
295
|
case "FcnApp": {
|
|
345
|
-
const
|
|
296
|
+
const printedFunction = printExpr(expression.function);
|
|
346
297
|
return expression.args.length === 1
|
|
347
|
-
? `fapply (${
|
|
348
|
-
: `fapply (${
|
|
298
|
+
? `fapply (${printedFunction}, ${printExpr(expression.args[0])})`
|
|
299
|
+
: `fapply (${printedFunction}, <<${delimited(expression.args)}>>)`;
|
|
349
300
|
}
|
|
350
301
|
case "Arrow":
|
|
351
302
|
return `[${printExpr(expression.domain)} \\<rightarrow> ${printExpr(expression.range)}]`;
|
|
@@ -390,28 +341,16 @@ export const encodeIsabelle = (
|
|
|
390
341
|
case "String":
|
|
391
342
|
return `''${expression.value}''`;
|
|
392
343
|
case "Num":
|
|
393
|
-
if (expression.fraction !== "")
|
|
344
|
+
if (expression.fraction !== "") throw new TlaUnsupportedError("real constants");
|
|
394
345
|
return `(${getSuccessors(expression.integer)})`;
|
|
395
346
|
case "At":
|
|
396
347
|
throw new TlapmBugError();
|
|
397
348
|
}
|
|
398
349
|
};
|
|
399
350
|
|
|
400
|
-
//
|
|
401
|
-
|
|
402
|
-
|
|
403
|
-
try {
|
|
404
|
-
return printExpr(expression);
|
|
405
|
-
} catch (error) {
|
|
406
|
-
if (!(error instanceof TlaUnsupportedError)) throw error;
|
|
407
|
-
popNames(context, context.stack.length - depth);
|
|
408
|
-
return error;
|
|
409
|
-
}
|
|
410
|
-
};
|
|
411
|
-
|
|
412
|
-
// pp_print_sequent_outer: the obligation's sequent as the fixes, assumes and shows of a lemma. A
|
|
413
|
-
// pragma's definition ends it, without the goal.
|
|
414
|
-
const printLemma = (sequent: Sequent) => {
|
|
351
|
+
// pp_print_sequent_outer: the obligation's sequent as the lines of a lemma's fixes, assumes and
|
|
352
|
+
// shows. A pragma's definition ends it with an empty line in place of the goal.
|
|
353
|
+
const printSequent = (sequent: Sequent) => {
|
|
415
354
|
const lines: string[] = [];
|
|
416
355
|
for (const hyp of sequent.context) {
|
|
417
356
|
switch (hyp.kind) {
|
|
@@ -426,52 +365,81 @@ export const encodeIsabelle = (
|
|
|
426
365
|
const name = adjoin(hyp.name);
|
|
427
366
|
lines.push(`fixes ${name}`);
|
|
428
367
|
if (domain === undefined) break;
|
|
429
|
-
state.isAssumed = true;
|
|
430
368
|
lines.push(`assumes ${name}_in : "(${name} \\<in> ${domain})"`);
|
|
431
369
|
break;
|
|
432
370
|
}
|
|
433
371
|
case "Fact": {
|
|
434
372
|
const count = context.stack.length;
|
|
435
|
-
const fact =
|
|
373
|
+
const fact =
|
|
374
|
+
hyp.visibility === "Visible"
|
|
375
|
+
? printFact(context, () => printExpr(hyp.expression))
|
|
376
|
+
: undefined;
|
|
436
377
|
bump();
|
|
437
378
|
if (fact instanceof TlaUnsupportedError) {
|
|
438
379
|
lines.push(`(* omitted temporal assumption : ${fact.message} *)`);
|
|
439
380
|
break;
|
|
440
381
|
}
|
|
441
382
|
if (fact === undefined) break;
|
|
442
|
-
state.isAssumed = true;
|
|
443
383
|
lines.push(`assumes v'${count}: "${fact}"`);
|
|
444
384
|
break;
|
|
445
385
|
}
|
|
446
386
|
case "Defn":
|
|
447
|
-
if (hyp.definition.kind === "Bpragma") return lines
|
|
387
|
+
if (hyp.definition.kind === "Bpragma") return [...lines, ""];
|
|
448
388
|
lines.push(`(* usable definition ${hyp.definition.name} suppressed *)`);
|
|
449
389
|
adjoin(hyp.definition.name);
|
|
450
390
|
break;
|
|
451
391
|
}
|
|
452
392
|
}
|
|
453
|
-
return [...lines, `shows "${printExpr(sequent.active)}"`]
|
|
393
|
+
return [...lines, `shows "${printExpr(sequent.active)}"`];
|
|
454
394
|
};
|
|
455
395
|
|
|
456
|
-
|
|
457
|
-
|
|
458
|
-
|
|
459
|
-
|
|
460
|
-
|
|
461
|
-
|
|
462
|
-
|
|
463
|
-
|
|
396
|
+
try {
|
|
397
|
+
const lines = printSequent(sequent);
|
|
398
|
+
return {
|
|
399
|
+
text: lines.join("\n"),
|
|
400
|
+
isAssumed: lines.some((line) => line.startsWith("assumes ")),
|
|
401
|
+
};
|
|
402
|
+
} catch (error) {
|
|
403
|
+
if (!(error instanceof TlaUnsupportedError)) throw error;
|
|
404
|
+
throw new TlaProverError(`isabelle : unsupported operator ${error.message}`);
|
|
405
|
+
}
|
|
406
|
+
};
|
|
407
|
+
|
|
408
|
+
// thy_temp: the theory tlapm writes for Isabelle to prove obligation id.
|
|
409
|
+
export const encodeIsabelle = (id: number, sequent: Sequent, tactic: string): string => {
|
|
410
|
+
const lemma = printLemma(sequent);
|
|
464
411
|
return [
|
|
465
|
-
|
|
466
|
-
`theory ${theoryName} imports Constant Zenon begin`,
|
|
467
|
-
HEADER,
|
|
412
|
+
...getTheoryHeader(`tlapm_${id}`, false),
|
|
468
413
|
`lemma ob'${id}:`,
|
|
469
|
-
`${lemma}(is "PROP ?ob'${id}")`,
|
|
414
|
+
`${lemma.text}(is "PROP ?ob'${id}")`,
|
|
470
415
|
"proof -",
|
|
471
416
|
`show "PROP ?ob'${id}"`,
|
|
472
|
-
`${
|
|
417
|
+
`${lemma.isAssumed ? "using assms " : ""}by ${tactic}`,
|
|
473
418
|
"qed",
|
|
474
419
|
"end",
|
|
475
420
|
"",
|
|
476
421
|
].join("\n");
|
|
477
422
|
};
|
|
423
|
+
|
|
424
|
+
interface IsabelleProof {
|
|
425
|
+
id: number;
|
|
426
|
+
sequent: Sequent;
|
|
427
|
+
tactic: string;
|
|
428
|
+
}
|
|
429
|
+
|
|
430
|
+
// Isabelle.thy_init, thy_write and thy_close.
|
|
431
|
+
export const encodeIsabelleTheory = (name: string, proofs: IsabelleProof[]) =>
|
|
432
|
+
[
|
|
433
|
+
...getTheoryHeader(name, true),
|
|
434
|
+
...proofs.flatMap((proof) => [
|
|
435
|
+
`lemma ob'${proof.id}:`,
|
|
436
|
+
`${printLemma(proof.sequent).text}(is "PROP ?ob'${proof.id}")`,
|
|
437
|
+
"proof -",
|
|
438
|
+
`ML_command \\<open> writeln "*** TLAPS ENTER ${proof.id}"; \\<close>`,
|
|
439
|
+
`show "PROP ?ob'${proof.id}"`,
|
|
440
|
+
`using assms by ${proof.tactic}`,
|
|
441
|
+
`ML_command \\<open> writeln "*** TLAPS EXIT ${proof.id}"; \\<close> qed`,
|
|
442
|
+
]),
|
|
443
|
+
"end",
|
|
444
|
+
"",
|
|
445
|
+
].join("\n");
|
|
@@ -7,7 +7,7 @@
|
|
|
7
7
|
import { TlaIsabelleError } from "../../../errors";
|
|
8
8
|
import { funT, mkType, propT, type Typ } from "../pure/term";
|
|
9
9
|
|
|
10
|
-
|
|
10
|
+
const TLA_TYPE = mkType("PredicateLogic.c");
|
|
11
11
|
|
|
12
12
|
// A parsed term before names resolve and types are inferred. A name is a bound or free variable
|
|
13
13
|
// or a constant; a constant comes from notation.
|
|
@@ -50,12 +50,12 @@ import { proverTac, type IntuitionisticContext } from "../tools/intuitionistic";
|
|
|
50
50
|
import { insertTac } from "./proof";
|
|
51
51
|
import type { OuterToken } from "./theory";
|
|
52
52
|
|
|
53
|
-
|
|
53
|
+
interface Modifier {
|
|
54
54
|
readonly kind: "intro" | "dest";
|
|
55
55
|
readonly facts: readonly string[];
|
|
56
56
|
}
|
|
57
57
|
|
|
58
|
-
|
|
58
|
+
type MethodText =
|
|
59
59
|
| {
|
|
60
60
|
readonly kind: "auto" | "blast" | "force" | "clarsimp";
|
|
61
61
|
readonly modifiers: readonly Modifier[];
|
|
@@ -66,7 +66,7 @@ export type MethodText =
|
|
|
66
66
|
| { readonly kind: "try"; readonly method: MethodText };
|
|
67
67
|
|
|
68
68
|
// The methods of by: the initial one, and the terminal one that qed runs.
|
|
69
|
-
|
|
69
|
+
interface ProofText {
|
|
70
70
|
readonly initial: MethodText;
|
|
71
71
|
readonly terminal: MethodText | undefined;
|
|
72
72
|
}
|
|
@@ -32,7 +32,7 @@ import type { Ast } from "./inner-syntax";
|
|
|
32
32
|
// The name a type parameter carries until it is fixed, as Type_Infer.param does.
|
|
33
33
|
const PARAM_NAME = "?'a";
|
|
34
34
|
|
|
35
|
-
|
|
35
|
+
interface NameScope {
|
|
36
36
|
readonly consts: ReadonlyMap<string, ConstInfo>;
|
|
37
37
|
// The constant an unqualified name stands for.
|
|
38
38
|
readonly constNames: ReadonlyMap<string, string>;
|
|
@@ -30,7 +30,7 @@ import {
|
|
|
30
30
|
type BlastTerm,
|
|
31
31
|
} from "./term";
|
|
32
32
|
|
|
33
|
-
|
|
33
|
+
const negate = (state: BlastState, term: BlastTerm) =>
|
|
34
34
|
mkBlastApp(mkBlastConst(state.context.data.notName), term);
|
|
35
35
|
|
|
36
36
|
// Converts a *Goal* to an ordinary negation.
|
|
@@ -169,7 +169,7 @@ export const blastAconv = (left: BlastTerm, right: BlastTerm): boolean => {
|
|
|
169
169
|
const blastAconvs = (lefts: readonly BlastTerm[], rights: readonly BlastTerm[]) =>
|
|
170
170
|
lefts.length === rights.length && lefts.every((left, index) => blastAconv(left, rights[index]));
|
|
171
171
|
|
|
172
|
-
|
|
172
|
+
const memTerm = (term: BlastTerm, terms: readonly BlastTerm[]) =>
|
|
173
173
|
terms.some((other) => blastAconv(term, other));
|
|
174
174
|
|
|
175
175
|
export const insTerm = (term: BlastTerm, terms: readonly BlastTerm[]) =>
|
|
@@ -178,7 +178,7 @@ export const insTerm = (term: BlastTerm, terms: readonly BlastTerm[]) =>
|
|
|
178
178
|
export const sameVars = (left: readonly VarRef[], right: readonly VarRef[]) =>
|
|
179
179
|
left.length === right.length && left.every((ref, index) => ref === right[index]);
|
|
180
180
|
|
|
181
|
-
|
|
181
|
+
const memVar = (ref: VarRef, refs: readonly VarRef[]) => refs.includes(ref);
|
|
182
182
|
|
|
183
183
|
const insVar = (ref: VarRef, refs: readonly VarRef[]) =>
|
|
184
184
|
memVar(ref, refs) ? refs : [ref, ...refs];
|
|
@@ -525,8 +525,7 @@ export const toTerm = (depth: number, term: BlastTerm): Term => {
|
|
|
525
525
|
}
|
|
526
526
|
};
|
|
527
527
|
|
|
528
|
-
|
|
529
|
-
destConstApp(term, trueprop) ?? term;
|
|
528
|
+
const stripTrueprop = (trueprop: string, term: BlastTerm) => destConstApp(term, trueprop) ?? term;
|
|
530
529
|
|
|
531
530
|
// A1 ==> ... ==> An ==> B goes to [A1, ..., An], where B is not an implication.
|
|
532
531
|
export const stripBlastImpPrems = (trueprop: string, term: BlastTerm): BlastTerm[] =>
|
|
@@ -120,7 +120,7 @@ const pruneParamsTac = (simp: SimpContext): Tactic => {
|
|
|
120
120
|
);
|
|
121
121
|
};
|
|
122
122
|
|
|
123
|
-
|
|
123
|
+
const mkAutoTac = (context: ClasimpContext, depth: number, nodupDepth: number): Tactic => {
|
|
124
124
|
const mainTac = orElseGoal(context.blastDepthTac(context.classical, depth), (index) =>
|
|
125
125
|
changed(nodupDepthTac(addss(context), nodupDepth)(index)),
|
|
126
126
|
);
|
|
@@ -264,7 +264,7 @@ export const appWrappers = (context: ClassicalContext, tactic: GoalTactic) =>
|
|
|
264
264
|
context.claset.uwrappers.reduce((result, wrapper) => wrapper.wrap(result), tactic);
|
|
265
265
|
|
|
266
266
|
// contr_tac: solves a goal that assumes both P and ~P.
|
|
267
|
-
|
|
267
|
+
const contrTac = (context: ClassicalContext): GoalTactic =>
|
|
268
268
|
thenGoal(
|
|
269
269
|
eresolveTac(context.limits, [context.data.notElim]),
|
|
270
270
|
orElseGoal(eqAssumeTac, assumeTac(context.limits)),
|
|
@@ -280,7 +280,7 @@ const eqMpTac =
|
|
|
280
280
|
);
|
|
281
281
|
|
|
282
282
|
// safe_step_tac: one safe inference, by matching rather than unification.
|
|
283
|
-
|
|
283
|
+
const safeStepTac = (context: ClassicalContext): GoalTactic =>
|
|
284
284
|
appSWrappers(
|
|
285
285
|
context,
|
|
286
286
|
firstGoal([
|
|
@@ -365,7 +365,7 @@ export const unsafeStepTac = (context: ClassicalContext): GoalTactic =>
|
|
|
365
365
|
biresolveFromNetsTac(context.limits, context.claset.unsafe);
|
|
366
366
|
|
|
367
367
|
// step_tac: a safe step, or else an unsafe one.
|
|
368
|
-
|
|
368
|
+
const stepTac =
|
|
369
369
|
(context: ClassicalContext): GoalTactic =>
|
|
370
370
|
(index) =>
|
|
371
371
|
orElse(
|
|
@@ -16,7 +16,6 @@ import {
|
|
|
16
16
|
every,
|
|
17
17
|
firstGoal,
|
|
18
18
|
noTac,
|
|
19
|
-
orElseGoal,
|
|
20
19
|
repeatDetermN,
|
|
21
20
|
repeatDeterm1,
|
|
22
21
|
subgoal,
|
|
@@ -73,7 +72,7 @@ export interface HypsubstData {
|
|
|
73
72
|
readonly thinRefl: Thm;
|
|
74
73
|
}
|
|
75
74
|
|
|
76
|
-
|
|
75
|
+
interface HypsubstContext {
|
|
77
76
|
readonly limits: Limits;
|
|
78
77
|
readonly data: HypsubstData;
|
|
79
78
|
}
|
|
@@ -368,13 +367,6 @@ export const hypSubstTac =
|
|
|
368
367
|
])(index),
|
|
369
368
|
);
|
|
370
369
|
|
|
371
|
-
export const boundHypSubstTac =
|
|
372
|
-
(context: HypsubstContext): GoalTactic =>
|
|
373
|
-
(index) =>
|
|
374
|
-
repeatDeterm1(
|
|
375
|
-
orElseGoal(genHypSubstTac(context, true), varsGenHypSubstTac(context, true))(index),
|
|
376
|
-
);
|
|
377
|
-
|
|
378
370
|
const reverseNTac = (context: HypsubstContext, count: number, index: number): Tactic =>
|
|
379
371
|
count === 0
|
|
380
372
|
? allTac
|
|
@@ -135,7 +135,7 @@ export const isNormHhf = (isProtecting: boolean, term: Term): boolean => {
|
|
|
135
135
|
};
|
|
136
136
|
|
|
137
137
|
// Drule.outer_params: the outermost parameters, named apart.
|
|
138
|
-
|
|
138
|
+
const outerParams = (term: Term) => {
|
|
139
139
|
const vars = stripAllVars(term);
|
|
140
140
|
const names = variantList(
|
|
141
141
|
[],
|
|
@@ -228,7 +228,7 @@ export const zeroVarIndexes = (thm: Thm): Thm => {
|
|
|
228
228
|
export const makeElim = (rule: Thm) => zeroVarIndexes(rs(rule, revcutRl));
|
|
229
229
|
|
|
230
230
|
// Drule.compose: resolves tha into premise index of thb without lifting, with a unique result.
|
|
231
|
-
|
|
231
|
+
const compose = (tha: Thm, index: number, thb: Thm): Thm => {
|
|
232
232
|
const results = listOfSeq(
|
|
233
233
|
bicompose(
|
|
234
234
|
undefined,
|