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
|
@@ -1,40 +1,27 @@
|
|
|
1
|
-
// A port of tlapm's
|
|
2
|
-
//
|
|
1
|
+
// A port of tlapm's obligation generation (Proof.Gen and Module.Gen): leaf proofs become obligations
|
|
2
|
+
// whose context is everything the proof may use at that point.
|
|
3
3
|
|
|
4
4
|
import { TlapmBugError, TlaProofError } from "../errors";
|
|
5
|
+
import { isEqualExpr } from "./equality";
|
|
5
6
|
import {
|
|
6
|
-
applyBuiltin,
|
|
7
7
|
at,
|
|
8
|
-
consSubstitution,
|
|
9
8
|
exprifySequent,
|
|
10
9
|
getErrorNote,
|
|
11
|
-
|
|
10
|
+
getFact,
|
|
11
|
+
isBuiltinApply,
|
|
12
12
|
mapAccumulate,
|
|
13
|
-
normalizeApply,
|
|
14
|
-
shift,
|
|
15
|
-
shiftExpr,
|
|
16
|
-
substituteBounds,
|
|
17
|
-
substituteExpr,
|
|
18
|
-
type Bound,
|
|
19
|
-
type Builtin,
|
|
20
13
|
type Expr,
|
|
21
14
|
type Hyp,
|
|
22
15
|
type Locus,
|
|
23
|
-
type ObligationWarning,
|
|
24
16
|
type Sequent,
|
|
25
17
|
type Time,
|
|
26
18
|
type Visibility,
|
|
27
|
-
|
|
28
|
-
stripProps,
|
|
19
|
+
type Warn,
|
|
29
20
|
} from "./expression";
|
|
30
|
-
import {
|
|
31
|
-
import { printExpression } from "./printer";
|
|
21
|
+
import { bindTheoremName, getUnitHyps, type Mule } from "./module";
|
|
32
22
|
import type { OldMethod } from "./pragma";
|
|
33
|
-
import { getScopeTime } from "./temporal";
|
|
34
23
|
import {
|
|
35
24
|
getStepName,
|
|
36
|
-
getUnique,
|
|
37
|
-
type Counter,
|
|
38
25
|
type Obligation,
|
|
39
26
|
type ObligationKind,
|
|
40
27
|
type Proof,
|
|
@@ -43,59 +30,15 @@ import {
|
|
|
43
30
|
type UseDef,
|
|
44
31
|
type Usable,
|
|
45
32
|
} from "./proof";
|
|
33
|
+
import { shiftExpr } from "./substitution";
|
|
34
|
+
import { getScopeTime } from "./temporal";
|
|
46
35
|
|
|
47
|
-
const AT_NOWHERE: Expr = { kind: "At", isExcept: false };
|
|
48
|
-
|
|
49
|
-
// tlapm builds nodes with x @@ step, which copies all of the step's properties.
|
|
50
|
-
const getProps = (from: Step) => ({
|
|
51
|
-
location: from.location,
|
|
52
|
-
step: from.step,
|
|
53
|
-
isSuppressed: from.isSuppressed,
|
|
54
|
-
method: from.method,
|
|
55
|
-
});
|
|
36
|
+
export const AT_NOWHERE: Expr = { kind: "At", isExcept: false };
|
|
56
37
|
|
|
57
38
|
const isAnonymous = (step: StepNumber | undefined) => step?.kind === "Named" && step.isAnonymous;
|
|
58
39
|
|
|
59
|
-
const
|
|
60
|
-
|
|
61
|
-
const getTrue = (from: { location?: Locus }) => at({ kind: "Internal", builtin: "TRUE" }, from);
|
|
62
|
-
|
|
63
|
-
const isBinary = (
|
|
64
|
-
expression: Expr,
|
|
65
|
-
builtin: Builtin,
|
|
66
|
-
): expression is Extract<Expr, { kind: "Apply" }> =>
|
|
67
|
-
expression.kind === "Apply" &&
|
|
68
|
-
expression.operator.kind === "Internal" &&
|
|
69
|
-
expression.operator.builtin === builtin &&
|
|
70
|
-
expression.args.length === 2;
|
|
71
|
-
|
|
72
|
-
const getMessage = (pattern: string, ...args: (string | Doc)[]) =>
|
|
73
|
-
renderDoc(format(pattern, ...args));
|
|
74
|
-
|
|
75
|
-
// Visit.hyps_of_bounds_unditto: dittos repeat the previous domain, and each domain shifts past the
|
|
76
|
-
// names bound before it.
|
|
77
|
-
const getBoundHyps = (bounds: Bound[]): Hyp[] =>
|
|
78
|
-
expandDittoes(bounds).map((bound, index): Hyp => {
|
|
79
|
-
const domain =
|
|
80
|
-
bound.domain.kind === "Domain" ? shiftExpr(index, bound.domain.expression) : undefined;
|
|
81
|
-
return {
|
|
82
|
-
kind: "Fresh",
|
|
83
|
-
name: bound.name,
|
|
84
|
-
shape: 0,
|
|
85
|
-
level: domain ? "Constant" : bound.level,
|
|
86
|
-
domain,
|
|
87
|
-
domainVisibility: "Visible",
|
|
88
|
-
};
|
|
89
|
-
});
|
|
90
|
-
|
|
91
|
-
const expandDittoes = (bounds: Bound[]): Bound[] => {
|
|
92
|
-
let domain: Bound["domain"] = { kind: "NoDomain" };
|
|
93
|
-
return bounds.map((bound) => {
|
|
94
|
-
if (bound.domain.kind === "Ditto") return { ...bound, domain };
|
|
95
|
-
domain = bound.domain;
|
|
96
|
-
return bound;
|
|
97
|
-
});
|
|
98
|
-
};
|
|
40
|
+
export const getTrue = (from: { location?: Locus }) =>
|
|
41
|
+
at({ kind: "Internal", builtin: "TRUE" }, from);
|
|
99
42
|
|
|
100
43
|
// Each visible fact of the sequent, shifted past the hypotheses after it.
|
|
101
44
|
const getAssumedFacts = (offset: number, sequent: Sequent) =>
|
|
@@ -119,7 +62,7 @@ const getStepDefinition = (step: Step, body: Expr, time: Time): Hyp => {
|
|
|
119
62
|
|
|
120
63
|
// The proof of an assertion leaves the always scope when the assertion assumes a fact that holds
|
|
121
64
|
// only now.
|
|
122
|
-
const proveAssertion = (context: Hyp[], sequent: Sequent, step: Step, time: Time) => {
|
|
65
|
+
export const proveAssertion = (context: Hyp[], sequent: Sequent, step: Step, time: Time) => {
|
|
123
66
|
const visibility: Visibility = isAnonymous(step.step) ? "Visible" : "Hidden";
|
|
124
67
|
const hyps = sequent.context.map((hyp): Hyp =>
|
|
125
68
|
hyp.kind === "Fact" ? { ...hyp, visibility } : hyp,
|
|
@@ -130,28 +73,16 @@ const proveAssertion = (context: Hyp[], sequent: Sequent, step: Step, time: Time
|
|
|
130
73
|
context: [
|
|
131
74
|
...context,
|
|
132
75
|
...hyps,
|
|
133
|
-
|
|
134
|
-
kind: "Fact",
|
|
135
|
-
expression: getTrue(step),
|
|
136
|
-
visibility: "Hidden",
|
|
137
|
-
time,
|
|
138
|
-
location: step.location,
|
|
139
|
-
},
|
|
76
|
+
getFact(getTrue(step), "Hidden", time, step.location),
|
|
140
77
|
getStepDefinition(step, body, scopeTime),
|
|
141
|
-
{
|
|
142
|
-
|
|
143
|
-
expression: at({ kind: "Ix", index: 1 }, step),
|
|
144
|
-
visibility: "Hidden",
|
|
145
|
-
time: scopeTime,
|
|
146
|
-
location: step.location,
|
|
147
|
-
},
|
|
148
|
-
] satisfies Hyp[],
|
|
78
|
+
getFact(at({ kind: "Ix", index: 1 }, step), "Hidden", scopeTime, step.location),
|
|
79
|
+
],
|
|
149
80
|
active: shiftExpr(3, sequent.active),
|
|
150
81
|
time: scopeTime,
|
|
151
82
|
};
|
|
152
83
|
};
|
|
153
84
|
|
|
154
|
-
const useAssertion = (
|
|
85
|
+
export const useAssertion = (
|
|
155
86
|
isSuffices: boolean,
|
|
156
87
|
context: Hyp[],
|
|
157
88
|
goal: Expr,
|
|
@@ -164,14 +95,8 @@ const useAssertion = (
|
|
|
164
95
|
context: [
|
|
165
96
|
...context,
|
|
166
97
|
getStepDefinition(step, at(exprifySequent(sequent), step), time),
|
|
167
|
-
{
|
|
168
|
-
|
|
169
|
-
expression: at({ kind: "Ix", index: 1 }, step),
|
|
170
|
-
visibility,
|
|
171
|
-
time,
|
|
172
|
-
location: step.location,
|
|
173
|
-
},
|
|
174
|
-
] satisfies Hyp[],
|
|
98
|
+
getFact(at({ kind: "Ix", index: 1 }, step), visibility, time, step.location),
|
|
99
|
+
],
|
|
175
100
|
active: shiftExpr(2, goal),
|
|
176
101
|
};
|
|
177
102
|
};
|
|
@@ -187,7 +112,7 @@ const getFactTime = (context: Hyp[], fact: Expr, time: Time): Time => {
|
|
|
187
112
|
: "Always";
|
|
188
113
|
};
|
|
189
114
|
|
|
190
|
-
|
|
115
|
+
const setDefinition = (visibility: Visibility, context: Hyp[], def: UseDef): Hyp[] => {
|
|
191
116
|
if (def.kind !== "Dx") throw new TlaProofError(`Unknown definition ${def.name}`);
|
|
192
117
|
const index = context.length - def.index;
|
|
193
118
|
const hyp = context[index];
|
|
@@ -197,15 +122,13 @@ export const setDefinition = (visibility: Visibility, context: Hyp[], def: UseDe
|
|
|
197
122
|
};
|
|
198
123
|
|
|
199
124
|
const isDomainMatch = (fact: Expr, domain: Expr) =>
|
|
200
|
-
fact
|
|
201
|
-
fact.operator.kind === "Internal" &&
|
|
202
|
-
fact.operator.builtin === "Mem" &&
|
|
125
|
+
isBuiltinApply(fact, "Mem") &&
|
|
203
126
|
fact.args[0]?.kind === "Ix" &&
|
|
204
127
|
fact.args[0].index === 0 &&
|
|
205
128
|
isEqualExpr(domain, fact.args[1]);
|
|
206
129
|
|
|
207
|
-
|
|
208
|
-
onWarning:
|
|
130
|
+
const setExpression = (
|
|
131
|
+
onWarning: Warn,
|
|
209
132
|
visibility: Visibility,
|
|
210
133
|
fact: Expr,
|
|
211
134
|
context: Hyp[],
|
|
@@ -219,7 +142,9 @@ export const setExpression = (
|
|
|
219
142
|
if (hyp.kind === "Fact" && isEqualExpr(hyp.expression, current)) {
|
|
220
143
|
isFound = true;
|
|
221
144
|
result[index] = { ...hyp, visibility };
|
|
222
|
-
|
|
145
|
+
continue;
|
|
146
|
+
}
|
|
147
|
+
if (hyp.kind === "Fresh" && hyp.domain && isDomainMatch(current, hyp.domain)) {
|
|
223
148
|
isFound = true;
|
|
224
149
|
result[index] = { ...hyp, domainVisibility: visibility };
|
|
225
150
|
}
|
|
@@ -238,105 +163,32 @@ export interface LineRange {
|
|
|
238
163
|
end: number;
|
|
239
164
|
}
|
|
240
165
|
|
|
241
|
-
export interface Generator {
|
|
242
|
-
generate: (sequent: Sequent, proof: Proof, time: Time) => Proof;
|
|
243
|
-
collect: (proof: Proof) => Obligation[];
|
|
244
|
-
mutate: (
|
|
245
|
-
context: Hyp[],
|
|
246
|
-
mode: "Use" | "Hide",
|
|
247
|
-
usable: Usable,
|
|
248
|
-
location: Locus | undefined,
|
|
249
|
-
) => [Hyp[], Obligation[]];
|
|
250
|
-
simplify: (context: Hyp[], goal: Expr, proof: Proof, time: Time) => Proof;
|
|
251
|
-
}
|
|
252
|
-
|
|
253
|
-
// The bounds after a witnessed one, where a ditto takes the witnessed domain.
|
|
254
|
-
const getRemainingBounds = (first: Bound, rest: Bound[]): Bound[] => {
|
|
255
|
-
const shifted = substituteBounds(shift(1), rest)[1];
|
|
256
|
-
return shifted[0].domain.kind === "Ditto" && first.domain.kind === "Domain"
|
|
257
|
-
? [
|
|
258
|
-
{
|
|
259
|
-
...shifted[0],
|
|
260
|
-
domain: { kind: "Domain", expression: shiftExpr(1, first.domain.expression) },
|
|
261
|
-
},
|
|
262
|
-
...shifted.slice(1),
|
|
263
|
-
]
|
|
264
|
-
: shifted;
|
|
265
|
-
};
|
|
266
|
-
|
|
267
|
-
// A WITNESS proves each membership and subset it relies on, then the goal from them.
|
|
268
|
-
const getWitnessProof = (step: Step, aux: Expr[]): Proof => {
|
|
269
|
-
if (step.isSuppressed || aux.length === 0) return { kind: "Obvious", ...getProps(step) };
|
|
270
|
-
const steps = aux.map((item, index): Step => {
|
|
271
|
-
const active = shiftExpr(2 * index + 2, item);
|
|
272
|
-
return {
|
|
273
|
-
kind: "Assert",
|
|
274
|
-
sequent: { context: [], active },
|
|
275
|
-
proof: {
|
|
276
|
-
kind: "By",
|
|
277
|
-
usable: { facts: [shiftExpr(3, active)], defs: [] },
|
|
278
|
-
isOnly: false,
|
|
279
|
-
location: item.location,
|
|
280
|
-
method: step.method,
|
|
281
|
-
},
|
|
282
|
-
location: item.location,
|
|
283
|
-
};
|
|
284
|
-
});
|
|
285
|
-
const facts = [
|
|
286
|
-
at({ kind: "Ix", index: 2 * aux.length + 2 }, step),
|
|
287
|
-
...aux.map((_item, index) => at({ kind: "Ix", index: 2 * (aux.length - index) }, step)),
|
|
288
|
-
];
|
|
289
|
-
// tlapm removes the method from the QED.
|
|
290
|
-
const qedProof: Proof = {
|
|
291
|
-
kind: "By",
|
|
292
|
-
usable: { facts, defs: [] },
|
|
293
|
-
isOnly: true,
|
|
294
|
-
...getProps(step),
|
|
295
|
-
method: undefined,
|
|
296
|
-
};
|
|
297
|
-
return {
|
|
298
|
-
kind: "Steps",
|
|
299
|
-
steps,
|
|
300
|
-
qed: { proof: qedProof, location: qedProof.location },
|
|
301
|
-
...getProps(step),
|
|
302
|
-
};
|
|
303
|
-
};
|
|
304
|
-
|
|
305
166
|
const obligate = (
|
|
306
167
|
sequent: Sequent,
|
|
307
168
|
from: { location?: Locus; method?: OldMethod },
|
|
308
169
|
kind: ObligationKind,
|
|
309
170
|
): Obligation => ({ sequent, location: from.location, kind, method: from.method });
|
|
310
171
|
|
|
311
|
-
|
|
172
|
+
interface ProofSummary {
|
|
312
173
|
total: number;
|
|
313
174
|
absent: Locus[];
|
|
314
175
|
omitted: Locus[];
|
|
315
176
|
}
|
|
316
177
|
|
|
317
|
-
|
|
178
|
+
const EMPTY_SUMMARY: ProofSummary = { total: 0, absent: [], omitted: [] };
|
|
318
179
|
|
|
319
|
-
|
|
180
|
+
const joinSummaries = (left: ProofSummary, right: ProofSummary): ProofSummary => ({
|
|
320
181
|
total: left.total + right.total,
|
|
321
182
|
absent: [...left.absent, ...right.absent],
|
|
322
183
|
omitted: [...left.omitted, ...right.omitted],
|
|
323
184
|
});
|
|
324
185
|
|
|
325
186
|
const getStepSummary = (step: Step): ProofSummary => {
|
|
326
|
-
|
|
327
|
-
|
|
328
|
-
return { ...EMPTY_SUMMARY, total: step.obligations?.length ?? 0 };
|
|
329
|
-
case "Assert":
|
|
330
|
-
case "Suffices":
|
|
331
|
-
case "Pcase":
|
|
332
|
-
case "Pick":
|
|
333
|
-
return getProofSummary(step.proof);
|
|
334
|
-
default:
|
|
335
|
-
return EMPTY_SUMMARY;
|
|
336
|
-
}
|
|
187
|
+
if (step.kind === "Use") return { ...EMPTY_SUMMARY, total: step.obligations?.length ?? 0 };
|
|
188
|
+
return "proof" in step ? getProofSummary(step.proof) : EMPTY_SUMMARY;
|
|
337
189
|
};
|
|
338
190
|
|
|
339
|
-
|
|
191
|
+
const getProofSummary = (proof: Proof): ProofSummary => {
|
|
340
192
|
if (proof.kind === "Steps") {
|
|
341
193
|
return [...proof.steps.map(getStepSummary), getProofSummary(proof.qed.proof)].reduce(
|
|
342
194
|
joinSummaries,
|
|
@@ -351,17 +203,15 @@ export const getProofSummary = (proof: Proof): ProofSummary => {
|
|
|
351
203
|
};
|
|
352
204
|
};
|
|
353
205
|
|
|
354
|
-
|
|
355
|
-
|
|
356
|
-
|
|
357
|
-
: mapChildren(expression, (inner) => replaceAt(inner, replacement));
|
|
206
|
+
export interface TheoremSummary extends ProofSummary {
|
|
207
|
+
location: Locus | undefined;
|
|
208
|
+
}
|
|
358
209
|
|
|
359
|
-
export
|
|
360
|
-
|
|
361
|
-
|
|
362
|
-
|
|
363
|
-
|
|
364
|
-
): Generator => {
|
|
210
|
+
export interface ModuleSummary extends ProofSummary {
|
|
211
|
+
theorems: TheoremSummary[];
|
|
212
|
+
}
|
|
213
|
+
|
|
214
|
+
export const createGenerator = (inputFiles: Set<string>, lines: LineRange, onWarning: Warn) => {
|
|
365
215
|
const generate = (sequent: Sequent, proof: Proof, time: Time): Proof => {
|
|
366
216
|
const location = proof.location;
|
|
367
217
|
if (
|
|
@@ -418,11 +268,12 @@ export const createGenerator = (
|
|
|
418
268
|
context: [
|
|
419
269
|
...sequent.context,
|
|
420
270
|
{
|
|
421
|
-
|
|
422
|
-
|
|
423
|
-
|
|
424
|
-
|
|
425
|
-
|
|
271
|
+
...getFact(
|
|
272
|
+
fact,
|
|
273
|
+
"Visible",
|
|
274
|
+
getFactTime(sequent.context, fact, time),
|
|
275
|
+
fact.location,
|
|
276
|
+
),
|
|
426
277
|
useLocation: step.useLocation,
|
|
427
278
|
},
|
|
428
279
|
],
|
|
@@ -542,606 +393,65 @@ export const createGenerator = (
|
|
|
542
393
|
item.steps.forEach(visitStep);
|
|
543
394
|
return;
|
|
544
395
|
}
|
|
545
|
-
if (item.obligations
|
|
396
|
+
if (item.obligations) obligations.push(...item.obligations);
|
|
546
397
|
};
|
|
547
398
|
const visitStep = (step: Step) => {
|
|
548
|
-
if (step.kind === "Use" && step.obligations
|
|
549
|
-
|
|
550
|
-
if (
|
|
551
|
-
step.kind === "Assert" ||
|
|
552
|
-
step.kind === "Suffices" ||
|
|
553
|
-
step.kind === "Pcase" ||
|
|
554
|
-
step.kind === "Pick"
|
|
555
|
-
) {
|
|
556
|
-
visitProof(step.proof);
|
|
557
|
-
}
|
|
399
|
+
if (step.kind === "Use" && step.obligations) obligations.push(...step.obligations);
|
|
400
|
+
if ("proof" in step) visitProof(step.proof);
|
|
558
401
|
};
|
|
559
402
|
visitProof(proof);
|
|
560
403
|
return obligations;
|
|
561
404
|
};
|
|
562
405
|
|
|
563
|
-
|
|
564
|
-
|
|
565
|
-
level,
|
|
566
|
-
label: `_a${getUnique(counter)}`,
|
|
567
|
-
isAnonymous: true,
|
|
568
|
-
});
|
|
569
|
-
|
|
570
|
-
const renumberNumber = (level: number, step: StepNumber | undefined): StepNumber =>
|
|
571
|
-
step?.kind === "Named" ? { ...step, level } : getAnonymous(level);
|
|
572
|
-
|
|
573
|
-
const renumber = (level: number, proof: Proof): Proof => {
|
|
574
|
-
const renumbered: Proof = { ...proof, step: renumberNumber(level, proof.step) };
|
|
575
|
-
if (renumbered.kind !== "Steps") return renumbered;
|
|
576
|
-
const steps = renumbered.steps.map((step) => renumberStep(level, step));
|
|
577
|
-
return {
|
|
578
|
-
...renumbered,
|
|
579
|
-
steps,
|
|
580
|
-
qed: { ...renumbered.qed, proof: renumber(level + 1, renumbered.qed.proof) },
|
|
581
|
-
};
|
|
582
|
-
};
|
|
583
|
-
|
|
584
|
-
const renumberStep = (level: number, step: Step): Step => {
|
|
585
|
-
const renumbered: Step = { ...step, step: renumberNumber(level, step.step) };
|
|
586
|
-
switch (renumbered.kind) {
|
|
587
|
-
case "Assert":
|
|
588
|
-
case "Suffices":
|
|
589
|
-
case "Pcase":
|
|
590
|
-
case "Pick":
|
|
591
|
-
return { ...renumbered, proof: renumber(level + 1, renumbered.proof) };
|
|
592
|
-
default:
|
|
593
|
-
return renumbered;
|
|
594
|
-
}
|
|
595
|
-
};
|
|
596
|
-
|
|
597
|
-
const exposeConnective = (context: Hyp[], goal: Expr): Expr => {
|
|
598
|
-
const head = goal.kind === "Apply" ? goal.operator : goal;
|
|
599
|
-
if (head.kind === "Ix") {
|
|
600
|
-
const hyp = context[context.length - head.index];
|
|
601
|
-
if (!hyp) throw new TlaProofError("expose_connective");
|
|
602
|
-
if (hyp.kind !== "Defn" || hyp.definition.kind !== "Operator") return goal;
|
|
603
|
-
const body = shiftExpr(head.index, hyp.definition.body);
|
|
604
|
-
if (goal.kind !== "Apply") return exposeConnective(context, body);
|
|
605
|
-
const operator: Expr = { ...body, location: goal.location };
|
|
606
|
-
return exposeConnective(context, at(normalizeApply(operator, goal.args), operator));
|
|
607
|
-
}
|
|
608
|
-
if (
|
|
609
|
-
goal.kind === "Apply" &&
|
|
610
|
-
goal.operator.kind === "Internal" &&
|
|
611
|
-
goal.operator.builtin === "Prime"
|
|
612
|
-
) {
|
|
613
|
-
const inner = exposeConnective(context, goal.args[0]);
|
|
614
|
-
const prime = (expression: Expr) => applyBuiltin("Prime", [expression], expression);
|
|
615
|
-
if (inner.kind === "Quant") {
|
|
616
|
-
return at(
|
|
617
|
-
{
|
|
618
|
-
kind: "Quant",
|
|
619
|
-
quantifier: inner.quantifier,
|
|
620
|
-
bounds: inner.bounds.map((bound) =>
|
|
621
|
-
bound.domain.kind === "Domain"
|
|
622
|
-
? {
|
|
623
|
-
...bound,
|
|
624
|
-
domain: { kind: "Domain", expression: prime(bound.domain.expression) },
|
|
625
|
-
}
|
|
626
|
-
: bound,
|
|
627
|
-
),
|
|
628
|
-
body: prime(inner.body),
|
|
629
|
-
},
|
|
630
|
-
goal,
|
|
631
|
-
);
|
|
632
|
-
}
|
|
633
|
-
if (isBinary(inner, "Implies") || isBinary(inner, "Mem")) {
|
|
634
|
-
return at(
|
|
635
|
-
{
|
|
636
|
-
kind: "Apply",
|
|
637
|
-
operator: inner.operator,
|
|
638
|
-
args: [prime(inner.args[0]), prime(inner.args[1])],
|
|
639
|
-
},
|
|
640
|
-
goal,
|
|
641
|
-
);
|
|
642
|
-
}
|
|
643
|
-
return prime(inner);
|
|
644
|
-
}
|
|
645
|
-
if (goal.kind === "Parens") return exposeConnective(context, goal.expression);
|
|
646
|
-
return goal;
|
|
647
|
-
};
|
|
648
|
-
|
|
649
|
-
const getRightOperand = (step: Step): Expr | undefined => {
|
|
650
|
-
if (step.kind !== "Assert") return undefined;
|
|
651
|
-
const active = step.sequent.active;
|
|
652
|
-
return active.kind === "Apply" && active.args.length === 2 ? active.args[1] : undefined;
|
|
653
|
-
};
|
|
654
|
-
|
|
655
|
-
// at_expand: @ in a step stands for the right side of the previous step's assertion.
|
|
656
|
-
const expandAt = (proof: Proof): Proof => {
|
|
657
|
-
if (proof.kind !== "Steps") return proof;
|
|
658
|
-
const steps: Step[] = [];
|
|
659
|
-
proof.steps.forEach((step) => {
|
|
660
|
-
const previous = steps.at(-1);
|
|
661
|
-
const right = previous && getRightOperand(previous);
|
|
662
|
-
if (step.kind !== "Assert" || !right) {
|
|
663
|
-
steps.push(step);
|
|
664
|
-
return;
|
|
665
|
-
}
|
|
666
|
-
const active = replaceAt(step.sequent.active, shiftExpr(2, right));
|
|
667
|
-
steps.push({ ...step, sequent: { ...step.sequent, active } });
|
|
668
|
-
});
|
|
669
|
-
return { ...proof, steps };
|
|
670
|
-
};
|
|
671
|
-
|
|
672
|
-
const simplify = (context: Hyp[], goal: Expr, original: Proof, time: Time): Proof => {
|
|
673
|
-
const proof = expandAt(original);
|
|
674
|
-
switch (proof.kind) {
|
|
675
|
-
case "Obvious":
|
|
676
|
-
case "Omitted":
|
|
677
|
-
case "Error":
|
|
678
|
-
return proof;
|
|
679
|
-
case "By": {
|
|
680
|
-
const usable = proof.usable;
|
|
681
|
-
const useDefs: Step[] =
|
|
682
|
-
usable.defs.length === 0
|
|
683
|
-
? []
|
|
684
|
-
: [
|
|
685
|
-
{
|
|
686
|
-
kind: "Use",
|
|
687
|
-
usable: { facts: [], defs: usable.defs },
|
|
688
|
-
isOnly: false,
|
|
689
|
-
location: proof.location,
|
|
690
|
-
},
|
|
691
|
-
];
|
|
692
|
-
const useFacts = usable.facts.map((fact, index): Step => ({
|
|
693
|
-
kind: "Use",
|
|
694
|
-
usable: { facts: [shiftExpr(index, fact)], defs: [] },
|
|
695
|
-
isOnly: false,
|
|
696
|
-
location: fact.location,
|
|
697
|
-
isSuppressed: proof.isSuppressed,
|
|
698
|
-
useLocation: proof.location,
|
|
699
|
-
}));
|
|
700
|
-
const forget: Step[] = proof.isOnly
|
|
701
|
-
? [{ kind: "Forget", count: usable.facts.length, location: proof.location }]
|
|
702
|
-
: [];
|
|
703
|
-
const level = getLevel(proof.step);
|
|
704
|
-
const steps = [...useDefs, ...useFacts, ...forget].map((step): Step => ({
|
|
705
|
-
...step,
|
|
706
|
-
step: getAnonymous(level),
|
|
707
|
-
}));
|
|
708
|
-
const qedProof: Proof = {
|
|
709
|
-
kind: "Obvious",
|
|
710
|
-
location: proof.location,
|
|
711
|
-
step: getAnonymous(level),
|
|
712
|
-
isSuppressed: proof.isSuppressed,
|
|
713
|
-
method: proof.method,
|
|
714
|
-
};
|
|
715
|
-
return {
|
|
716
|
-
kind: "Steps",
|
|
717
|
-
steps,
|
|
718
|
-
qed: { proof: qedProof, location: qedProof.location, step: qedProof.step },
|
|
719
|
-
location: proof.location,
|
|
720
|
-
step: proof.step,
|
|
721
|
-
isSuppressed: proof.isSuppressed,
|
|
722
|
-
};
|
|
723
|
-
}
|
|
724
|
-
case "Steps": {
|
|
725
|
-
let currentContext = context;
|
|
726
|
-
let currentGoal = goal;
|
|
727
|
-
let currentTime = time;
|
|
728
|
-
const steps = proof.steps.flatMap((step) => {
|
|
729
|
-
const [nextContext, nextGoal, simplified, nextTime] = simplifyStep(
|
|
730
|
-
currentContext,
|
|
731
|
-
currentGoal,
|
|
732
|
-
step,
|
|
733
|
-
currentTime,
|
|
734
|
-
);
|
|
735
|
-
currentContext = nextContext;
|
|
736
|
-
currentGoal = nextGoal;
|
|
737
|
-
currentTime = nextTime;
|
|
738
|
-
return simplified;
|
|
739
|
-
});
|
|
740
|
-
const qedProof = simplify(currentContext, currentGoal, proof.qed.proof, currentTime);
|
|
741
|
-
return { ...proof, steps, qed: { ...proof.qed, proof: qedProof } };
|
|
742
|
-
}
|
|
743
|
-
}
|
|
744
|
-
};
|
|
745
|
-
|
|
746
|
-
const simplifyStep = (
|
|
406
|
+
// Module.Gen.generate.
|
|
407
|
+
const generateModule = (
|
|
747
408
|
context: Hyp[],
|
|
748
|
-
|
|
749
|
-
|
|
750
|
-
|
|
751
|
-
|
|
752
|
-
|
|
753
|
-
|
|
754
|
-
|
|
755
|
-
|
|
756
|
-
|
|
757
|
-
|
|
758
|
-
|
|
759
|
-
...
|
|
760
|
-
proof
|
|
761
|
-
|
|
762
|
-
|
|
763
|
-
|
|
764
|
-
}
|
|
765
|
-
case "Suffices": {
|
|
766
|
-
const inner = useAssertion(true, context, goal, step.sequent, step, time);
|
|
767
|
-
const simplified: Step = {
|
|
768
|
-
...step,
|
|
769
|
-
proof: simplify(inner.context, inner.active, step.proof, time),
|
|
770
|
-
};
|
|
771
|
-
const next = proveAssertion(context, step.sequent, simplified, time);
|
|
772
|
-
return [next.context, next.active, [simplified], next.time];
|
|
773
|
-
}
|
|
774
|
-
case "Use": {
|
|
775
|
-
const byProof: Proof = {
|
|
776
|
-
kind: "By",
|
|
777
|
-
usable: step.usable,
|
|
778
|
-
isOnly: step.isOnly,
|
|
779
|
-
location: step.location,
|
|
780
|
-
step: step.step,
|
|
781
|
-
isSuppressed: step.isSuppressed,
|
|
782
|
-
method: step.method,
|
|
783
|
-
};
|
|
784
|
-
const simplified = simplify(context, goal, byProof, time);
|
|
785
|
-
if (simplified.kind !== "Steps")
|
|
786
|
-
throw new TlaProofError("simplifying BY does not produce a non-leaf proof!");
|
|
787
|
-
const assumed = step.usable.facts.map((): Hyp => ({
|
|
788
|
-
kind: "Fact",
|
|
789
|
-
expression: AT_NOWHERE,
|
|
790
|
-
visibility: "Visible",
|
|
791
|
-
time,
|
|
792
|
-
location: step.location,
|
|
793
|
-
}));
|
|
794
|
-
return [
|
|
795
|
-
[...context, ...assumed],
|
|
796
|
-
shiftExpr(step.usable.facts.length, goal),
|
|
797
|
-
simplified.steps,
|
|
798
|
-
time,
|
|
799
|
-
];
|
|
800
|
-
}
|
|
801
|
-
case "Hide": {
|
|
802
|
-
const hidden = step.usable.defs.reduce((current, def) => {
|
|
803
|
-
if (def.kind !== "Dx") throw new TlaProofError("set_vis");
|
|
804
|
-
const index = current.length - def.index;
|
|
805
|
-
const hyp = current[index];
|
|
806
|
-
if (hyp?.kind !== "Defn") {
|
|
807
|
-
const name = hyp ? (hyp.kind === "Fact" ? "??? FACT ???" : hyp.name) : "";
|
|
808
|
-
throw new TlaProofError(
|
|
809
|
-
`USE DEF ${name} invalid because ${name} is not a defined operator`,
|
|
810
|
-
);
|
|
811
|
-
}
|
|
812
|
-
return current.map((entry, position) =>
|
|
813
|
-
position === index
|
|
814
|
-
? { ...hyp, visibility: "Hidden" as const, location: step.location }
|
|
815
|
-
: entry,
|
|
816
|
-
);
|
|
817
|
-
}, context);
|
|
818
|
-
return [hidden, goal, [step], time];
|
|
819
|
-
}
|
|
820
|
-
case "Define":
|
|
821
|
-
return [
|
|
822
|
-
[
|
|
823
|
-
...context,
|
|
824
|
-
...step.definitions.map((definition): Hyp => ({
|
|
825
|
-
kind: "Defn",
|
|
826
|
-
definition,
|
|
827
|
-
whereDefined: { kind: "Proof", time },
|
|
828
|
-
visibility: "Visible",
|
|
829
|
-
isLocal: true,
|
|
830
|
-
location: step.location,
|
|
831
|
-
})),
|
|
832
|
-
],
|
|
833
|
-
shiftExpr(step.definitions.length, goal),
|
|
834
|
-
[step],
|
|
835
|
-
time,
|
|
836
|
-
];
|
|
837
|
-
case "Have": {
|
|
838
|
-
const connective = exposeConnective(context, goal);
|
|
839
|
-
const fact: Hyp = {
|
|
840
|
-
kind: "Fact",
|
|
841
|
-
expression: step.expression,
|
|
842
|
-
visibility: "Visible",
|
|
843
|
-
time,
|
|
844
|
-
location: step.location,
|
|
845
|
-
};
|
|
846
|
-
const isImplication = isBinary(connective, "Implies");
|
|
847
|
-
const sequent: Sequent = {
|
|
848
|
-
context: [fact],
|
|
849
|
-
active: isImplication ? shiftExpr(1, connective.args[1]) : connective,
|
|
850
|
-
};
|
|
851
|
-
const proof: Proof = isImplication
|
|
852
|
-
? {
|
|
853
|
-
kind: "By",
|
|
854
|
-
usable: { facts: [at({ kind: "Ix", index: 2 }, step)], defs: [] },
|
|
855
|
-
isOnly: true,
|
|
856
|
-
...getProps(step),
|
|
857
|
-
}
|
|
858
|
-
: {
|
|
859
|
-
kind: "Error",
|
|
860
|
-
message: getMessage(
|
|
861
|
-
"@.@[<v2>@[%s@ %s@]@,%a@]@.",
|
|
862
|
-
"Error: this HAVE step is applied to the following goal,",
|
|
863
|
-
"which is not an implication:",
|
|
864
|
-
printExpression(context, goal),
|
|
865
|
-
),
|
|
866
|
-
...getProps(step),
|
|
867
|
-
};
|
|
868
|
-
const suffices = renumberStep(level, {
|
|
869
|
-
kind: "Suffices",
|
|
870
|
-
sequent,
|
|
871
|
-
proof,
|
|
872
|
-
location: step.location,
|
|
873
|
-
step: step.step,
|
|
874
|
-
});
|
|
875
|
-
return simplifyStep(context, goal, suffices, time);
|
|
876
|
-
}
|
|
877
|
-
case "Take":
|
|
878
|
-
return simplifyStep(
|
|
879
|
-
context,
|
|
880
|
-
goal,
|
|
881
|
-
renumberStep(level, getTakeSuffices(context, goal, step)),
|
|
882
|
-
time,
|
|
883
|
-
);
|
|
884
|
-
case "Witness":
|
|
885
|
-
return simplifyStep(
|
|
886
|
-
context,
|
|
887
|
-
goal,
|
|
888
|
-
renumberStep(level, getWitnessSuffices(context, goal, step)),
|
|
889
|
-
time,
|
|
890
|
-
);
|
|
891
|
-
case "Pcase": {
|
|
892
|
-
const assertion: Step = {
|
|
893
|
-
kind: "Assert",
|
|
894
|
-
sequent: {
|
|
895
|
-
context: [
|
|
896
|
-
{
|
|
897
|
-
kind: "Fact",
|
|
898
|
-
expression: step.expression,
|
|
899
|
-
visibility: "Visible",
|
|
900
|
-
time,
|
|
901
|
-
location: step.location,
|
|
902
|
-
},
|
|
903
|
-
],
|
|
904
|
-
active: shiftExpr(1, goal),
|
|
905
|
-
},
|
|
906
|
-
proof: step.proof,
|
|
907
|
-
...getProps(step),
|
|
908
|
-
};
|
|
909
|
-
return simplifyStep(context, goal, renumberStep(level, assertion), time);
|
|
910
|
-
}
|
|
911
|
-
case "Pick": {
|
|
912
|
-
const existential: Expr = at(
|
|
913
|
-
{ kind: "Quant", quantifier: "Exists", bounds: step.bounds, body: step.expression },
|
|
914
|
-
step,
|
|
915
|
-
);
|
|
916
|
-
const salted = getSalted(step.step, "ex");
|
|
917
|
-
const [assertContext, assertGoal, asserted, assertTime] = simplifyStep(
|
|
918
|
-
context,
|
|
919
|
-
goal,
|
|
920
|
-
{
|
|
921
|
-
kind: "Assert",
|
|
922
|
-
sequent: { context: [], active: existential },
|
|
923
|
-
proof: step.proof,
|
|
924
|
-
...getProps(step),
|
|
925
|
-
step: salted,
|
|
926
|
-
},
|
|
927
|
-
time,
|
|
928
|
-
);
|
|
929
|
-
const shifted = shiftExpr(2, existential);
|
|
930
|
-
if (shifted.kind !== "Quant") throw new TlaProofError("Proof.Simplify.simplify_step/PICK");
|
|
931
|
-
const hyps = [
|
|
932
|
-
...getBoundHyps(shifted.bounds),
|
|
933
|
-
{
|
|
934
|
-
kind: "Fact",
|
|
935
|
-
expression: shifted.body,
|
|
936
|
-
visibility: "Visible",
|
|
937
|
-
time: assertTime,
|
|
938
|
-
location: shifted.body.location,
|
|
939
|
-
} satisfies Hyp,
|
|
940
|
-
];
|
|
941
|
-
const [nextContext, nextGoal, sufficed, nextTime] = simplifyStep(
|
|
942
|
-
assertContext,
|
|
943
|
-
assertGoal,
|
|
944
|
-
{
|
|
945
|
-
kind: "Suffices",
|
|
946
|
-
sequent: { context: hyps, active: shiftExpr(hyps.length, assertGoal) },
|
|
947
|
-
proof: { kind: "Omitted", omission: "Elsewhere", ...getProps(step) },
|
|
948
|
-
...getProps(step),
|
|
949
|
-
},
|
|
950
|
-
assertTime,
|
|
951
|
-
);
|
|
952
|
-
return [nextContext, nextGoal, [...asserted, ...sufficed], nextTime];
|
|
953
|
-
}
|
|
954
|
-
}
|
|
955
|
-
};
|
|
956
|
-
|
|
957
|
-
const getSalted = (step: StepNumber | undefined, salt: string): StepNumber => ({
|
|
958
|
-
kind: "Named",
|
|
959
|
-
level: getLevel(step),
|
|
960
|
-
label: `${step?.kind === "Named" ? step.label : "_a"}${salt}${getUnique(counter)}`,
|
|
961
|
-
isAnonymous: false,
|
|
962
|
-
});
|
|
963
|
-
|
|
964
|
-
const getTakeSuffices = (context: Hyp[], goal: Expr, step: Step & { kind: "Take" }): Step => {
|
|
965
|
-
const bounds = expandDittoes(step.bounds);
|
|
966
|
-
const stripBounds = (
|
|
967
|
-
amount: number,
|
|
968
|
-
aux: Expr[],
|
|
969
|
-
current: Expr,
|
|
970
|
-
rest: Bound[],
|
|
971
|
-
): { aux: Expr[]; goal: Expr } | string => {
|
|
972
|
-
const bound = rest[0];
|
|
973
|
-
if (!bound) return { aux, goal: current };
|
|
974
|
-
const exposed = exposeConnective(context, current);
|
|
975
|
-
if (
|
|
976
|
-
exposed.kind !== "Quant" ||
|
|
977
|
-
exposed.quantifier !== "Forall" ||
|
|
978
|
-
exposed.bounds.length === 0
|
|
979
|
-
) {
|
|
980
|
-
return getMessage(
|
|
981
|
-
"@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.",
|
|
982
|
-
"Error: this TAKE step is applied to the following goal,",
|
|
983
|
-
"which is not a universal formula:",
|
|
984
|
-
printExpression(context, current),
|
|
985
|
-
);
|
|
986
|
-
}
|
|
987
|
-
const goalBound = exposed.bounds[0];
|
|
988
|
-
const goalBounds = expandDittoes(exposed.bounds).slice(1);
|
|
989
|
-
const domain = bound.domain;
|
|
990
|
-
const goalDomain = goalBound.domain;
|
|
991
|
-
if (domain.kind === "NoDomain" && goalDomain.kind === "Domain") {
|
|
992
|
-
return getMessage(
|
|
993
|
-
"@.@[<b0>%s (%s)@ %s (%s \\in %a)@]@.",
|
|
994
|
-
"Error: the TAKE argument",
|
|
995
|
-
bound.name,
|
|
996
|
-
"does not match the pattern",
|
|
997
|
-
goalBound.name,
|
|
998
|
-
printExpression(context, goalDomain.expression),
|
|
999
|
-
);
|
|
1000
|
-
}
|
|
1001
|
-
if (domain.kind === "Domain" && goalDomain.kind === "NoDomain") {
|
|
1002
|
-
return getMessage(
|
|
1003
|
-
"@.@[<b0>%s (%s \\in %a)@ %s (%s)@]@.",
|
|
1004
|
-
"Error: the TAKE argument",
|
|
1005
|
-
bound.name,
|
|
1006
|
-
printExpression(context, domain.expression),
|
|
1007
|
-
"does not match the pattern",
|
|
1008
|
-
goalBound.name,
|
|
1009
|
-
);
|
|
1010
|
-
}
|
|
1011
|
-
const nextAux =
|
|
1012
|
-
domain.kind === "Domain" &&
|
|
1013
|
-
goalDomain.kind === "Domain" &&
|
|
1014
|
-
!isEqualExpr(domain.expression, goalDomain.expression)
|
|
1015
|
-
? [
|
|
1016
|
-
{
|
|
1017
|
-
kind: "Apply",
|
|
1018
|
-
operator: { kind: "Internal", builtin: "Subseteq" },
|
|
1019
|
-
args: [goalDomain.expression, domain.expression],
|
|
1020
|
-
} satisfies Expr,
|
|
1021
|
-
...aux,
|
|
1022
|
-
]
|
|
1023
|
-
: aux;
|
|
1024
|
-
if (goalBounds.length === 0) return stripBounds(1, nextAux, exposed.body, rest.slice(1));
|
|
1025
|
-
const shiftedBounds =
|
|
1026
|
-
rest.length === 1
|
|
1027
|
-
? goalBounds.map((item) => substituteBounds(shift(amount), [item])[1][0])
|
|
1028
|
-
: goalBounds;
|
|
1029
|
-
return stripBounds(
|
|
1030
|
-
amount + 1,
|
|
1031
|
-
nextAux,
|
|
1032
|
-
at(
|
|
1033
|
-
{ kind: "Quant", quantifier: "Forall", bounds: shiftedBounds, body: exposed.body },
|
|
1034
|
-
exposed,
|
|
1035
|
-
),
|
|
1036
|
-
rest.slice(1),
|
|
1037
|
-
);
|
|
1038
|
-
};
|
|
1039
|
-
const stripped = stripBounds(1, [], goal, bounds);
|
|
1040
|
-
if (typeof stripped === "string") {
|
|
1041
|
-
return {
|
|
1042
|
-
kind: "Suffices",
|
|
1043
|
-
sequent: {
|
|
1044
|
-
context: [
|
|
1045
|
-
{
|
|
1046
|
-
kind: "Fact",
|
|
1047
|
-
expression: getTrue(goal),
|
|
1048
|
-
visibility: "Visible",
|
|
1049
|
-
time: "Now",
|
|
1050
|
-
location: step.location,
|
|
1051
|
-
},
|
|
1052
|
-
],
|
|
1053
|
-
active: goal,
|
|
1054
|
-
},
|
|
1055
|
-
proof: { kind: "Error", message: stripped, ...getProps(step) },
|
|
1056
|
-
...getProps(step),
|
|
1057
|
-
};
|
|
1058
|
-
}
|
|
1059
|
-
const unique = stripped.aux.filter(
|
|
1060
|
-
(item, index) => stripped.aux.findIndex((other) => isEqualExpr(item, other)) === index,
|
|
1061
|
-
);
|
|
1062
|
-
const facts = [at({ kind: "Ix", index: 2 }, step), ...unique.map((item) => shiftExpr(2, item))];
|
|
1063
|
-
return {
|
|
1064
|
-
kind: "Suffices",
|
|
1065
|
-
sequent: { context: getBoundHyps(bounds), active: stripped.goal },
|
|
1066
|
-
proof: { kind: "By", usable: { facts, defs: [] }, isOnly: true, ...getProps(step) },
|
|
1067
|
-
...getProps(step),
|
|
1068
|
-
};
|
|
1069
|
-
};
|
|
1070
|
-
|
|
1071
|
-
const getWitnessSuffices = (
|
|
1072
|
-
context: Hyp[],
|
|
1073
|
-
goal: Expr,
|
|
1074
|
-
step: Step & { kind: "Witness" },
|
|
1075
|
-
): Step => {
|
|
1076
|
-
const aux: Expr[] = [];
|
|
1077
|
-
let error = "";
|
|
1078
|
-
let current = goal;
|
|
1079
|
-
for (const witness of step.expressions) {
|
|
1080
|
-
const exposed = exposeConnective(context, current);
|
|
1081
|
-
if (
|
|
1082
|
-
exposed.kind !== "Quant" ||
|
|
1083
|
-
exposed.quantifier !== "Exists" ||
|
|
1084
|
-
exposed.bounds.length === 0
|
|
1085
|
-
) {
|
|
1086
|
-
error ||= getMessage(
|
|
1087
|
-
"@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.",
|
|
1088
|
-
"Error: this WITNESS step is applied to the following goal,",
|
|
1089
|
-
"which is not an existential formula:",
|
|
1090
|
-
printExpression(context, exposed),
|
|
1091
|
-
);
|
|
1092
|
-
current = exposed;
|
|
1093
|
-
break;
|
|
1094
|
-
}
|
|
1095
|
-
const [first, ...rest] = exposed.bounds;
|
|
1096
|
-
const next =
|
|
1097
|
-
rest.length === 0
|
|
1098
|
-
? exposed.body
|
|
1099
|
-
: at(
|
|
1100
|
-
{
|
|
1101
|
-
kind: "Quant",
|
|
1102
|
-
quantifier: "Exists",
|
|
1103
|
-
bounds: getRemainingBounds(first, rest),
|
|
1104
|
-
body: exposed.body,
|
|
1105
|
-
},
|
|
1106
|
-
exposed,
|
|
1107
|
-
);
|
|
1108
|
-
let value = witness;
|
|
1109
|
-
if (first.domain.kind === "Domain") {
|
|
1110
|
-
const domain = first.domain.expression;
|
|
1111
|
-
const membership = exposeConnective(context, witness);
|
|
1112
|
-
if (isBinary(membership, "Mem")) {
|
|
1113
|
-
const [term, termDomain] = membership.args;
|
|
1114
|
-
const subset = isEqualExpr(termDomain, domain)
|
|
1115
|
-
? []
|
|
1116
|
-
: [applyBuiltin("Subseteq", [termDomain, domain], termDomain)];
|
|
1117
|
-
aux.push(...subset, membership);
|
|
1118
|
-
value = term;
|
|
1119
|
-
} else {
|
|
1120
|
-
error ||= getMessage(
|
|
1121
|
-
"@.@[<b0>%s (%a)@ %s (%s \\in %a)@]@.",
|
|
1122
|
-
"Error: the WITNESS argument",
|
|
1123
|
-
printExpression(context, membership),
|
|
1124
|
-
"does not match the pattern",
|
|
1125
|
-
first.name,
|
|
1126
|
-
printExpression(context, domain),
|
|
409
|
+
module: Mule,
|
|
410
|
+
): { obligations: Obligation[]; summary: ModuleSummary } => {
|
|
411
|
+
const obligations: Obligation[] = [];
|
|
412
|
+
const theorems: TheoremSummary[] = [];
|
|
413
|
+
let summary = EMPTY_SUMMARY;
|
|
414
|
+
let current = context;
|
|
415
|
+
for (const unit of module.body) {
|
|
416
|
+
switch (unit.kind) {
|
|
417
|
+
case "Theorem": {
|
|
418
|
+
const binding = bindTheoremName(unit.name, unit.sequent, unit.location);
|
|
419
|
+
const named = [...current, ...binding.hyps];
|
|
420
|
+
const context = [...named, ...binding.sequent.context];
|
|
421
|
+
const proof = generate(
|
|
422
|
+
{ context, active: binding.sequent.active },
|
|
423
|
+
unit.proof,
|
|
424
|
+
getScopeTime(context, "Always"),
|
|
1127
425
|
);
|
|
1128
|
-
|
|
426
|
+
obligations.push(...collect(proof));
|
|
427
|
+
const theorem = getProofSummary(proof);
|
|
428
|
+
theorems.push({ ...theorem, location: unit.location });
|
|
429
|
+
summary = joinSummaries(summary, theorem);
|
|
430
|
+
const fact: Expr =
|
|
431
|
+
unit.name === undefined
|
|
432
|
+
? at(exprifySequent(unit.sequent), unit)
|
|
433
|
+
: { kind: "Ix", index: 1, location: unit.location };
|
|
434
|
+
current = [...named, getFact(fact, "Hidden", "Always", unit.location)];
|
|
435
|
+
continue;
|
|
436
|
+
}
|
|
437
|
+
case "Submod": {
|
|
438
|
+
const generated = generateModule(current, unit.module);
|
|
439
|
+
obligations.push(...generated.obligations);
|
|
440
|
+
summary = joinSummaries(summary, generated.summary);
|
|
441
|
+
continue;
|
|
1129
442
|
}
|
|
443
|
+
case "Mutate": {
|
|
444
|
+
const [next, generated] = mutate(current, unit.mode, unit.usable, unit.location);
|
|
445
|
+
obligations.push(...generated);
|
|
446
|
+
current = next;
|
|
447
|
+
continue;
|
|
448
|
+
}
|
|
449
|
+
default:
|
|
450
|
+
current = [...current, ...getUnitHyps(unit)];
|
|
1130
451
|
}
|
|
1131
|
-
const unprimable = applyBuiltin("Unprimable", [value], value);
|
|
1132
|
-
current = substituteExpr(consSubstitution(unprimable, shift(0)), next);
|
|
1133
452
|
}
|
|
1134
|
-
|
|
1135
|
-
error === ""
|
|
1136
|
-
? getWitnessProof(step, aux)
|
|
1137
|
-
: { kind: "Error", message: error, ...getProps(step) };
|
|
1138
|
-
return {
|
|
1139
|
-
kind: "Suffices",
|
|
1140
|
-
sequent: { context: [], active: current },
|
|
1141
|
-
proof,
|
|
1142
|
-
...getProps(step),
|
|
1143
|
-
};
|
|
453
|
+
return { obligations, summary: { ...summary, theorems } };
|
|
1144
454
|
};
|
|
1145
455
|
|
|
1146
|
-
return
|
|
456
|
+
return generateModule;
|
|
1147
457
|
};
|