tla-ts 0.0.9-dev.8298a52 → 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 +8 -0
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +121 -12
- package/dist/index.d.ts +121 -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 +1 -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 +1155 -900
- 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 +318 -656
- package/src/cli/typescript.ts +0 -3
- 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 +260 -371
- package/src/errors.ts +93 -58
- package/src/evaluate.ts +848 -374
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +97 -43
- 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 -325
- package/src/liveness.ts +224 -131
- 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 +34 -57
- package/src/parallel.ts +62 -72
- 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 +129 -38
- 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 +296 -105
- 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 +10 -25
- package/src/typescript/collections.ts +34 -35
- package/src/typescript/compile.ts +1 -8
- package/src/typescript/context.ts +0 -12
- package/src/typescript/emit.ts +0 -1
- package/src/typescript/expressions.ts +0 -12
- package/src/typescript/formula.ts +9 -15
- package/src/typescript/functions.ts +6 -17
- package/src/typescript/model.ts +14 -16
- package/src/typescript/names.ts +0 -2
- package/src/typescript/program.ts +0 -3
- package/src/typescript/properties.ts +6 -8
- package/src/typescript/scope.ts +0 -5
- package/src/typescript/steps.ts +20 -28
- package/src/typescript/types.ts +3 -10
- package/src/values.ts +917 -522
- 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,331 @@
|
|
|
1
|
+
import { TlaIsabelleError } from "../../../errors";
|
|
2
|
+
import { typargsOf } from "../pure/consts";
|
|
3
|
+
import { zeroVarIndexes } from "../pure/drule";
|
|
4
|
+
import type { Limits } from "../pure/interrupt";
|
|
5
|
+
import { destEquals, mkEquals } from "../pure/logic";
|
|
6
|
+
import { seqHead } from "../pure/seq";
|
|
7
|
+
import { normHhfProtect } from "../pure/simplifier";
|
|
8
|
+
import {
|
|
9
|
+
abstractOver,
|
|
10
|
+
aconv,
|
|
11
|
+
addFreeNames,
|
|
12
|
+
existsSubterm,
|
|
13
|
+
mkAbs,
|
|
14
|
+
mkConst,
|
|
15
|
+
stripComb,
|
|
16
|
+
type Term,
|
|
17
|
+
type Typ,
|
|
18
|
+
} from "../pure/term";
|
|
19
|
+
import {
|
|
20
|
+
axiomThm,
|
|
21
|
+
betaConversion,
|
|
22
|
+
combination,
|
|
23
|
+
generalize,
|
|
24
|
+
reflexive,
|
|
25
|
+
transitive,
|
|
26
|
+
type Thm,
|
|
27
|
+
} from "../pure/thm";
|
|
28
|
+
import { getLogicFact, getProofContext } from "../tla/context";
|
|
29
|
+
import type { ConstInfo, TlaLogic } from "../tla/logic";
|
|
30
|
+
import { applyAttributes, getThms } from "./attrib";
|
|
31
|
+
import {
|
|
32
|
+
addAssumptions,
|
|
33
|
+
addFixes,
|
|
34
|
+
augment,
|
|
35
|
+
exportThm,
|
|
36
|
+
getFact,
|
|
37
|
+
putFacts,
|
|
38
|
+
type IsarContext,
|
|
39
|
+
} from "./context";
|
|
40
|
+
import { parseType } from "./inner-syntax";
|
|
41
|
+
import { metaRewriteConv, type ProofContext } from "./method";
|
|
42
|
+
import {
|
|
43
|
+
assume,
|
|
44
|
+
chain,
|
|
45
|
+
collect,
|
|
46
|
+
contextOf,
|
|
47
|
+
fix,
|
|
48
|
+
from,
|
|
49
|
+
have,
|
|
50
|
+
invokeCase,
|
|
51
|
+
isFinished,
|
|
52
|
+
next,
|
|
53
|
+
proof,
|
|
54
|
+
qed,
|
|
55
|
+
readStatement,
|
|
56
|
+
show,
|
|
57
|
+
terminalProof,
|
|
58
|
+
theorem,
|
|
59
|
+
unfolding,
|
|
60
|
+
using,
|
|
61
|
+
type State,
|
|
62
|
+
} from "./proof";
|
|
63
|
+
import type { Command, FactReference, TheoryText } from "./theory";
|
|
64
|
+
|
|
65
|
+
type Free = Extract<Term, { kind: "Free" }>;
|
|
66
|
+
|
|
67
|
+
const error = (message: string) => new TlaIsabelleError("ERROR", message);
|
|
68
|
+
|
|
69
|
+
interface Theory {
|
|
70
|
+
readonly name: string;
|
|
71
|
+
readonly consts: ReadonlyMap<string, ConstInfo>;
|
|
72
|
+
readonly constNames: ReadonlyMap<string, string>;
|
|
73
|
+
readonly facts: ReadonlyMap<string, readonly Thm[]>;
|
|
74
|
+
readonly tactics: ProofContext;
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
const initContext = (logic: TlaLogic, theory: Theory): IsarContext => ({
|
|
78
|
+
scope: { consts: theory.consts, constNames: theory.constNames },
|
|
79
|
+
getGlobalFact: (name) => theory.facts.get(name) ?? getLogicFact(logic, name),
|
|
80
|
+
tactics: theory.tactics,
|
|
81
|
+
fixes: [],
|
|
82
|
+
types: new Map(),
|
|
83
|
+
assumptions: [],
|
|
84
|
+
facts: new Map(),
|
|
85
|
+
binds: new Map(),
|
|
86
|
+
calculation: undefined,
|
|
87
|
+
isBody: false,
|
|
88
|
+
cases: new Map(),
|
|
89
|
+
});
|
|
90
|
+
|
|
91
|
+
const addConst = (theory: Theory, base: string, type: Typ): Theory => {
|
|
92
|
+
const name = `${theory.name}.${base}`;
|
|
93
|
+
const info: ConstInfo = { type, typargs: typargsOf(type), abbreviation: undefined };
|
|
94
|
+
return {
|
|
95
|
+
...theory,
|
|
96
|
+
consts: new Map([...theory.consts, [name, info]]),
|
|
97
|
+
constNames: new Map([...theory.constNames, [base, name]]),
|
|
98
|
+
};
|
|
99
|
+
};
|
|
100
|
+
|
|
101
|
+
interface NamedFact {
|
|
102
|
+
readonly name: string;
|
|
103
|
+
readonly thms: readonly Thm[];
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
const putTheoryFacts = (theory: Theory, name: string, thms: readonly Thm[]): Theory => ({
|
|
107
|
+
...theory,
|
|
108
|
+
facts: new Map([...theory.facts, [name, thms]]),
|
|
109
|
+
});
|
|
110
|
+
|
|
111
|
+
// Primitive_Defs.dest_def: the head is new and its arguments are distinct variables, the only free
|
|
112
|
+
// variables of the right-hand side.
|
|
113
|
+
const destDef = (prop: Term): [Free, Free[], Term] => {
|
|
114
|
+
const [lhs, rhs] = destEquals(prop);
|
|
115
|
+
const [head, args] = stripComb(lhs);
|
|
116
|
+
if (head.kind !== "Free") throw error("Bad head of lhs: existing constant");
|
|
117
|
+
const frees = args.filter((arg): arg is Free => arg.kind === "Free");
|
|
118
|
+
if (
|
|
119
|
+
frees.length < args.length ||
|
|
120
|
+
frees.some((arg, index) => frees.slice(0, index).some((other) => aconv(other, arg)))
|
|
121
|
+
)
|
|
122
|
+
throw error("Arguments of lhs must be distinct free variables");
|
|
123
|
+
if (existsSubterm((term) => aconv(term, head), rhs))
|
|
124
|
+
throw error("Entity to be defined occurs on rhs");
|
|
125
|
+
if (addFreeNames(rhs, []).some((name) => !frees.some((arg) => arg.name === name)))
|
|
126
|
+
throw error("Extra variables on rhs");
|
|
127
|
+
return [head, frees, rhs];
|
|
128
|
+
};
|
|
129
|
+
|
|
130
|
+
// Specification.definition: the head becomes a constant, whose definitional axiom proves the
|
|
131
|
+
// equation as stated.
|
|
132
|
+
const define = (
|
|
133
|
+
theory: Theory,
|
|
134
|
+
context: IsarContext,
|
|
135
|
+
command: Extract<Command, { kind: "definition" }>,
|
|
136
|
+
): Theory => {
|
|
137
|
+
const [prop] = readStatement(
|
|
138
|
+
command.name === undefined || command.type === undefined
|
|
139
|
+
? context
|
|
140
|
+
: {
|
|
141
|
+
...context,
|
|
142
|
+
types: new Map([...context.types, [command.name, parseType(command.type)]]),
|
|
143
|
+
},
|
|
144
|
+
[command.part],
|
|
145
|
+
"default",
|
|
146
|
+
).props.flat();
|
|
147
|
+
const [head, args, rhs] = destDef(destEquals(metaRewriteConv(theory.tactics, prop).prop)[1]);
|
|
148
|
+
if (command.name !== undefined && command.name !== head.name)
|
|
149
|
+
throw error(`Head of definition ${head.name} differs from declaration ${command.name}`);
|
|
150
|
+
const axiom = axiomThm(
|
|
151
|
+
mkEquals(
|
|
152
|
+
mkConst(`${theory.name}.${head.name}`, head.type),
|
|
153
|
+
args.reduceRight((body, arg) => mkAbs(arg.name, arg.type, abstractOver(arg, body)), rhs),
|
|
154
|
+
),
|
|
155
|
+
);
|
|
156
|
+
const applied = args.reduce((thm, arg) => {
|
|
157
|
+
const combined = combination(thm, reflexive(arg));
|
|
158
|
+
return transitive(combined, betaConversion(false, destEquals(combined.prop)[1]));
|
|
159
|
+
}, axiom);
|
|
160
|
+
const generalized = generalize(
|
|
161
|
+
args.map((arg) => arg.name),
|
|
162
|
+
applied.maxidx + 1,
|
|
163
|
+
applied,
|
|
164
|
+
);
|
|
165
|
+
const [declared, thms] = applyAttributes(context, command.part.attributes, [
|
|
166
|
+
zeroVarIndexes(generalized),
|
|
167
|
+
]);
|
|
168
|
+
return putTheoryFacts(
|
|
169
|
+
{ ...addConst(theory, head.name, head.type), tactics: declared.tactics },
|
|
170
|
+
command.part.name ?? `${head.name}_def`,
|
|
171
|
+
thms,
|
|
172
|
+
);
|
|
173
|
+
};
|
|
174
|
+
|
|
175
|
+
// Specification.theorems: the declarations of each fact's attributes, whose results it drops.
|
|
176
|
+
const declare = (context: IsarContext, references: readonly FactReference[]): ProofContext =>
|
|
177
|
+
references.reduce(
|
|
178
|
+
(current, reference) =>
|
|
179
|
+
applyAttributes(current, reference.attributes, getFact(current, reference.name))[0],
|
|
180
|
+
context,
|
|
181
|
+
).tactics;
|
|
182
|
+
|
|
183
|
+
// Specification.theorem: the statement's elements, then the goal whose results the theory keeps.
|
|
184
|
+
const startTheorem = (
|
|
185
|
+
outer: IsarContext,
|
|
186
|
+
command: Extract<Command, { kind: "theorem" }>,
|
|
187
|
+
store: (tactics: ProofContext, facts: readonly NamedFact[]) => void,
|
|
188
|
+
): State => {
|
|
189
|
+
const fixed = command.elements.reduce((context, element) => {
|
|
190
|
+
if (element.kind !== "fixes") return context;
|
|
191
|
+
const types = new Map(context.types);
|
|
192
|
+
for (const variable of element.variables)
|
|
193
|
+
if (variable.type !== undefined) types.set(variable.name, parseType(variable.type));
|
|
194
|
+
return addFixes(
|
|
195
|
+
{ ...context, types },
|
|
196
|
+
element.variables.map((variable) => variable.name),
|
|
197
|
+
);
|
|
198
|
+
}, outer);
|
|
199
|
+
const assumes = command.elements.flatMap((element) =>
|
|
200
|
+
element.kind === "assumes" ? element.parts : [],
|
|
201
|
+
);
|
|
202
|
+
const statement = readStatement(fixed, [...assumes, ...command.shows], "schematic");
|
|
203
|
+
const assumeProps = statement.props.slice(0, assumes.length);
|
|
204
|
+
const showProps = statement.props.slice(assumes.length).flat();
|
|
205
|
+
const [prems, assumed] = addAssumptions(
|
|
206
|
+
assumeProps.flat().reduce(augment, statement.context),
|
|
207
|
+
false,
|
|
208
|
+
assumeProps.flat(),
|
|
209
|
+
);
|
|
210
|
+
let offset = 0;
|
|
211
|
+
const named = assumes.reduce((context, part, index) => {
|
|
212
|
+
const [declared, group] = applyAttributes(
|
|
213
|
+
context,
|
|
214
|
+
part.attributes,
|
|
215
|
+
prems.slice(offset, offset + assumeProps[index].length),
|
|
216
|
+
);
|
|
217
|
+
offset += assumeProps[index].length;
|
|
218
|
+
return part.name === undefined ? declared : putFacts(declared, part.name, group);
|
|
219
|
+
}, assumed);
|
|
220
|
+
const elementsContext =
|
|
221
|
+
prems.length === 0 ? named : putFacts(named, command.isLong ? "assms" : "that", prems);
|
|
222
|
+
const goalContext = showProps.reduce(augment, elementsContext);
|
|
223
|
+
if (showProps.length !== 1) throw error("Unsupported theorem of several propositions");
|
|
224
|
+
return theorem(goalContext, showProps, (resultContext, results) => {
|
|
225
|
+
const normalized = results.map((result) =>
|
|
226
|
+
zeroVarIndexes(
|
|
227
|
+
normHhfProtect(outer.tactics.limits, exportThm(resultContext, outer, false, result)),
|
|
228
|
+
),
|
|
229
|
+
);
|
|
230
|
+
const part = command.shows[0];
|
|
231
|
+
const [notedContext, noted] = applyAttributes(outer, part.attributes, normalized);
|
|
232
|
+
const [namedContext, named] = applyAttributes(notedContext, command.attributes, noted);
|
|
233
|
+
store(namedContext.tactics, [
|
|
234
|
+
...(part.name === undefined ? [] : [{ name: part.name, thms: noted }]),
|
|
235
|
+
...(command.name === undefined ? [] : [{ name: command.name, thms: named }]),
|
|
236
|
+
]);
|
|
237
|
+
});
|
|
238
|
+
};
|
|
239
|
+
|
|
240
|
+
const proofCommand = (state: State, command: Command): State => {
|
|
241
|
+
switch (command.kind) {
|
|
242
|
+
case "proof": {
|
|
243
|
+
const result = seqHead(proof(state, command.method));
|
|
244
|
+
if (result === undefined) throw error("Failed to apply initial proof method");
|
|
245
|
+
return result;
|
|
246
|
+
}
|
|
247
|
+
case "qed":
|
|
248
|
+
return qed(state, command.method);
|
|
249
|
+
case "by":
|
|
250
|
+
return terminalProof(state, command.initial, command.terminal);
|
|
251
|
+
case "next":
|
|
252
|
+
return next(state);
|
|
253
|
+
case "then":
|
|
254
|
+
return chain(state);
|
|
255
|
+
case "goal": {
|
|
256
|
+
const chained =
|
|
257
|
+
command.command === "hence" || command.command === "thus" ? chain(state) : state;
|
|
258
|
+
return command.command === "have" || command.command === "hence"
|
|
259
|
+
? have(chained, command.parts)
|
|
260
|
+
: show(chained, command.parts);
|
|
261
|
+
}
|
|
262
|
+
case "assume":
|
|
263
|
+
return assume(state, command.parts);
|
|
264
|
+
case "fix":
|
|
265
|
+
return fix(state, command.variables);
|
|
266
|
+
case "case":
|
|
267
|
+
return invokeCase(state, command.binding, command.name, command.params);
|
|
268
|
+
case "moreover":
|
|
269
|
+
case "ultimately":
|
|
270
|
+
return collect(state, command.kind === "ultimately");
|
|
271
|
+
case "facts": {
|
|
272
|
+
const facts = getThms(contextOf(state), command.facts);
|
|
273
|
+
switch (command.command) {
|
|
274
|
+
case "from":
|
|
275
|
+
return from(state, facts, false);
|
|
276
|
+
case "with":
|
|
277
|
+
return from(state, facts, true);
|
|
278
|
+
case "using":
|
|
279
|
+
return using(state, facts);
|
|
280
|
+
case "unfolding":
|
|
281
|
+
return unfolding(state, facts);
|
|
282
|
+
}
|
|
283
|
+
}
|
|
284
|
+
default:
|
|
285
|
+
throw error(`Unsupported proof command: ${command.kind}`);
|
|
286
|
+
}
|
|
287
|
+
};
|
|
288
|
+
|
|
289
|
+
// Thy_Info.use_thy: the theory fails at its first failing command.
|
|
290
|
+
export const runTheory = (logic: TlaLogic, text: TheoryText, limits: Limits) => {
|
|
291
|
+
let theory: Theory = {
|
|
292
|
+
name: text.name,
|
|
293
|
+
consts: logic.consts,
|
|
294
|
+
constNames: logic.constNames,
|
|
295
|
+
facts: new Map(),
|
|
296
|
+
tactics: getProofContext(logic, limits),
|
|
297
|
+
};
|
|
298
|
+
let state: State | undefined;
|
|
299
|
+
for (const command of text.commands) {
|
|
300
|
+
if (state !== undefined) {
|
|
301
|
+
state = proofCommand(state, command);
|
|
302
|
+
if (isFinished(state)) state = undefined;
|
|
303
|
+
continue;
|
|
304
|
+
}
|
|
305
|
+
switch (command.kind) {
|
|
306
|
+
case "consts":
|
|
307
|
+
theory = command.consts.reduce(
|
|
308
|
+
(current, constant) => addConst(current, constant.name, parseType(constant.type)),
|
|
309
|
+
theory,
|
|
310
|
+
);
|
|
311
|
+
break;
|
|
312
|
+
case "definition":
|
|
313
|
+
theory = define(theory, initContext(logic, theory), command);
|
|
314
|
+
break;
|
|
315
|
+
case "declare":
|
|
316
|
+
theory = { ...theory, tactics: declare(initContext(logic, theory), command.facts) };
|
|
317
|
+
break;
|
|
318
|
+
case "theorem":
|
|
319
|
+
state = startTheorem(initContext(logic, theory), command, (tactics, facts) => {
|
|
320
|
+
theory = facts.reduce((current, fact) => putTheoryFacts(current, fact.name, fact.thms), {
|
|
321
|
+
...theory,
|
|
322
|
+
tactics,
|
|
323
|
+
});
|
|
324
|
+
});
|
|
325
|
+
break;
|
|
326
|
+
default:
|
|
327
|
+
throw error(`Unsupported theory command: ${command.kind}`);
|
|
328
|
+
}
|
|
329
|
+
}
|
|
330
|
+
if (state !== undefined) throw error("Unfinished proof at end of theory");
|
|
331
|
+
};
|
|
@@ -1,11 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/type_infer_context.ML, Pure/type_infer.ML (fixate) and the
|
|
2
|
-
// abbreviation expansion of Pure/consts.ML. Copyright (c) 1986-2025 University of Cambridge,
|
|
3
|
-
// Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
4
|
-
//
|
|
5
|
-
// Resolves the names of parsed propositions and infers their types together, as
|
|
6
|
-
// Syntax.check_props does for the statement of a lemma: a free variable has one type across all
|
|
7
|
-
// of them, and type parameters that stay open become the type variables 'a, 'b, and so on.
|
|
8
|
-
|
|
9
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
10
2
|
import { bumpString } from "../pure/name";
|
|
11
3
|
import {
|
|
@@ -21,6 +13,8 @@ import {
|
|
|
21
13
|
mkTFree,
|
|
22
14
|
mkTVar,
|
|
23
15
|
mkType,
|
|
16
|
+
mkVar,
|
|
17
|
+
existsSubterm,
|
|
24
18
|
mapTypes,
|
|
25
19
|
stripComb,
|
|
26
20
|
type Term,
|
|
@@ -29,28 +23,38 @@ import {
|
|
|
29
23
|
import type { ConstInfo } from "../tla/logic";
|
|
30
24
|
import type { Ast } from "./inner-syntax";
|
|
31
25
|
|
|
32
|
-
// The name a type parameter carries until it is fixed, as Type_Infer.param does.
|
|
33
26
|
const PARAM_NAME = "?'a";
|
|
34
27
|
|
|
35
28
|
interface NameScope {
|
|
36
29
|
readonly consts: ReadonlyMap<string, ConstInfo>;
|
|
37
|
-
// The constant an unqualified name stands for.
|
|
38
30
|
readonly constNames: ReadonlyMap<string, string>;
|
|
39
31
|
}
|
|
40
32
|
|
|
41
33
|
export interface PropToCheck {
|
|
42
34
|
readonly ast: Ast;
|
|
43
|
-
// The variables fixed where the proposition appears.
|
|
44
35
|
readonly fixed: ReadonlySet<string>;
|
|
36
|
+
// The type the term must have, a proposition unless given.
|
|
37
|
+
readonly type?: Typ;
|
|
38
|
+
}
|
|
39
|
+
|
|
40
|
+
export interface CheckOptions {
|
|
41
|
+
readonly fixedTypes: ReadonlyMap<string, Typ>;
|
|
42
|
+
// The types of the schematic variables a term binding gives, Variable.def_type.
|
|
43
|
+
readonly varTypes?: (name: string, index: number) => Typ | undefined;
|
|
44
|
+
// Proof_Context.mode_pattern: dummies and open type parameters become schematic.
|
|
45
|
+
readonly isPattern?: boolean;
|
|
45
46
|
}
|
|
46
47
|
|
|
47
48
|
interface Inference {
|
|
48
49
|
readonly substitution: Map<number, Typ>;
|
|
49
50
|
readonly freeTypes: Map<string, Typ>;
|
|
51
|
+
readonly varTypes: Map<string, Typ>;
|
|
52
|
+
readonly getVarType: (name: string, index: number) => Typ | undefined;
|
|
50
53
|
nextParam: number;
|
|
54
|
+
nextDummy: number;
|
|
51
55
|
}
|
|
52
56
|
|
|
53
|
-
const
|
|
57
|
+
const createParam = (inference: Inference) => {
|
|
54
58
|
const param = mkTVar(PARAM_NAME, inference.nextParam);
|
|
55
59
|
inference.nextParam += 1;
|
|
56
60
|
return param;
|
|
@@ -118,28 +122,42 @@ const unify = (inference: Inference, left: Typ, right: Typ) => {
|
|
|
118
122
|
throw new TlaIsabelleError("ERROR", "Type unification failed");
|
|
119
123
|
};
|
|
120
124
|
|
|
121
|
-
|
|
125
|
+
const getSchemeKey = (atom: Exclude<Typ, { kind: "Type" }>) =>
|
|
126
|
+
atom.kind === "TFree" ? atom.name : `${atom.name}.${atom.index}`;
|
|
127
|
+
|
|
122
128
|
const instantiateScheme = (inference: Inference, type: Typ) => {
|
|
123
129
|
const params = new Map<string, Typ>();
|
|
124
130
|
const instantiate = (current: Typ): Typ => {
|
|
125
131
|
if (current.kind === "Type") return mkType(current.name, current.args.map(instantiate));
|
|
126
|
-
const key = current
|
|
132
|
+
const key = getSchemeKey(current);
|
|
127
133
|
const known = params.get(key);
|
|
128
134
|
if (known !== undefined) return known;
|
|
129
|
-
const param =
|
|
135
|
+
const param = createParam(inference);
|
|
136
|
+
params.set(key, param);
|
|
137
|
+
return param;
|
|
138
|
+
};
|
|
139
|
+
return instantiate(type);
|
|
140
|
+
};
|
|
141
|
+
|
|
142
|
+
// Type.mark_polymorphic: each use of a term binding instantiates its type variables afresh.
|
|
143
|
+
const instantiateTVars = (inference: Inference, type: Typ, params = new Map<string, Typ>()) => {
|
|
144
|
+
const instantiate = (current: Typ): Typ => {
|
|
145
|
+
if (current.kind === "Type") return mkType(current.name, current.args.map(instantiate));
|
|
146
|
+
if (current.kind === "TFree") return current;
|
|
147
|
+
const key = `${current.name}.${current.index}`;
|
|
148
|
+
const param = params.get(key) ?? createParam(inference);
|
|
130
149
|
params.set(key, param);
|
|
131
150
|
return param;
|
|
132
151
|
};
|
|
133
152
|
return instantiate(type);
|
|
134
153
|
};
|
|
135
154
|
|
|
136
|
-
const
|
|
155
|
+
const getConstType = (scope: NameScope, name: string) => {
|
|
137
156
|
const info = scope.consts.get(name);
|
|
138
157
|
if (info === undefined) throw new TlaIsabelleError("ERROR", `Undeclared constant: ${name}`);
|
|
139
158
|
return info.type;
|
|
140
159
|
};
|
|
141
160
|
|
|
142
|
-
// Builds the term with parameter types and infers its type, constraining the parameters.
|
|
143
161
|
const elaborate = (
|
|
144
162
|
scope: NameScope,
|
|
145
163
|
inference: Inference,
|
|
@@ -153,27 +171,42 @@ const elaborate = (
|
|
|
153
171
|
if (index >= 0) return [mkBound(index), bound[index].type];
|
|
154
172
|
const constant = fixed.has(ast.name) ? undefined : scope.constNames.get(ast.name);
|
|
155
173
|
if (constant !== undefined) {
|
|
156
|
-
const type = instantiateScheme(inference,
|
|
174
|
+
const type = instantiateScheme(inference, getConstType(scope, constant));
|
|
157
175
|
return [mkConst(constant, type), type];
|
|
158
176
|
}
|
|
159
177
|
const known = inference.freeTypes.get(ast.name);
|
|
160
|
-
const type = known ??
|
|
178
|
+
const type = known ?? createParam(inference);
|
|
161
179
|
if (known === undefined) inference.freeTypes.set(ast.name, type);
|
|
162
180
|
return [mkFree(ast.name, type), type];
|
|
163
181
|
}
|
|
164
182
|
case "const": {
|
|
165
|
-
const type = instantiateScheme(inference,
|
|
183
|
+
const type = instantiateScheme(inference, getConstType(scope, ast.name));
|
|
166
184
|
return [mkConst(ast.name, type), type];
|
|
167
185
|
}
|
|
186
|
+
case "var": {
|
|
187
|
+
const key = `${ast.name}.${ast.index}`;
|
|
188
|
+
const known = inference.varTypes.get(key);
|
|
189
|
+
const bound = known === undefined ? inference.getVarType(ast.name, ast.index) : undefined;
|
|
190
|
+
const type =
|
|
191
|
+
known ??
|
|
192
|
+
(bound === undefined ? createParam(inference) : instantiateTVars(inference, bound));
|
|
193
|
+
inference.varTypes.set(key, type);
|
|
194
|
+
return [mkVar(ast.name, ast.index, type), type];
|
|
195
|
+
}
|
|
196
|
+
case "dummy": {
|
|
197
|
+
const type = createParam(inference);
|
|
198
|
+
inference.nextDummy += 1;
|
|
199
|
+
return [mkVar("_dummy_", inference.nextDummy, type), type];
|
|
200
|
+
}
|
|
168
201
|
case "app": {
|
|
169
202
|
const [fun, funType] = elaborate(scope, inference, fixed, bound, ast.fun);
|
|
170
203
|
const [arg, argType] = elaborate(scope, inference, fixed, bound, ast.arg);
|
|
171
|
-
const result =
|
|
204
|
+
const result = createParam(inference);
|
|
172
205
|
unify(inference, funType, funT(argType, result));
|
|
173
206
|
return [mkApp(fun, arg), result];
|
|
174
207
|
}
|
|
175
208
|
case "abs": {
|
|
176
|
-
const type = ast.type ??
|
|
209
|
+
const type = ast.type ?? createParam(inference);
|
|
177
210
|
const [body, bodyType] = elaborate(
|
|
178
211
|
scope,
|
|
179
212
|
inference,
|
|
@@ -197,10 +230,7 @@ const matchScheme = (pattern: Typ, object: Typ, instantiation: Map<string, Typ>)
|
|
|
197
230
|
pattern.args.forEach((arg, index) => matchScheme(arg, object.args[index], instantiation));
|
|
198
231
|
return;
|
|
199
232
|
}
|
|
200
|
-
instantiation.set(
|
|
201
|
-
pattern.kind === "TFree" ? pattern.name : `${pattern.name}.${pattern.index}`,
|
|
202
|
-
object,
|
|
203
|
-
);
|
|
233
|
+
instantiation.set(getSchemeKey(pattern), object);
|
|
204
234
|
};
|
|
205
235
|
|
|
206
236
|
const instantiateMatched = (type: Typ, instantiation: ReadonlyMap<string, Typ>): Typ =>
|
|
@@ -209,9 +239,8 @@ const instantiateMatched = (type: Typ, instantiation: ReadonlyMap<string, Typ>):
|
|
|
209
239
|
type.name,
|
|
210
240
|
type.args.map((arg) => instantiateMatched(arg, instantiation)),
|
|
211
241
|
)
|
|
212
|
-
: (instantiation.get(type
|
|
242
|
+
: (instantiation.get(getSchemeKey(type)) ?? type);
|
|
213
243
|
|
|
214
|
-
// Consts.certify with normalize: unfolds abbreviations and applies them to their arguments.
|
|
215
244
|
const expandAbbreviations = (scope: NameScope, term: Term): Term => {
|
|
216
245
|
const [head, args] = stripComb(term);
|
|
217
246
|
const expandedArgs = args.map((arg) => expandAbbreviations(scope, arg));
|
|
@@ -231,22 +260,44 @@ const expandAbbreviations = (scope: NameScope, term: Term): Term => {
|
|
|
231
260
|
);
|
|
232
261
|
};
|
|
233
262
|
|
|
234
|
-
export const checkProps = (
|
|
235
|
-
|
|
263
|
+
export const checkProps = (
|
|
264
|
+
scope: NameScope,
|
|
265
|
+
props: readonly PropToCheck[],
|
|
266
|
+
options: CheckOptions,
|
|
267
|
+
): Term[] => {
|
|
268
|
+
const inference: Inference = {
|
|
269
|
+
substitution: new Map(),
|
|
270
|
+
freeTypes: new Map(options.fixedTypes),
|
|
271
|
+
varTypes: new Map(),
|
|
272
|
+
getVarType: options.varTypes ?? (() => undefined),
|
|
273
|
+
nextParam: 0,
|
|
274
|
+
nextDummy: 0,
|
|
275
|
+
};
|
|
276
|
+
// Type_Infer.paramify_vars: the expected types' variables are open, the same in each.
|
|
277
|
+
const expected = new Map<string, Typ>();
|
|
236
278
|
const elaborated = props.map((prop) => {
|
|
237
279
|
const [term, type] = elaborate(scope, inference, prop.fixed, [], prop.ast);
|
|
238
|
-
unify(
|
|
280
|
+
unify(
|
|
281
|
+
inference,
|
|
282
|
+
type,
|
|
283
|
+
prop.type === undefined ? mkType("prop") : instantiateTVars(inference, prop.type, expected),
|
|
284
|
+
);
|
|
239
285
|
return term;
|
|
240
286
|
});
|
|
287
|
+
if (
|
|
288
|
+
!options.isPattern &&
|
|
289
|
+
elaborated.some((term) =>
|
|
290
|
+
existsSubterm((sub) => sub.kind === "Var" && sub.name === "_dummy_", term),
|
|
291
|
+
)
|
|
292
|
+
)
|
|
293
|
+
throw new TlaIsabelleError("ERROR", "Illegal dummy pattern(s) in term");
|
|
241
294
|
const expanded = elaborated.map((term) =>
|
|
242
295
|
expandAbbreviations(
|
|
243
296
|
scope,
|
|
244
297
|
mapTypes((type) => normalize(inference, type), term),
|
|
245
298
|
),
|
|
246
299
|
);
|
|
247
|
-
|
|
248
|
-
// first appearance.
|
|
249
|
-
const params = expanded.reduce(
|
|
300
|
+
const params = expanded.reduce<number[]>(
|
|
250
301
|
(result, term) =>
|
|
251
302
|
foldTypes(
|
|
252
303
|
(type, state: number[]) =>
|
|
@@ -261,18 +312,28 @@ export const checkProps = (scope: NameScope, props: readonly PropToCheck[]): Ter
|
|
|
261
312
|
term,
|
|
262
313
|
result,
|
|
263
314
|
),
|
|
264
|
-
[]
|
|
315
|
+
[],
|
|
265
316
|
);
|
|
317
|
+
const used = new Set<string>();
|
|
318
|
+
for (const type of options.fixedTypes.values())
|
|
319
|
+
foldAtyps(
|
|
320
|
+
(atom, current: Set<string>) => (atom.kind === "TFree" ? current.add(atom.name) : current),
|
|
321
|
+
type,
|
|
322
|
+
used,
|
|
323
|
+
);
|
|
324
|
+
const fresh = (name: string): string => (used.has(name) ? fresh(bumpString(name)) : name);
|
|
266
325
|
const names = new Map<number, string>();
|
|
267
326
|
params.reduce((name, param) => {
|
|
268
|
-
names.set(param, name);
|
|
269
|
-
return bumpString(name);
|
|
327
|
+
names.set(param, fresh(name));
|
|
328
|
+
return bumpString(fresh(name));
|
|
270
329
|
}, "'a");
|
|
271
330
|
const fixType = (type: Typ): Typ =>
|
|
272
331
|
type.kind === "Type"
|
|
273
332
|
? mkType(type.name, type.args.map(fixType))
|
|
274
333
|
: type.kind === "TVar" && isParam(type)
|
|
275
|
-
?
|
|
334
|
+
? options.isPattern
|
|
335
|
+
? mkTVar(names.get(type.index) ?? "'a", 0)
|
|
336
|
+
: mkTFree(names.get(type.index) ?? "'a")
|
|
276
337
|
: type;
|
|
277
338
|
return expanded.map((term) => mapTypes(fixType, term));
|
|
278
339
|
};
|