tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
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 +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- 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 +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -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 +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- 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 +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- 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 +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- 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 +119 -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 +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- 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 +224 -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 +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- 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 +31 -74
- 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 +1 -44
- 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 +0 -2
- 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 +1026 -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 +615 -53
- 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 +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -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 +110 -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 +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -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 +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -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 +260 -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-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -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 +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -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 +26 -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 +112 -132
- 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 +345 -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 +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- 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 +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- 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 +91 -135
- 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 +22 -72
- 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 +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- 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 +309 -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 +105 -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 +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- 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 +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -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 +496 -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 +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -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 +218 -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 +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -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 +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -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/qe-arith-plugin.ts +1098 -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 +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -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 +814 -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 +8 -23
- 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 +261 -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 +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- 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 +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -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 +2127 -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 +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- 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 +1986 -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 +1200 -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 +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -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 +67 -41
- 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 +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- 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 +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -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 +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -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 +832 -484
- 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
|
@@ -1,9 +1,5 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/conv.ML, conversions: functions from a term to a theorem that
|
|
2
|
-
// it equals another. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet
|
|
3
|
-
// Muenchen, and contributors, see LICENSE.
|
|
4
|
-
|
|
5
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
6
|
-
import { destEquals, destImplies, implies, isImplies } from "./logic";
|
|
2
|
+
import { destEquals, destImplies, implies, isAllAbs, isImplies } from "./logic";
|
|
7
3
|
import { declareName, makeNameContext, variantName, type NameContext } from "./name";
|
|
8
4
|
import { aconv, addFreeNames, mkFree, substBound, type Term } from "./term";
|
|
9
5
|
import {
|
|
@@ -24,11 +20,9 @@ const isReflexive = (eq: Thm) => {
|
|
|
24
20
|
return aconv(lhs, rhs);
|
|
25
21
|
};
|
|
26
22
|
|
|
27
|
-
// Drule.imp_cong_rule
|
|
28
23
|
export const impCongRule = (first: Thm, second: Thm) =>
|
|
29
24
|
combination(combination(reflexive(implies), first), second);
|
|
30
25
|
|
|
31
|
-
// Conv.prems_conv ~1: converts every premise.
|
|
32
26
|
export const premsConv =
|
|
33
27
|
(convert: Conversion): Conversion =>
|
|
34
28
|
(term) =>
|
|
@@ -36,19 +30,11 @@ export const premsConv =
|
|
|
36
30
|
? impCongRule(convert(destImplies(term)[0]), premsConv(convert)(destImplies(term)[1]))
|
|
37
31
|
: reflexive(term);
|
|
38
32
|
|
|
39
|
-
// Conv.params_conv ~1: converts the body under every outer parameter, fixed as a fresh free
|
|
40
|
-
// variable.
|
|
41
33
|
export const paramsConv = (convert: Conversion): Conversion => {
|
|
42
34
|
const under =
|
|
43
35
|
(names: NameContext): Conversion =>
|
|
44
36
|
(term) => {
|
|
45
|
-
if (
|
|
46
|
-
term.kind !== "App" ||
|
|
47
|
-
term.fun.kind !== "Const" ||
|
|
48
|
-
term.fun.name !== "Pure.all" ||
|
|
49
|
-
term.arg.kind !== "Abs"
|
|
50
|
-
)
|
|
51
|
-
return convert(term);
|
|
37
|
+
if (!isAllAbs(term)) return convert(term);
|
|
52
38
|
const abs = term.arg;
|
|
53
39
|
const [name, nextNames] = variantName(abs.name, names);
|
|
54
40
|
const free = mkFree(name, abs.type);
|
|
@@ -60,7 +46,6 @@ export const paramsConv = (convert: Conversion): Conversion => {
|
|
|
60
46
|
return (term) => under(makeNameContext(addFreeNames(term, [])))(term);
|
|
61
47
|
};
|
|
62
48
|
|
|
63
|
-
// Conv.gconv_rule: converts goal index of a state.
|
|
64
49
|
export const gconvRule = (convert: Conversion, index: number, state: Thm): Thm => {
|
|
65
50
|
if (index < 1 || index > nprems(state)) throw new TlaIsabelleError("THM", `gconv_rule ${index}`);
|
|
66
51
|
const eq = convert(premOf(state, index));
|
|
@@ -72,7 +57,6 @@ export const gconvRule = (convert: Conversion, index: number, state: Thm): Thm =
|
|
|
72
57
|
return permutePrems(0, 1 - index, converted);
|
|
73
58
|
};
|
|
74
59
|
|
|
75
|
-
// Conv.fconv_rule: converts a theorem's proposition.
|
|
76
60
|
export const fconvRule = (convert: Conversion, thm: Thm): Thm => {
|
|
77
61
|
const eq = convert(thm.prop);
|
|
78
62
|
return isReflexive(eq) ? thm : equalElim(eq, thm);
|
|
@@ -1,8 +1,11 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
1
|
+
import {
|
|
2
|
+
cleanName,
|
|
3
|
+
emptyNameContext,
|
|
4
|
+
isBoundName,
|
|
5
|
+
variantList,
|
|
6
|
+
variantName,
|
|
7
|
+
type NameContext,
|
|
8
|
+
} from "./name";
|
|
6
9
|
import {
|
|
7
10
|
emptyTable,
|
|
8
11
|
fastIndexnameOrd,
|
|
@@ -12,10 +15,12 @@ import {
|
|
|
12
15
|
type IndexKey,
|
|
13
16
|
} from "./table";
|
|
14
17
|
import { TlaIsabelleError } from "../../../errors";
|
|
15
|
-
import { allConst, isProtected, mkEquals, mkImplies, mkTerm, protect } from "./logic";
|
|
16
|
-
import {
|
|
17
|
-
import {
|
|
18
|
+
import { allConst, destEquals, isProtected, mkEquals, mkImplies, mkTerm, protect } from "./logic";
|
|
19
|
+
import type { Limits } from "./interrupt";
|
|
20
|
+
import { emptySeq, listOfSeq, mapsSeq, seqOfList, singleSeq, type Seq } from "./seq";
|
|
21
|
+
import { distinctThms } from "./tactical";
|
|
18
22
|
import {
|
|
23
|
+
aconv,
|
|
19
24
|
foldVars,
|
|
20
25
|
foldAtyps,
|
|
21
26
|
foldTypes,
|
|
@@ -33,27 +38,27 @@ import {
|
|
|
33
38
|
} from "./term";
|
|
34
39
|
import { normType, type TyEnv } from "./type";
|
|
35
40
|
import {
|
|
41
|
+
abstractRule,
|
|
36
42
|
axiomThm,
|
|
43
|
+
betaConversion,
|
|
37
44
|
bicompose,
|
|
45
|
+
biresolution,
|
|
46
|
+
etaConversion,
|
|
38
47
|
forallElim,
|
|
39
48
|
forallIntr,
|
|
40
49
|
incrIndexesThm,
|
|
41
50
|
instantiate,
|
|
42
51
|
instantiateTypes,
|
|
52
|
+
nprems,
|
|
43
53
|
rs,
|
|
54
|
+
symmetric,
|
|
55
|
+
transitive,
|
|
44
56
|
type Instantiation,
|
|
45
57
|
type Thm,
|
|
46
58
|
} from "./thm";
|
|
47
59
|
|
|
48
60
|
const propVar = (name: string) => mkVar(name, 0, propT);
|
|
49
61
|
|
|
50
|
-
// The basic rules of Pure.thy, with the variable names Isabelle gives them.
|
|
51
|
-
export const cutRl = axiomThm(
|
|
52
|
-
mkImplies(
|
|
53
|
-
mkImplies(propVar("psi"), propVar("theta")),
|
|
54
|
-
mkImplies(propVar("psi"), propVar("theta")),
|
|
55
|
-
),
|
|
56
|
-
);
|
|
57
62
|
export const revcutRl = axiomThm(
|
|
58
63
|
mkImplies(propVar("V"), mkImplies(mkImplies(propVar("V"), propVar("W")), propVar("W"))),
|
|
59
64
|
);
|
|
@@ -64,6 +69,13 @@ export const remdupsRl = axiomThm(
|
|
|
64
69
|
);
|
|
65
70
|
export const protectI = axiomThm(mkImplies(propVar("A"), protect(propVar("A"))));
|
|
66
71
|
export const protectD = axiomThm(mkImplies(protect(propVar("A")), propVar("A")));
|
|
72
|
+
export const protectCong = axiomThm(mkEquals(protect(propVar("A")), protect(propVar("A"))));
|
|
73
|
+
export const equalsCong = axiomThm(
|
|
74
|
+
mkEquals(
|
|
75
|
+
mkEquals(mkVar("x", 0, mkTVar("'a", 0)), mkVar("y", 0, mkTVar("'a", 0))),
|
|
76
|
+
mkEquals(mkVar("x", 0, mkTVar("'a", 0)), mkVar("y", 0, mkTVar("'a", 0))),
|
|
77
|
+
),
|
|
78
|
+
);
|
|
67
79
|
export const reflexiveThm = axiomThm(
|
|
68
80
|
mkEquals(mkVar("x", 0, mkTVar("'a", 0)), mkVar("x", 0, mkTVar("'a", 0))),
|
|
69
81
|
);
|
|
@@ -94,7 +106,6 @@ export const trivForallEquality = axiomThm(
|
|
|
94
106
|
mkEquals(mkApp(allConst(typeA), mkAbs("x", typeA, propVar("V"))), propVar("V")),
|
|
95
107
|
);
|
|
96
108
|
|
|
97
|
-
// Drule.norm_hhf_eq: (PROP ?phi ==> (!!x. PROP ?psi x)) == (!!x. PROP ?phi ==> PROP ?psi x).
|
|
98
109
|
export const normHhfEq = axiomThm(
|
|
99
110
|
mkEquals(
|
|
100
111
|
mkImplies(
|
|
@@ -115,7 +126,6 @@ export const normHhfEq = axiomThm(
|
|
|
115
126
|
),
|
|
116
127
|
);
|
|
117
128
|
|
|
118
|
-
// Drule.is_norm_hhf: no quantifier right of an implication and no beta redex.
|
|
119
129
|
export const isNormHhf = (isProtecting: boolean, term: Term): boolean => {
|
|
120
130
|
if (term.kind === "Const") return term.name !== "Pure.sort_constraint";
|
|
121
131
|
if (term.kind === "Abs") return isNormHhf(isProtecting, term.body);
|
|
@@ -134,7 +144,6 @@ export const isNormHhf = (isProtecting: boolean, term: Term): boolean => {
|
|
|
134
144
|
return isNormHhf(isProtecting, term.fun) && isNormHhf(isProtecting, term.arg);
|
|
135
145
|
};
|
|
136
146
|
|
|
137
|
-
// Drule.outer_params: the outermost parameters, named apart.
|
|
138
147
|
const outerParams = (term: Term) => {
|
|
139
148
|
const vars = stripAllVars(term);
|
|
140
149
|
const names = variantList(
|
|
@@ -144,7 +153,6 @@ const outerParams = (term: Term) => {
|
|
|
144
153
|
return vars.map((variable, index) => ({ name: names[index], type: variable.type }));
|
|
145
154
|
};
|
|
146
155
|
|
|
147
|
-
// Variable.gen_all: the outermost parameters become schematic variables.
|
|
148
156
|
export const genAll = (thm: Thm) => {
|
|
149
157
|
const index = Math.max(thm.maxidx, -1) + 1;
|
|
150
158
|
return outerParams(thm.prop).reduce(
|
|
@@ -153,9 +161,8 @@ export const genAll = (thm: Thm) => {
|
|
|
153
161
|
);
|
|
154
162
|
};
|
|
155
163
|
|
|
156
|
-
// Thm.forall_intr_vars: quantifies the schematic variables in order of appearance.
|
|
157
164
|
export const forallIntrVars = (thm: Thm) => {
|
|
158
|
-
const vars = fullProps(thm).reduce(
|
|
165
|
+
const vars = fullProps(thm).reduce<Var[]>(
|
|
159
166
|
(result, term) =>
|
|
160
167
|
foldVars(
|
|
161
168
|
(atom, current: Var[]) =>
|
|
@@ -165,17 +172,16 @@ export const forallIntrVars = (thm: Thm) => {
|
|
|
165
172
|
term,
|
|
166
173
|
result,
|
|
167
174
|
),
|
|
168
|
-
[]
|
|
175
|
+
[],
|
|
169
176
|
);
|
|
170
177
|
return vars.reduceRight((result, variable) => forallIntr(variable, result), thm);
|
|
171
178
|
};
|
|
172
179
|
|
|
173
180
|
const variantBound = (name: string, used: NameContext) =>
|
|
174
|
-
variantName(name
|
|
181
|
+
variantName(isBoundName(name) ? "u" : name, used);
|
|
175
182
|
|
|
176
183
|
const fullProps = (thm: Thm) => [...thm.tpairs.flatMap((pair) => [pair[0], pair[1]]), thm.prop];
|
|
177
184
|
|
|
178
|
-
// Drule.zero_var_indexes: renames the schematic variables apart with index 0.
|
|
179
185
|
export const zeroVarIndexes = (thm: Thm): Thm => {
|
|
180
186
|
const terms = fullProps(thm);
|
|
181
187
|
const tvars = terms.reduce(
|
|
@@ -224,41 +230,85 @@ export const zeroVarIndexes = (thm: Thm): Thm => {
|
|
|
224
230
|
return instantiate(insts, instantiateTypes(tyenv, thm));
|
|
225
231
|
};
|
|
226
232
|
|
|
227
|
-
// Tactic.make_elim: turns a destruction rule into an elimination rule.
|
|
228
233
|
export const makeElim = (rule: Thm) => zeroVarIndexes(rs(rule, revcutRl));
|
|
229
234
|
|
|
230
|
-
// Drule.compose: resolves tha into premise index of thb without lifting, with a unique result.
|
|
231
235
|
const compose = (tha: Thm, index: number, thb: Thm): Thm => {
|
|
232
|
-
const results =
|
|
233
|
-
|
|
234
|
-
|
|
235
|
-
|
|
236
|
-
|
|
237
|
-
|
|
238
|
-
|
|
236
|
+
const results = distinctThms(
|
|
237
|
+
listOfSeq(
|
|
238
|
+
bicompose(
|
|
239
|
+
undefined,
|
|
240
|
+
{ flatten: true, match: false, incremented: true },
|
|
241
|
+
{ isElim: false, rule: tha, subgoals: 0 },
|
|
242
|
+
index,
|
|
243
|
+
thb,
|
|
244
|
+
),
|
|
239
245
|
),
|
|
240
|
-
)
|
|
246
|
+
);
|
|
241
247
|
if (results.length !== 1)
|
|
242
248
|
throw new TlaIsabelleError("THM", `compose: unique result expected ${index}`);
|
|
243
249
|
return results[0];
|
|
244
250
|
};
|
|
245
251
|
|
|
246
|
-
|
|
252
|
+
export const betaEtaConversion = (term: Term) => {
|
|
253
|
+
const beta = betaConversion(true, term);
|
|
254
|
+
return transitive(beta, etaConversion(destEquals(beta.prop)[1]));
|
|
255
|
+
};
|
|
256
|
+
|
|
257
|
+
// f ?x1 ... ?xn == u becomes f == %x1 ... xn. u.
|
|
258
|
+
export const absDef = (thm: Thm): Thm => {
|
|
259
|
+
const contractLhs = (current: Thm) =>
|
|
260
|
+
transitive(symmetric(betaEtaConversion(destEquals(current.prop)[0])), current);
|
|
261
|
+
const varArgs = (term: Term): Term[] => {
|
|
262
|
+
if (term.kind !== "App" || term.arg.kind !== "Var") return [];
|
|
263
|
+
const variable = term.arg;
|
|
264
|
+
return [variable, ...varArgs(term.fun).filter((other) => !aconv(other, variable))];
|
|
265
|
+
};
|
|
266
|
+
const contracted = contractLhs(thm);
|
|
267
|
+
return contractLhs(
|
|
268
|
+
varArgs(destEquals(contracted.prop)[0]).reduce(
|
|
269
|
+
(current, variable) =>
|
|
270
|
+
abstractRule(variable.kind === "Var" ? variable.name : "", variable, current),
|
|
271
|
+
contracted,
|
|
272
|
+
),
|
|
273
|
+
);
|
|
274
|
+
};
|
|
275
|
+
|
|
247
276
|
export const compIncr = (tha: Thm, thb: Thm) =>
|
|
248
277
|
compose(tha, 1, incrIndexesThm(tha.maxidx + 1, thb));
|
|
249
278
|
|
|
250
|
-
// Drule.comp_no_flatten: composes th, keeping its first count premises, into premise index of
|
|
251
|
-
// rule.
|
|
252
279
|
export const compNoFlatten = (thm: Thm, count: number, index: number, rule: Thm): Thm => {
|
|
253
|
-
const results =
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
|
|
280
|
+
const results = distinctThms(
|
|
281
|
+
listOfSeq(
|
|
282
|
+
bicompose(
|
|
283
|
+
undefined,
|
|
284
|
+
{ flatten: false, match: false, incremented: true },
|
|
285
|
+
{ isElim: false, rule: thm, subgoals: count },
|
|
286
|
+
index,
|
|
287
|
+
incrIndexesThm(thm.maxidx + 1, rule),
|
|
288
|
+
),
|
|
260
289
|
),
|
|
261
|
-
)
|
|
290
|
+
);
|
|
262
291
|
if (results.length !== 1) throw new TlaIsabelleError("THM", `comp_no_flatten ${index}`);
|
|
263
292
|
return results[0];
|
|
264
293
|
};
|
|
294
|
+
|
|
295
|
+
export const multiResolves = (
|
|
296
|
+
limits: Limits,
|
|
297
|
+
facts: readonly Thm[],
|
|
298
|
+
rules: readonly Thm[],
|
|
299
|
+
): Seq<Thm> =>
|
|
300
|
+
mapsSeq(
|
|
301
|
+
(rule) =>
|
|
302
|
+
facts.reduceRight<Seq<Thm>>(
|
|
303
|
+
(results, fact, index) =>
|
|
304
|
+
mapsSeq(
|
|
305
|
+
(thm) =>
|
|
306
|
+
index + 1 > nprems(thm)
|
|
307
|
+
? emptySeq
|
|
308
|
+
: biresolution(limits, false, [{ isElim: false, rule: fact }], index + 1, thm),
|
|
309
|
+
results,
|
|
310
|
+
),
|
|
311
|
+
singleSeq(rule),
|
|
312
|
+
),
|
|
313
|
+
seqOfList(rules),
|
|
314
|
+
);
|
|
@@ -1,8 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/envir.ML. Copyright (c) 1986-2025 University of Cambridge,
|
|
2
|
-
// Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
3
|
-
//
|
|
4
|
-
// Environments of assignments to schematic variables, and beta and eta normalization.
|
|
5
|
-
|
|
6
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
7
2
|
import {
|
|
8
3
|
emptyTable,
|
|
@@ -36,7 +31,7 @@ import {
|
|
|
36
31
|
type Typ,
|
|
37
32
|
type Var,
|
|
38
33
|
} from "./term";
|
|
39
|
-
import { devar, emptyTyEnv, normType,
|
|
34
|
+
import { devar, emptyTyEnv, normType, unifiedTypes, type TyEnv } from "./type";
|
|
40
35
|
|
|
41
36
|
export interface Binding {
|
|
42
37
|
readonly type: Typ;
|
|
@@ -63,7 +58,6 @@ const initEnvir = emptyEnvir(-1);
|
|
|
63
58
|
|
|
64
59
|
export const isEmptyEnvir = (envir: Envir) => isEmptyTable(envir.tenv) && isEmptyTable(envir.tyenv);
|
|
65
60
|
|
|
66
|
-
// radixstring (26, "a", n)
|
|
67
61
|
const radixString = (value: number): string => {
|
|
68
62
|
const digits: number[] = [];
|
|
69
63
|
let remaining = value;
|
|
@@ -74,7 +68,6 @@ const radixString = (value: number): string => {
|
|
|
74
68
|
return digits.map((digit) => String.fromCharCode(97 + digit)).join("");
|
|
75
69
|
};
|
|
76
70
|
|
|
77
|
-
// Envir.genvars: fresh variables with an index above every present one.
|
|
78
71
|
export const genvars = (name: string, envir: Envir, types: readonly Typ[]): [Envir, Var[]] => {
|
|
79
72
|
const index = envir.maxidx + 1;
|
|
80
73
|
const vars = types.map((type, position) =>
|
|
@@ -88,17 +81,14 @@ export const genvar = (name: string, envir: Envir, type: Typ): [Envir, Var] => {
|
|
|
88
81
|
return [updated, vars[0]];
|
|
89
82
|
};
|
|
90
83
|
|
|
91
|
-
// Envir.lookup1: lookup without chasing type assignments, for environments from matching.
|
|
92
84
|
export const lookup1 = (tenv: TEnv, variable: Var): Term | undefined => {
|
|
93
85
|
const binding = lookupTable(tenv, variable);
|
|
94
86
|
if (binding === undefined) return undefined;
|
|
95
|
-
if (!
|
|
87
|
+
if (!unifiedTypes(emptyTyEnv, variable.type, binding.type))
|
|
96
88
|
throw new TlaIsabelleError("TYPE", "Variable has two distinct types");
|
|
97
89
|
return binding.term;
|
|
98
90
|
};
|
|
99
91
|
|
|
100
|
-
const eqTypExact = (left: Typ, right: Typ) => unifiedTypes(emptyTyEnv, left, right);
|
|
101
|
-
|
|
102
92
|
export const lookup = (envir: Envir, variable: Var): Term | undefined => {
|
|
103
93
|
const binding = lookupTable(envir.tenv, variable);
|
|
104
94
|
if (binding === undefined) return undefined;
|
|
@@ -120,7 +110,6 @@ export const update = (variable: Var, term: Term, envir: Envir): Envir => {
|
|
|
120
110
|
};
|
|
121
111
|
};
|
|
122
112
|
|
|
123
|
-
// Envir.above: whether the least index updated exceeds limit.
|
|
124
113
|
export const above = (envir: Envir, limit: number) => {
|
|
125
114
|
const term = minTable(envir.tenv);
|
|
126
115
|
const type = minTable(envir.tyenv);
|
|
@@ -129,7 +118,6 @@ export const above = (envir: Envir, limit: number) => {
|
|
|
129
118
|
);
|
|
130
119
|
};
|
|
131
120
|
|
|
132
|
-
// Envir.vupdate: an assignment that suppresses higher indexes between variables.
|
|
133
121
|
export const vupdate = (variable: Var, term: Term, envir: Envir): Envir => {
|
|
134
122
|
if (term.kind !== "Var") return update(variable, term, envir);
|
|
135
123
|
if (variable.name === term.name && variable.index === term.index) return envir;
|
|
@@ -191,7 +179,6 @@ const normTerm2 = (envir: Envir, term: Term): Term => {
|
|
|
191
179
|
}
|
|
192
180
|
};
|
|
193
181
|
|
|
194
|
-
// Envir.norm_term: instantiates the environment and beta-normalizes.
|
|
195
182
|
export const normTerm = (envir: Envir, term: Term): Term => {
|
|
196
183
|
if (isEmptyEnvir(envir) && !couldBetaContract(term)) return term;
|
|
197
184
|
return isEmptyTable(envir.tyenv) ? normTerm1(envir.tenv, term) : normTerm2(envir, term);
|
|
@@ -199,7 +186,6 @@ export const normTerm = (envir: Envir, term: Term): Term => {
|
|
|
199
186
|
|
|
200
187
|
export const betaNorm = (term: Term) => normTerm(initEnvir, term);
|
|
201
188
|
|
|
202
|
-
// Envir.head_norm: normalizes the head only, for unification.
|
|
203
189
|
export const headNorm = (envir: Envir, term: Term): Term => {
|
|
204
190
|
if ((flagsOf(term) & (HAS_VAR | HAS_REDEX)) === 0) return term;
|
|
205
191
|
switch (term.kind) {
|
|
@@ -250,7 +236,6 @@ const etaSame = (term: Term): Term => {
|
|
|
250
236
|
return term;
|
|
251
237
|
};
|
|
252
238
|
|
|
253
|
-
// Envir.eta_contract
|
|
254
239
|
export const etaContract = (term: Term) => (couldEtaContract(term) ? etaSame(term) : term);
|
|
255
240
|
|
|
256
241
|
export const aeconv = (left: Term, right: Term) =>
|
|
@@ -275,7 +260,6 @@ export const envBinderTypes = (envir: Envir, type: Typ): Typ[] => {
|
|
|
275
260
|
return [];
|
|
276
261
|
};
|
|
277
262
|
|
|
278
|
-
// Envir.fastype: the type of a term, chasing type assignments at applications.
|
|
279
263
|
export const fastype = (envir: Envir, types: readonly Typ[], term: Term): Typ => {
|
|
280
264
|
switch (term.kind) {
|
|
281
265
|
case "App": {
|
|
@@ -294,38 +278,3 @@ export const fastype = (envir: Envir, types: readonly Typ[], term: Term): Typ =>
|
|
|
294
278
|
return term.type;
|
|
295
279
|
}
|
|
296
280
|
};
|
|
297
|
-
|
|
298
|
-
// Envir.subst_term: instantiates without chasing variables.
|
|
299
|
-
const substTermAux = (tyenv: TyEnv, tenv: TEnv, term: Term): Term => {
|
|
300
|
-
if (maxidxOfTerm(term) < 0) return term;
|
|
301
|
-
switch (term.kind) {
|
|
302
|
-
case "Const":
|
|
303
|
-
case "Free": {
|
|
304
|
-
const type = isEmptyTable(tyenv) ? term.type : substType(tyenv, term.type);
|
|
305
|
-
return type === term.type ? term : { ...term, type };
|
|
306
|
-
}
|
|
307
|
-
case "Var": {
|
|
308
|
-
const assigned = lookup1(tenv, term);
|
|
309
|
-
if (assigned !== undefined) return assigned;
|
|
310
|
-
const type = isEmptyTable(tyenv) ? term.type : substType(tyenv, term.type);
|
|
311
|
-
return type === term.type ? term : { ...term, type };
|
|
312
|
-
}
|
|
313
|
-
case "Bound":
|
|
314
|
-
return term;
|
|
315
|
-
case "Abs":
|
|
316
|
-
return updateAbs(
|
|
317
|
-
term,
|
|
318
|
-
substTermAux(tyenv, tenv, term.body),
|
|
319
|
-
isEmptyTable(tyenv) ? term.type : substType(tyenv, term.type),
|
|
320
|
-
);
|
|
321
|
-
case "App":
|
|
322
|
-
return updateApp(
|
|
323
|
-
term,
|
|
324
|
-
substTermAux(tyenv, tenv, term.fun),
|
|
325
|
-
substTermAux(tyenv, tenv, term.arg),
|
|
326
|
-
);
|
|
327
|
-
}
|
|
328
|
-
};
|
|
329
|
-
|
|
330
|
-
export const substTerm = (tyenv: TyEnv, tenv: TEnv, term: Term) =>
|
|
331
|
-
isEmptyTable(tenv) && isEmptyTable(tyenv) ? term : substTermAux(tyenv, tenv, term);
|
|
@@ -1,18 +1,12 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/goal.ML: focusing a tactic on one subgoal. Copyright (c)
|
|
2
|
-
// 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see
|
|
3
|
-
// LICENSE.
|
|
4
|
-
|
|
5
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
6
2
|
import { compNoFlatten, protectD, protectI } from "./drule";
|
|
7
3
|
import { emptySeq } from "./seq";
|
|
8
4
|
import { primitive, thenTac, type GoalTactic, type Tactic } from "./tactical";
|
|
9
5
|
import { nprems, permutePrems, type Thm } from "./thm";
|
|
10
6
|
|
|
11
|
-
// A ==> ... ==> C becomes A ==> #(... ==> C), keeping count premises.
|
|
12
7
|
const protect = (count: number, thm: Thm) => compNoFlatten(thm, count, 1, protectI);
|
|
13
8
|
|
|
14
|
-
|
|
15
|
-
const conclude = (thm: Thm) => compNoFlatten(thm, nprems(thm), 1, protectD);
|
|
9
|
+
export const conclude = (thm: Thm) => compNoFlatten(thm, nprems(thm), 1, protectD);
|
|
16
10
|
|
|
17
11
|
const restrict = (index: number, count: number, state: Thm) => {
|
|
18
12
|
if (index < 1 || count < 1 || index + count - 1 > nprems(state))
|
|
@@ -22,7 +16,6 @@ const restrict = (index: number, count: number, state: Thm) => {
|
|
|
22
16
|
|
|
23
17
|
const unrestrict = (index: number, state: Thm) => permutePrems(0, 1 - index, conclude(state));
|
|
24
18
|
|
|
25
|
-
// SELECT_GOAL: runs the tactic on goal index alone.
|
|
26
19
|
export const selectGoal =
|
|
27
20
|
(tactic: Tactic): GoalTactic =>
|
|
28
21
|
(index) =>
|
|
@@ -37,7 +30,6 @@ export const selectGoal =
|
|
|
37
30
|
)(state);
|
|
38
31
|
};
|
|
39
32
|
|
|
40
|
-
// PREFER_GOAL: runs the tactic with goal index moved to the front.
|
|
41
33
|
export const preferGoal =
|
|
42
34
|
(tactic: Tactic): GoalTactic =>
|
|
43
35
|
(index) =>
|
|
@@ -1,15 +1,10 @@
|
|
|
1
|
-
// Isabelle interrupts a proof that runs out of time, wherever it is; this port checks for that at
|
|
2
|
-
// the points where Isabelle's tactics and unifier spend their time.
|
|
3
|
-
|
|
4
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
5
2
|
|
|
6
|
-
// When a proof gives up: past the deadline, a time from Date.now(), or once the signal aborts.
|
|
7
3
|
export interface Limits {
|
|
8
4
|
readonly deadline: number;
|
|
9
5
|
readonly signal?: AbortSignal;
|
|
10
6
|
}
|
|
11
7
|
|
|
12
|
-
// tlapm reports no success for an interrupted proof.
|
|
13
8
|
export const checkInterrupt = (limits: Limits) => {
|
|
14
9
|
if (Date.now() > limits.deadline || limits.signal?.aborted === true)
|
|
15
10
|
throw new TlaIsabelleError("Interrupt", "Interrupt");
|
|
@@ -1,7 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/logic.ML, the abstract syntax of the meta logic. Copyright (c)
|
|
2
|
-
// 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see
|
|
3
|
-
// LICENSE.
|
|
4
|
-
|
|
5
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
6
2
|
import { variantList } from "./name";
|
|
7
3
|
import {
|
|
@@ -25,7 +21,6 @@ import {
|
|
|
25
21
|
type Typ,
|
|
26
22
|
} from "./term";
|
|
27
23
|
|
|
28
|
-
// Logic.occs: whether a subterm of other is aconv to term.
|
|
29
24
|
export const occs = (term: Term, other: Term): boolean =>
|
|
30
25
|
mayOccur(term, other) &&
|
|
31
26
|
(aconv(term, other) ||
|
|
@@ -52,7 +47,6 @@ export const mkEquals = (left: Term, right: Term) => {
|
|
|
52
47
|
return mkApp(mkApp(mkConst("Pure.eq", funTs([type, type], propT)), left), right);
|
|
53
48
|
};
|
|
54
49
|
|
|
55
|
-
// A term c $ x $ y.
|
|
56
50
|
interface ConstApp2 extends App {
|
|
57
51
|
readonly fun: App;
|
|
58
52
|
}
|
|
@@ -101,7 +95,6 @@ export const stripImpConcl = (term: Term): Term => {
|
|
|
101
95
|
return current;
|
|
102
96
|
};
|
|
103
97
|
|
|
104
|
-
// Logic.strip_prems: removes count premises, returning them reversed onto premises.
|
|
105
98
|
export const stripPrems = (
|
|
106
99
|
count: number,
|
|
107
100
|
premises: readonly Term[],
|
|
@@ -124,11 +117,9 @@ export const isProtected = (term: Term) =>
|
|
|
124
117
|
export const mkTerm = (term: Term) =>
|
|
125
118
|
mkApp(mkConst("Pure.term", funT(fastypeOf(term), propT)), term);
|
|
126
119
|
|
|
127
|
-
// Logic.combound: term(Bound (start+count-1), ..., Bound start).
|
|
128
120
|
export const combound = (term: Term, start: number, count: number): Term =>
|
|
129
121
|
count > 0 ? mkApp(combound(term, start + 1, count - 1), mkBound(start)) : term;
|
|
130
122
|
|
|
131
|
-
// Logic.rlist_abs: ([xn, ..., x1], body) to %x1 ... xn. body.
|
|
132
123
|
export const rlistAbs = (binders: readonly Binder[], body: Term) =>
|
|
133
124
|
binders.reduce((result, binder) => mkAbs(binder.name, binder.type, result), body);
|
|
134
125
|
|
|
@@ -141,7 +132,6 @@ const incrTVar = (increment: number, type: Typ) =>
|
|
|
141
132
|
type,
|
|
142
133
|
);
|
|
143
134
|
|
|
144
|
-
// Logic.incr_indexes_operation: lifts the variables over the types and increments their indexes.
|
|
145
135
|
const incrIndexesFixed = (
|
|
146
136
|
fixed: readonly string[],
|
|
147
137
|
types: readonly Typ[],
|
|
@@ -191,7 +181,7 @@ const incrIndexesFixed = (
|
|
|
191
181
|
export const incrIndexes = (types: readonly Typ[], increment: number, term: Term) =>
|
|
192
182
|
incrIndexesFixed([], types, increment, 0, term);
|
|
193
183
|
|
|
194
|
-
const isAllAbs = (
|
|
184
|
+
export const isAllAbs = (
|
|
195
185
|
term: Term,
|
|
196
186
|
): term is Extract<Term, { kind: "App" }> & {
|
|
197
187
|
arg: Extract<Term, { kind: "Abs" }>;
|
|
@@ -201,7 +191,6 @@ const isAllAbs = (
|
|
|
201
191
|
term.fun.name === "Pure.all" &&
|
|
202
192
|
term.arg.kind === "Abs";
|
|
203
193
|
|
|
204
|
-
// Logic.lift_abs: lifts a term over the parameters of a goal.
|
|
205
194
|
export const liftAbs = (increment: number, goal: Term, term: Term): Term => {
|
|
206
195
|
const lift = (types: Typ[], current: Term): Term => {
|
|
207
196
|
if (isConstApp2(current, "Pure.imp")) return lift(types, current.arg);
|
|
@@ -216,7 +205,6 @@ export const liftAbs = (increment: number, goal: Term, term: Term): Term => {
|
|
|
216
205
|
return lift([], goal);
|
|
217
206
|
};
|
|
218
207
|
|
|
219
|
-
// Logic.lift_all: lifts a proposition over the parameters and premises of a goal.
|
|
220
208
|
export const liftAll = (increment: number, goal: Term, term: Term): Term => {
|
|
221
209
|
const lift = (types: Typ[], current: Term): Term => {
|
|
222
210
|
if (isConstApp2(current, "Pure.imp"))
|
|
@@ -281,7 +269,6 @@ export const hasMetaPrems = (term: Term): boolean => {
|
|
|
281
269
|
return false;
|
|
282
270
|
};
|
|
283
271
|
|
|
284
|
-
// Logic.remove_params: drops count parameters and premise number index.
|
|
285
272
|
const removeParams = (count: number, index: number, term: Term): Term => {
|
|
286
273
|
if (count === 0 && index <= 0) return term;
|
|
287
274
|
if (isConstApp2(term, "Pure.imp"))
|
|
@@ -293,7 +280,6 @@ const removeParams = (count: number, index: number, term: Term): Term => {
|
|
|
293
280
|
return term;
|
|
294
281
|
};
|
|
295
282
|
|
|
296
|
-
// Logic.flatten_params: moves all parameters to the front, renaming them apart.
|
|
297
283
|
export const flattenParams = (index: number, term: Term) => {
|
|
298
284
|
const params = stripParams(term);
|
|
299
285
|
const names = variantList(
|
|
@@ -304,7 +290,6 @@ export const flattenParams = (index: number, term: Term) => {
|
|
|
304
290
|
return listAll(vars, removeParams(vars.length, index, term));
|
|
305
291
|
};
|
|
306
292
|
|
|
307
|
-
// Logic.strip_assums_imp: strips at most count premises.
|
|
308
293
|
const stripAssumsImp = (count: number, hyps: Term[], term: Term): [Term[], Term] => {
|
|
309
294
|
if (count === 0) return [hyps, term];
|
|
310
295
|
if (isConstApp2(term, "Pure.imp"))
|
|
@@ -1,8 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/name.ML and the name bumping of Pure/General/symbol.ML.
|
|
2
|
-
// Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and
|
|
3
|
-
// contributors, see LICENSE.
|
|
4
|
-
|
|
5
|
-
// Symbol.explode: \<name> symbols count as one symbol.
|
|
6
1
|
const explodeSymbols = (text: string): string[] => text.match(/\\<\^?[A-Za-z0-9_']*>|[^]/gu) ?? [];
|
|
7
2
|
|
|
8
3
|
const isRawSymbolic = (symbol: string) => symbol.startsWith("\\<") && !symbol.startsWith("\\<^");
|
|
@@ -48,7 +43,6 @@ const cleanIndex = (name: string): [string, number] => {
|
|
|
48
43
|
|
|
49
44
|
export const cleanName = (name: string) => cleanIndex(name)[0];
|
|
50
45
|
|
|
51
|
-
// Name.context: the declared names with their latest renaming.
|
|
52
46
|
export type NameContext = ReadonlyMap<string, string | undefined>;
|
|
53
47
|
|
|
54
48
|
export const declareName = (name: string, context: NameContext): NameContext => {
|
|
@@ -65,7 +59,6 @@ export const emptyNameContext: NameContext = new Map([
|
|
|
65
59
|
export const makeNameContext = (names: readonly string[]) =>
|
|
66
60
|
names.reduce((context, name) => declareName(name, context), emptyNameContext);
|
|
67
61
|
|
|
68
|
-
// Name.variant: a name distinct from the declared ones, keeping a suffix of underscores.
|
|
69
62
|
export const variantName = (name: string, context: NameContext): [string, NameContext] => {
|
|
70
63
|
const [base, count] = cleanIndex(name);
|
|
71
64
|
if (!context.has(base)) return [base + "_".repeat(count), declareName(base, context)];
|
|
@@ -79,7 +72,7 @@ export const variantName = (name: string, context: NameContext): [string, NameCo
|
|
|
79
72
|
return [current + "_".repeat(count), declareName(current, renamed)];
|
|
80
73
|
};
|
|
81
74
|
|
|
82
|
-
|
|
75
|
+
const variantNames = (names: readonly string[], context: NameContext) => {
|
|
83
76
|
let current = context;
|
|
84
77
|
return names.map((name) => {
|
|
85
78
|
const [variant, next] = variantName(name, current);
|
|
@@ -91,8 +84,6 @@ export const variantNames = (names: readonly string[], context: NameContext) =>
|
|
|
91
84
|
export const variantList = (used: readonly string[], names: readonly string[]) =>
|
|
92
85
|
variantNames(names, makeNameContext(used));
|
|
93
86
|
|
|
94
|
-
// Name.is_bound and Name.bound: the names of loose bound variables in nets and printing.
|
|
95
|
-
// Name.is_bound: the names the simplifier gives the free variables standing for bound ones.
|
|
96
87
|
export const isBoundName = (name: string) => name.startsWith(":");
|
|
97
88
|
|
|
98
89
|
export const boundName = (index: number) => `:${String(index).padStart(3, "0")}`;
|