tla-ts 0.0.9 → 0.0.10-dev.06b481ee0
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +48 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +122 -12
- package/dist/index.d.ts +122 -12
- 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 +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1156 -888
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +330 -659
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +263 -370
- package/src/errors.ts +107 -57
- package/src/evaluate.ts +898 -369
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +137 -22
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -322
- package/src/liveness.ts +230 -133
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +121 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +36 -60
- package/src/parallel.ts +64 -73
- package/src/parser.ts +1184 -531
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +34 -77
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +4 -47
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +26 -31
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +626 -56
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +179 -28
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +30 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +113 -133
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +92 -136
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +261 -79
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +41 -51
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +22 -32
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +135 -40
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +2141 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +74 -48
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +299 -108
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +945 -526
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,665 @@
|
|
|
1
|
+
import type {
|
|
2
|
+
AssumeProve,
|
|
3
|
+
Assumption,
|
|
4
|
+
Expression,
|
|
5
|
+
Fact,
|
|
6
|
+
NewSymbol,
|
|
7
|
+
Proof,
|
|
8
|
+
ProofStep,
|
|
9
|
+
Theorem,
|
|
10
|
+
UseOrHide,
|
|
11
|
+
} from "../ast";
|
|
12
|
+
import { TlaSyntaxError } from "../errors";
|
|
13
|
+
import { createLevelFields } from "./builtins";
|
|
14
|
+
import {
|
|
15
|
+
addToContext,
|
|
16
|
+
type AssumeNode,
|
|
17
|
+
type AssumeProveNode,
|
|
18
|
+
type Context,
|
|
19
|
+
createContext,
|
|
20
|
+
type DefStepNode,
|
|
21
|
+
type ExprOrOpArgNode,
|
|
22
|
+
type FactNode,
|
|
23
|
+
type FormalParamNode,
|
|
24
|
+
type InstanceNode,
|
|
25
|
+
type LabelNode,
|
|
26
|
+
type LeafProofNode,
|
|
27
|
+
type LevelNode,
|
|
28
|
+
NEW_CONSTANT_KIND,
|
|
29
|
+
type NewSymbNode,
|
|
30
|
+
type NonLeafProofNode,
|
|
31
|
+
type OpDeclNode,
|
|
32
|
+
type OpDefNode,
|
|
33
|
+
type ProofStepNode,
|
|
34
|
+
type SanyLocation,
|
|
35
|
+
type TheoremNode,
|
|
36
|
+
type ThmOrAssumpDefNode,
|
|
37
|
+
type UseOrHideNode,
|
|
38
|
+
} from "./nodes";
|
|
39
|
+
import { getSelectorItems, isGeneralId } from "./selectors";
|
|
40
|
+
import {
|
|
41
|
+
findNameTokens,
|
|
42
|
+
getExpressionSpan,
|
|
43
|
+
getRangeSpan,
|
|
44
|
+
getSpanLocation,
|
|
45
|
+
getTokenIndex,
|
|
46
|
+
getTokenLocation,
|
|
47
|
+
isBoxToken,
|
|
48
|
+
isToken,
|
|
49
|
+
type SourceFile,
|
|
50
|
+
type TokenSpan,
|
|
51
|
+
} from "./source";
|
|
52
|
+
import {
|
|
53
|
+
addSymbol,
|
|
54
|
+
applyBuiltin,
|
|
55
|
+
type AssumeProveScope,
|
|
56
|
+
createFormalParam,
|
|
57
|
+
createOpAppl,
|
|
58
|
+
createOpDef,
|
|
59
|
+
endProof,
|
|
60
|
+
getLocation,
|
|
61
|
+
getTopContext,
|
|
62
|
+
getUnitLocation,
|
|
63
|
+
getUnitSpan,
|
|
64
|
+
type ModuleGeneration,
|
|
65
|
+
popLabels,
|
|
66
|
+
pushLabelScope,
|
|
67
|
+
resolveModule,
|
|
68
|
+
resolveName,
|
|
69
|
+
withContext,
|
|
70
|
+
} from "./generation";
|
|
71
|
+
import { resolveSynonym } from "../tlc/jar-data";
|
|
72
|
+
import { getOperandSpan, reportDefEntry } from "./generator-def-entries";
|
|
73
|
+
import {
|
|
74
|
+
generateInstance,
|
|
75
|
+
getOperatorSpan,
|
|
76
|
+
processFunction,
|
|
77
|
+
processModuleDefinition,
|
|
78
|
+
processOperator,
|
|
79
|
+
} from "./generator-definitions";
|
|
80
|
+
import {
|
|
81
|
+
findNameOrKeyword,
|
|
82
|
+
generateBounds,
|
|
83
|
+
generateExpression,
|
|
84
|
+
generateSelector,
|
|
85
|
+
generateWithParams,
|
|
86
|
+
} from "./generator-expressions";
|
|
87
|
+
|
|
88
|
+
const NEW_SYMBOL_KINDS = {
|
|
89
|
+
Constant: { declKind: NEW_CONSTANT_KIND, level: 0 },
|
|
90
|
+
Variable: { declKind: 25, level: 1 },
|
|
91
|
+
State: { declKind: 26, level: 1 },
|
|
92
|
+
Action: { declKind: 27, level: 2 },
|
|
93
|
+
Temporal: { declKind: 28, level: 3 },
|
|
94
|
+
};
|
|
95
|
+
|
|
96
|
+
const getFactModules = (generation: ModuleGeneration, fact: Fact & { kind: "ModuleFact" }) => {
|
|
97
|
+
const module =
|
|
98
|
+
resolveModule(generation, fact.name) ??
|
|
99
|
+
(fact.name === generation.currentModule.name ? generation.currentModule : undefined);
|
|
100
|
+
if (module !== undefined) return [module];
|
|
101
|
+
generation.addError(
|
|
102
|
+
getTokenLocation(generation.file, getTokenIndex(generation.file, fact.location) + 1),
|
|
103
|
+
`Module \`${fact.name}' used without being extended or instantiated.`,
|
|
104
|
+
);
|
|
105
|
+
return [];
|
|
106
|
+
};
|
|
107
|
+
|
|
108
|
+
const generateFacts = (generation: ModuleGeneration, facts: Fact[]) =>
|
|
109
|
+
facts.flatMap((fact): FactNode[] => {
|
|
110
|
+
if (fact.kind === "ModuleFact") return getFactModules(generation, fact);
|
|
111
|
+
const reference: Expression =
|
|
112
|
+
fact.kind === "ExceptAt" ? { kind: "Identifier", name: "@", location: fact.location } : fact;
|
|
113
|
+
const items = getSelectorItems(reference);
|
|
114
|
+
if (items === undefined || !isGeneralId(items)) return [generateExpression(generation, fact)];
|
|
115
|
+
const node = generateSelector(generation, reference, 0, true, false);
|
|
116
|
+
if (node.kind === "ThmOrAssumpDef") throw new TlaSyntaxError("Expected a fact");
|
|
117
|
+
return [node];
|
|
118
|
+
});
|
|
119
|
+
|
|
120
|
+
const generateDefs = (generation: ModuleGeneration, defs: Fact[]) =>
|
|
121
|
+
defs.flatMap((fact): UseOrHideNode["defs"] => {
|
|
122
|
+
if (fact.kind === "ModuleFact") return getFactModules(generation, fact);
|
|
123
|
+
if (reportDefEntry(generation, fact)) return [];
|
|
124
|
+
const symbol = generateSelector(
|
|
125
|
+
generation,
|
|
126
|
+
fact.kind === "OperatorReference"
|
|
127
|
+
? { kind: "Identifier", name: fact.operator, location: fact.location }
|
|
128
|
+
: fact,
|
|
129
|
+
-1,
|
|
130
|
+
false,
|
|
131
|
+
true,
|
|
132
|
+
);
|
|
133
|
+
const isDefinition =
|
|
134
|
+
symbol.kind === "OpDef" || (symbol.kind === "ThmOrAssumpDef" && !symbol.name.startsWith("<"));
|
|
135
|
+
if (!isDefinition) {
|
|
136
|
+
generation.addError(
|
|
137
|
+
getLocation(generation.file, fact),
|
|
138
|
+
"DEF clause entry should describe a defined operator.",
|
|
139
|
+
);
|
|
140
|
+
return [];
|
|
141
|
+
}
|
|
142
|
+
return [symbol];
|
|
143
|
+
});
|
|
144
|
+
|
|
145
|
+
const checkKeywordOnly = (
|
|
146
|
+
generation: ModuleGeneration,
|
|
147
|
+
statement: UseOrHide | Extract<Proof, { kind: "By" }>,
|
|
148
|
+
location: SanyLocation,
|
|
149
|
+
) => {
|
|
150
|
+
if (statement.isOnly || statement.facts.length + statement.defs.length > 0) return;
|
|
151
|
+
generation.addError(location, "Empty BY, USE, or HIDE");
|
|
152
|
+
};
|
|
153
|
+
|
|
154
|
+
export const generateUseOrHide = (generation: ModuleGeneration, use: UseOrHide): UseOrHideNode => {
|
|
155
|
+
const location = getUnitLocation(generation.file, use.location);
|
|
156
|
+
checkKeywordOnly(generation, use, location);
|
|
157
|
+
const facts = generateFacts(generation, use.facts);
|
|
158
|
+
const defs = generateDefs(generation, use.defs);
|
|
159
|
+
if (facts.length + defs.length === 0)
|
|
160
|
+
generation.addError(location, "Empty USE or HIDE statement.");
|
|
161
|
+
if (use.kind === "Hide") {
|
|
162
|
+
// Deviation from SANY: UseOrHideNode#factCheck crashes on a fact whose operator Generator#generateExpression could not resolve, where tla-ts reports it like a null node.
|
|
163
|
+
facts
|
|
164
|
+
.filter((fact) => fact.kind === "OpAppl" && fact.operator.kind !== "ThmOrAssumpDef")
|
|
165
|
+
.forEach((fact) =>
|
|
166
|
+
generation.addError(
|
|
167
|
+
fact.location,
|
|
168
|
+
"The only expression allowed as a fact in a HIDE is \nthe name of a theorem, assumption, or step.",
|
|
169
|
+
),
|
|
170
|
+
);
|
|
171
|
+
}
|
|
172
|
+
return {
|
|
173
|
+
...createLevelFields(generation.getId()),
|
|
174
|
+
kind: "UseOrHide",
|
|
175
|
+
facts,
|
|
176
|
+
defs,
|
|
177
|
+
isOnly: use.isOnly,
|
|
178
|
+
isHide: use.kind === "Hide",
|
|
179
|
+
location,
|
|
180
|
+
};
|
|
181
|
+
};
|
|
182
|
+
|
|
183
|
+
const generateNewSymbol = (generation: ModuleGeneration, symbol: NewSymbol): NewSymbNode => {
|
|
184
|
+
const span = getUnitSpan(generation.file, symbol.location);
|
|
185
|
+
const set = symbol.set && generateExpression(generation, symbol.set);
|
|
186
|
+
const nameIndex = findNameOrKeyword(generation.file, span.start, symbol.name);
|
|
187
|
+
const kind = NEW_SYMBOL_KINDS[symbol.level];
|
|
188
|
+
const declaration: OpDeclNode = {
|
|
189
|
+
...createLevelFields(generation.getId()),
|
|
190
|
+
levelChecked: 1,
|
|
191
|
+
level: kind.level,
|
|
192
|
+
kind: "OpDecl",
|
|
193
|
+
name: resolveSynonym(symbol.name),
|
|
194
|
+
arity: symbol.arity,
|
|
195
|
+
declKind: kind.declKind,
|
|
196
|
+
location: getSpanLocation(
|
|
197
|
+
generation.file,
|
|
198
|
+
getOperatorSpan(generation.file, nameIndex, symbol.arity),
|
|
199
|
+
),
|
|
200
|
+
module: generation.currentModule,
|
|
201
|
+
};
|
|
202
|
+
addSymbol(generation, declaration);
|
|
203
|
+
return {
|
|
204
|
+
...createLevelFields(generation.getId()),
|
|
205
|
+
kind: "NewSymb",
|
|
206
|
+
declaration,
|
|
207
|
+
set,
|
|
208
|
+
location: getSpanLocation(generation.file, span),
|
|
209
|
+
};
|
|
210
|
+
};
|
|
211
|
+
|
|
212
|
+
const generateAssumeProve = (
|
|
213
|
+
generation: ModuleGeneration,
|
|
214
|
+
assumeProve: AssumeProve,
|
|
215
|
+
depth: number,
|
|
216
|
+
goal?: { isSuffices: boolean },
|
|
217
|
+
): AssumeProveNode => {
|
|
218
|
+
const span = getUnitSpan(generation.file, assumeProve.location);
|
|
219
|
+
const isBoxed = isBoxToken(generation.file, span.start - 1);
|
|
220
|
+
const conclusionStart = getExpressionSpan(generation.file, assumeProve.conclusion).start;
|
|
221
|
+
const proveIndex = generation.file.tokens.findLastIndex(
|
|
222
|
+
(token, index) => index < conclusionStart && token.kind === "Keyword" && token.text === "PROVE",
|
|
223
|
+
);
|
|
224
|
+
const assumeLocation = getSpanLocation(generation.file, {
|
|
225
|
+
start: isBoxed ? span.start - 1 : span.start,
|
|
226
|
+
end: span.start,
|
|
227
|
+
});
|
|
228
|
+
if (isBoxed !== isBoxToken(generation.file, proveIndex - 1)) {
|
|
229
|
+
generation.addError(
|
|
230
|
+
assumeLocation,
|
|
231
|
+
isBoxed
|
|
232
|
+
? "[]ASSUME matched by PROVE instead of []PROVE"
|
|
233
|
+
: "ASSUME matched by []PROVE instead of PROVE",
|
|
234
|
+
);
|
|
235
|
+
}
|
|
236
|
+
// SANY numbers the AssumeProveNode before it generates its clauses.
|
|
237
|
+
const id = generation.getId();
|
|
238
|
+
if (depth > 1) generation.contexts.push(createContext());
|
|
239
|
+
if (isBoxed && generation.contexts.some((context) => generation.assumeContexts.has(context))) {
|
|
240
|
+
generation.addError(
|
|
241
|
+
assumeLocation,
|
|
242
|
+
"[]ASSUME used within the scope of an ordinary ASSUME's assumptions",
|
|
243
|
+
);
|
|
244
|
+
}
|
|
245
|
+
if (!isBoxed) generation.assumeContexts.add(getTopContext(generation.contexts));
|
|
246
|
+
const scope: AssumeProveScope = {
|
|
247
|
+
isDeclaredBefore: [false],
|
|
248
|
+
hasGoal: goal !== undefined,
|
|
249
|
+
isSuffices: goal?.isSuffices ?? false,
|
|
250
|
+
isInProof: true,
|
|
251
|
+
};
|
|
252
|
+
generation.assumeProveState.depth = depth;
|
|
253
|
+
generation.assumeProveState.isDeclared[depth] = false;
|
|
254
|
+
if (depth === 1) {
|
|
255
|
+
generation.assumeProveState.goal = goal && scope;
|
|
256
|
+
generation.assumeProveState.goalClause = 0;
|
|
257
|
+
}
|
|
258
|
+
const assumptions = assumeProve.assumptions.map((assumption, index): LevelNode => {
|
|
259
|
+
const isNew = assumption.kind === "NewSymbol";
|
|
260
|
+
const node =
|
|
261
|
+
assumption.kind === "AssumeProve"
|
|
262
|
+
? generateAssumeProve(generation, assumption, depth + 1)
|
|
263
|
+
: isNew
|
|
264
|
+
? generateNewSymbol(generation, assumption)
|
|
265
|
+
: generateExpression(generation, assumption);
|
|
266
|
+
generation.assumeProveState.depth = depth;
|
|
267
|
+
if (isNew) generation.assumeProveState.isDeclared[depth] = true;
|
|
268
|
+
scope.isDeclaredBefore.push(scope.isDeclaredBefore[index] || isNew);
|
|
269
|
+
if (depth === 1) generation.assumeProveState.goalClause++;
|
|
270
|
+
return node;
|
|
271
|
+
});
|
|
272
|
+
const conclusion = generateExpression(generation, assumeProve.conclusion);
|
|
273
|
+
if (depth > 1) generation.contexts.pop();
|
|
274
|
+
generation.assumeProveState.depth = depth - 1;
|
|
275
|
+
if (depth === 1) generation.assumeProveState.goal = undefined;
|
|
276
|
+
const node: AssumeProveNode = {
|
|
277
|
+
...createLevelFields(id),
|
|
278
|
+
kind: "AssumeProve",
|
|
279
|
+
assumptions,
|
|
280
|
+
goal: conclusion,
|
|
281
|
+
isSuffices: scope.isSuffices,
|
|
282
|
+
isBoxed,
|
|
283
|
+
location: getSpanLocation(generation.file, {
|
|
284
|
+
start: isBoxed ? span.start - 1 : span.start,
|
|
285
|
+
end: span.end,
|
|
286
|
+
}),
|
|
287
|
+
};
|
|
288
|
+
generation.assumeProveScopes.set(node, scope);
|
|
289
|
+
return node;
|
|
290
|
+
};
|
|
291
|
+
|
|
292
|
+
const createTheoremDefinition = (
|
|
293
|
+
generation: ModuleGeneration,
|
|
294
|
+
id: number,
|
|
295
|
+
name: string,
|
|
296
|
+
body: LevelNode,
|
|
297
|
+
location: SanyLocation,
|
|
298
|
+
labels: Map<string, LabelNode>,
|
|
299
|
+
isTheorem = true,
|
|
300
|
+
): ThmOrAssumpDefNode => ({
|
|
301
|
+
...createLevelFields(id),
|
|
302
|
+
kind: "ThmOrAssumpDef",
|
|
303
|
+
name,
|
|
304
|
+
isTheorem,
|
|
305
|
+
body,
|
|
306
|
+
params: [],
|
|
307
|
+
isLocal: false,
|
|
308
|
+
location,
|
|
309
|
+
module: generation.currentModule,
|
|
310
|
+
source: undefined,
|
|
311
|
+
labels,
|
|
312
|
+
isLeibnizArg: [],
|
|
313
|
+
isLeibniz: false,
|
|
314
|
+
opLevelCond: [],
|
|
315
|
+
maxLevels: [],
|
|
316
|
+
minMaxLevel: [],
|
|
317
|
+
});
|
|
318
|
+
|
|
319
|
+
const generateLeafProof = (
|
|
320
|
+
generation: ModuleGeneration,
|
|
321
|
+
proof: Exclude<Proof, { kind: "Steps" }>,
|
|
322
|
+
): LeafProofNode => {
|
|
323
|
+
const location = getUnitLocation(generation.file, proof.location);
|
|
324
|
+
if (proof.kind === "By") checkKeywordOnly(generation, proof, location);
|
|
325
|
+
const facts = proof.kind === "By" ? generateFacts(generation, proof.facts) : [];
|
|
326
|
+
const defs = proof.kind === "By" ? generateDefs(generation, proof.defs) : [];
|
|
327
|
+
// The UseOrHideNode SANY makes of a BY proof's facts and definitions.
|
|
328
|
+
if (proof.kind === "By") generation.getId();
|
|
329
|
+
if (proof.kind === "By" && facts.length + defs.length === 0)
|
|
330
|
+
generation.addError(location, "Empty BY");
|
|
331
|
+
return {
|
|
332
|
+
...createLevelFields(generation.getId()),
|
|
333
|
+
kind: "LeafProof",
|
|
334
|
+
facts,
|
|
335
|
+
defs,
|
|
336
|
+
isOmitted: proof.kind === "Omitted",
|
|
337
|
+
isOnly: proof.kind === "By" && proof.isOnly,
|
|
338
|
+
location,
|
|
339
|
+
};
|
|
340
|
+
};
|
|
341
|
+
|
|
342
|
+
const generateStepBody = (
|
|
343
|
+
generation: ModuleGeneration,
|
|
344
|
+
body: ProofStep["body"],
|
|
345
|
+
bodySpan: TokenSpan,
|
|
346
|
+
) => {
|
|
347
|
+
const bodyLocation = getSpanLocation(generation.file, bodySpan);
|
|
348
|
+
switch (body.kind) {
|
|
349
|
+
case "Have":
|
|
350
|
+
return applyBuiltin(
|
|
351
|
+
generation,
|
|
352
|
+
"$Have",
|
|
353
|
+
[generateExpression(generation, body.expression)],
|
|
354
|
+
bodyLocation,
|
|
355
|
+
);
|
|
356
|
+
case "Case":
|
|
357
|
+
return applyBuiltin(
|
|
358
|
+
generation,
|
|
359
|
+
"$Pfcase",
|
|
360
|
+
[generateExpression(generation, body.expression)],
|
|
361
|
+
bodyLocation,
|
|
362
|
+
);
|
|
363
|
+
case "Witness":
|
|
364
|
+
return applyBuiltin(
|
|
365
|
+
generation,
|
|
366
|
+
"$Witness",
|
|
367
|
+
body.expressions.map((witness) => generateExpression(generation, witness)),
|
|
368
|
+
bodyLocation,
|
|
369
|
+
);
|
|
370
|
+
case "Qed":
|
|
371
|
+
return applyBuiltin(generation, "$Qed", [], bodyLocation);
|
|
372
|
+
case "Take":
|
|
373
|
+
case "Pick": {
|
|
374
|
+
const isPick = body.kind === "Pick";
|
|
375
|
+
const name = isPick ? "$Pick" : "$Take";
|
|
376
|
+
if (isPick) generation.contexts.push(createContext());
|
|
377
|
+
const getOperands = (params: FormalParamNode[]) =>
|
|
378
|
+
body.kind === "Pick" ? [generateWithParams(generation, params, body.body)] : [];
|
|
379
|
+
if (body.bounds.length > 0) {
|
|
380
|
+
const bounds = generateBounds(generation, body.bounds, bodySpan.start);
|
|
381
|
+
const operands = getOperands(bounds.bounded.flat());
|
|
382
|
+
return applyBuiltin(generation, name, operands, bodyLocation, bounds);
|
|
383
|
+
}
|
|
384
|
+
const indexes = findNameTokens(generation.file, bodySpan.start, bodySpan.end + 1, body.names);
|
|
385
|
+
const unbounded = body.names.map((paramName, index) =>
|
|
386
|
+
createFormalParam(
|
|
387
|
+
generation,
|
|
388
|
+
paramName,
|
|
389
|
+
0,
|
|
390
|
+
getTokenLocation(generation.file, indexes[index]),
|
|
391
|
+
true,
|
|
392
|
+
),
|
|
393
|
+
);
|
|
394
|
+
const operands = getOperands(unbounded);
|
|
395
|
+
return applyBuiltin(generation, name, operands, bodyLocation, { unbounded });
|
|
396
|
+
}
|
|
397
|
+
}
|
|
398
|
+
return undefined;
|
|
399
|
+
};
|
|
400
|
+
|
|
401
|
+
const isInfixExpression = (file: SourceFile, expression: Expression) => {
|
|
402
|
+
if ((expression.kind === "And" || expression.kind === "Or") && !expression.isBulleted)
|
|
403
|
+
return true;
|
|
404
|
+
if (expression.kind !== "Apply" || expression.args.length !== 2) return false;
|
|
405
|
+
const left = getOperandSpan(file, expression.args[0]);
|
|
406
|
+
const start = getExpressionSpan(file, expression).start;
|
|
407
|
+
return left.start === start && !isToken(file, left.end + 1, "(");
|
|
408
|
+
};
|
|
409
|
+
|
|
410
|
+
const generateProof = (
|
|
411
|
+
generation: ModuleGeneration,
|
|
412
|
+
proof: Proof,
|
|
413
|
+
): LeafProofNode | NonLeafProofNode => {
|
|
414
|
+
if (proof.kind !== "Steps") return generateLeafProof(generation, proof);
|
|
415
|
+
const proofContext = createContext();
|
|
416
|
+
generation.contexts.push(proofContext);
|
|
417
|
+
const instances: InstanceNode[] = [];
|
|
418
|
+
const sufficesContexts: Context[] = [];
|
|
419
|
+
let previousRight: ExprOrOpArgNode | undefined;
|
|
420
|
+
const generateOtherStep = (
|
|
421
|
+
body: ProofStep["body"],
|
|
422
|
+
stepSpan: TokenSpan,
|
|
423
|
+
bodySpan: TokenSpan,
|
|
424
|
+
): DefStepNode | UseOrHideNode | InstanceNode | undefined => {
|
|
425
|
+
if (body.kind === "Define") {
|
|
426
|
+
const defs = body.definitions.map((definition) => {
|
|
427
|
+
const defined: (OpDefNode | ThmOrAssumpDefNode)[] = [];
|
|
428
|
+
if (definition.kind === "Instance")
|
|
429
|
+
processModuleDefinition(generation, definition, defined, instances);
|
|
430
|
+
else if (definition.kind === "Function") processFunction(generation, definition, defined);
|
|
431
|
+
else processOperator(generation, definition, defined);
|
|
432
|
+
const last = defined[definition.kind === "Instance" ? defined.length - 1 : 0];
|
|
433
|
+
if (last?.kind !== "OpDef") throw new TlaSyntaxError("A DEFINE step defines no operator");
|
|
434
|
+
return last;
|
|
435
|
+
});
|
|
436
|
+
return {
|
|
437
|
+
...createLevelFields(generation.getId()),
|
|
438
|
+
kind: "DefStep",
|
|
439
|
+
defs,
|
|
440
|
+
location: getSpanLocation(generation.file, bodySpan),
|
|
441
|
+
};
|
|
442
|
+
}
|
|
443
|
+
if (body.kind === "Use" || body.kind === "Hide") {
|
|
444
|
+
return {
|
|
445
|
+
...generateUseOrHide(generation, body),
|
|
446
|
+
location: getSpanLocation(generation.file, stepSpan),
|
|
447
|
+
};
|
|
448
|
+
}
|
|
449
|
+
if (body.kind === "Instance") {
|
|
450
|
+
return generateInstance(generation, body, false, getSpanLocation(generation.file, bodySpan));
|
|
451
|
+
}
|
|
452
|
+
return undefined;
|
|
453
|
+
};
|
|
454
|
+
const steps = proof.steps.map((step): ProofStepNode => {
|
|
455
|
+
const stepSpan = getUnitSpan(generation.file, step.location);
|
|
456
|
+
const headSpan = getRangeSpan(generation.file, step.head);
|
|
457
|
+
const bodySpan = { start: headSpan.start + 1, end: headSpan.end };
|
|
458
|
+
const body = step.body;
|
|
459
|
+
if (step.name !== undefined && /^<[*+]>/.test(step.token)) {
|
|
460
|
+
generation.addError(
|
|
461
|
+
getTokenLocation(generation.file, stepSpan.start),
|
|
462
|
+
"<*> and <+> cannot be used for a named step.",
|
|
463
|
+
);
|
|
464
|
+
}
|
|
465
|
+
if (step.name !== undefined) pushLabelScope(generation);
|
|
466
|
+
const definitionId = step.name === undefined ? undefined : generation.getId();
|
|
467
|
+
if (body.kind !== "Assert") previousRight = undefined;
|
|
468
|
+
const otherStep = generateOtherStep(body, stepSpan, bodySpan);
|
|
469
|
+
if (otherStep !== undefined) {
|
|
470
|
+
if (step.name !== undefined) {
|
|
471
|
+
addSymbol(
|
|
472
|
+
generation,
|
|
473
|
+
createOpDef(generation, {
|
|
474
|
+
defKind: "NumberedProofStep",
|
|
475
|
+
name: step.name,
|
|
476
|
+
location: getSpanLocation(generation.file, stepSpan),
|
|
477
|
+
labels: popLabels(generation),
|
|
478
|
+
step: otherStep,
|
|
479
|
+
}),
|
|
480
|
+
);
|
|
481
|
+
}
|
|
482
|
+
return otherStep;
|
|
483
|
+
}
|
|
484
|
+
const isAssumeProve = body.kind === "Assert" && body.statement.kind === "AssumeProve";
|
|
485
|
+
if (isAssumeProve) previousRight = undefined;
|
|
486
|
+
const isSuffices = body.kind === "Assert" && body.isSuffices;
|
|
487
|
+
const assumeContext = createContext();
|
|
488
|
+
const generateAssertion = (statement: Expression | AssumeProve): LevelNode => {
|
|
489
|
+
if (statement.kind === "AssumeProve") {
|
|
490
|
+
const node = withContext(generation, assumeContext, () =>
|
|
491
|
+
generateAssumeProve(
|
|
492
|
+
generation,
|
|
493
|
+
statement,
|
|
494
|
+
1,
|
|
495
|
+
step.name === undefined ? undefined : { isSuffices },
|
|
496
|
+
),
|
|
497
|
+
);
|
|
498
|
+
node.isSuffices = isSuffices;
|
|
499
|
+
return node;
|
|
500
|
+
}
|
|
501
|
+
if (isSuffices) {
|
|
502
|
+
const expression = generateExpression(generation, statement);
|
|
503
|
+
return applyBuiltin(
|
|
504
|
+
generation,
|
|
505
|
+
"$Suffices",
|
|
506
|
+
[expression],
|
|
507
|
+
getSpanLocation(generation.file, bodySpan),
|
|
508
|
+
);
|
|
509
|
+
}
|
|
510
|
+
const isAtStep =
|
|
511
|
+
previousRight !== undefined &&
|
|
512
|
+
statement.kind === "Apply" &&
|
|
513
|
+
isInfixExpression(generation.file, statement) &&
|
|
514
|
+
statement.args[0].kind === "ExceptAt";
|
|
515
|
+
// SANY generates an @ step's right side before the $Nop that stands for its @.
|
|
516
|
+
const atRight = isAtStep ? generateExpression(generation, statement.args[1]) : undefined;
|
|
517
|
+
const expression = isAtStep
|
|
518
|
+
? createOpAppl(
|
|
519
|
+
generation,
|
|
520
|
+
resolveName(generation, statement.operator, getLocation(generation.file, statement)),
|
|
521
|
+
[
|
|
522
|
+
applyBuiltin(
|
|
523
|
+
generation,
|
|
524
|
+
"$Nop",
|
|
525
|
+
[previousRight],
|
|
526
|
+
getLocation(generation.file, statement.args[0]),
|
|
527
|
+
),
|
|
528
|
+
atRight,
|
|
529
|
+
],
|
|
530
|
+
getLocation(generation.file, statement),
|
|
531
|
+
)
|
|
532
|
+
: generateExpression(generation, statement);
|
|
533
|
+
const right = expression.kind === "OpAppl" ? expression.operands[1] : undefined;
|
|
534
|
+
previousRight = isInfixExpression(generation.file, statement) ? right : undefined;
|
|
535
|
+
return expression;
|
|
536
|
+
};
|
|
537
|
+
const stepBody =
|
|
538
|
+
body.kind === "Assert"
|
|
539
|
+
? generateAssertion(body.statement)
|
|
540
|
+
: generateStepBody(generation, body, bodySpan);
|
|
541
|
+
if (stepBody === undefined) throw new TlaSyntaxError(`Unexpected proof step ${body.kind}`);
|
|
542
|
+
const pickContext = body.kind === "Pick" ? generation.contexts.pop() : undefined;
|
|
543
|
+
const definition =
|
|
544
|
+
step.name === undefined || definitionId === undefined
|
|
545
|
+
? undefined
|
|
546
|
+
: createTheoremDefinition(
|
|
547
|
+
generation,
|
|
548
|
+
definitionId,
|
|
549
|
+
step.name,
|
|
550
|
+
stepBody,
|
|
551
|
+
getTokenLocation(generation.file, getTokenIndex(generation.file, step.location)),
|
|
552
|
+
popLabels(generation),
|
|
553
|
+
);
|
|
554
|
+
if (definition) addSymbol(generation, definition);
|
|
555
|
+
const isScoped = isAssumeProve && !isSuffices;
|
|
556
|
+
if (isScoped) generation.contexts.push(assumeContext);
|
|
557
|
+
const stepProof = step.proof && generateProof(generation, step.proof);
|
|
558
|
+
if (isScoped) generation.contexts.pop();
|
|
559
|
+
endProof(generation, stepBody);
|
|
560
|
+
if (isAssumeProve && isSuffices) {
|
|
561
|
+
sufficesContexts.push(assumeContext);
|
|
562
|
+
generation.contexts.push(assumeContext);
|
|
563
|
+
}
|
|
564
|
+
pickContext?.symbols.forEach((symbol) => addSymbol(generation, symbol));
|
|
565
|
+
return {
|
|
566
|
+
...createLevelFields(generation.getId()),
|
|
567
|
+
kind: "Theorem",
|
|
568
|
+
definition,
|
|
569
|
+
body: stepBody,
|
|
570
|
+
proof: stepProof,
|
|
571
|
+
isSuffices,
|
|
572
|
+
location: getSpanLocation(generation.file, stepSpan),
|
|
573
|
+
};
|
|
574
|
+
});
|
|
575
|
+
sufficesContexts.forEach(() => {
|
|
576
|
+
generation.contexts.pop()?.symbols.forEach((symbol) => addToContext(proofContext, symbol));
|
|
577
|
+
});
|
|
578
|
+
generation.contexts.pop();
|
|
579
|
+
return {
|
|
580
|
+
...createLevelFields(generation.getId()),
|
|
581
|
+
kind: "NonLeafProof",
|
|
582
|
+
steps,
|
|
583
|
+
instances,
|
|
584
|
+
proofLevel: proof.level,
|
|
585
|
+
location: getUnitLocation(generation.file, proof.location),
|
|
586
|
+
};
|
|
587
|
+
};
|
|
588
|
+
|
|
589
|
+
export const processTheorem = (generation: ModuleGeneration, theorem: Theorem) => {
|
|
590
|
+
const location = getUnitLocation(generation.file, theorem.location);
|
|
591
|
+
const statement = theorem.statement;
|
|
592
|
+
const assumeContext = createContext();
|
|
593
|
+
if (theorem.name !== undefined) pushLabelScope(generation);
|
|
594
|
+
const definitionId = theorem.name === undefined ? undefined : generation.getId();
|
|
595
|
+
if (statement.kind === "AssumeProve") generation.contexts.push(assumeContext);
|
|
596
|
+
const body =
|
|
597
|
+
statement.kind === "AssumeProve"
|
|
598
|
+
? generateAssumeProve(
|
|
599
|
+
generation,
|
|
600
|
+
statement,
|
|
601
|
+
1,
|
|
602
|
+
theorem.name === undefined ? undefined : { isSuffices: false },
|
|
603
|
+
)
|
|
604
|
+
: generateExpression(generation, statement);
|
|
605
|
+
const definition =
|
|
606
|
+
theorem.name === undefined || definitionId === undefined
|
|
607
|
+
? undefined
|
|
608
|
+
: createTheoremDefinition(
|
|
609
|
+
generation,
|
|
610
|
+
definitionId,
|
|
611
|
+
theorem.name,
|
|
612
|
+
body,
|
|
613
|
+
location,
|
|
614
|
+
popLabels(generation),
|
|
615
|
+
);
|
|
616
|
+
if (definition) {
|
|
617
|
+
if (statement.kind === "AssumeProve") generation.contexts.pop();
|
|
618
|
+
addSymbol(generation, definition);
|
|
619
|
+
generation.currentModule.definitions.push(definition);
|
|
620
|
+
if (statement.kind === "AssumeProve") generation.contexts.push(assumeContext);
|
|
621
|
+
}
|
|
622
|
+
const proof = theorem.proof && generateProof(generation, theorem.proof);
|
|
623
|
+
if (statement.kind === "AssumeProve") generation.contexts.pop();
|
|
624
|
+
endProof(generation, body);
|
|
625
|
+
const node: TheoremNode = {
|
|
626
|
+
...createLevelFields(generation.getId()),
|
|
627
|
+
kind: "Theorem",
|
|
628
|
+
definition,
|
|
629
|
+
body,
|
|
630
|
+
proof,
|
|
631
|
+
isSuffices: false,
|
|
632
|
+
location,
|
|
633
|
+
};
|
|
634
|
+
generation.currentModule.topLevel.push(node);
|
|
635
|
+
};
|
|
636
|
+
|
|
637
|
+
export const processAssumption = (generation: ModuleGeneration, assumption: Assumption) => {
|
|
638
|
+
const location = getUnitLocation(generation.file, assumption.location);
|
|
639
|
+
if (assumption.name !== undefined) pushLabelScope(generation);
|
|
640
|
+
const body = generateExpression(generation, assumption.expression);
|
|
641
|
+
const definition =
|
|
642
|
+
assumption.name === undefined
|
|
643
|
+
? undefined
|
|
644
|
+
: createTheoremDefinition(
|
|
645
|
+
generation,
|
|
646
|
+
generation.getId(),
|
|
647
|
+
assumption.name,
|
|
648
|
+
body,
|
|
649
|
+
location,
|
|
650
|
+
popLabels(generation),
|
|
651
|
+
false,
|
|
652
|
+
);
|
|
653
|
+
if (definition) {
|
|
654
|
+
addSymbol(generation, definition);
|
|
655
|
+
generation.currentModule.definitions.push(definition);
|
|
656
|
+
}
|
|
657
|
+
const node: AssumeNode = {
|
|
658
|
+
...createLevelFields(generation.getId()),
|
|
659
|
+
kind: "Assume",
|
|
660
|
+
definition,
|
|
661
|
+
body,
|
|
662
|
+
location,
|
|
663
|
+
};
|
|
664
|
+
generation.currentModule.topLevel.push(node);
|
|
665
|
+
};
|