tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.c92e6a4ea
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 +2 -1
- 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 +37 -0
- package/dist/index.d.ts +37 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -44
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +44 -41
- package/dist/transfer.js +45 -42
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -41
- package/src/bags.ts +2 -5
- package/src/builtins.ts +5 -21
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +268 -0
- package/src/check.ts +578 -757
- package/src/cli/options.ts +6 -31
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +27 -62
- package/src/cli/shared.ts +1 -5
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +246 -240
- package/src/cli/tlc-output.ts +686 -0
- package/src/cli/tlc-usage.ts +3 -5
- package/src/cli/tlc.ts +59 -707
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +73 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +34 -107
- package/src/exit-codes.ts +3 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -9
- package/src/json-reader.ts +1 -2
- package/src/json.ts +8 -18
- package/src/levels.ts +46 -57
- package/src/lexer.ts +76 -85
- package/src/liveness-checker.ts +634 -306
- package/src/liveness.ts +104 -120
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +55 -80
- package/src/parser.ts +722 -385
- package/src/pcal/ast.ts +53 -65
- package/src/pcal/parse.ts +144 -191
- package/src/pcal/tokenize.ts +91 -115
- package/src/pcal/translate.ts +83 -98
- package/src/pcal/validate.ts +48 -50
- package/src/pretty-print.ts +7 -7
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- 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 +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- 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 -1
- 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 +613 -6
- 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/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- 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 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- 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 +38 -10
- 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 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- 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 -3
- 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 +908 -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 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- 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 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- 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 +175 -15
- 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 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- 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 +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- 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 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +67 -16
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -289
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- 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 -6
- 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 +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- 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 +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +236 -45
- 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 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- 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 +19 -11
- 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 +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- 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 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- 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 -1
- 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 +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- 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 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- 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 +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 +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 +3126 -316
- 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 +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- 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 +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- 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 +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +11 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/randomization.ts +1 -4
- package/src/resolve.ts +67 -143
- package/src/runtime.ts +17 -18
- package/src/sany/builtins.ts +1 -3
- 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 +160 -2683
- package/src/sany/levels.ts +5 -11
- package/src/sany/lexer.ts +57 -60
- package/src/sany/linter.ts +0 -3
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +244 -53
- package/src/simulate.ts +202 -184
- package/src/spec-description.ts +56 -82
- package/src/standard-definitions.ts +4 -3
- package/src/standard-modules.ts +17 -44
- package/src/state-graph.ts +3 -17
- package/src/subexpressions.ts +38 -47
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +20 -43
- package/src/symmetry.ts +6 -21
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +96 -30
- package/src/tlc/jar-data.ts +0 -1
- package/src/tlc/messages.ts +22 -36
- package/src/tlc/order.ts +36 -50
- package/src/tlc/random.ts +22 -34
- package/src/tlc/replay.ts +21 -48
- package/src/tlc/summary.ts +64 -58
- package/src/tlc/tlc-operators.ts +6 -17
- package/src/tlc/tlcext-operators.ts +70 -29
- package/src/tlc/trace-spec.ts +26 -51
- package/src/tlc/value-stream.ts +9 -13
- package/src/tlc/version.ts +0 -1
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +136 -338
- package/src/prover/isabelle/isar/statement.ts +0 -52
- 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
package/src/subexpressions.ts
CHANGED
|
@@ -149,9 +149,6 @@ const applyDefinition = (definition: Definition, selection: Selection) => {
|
|
|
149
149
|
return createApplication({ ...selection, params: [...selection.params, ...params] }, reference);
|
|
150
150
|
};
|
|
151
151
|
|
|
152
|
-
// Generator.selectorToNode reports the first part of a name that selects nothing, after it analyzes
|
|
153
|
-
// the arguments of the parts before, and goes on after the name. An operator or a label must be given
|
|
154
|
-
// all its arguments, except in a name that an operator argument may select whole.
|
|
155
152
|
const selectSubexpression = (
|
|
156
153
|
selectors: Selector[],
|
|
157
154
|
lookup: Lookup,
|
|
@@ -160,25 +157,27 @@ const selectSubexpression = (
|
|
|
160
157
|
): Expression => {
|
|
161
158
|
const location = reference.location;
|
|
162
159
|
const selection: Selection = { params: [], args: [], lets: [], location };
|
|
163
|
-
|
|
160
|
+
let selectorIndex = 0;
|
|
161
|
+
let current = undefined as Expression | undefined;
|
|
162
|
+
let isFailed = false;
|
|
164
163
|
|
|
165
164
|
const report = (range: SourceRange | undefined, message: string) => {
|
|
166
165
|
if (!range) throw createError(message, location);
|
|
167
166
|
selectionErrors.set(reference, {
|
|
168
167
|
args: selectors
|
|
169
|
-
.slice(0,
|
|
168
|
+
.slice(0, selectorIndex)
|
|
170
169
|
.flatMap((selector) => ("args" in selector ? selector.args : [])),
|
|
171
170
|
error: { location: formatRange(range), message },
|
|
172
171
|
});
|
|
173
|
-
|
|
172
|
+
isFailed = true;
|
|
174
173
|
return undefined;
|
|
175
174
|
};
|
|
176
175
|
|
|
177
176
|
const findDefinition = (local: Definition[] | undefined) => {
|
|
178
177
|
const names: string[] = [];
|
|
179
178
|
const args: Expression[] = [];
|
|
180
|
-
while (
|
|
181
|
-
const selector = selectors[
|
|
179
|
+
while (selectorIndex < selectors.length) {
|
|
180
|
+
const selector = selectors[selectorIndex];
|
|
182
181
|
if (selector.kind !== "Name") throw createError("Expected an operator name", location);
|
|
183
182
|
names.push(selector.name);
|
|
184
183
|
args.push(...selector.args);
|
|
@@ -188,7 +187,7 @@ const selectSubexpression = (
|
|
|
188
187
|
: lookup(name);
|
|
189
188
|
if (definition)
|
|
190
189
|
return { definition, name, args, earlier: args.length - selector.args.length };
|
|
191
|
-
|
|
190
|
+
selectorIndex++;
|
|
192
191
|
}
|
|
193
192
|
throw createError(`Unknown operator ${names.join("!")}`, location);
|
|
194
193
|
};
|
|
@@ -197,10 +196,10 @@ const selectSubexpression = (
|
|
|
197
196
|
const found = findDefinition(local);
|
|
198
197
|
const definition = found.definition;
|
|
199
198
|
const arity = getArity(definition);
|
|
200
|
-
const isLast =
|
|
199
|
+
const isLast = selectorIndex === selectors.length - 1;
|
|
201
200
|
if (found.args.length !== arity && (!isOperator || found.args.length !== 0)) {
|
|
202
201
|
return report(
|
|
203
|
-
reference.argumentRanges?.[
|
|
202
|
+
reference.argumentRanges?.[selectorIndex] ?? location.range,
|
|
204
203
|
`The operator ${found.name} requires ${arity - found.earlier} arguments.`,
|
|
205
204
|
);
|
|
206
205
|
}
|
|
@@ -210,17 +209,17 @@ const selectSubexpression = (
|
|
|
210
209
|
}
|
|
211
210
|
selection.params.push(...definition.params);
|
|
212
211
|
selection.args.push(...found.args);
|
|
213
|
-
|
|
214
|
-
|
|
212
|
+
current = definition.body;
|
|
213
|
+
selectorIndex++;
|
|
215
214
|
return undefined;
|
|
216
215
|
};
|
|
217
216
|
|
|
218
217
|
const followLabels = () => {
|
|
219
|
-
while (
|
|
220
|
-
const selector = selectors[
|
|
218
|
+
while (selectorIndex < selectors.length && !isFailed) {
|
|
219
|
+
const selector = selectors[selectorIndex];
|
|
221
220
|
if (selector.kind !== "Name") return;
|
|
222
|
-
const range = reference.selectorRanges?.[
|
|
223
|
-
const found =
|
|
221
|
+
const range = reference.selectorRanges?.[selectorIndex];
|
|
222
|
+
const found = current && findLabel(current, selector.name, []);
|
|
224
223
|
if (!found) return report(range, `Cannot find label \`${selector.name}'.`);
|
|
225
224
|
const params = found.label.params;
|
|
226
225
|
if (!isOperator && selector.args.length !== params.length) {
|
|
@@ -229,17 +228,16 @@ const selectSubexpression = (
|
|
|
229
228
|
selection.lets.push(...found.lets);
|
|
230
229
|
selection.params.push(...params.map((name) => ({ name, arity: 0 })));
|
|
231
230
|
selection.args.push(...selector.args);
|
|
232
|
-
|
|
233
|
-
|
|
231
|
+
current = found.label.body;
|
|
232
|
+
selectorIndex++;
|
|
234
233
|
}
|
|
235
234
|
};
|
|
236
235
|
|
|
237
236
|
const selectOperand = (selector: Selector) => {
|
|
238
|
-
const current = state.current;
|
|
239
237
|
if (!current) throw createError("Subexpression selection failed", location);
|
|
240
238
|
if (selector.kind === "Colon") return;
|
|
241
239
|
if (current.kind === "Label") {
|
|
242
|
-
|
|
240
|
+
current = current.body;
|
|
243
241
|
selectOperand(selector);
|
|
244
242
|
return;
|
|
245
243
|
}
|
|
@@ -248,14 +246,14 @@ const selectSubexpression = (
|
|
|
248
246
|
throw createError("A LET/IN expression has only one operand", location);
|
|
249
247
|
}
|
|
250
248
|
selection.lets.push(current.definitions);
|
|
251
|
-
|
|
249
|
+
current = current.body;
|
|
252
250
|
return;
|
|
253
251
|
}
|
|
254
252
|
const binder = getBinder(current);
|
|
255
253
|
if (binder && (selector.kind === "Bound" || selector.kind === "At")) {
|
|
256
254
|
selection.params.push(...binder.names.map((name) => ({ name, arity: 0 })));
|
|
257
255
|
if (selector.kind === "Bound") selection.args.push(...selector.args);
|
|
258
|
-
|
|
256
|
+
current = binder.body;
|
|
259
257
|
return;
|
|
260
258
|
}
|
|
261
259
|
if (current.kind === "Case" && selector.kind === "Operand") {
|
|
@@ -264,15 +262,15 @@ const selectSubexpression = (
|
|
|
264
262
|
...(current.other ? [{ condition: undefined, body: current.other }] : []),
|
|
265
263
|
];
|
|
266
264
|
const arm = arms[getOperandIndex(selector.operand, arms.length)];
|
|
267
|
-
const next = selectors[
|
|
265
|
+
const next = selectors[selectorIndex + 1];
|
|
268
266
|
if (!arm || next?.kind !== "Operand") {
|
|
269
267
|
throw createError("A subexpression of CASE must have the form !i!j", location);
|
|
270
268
|
}
|
|
271
|
-
|
|
269
|
+
selectorIndex++;
|
|
272
270
|
const part = getOperandIndex(next.operand, 2);
|
|
273
271
|
const chosen = part === 0 ? arm.condition : part === 1 ? arm.body : undefined;
|
|
274
272
|
if (!chosen) throw createError("Nonexistent CASE operand", location);
|
|
275
|
-
|
|
273
|
+
current = chosen;
|
|
276
274
|
return;
|
|
277
275
|
}
|
|
278
276
|
if (selector.kind !== "Operand")
|
|
@@ -280,23 +278,23 @@ const selectSubexpression = (
|
|
|
280
278
|
const operands = binder ? binder.sets : getOperands(current);
|
|
281
279
|
const operand = operands?.[getOperandIndex(selector.operand, operands.length)];
|
|
282
280
|
if (!operand) throw createError("Nonexistent operand specified by the selector", location);
|
|
283
|
-
|
|
281
|
+
current = operand;
|
|
284
282
|
};
|
|
285
283
|
|
|
286
284
|
const first = enterDefinition(undefined);
|
|
287
|
-
if (
|
|
285
|
+
if (isFailed) return reference;
|
|
288
286
|
if (first) return applyDefinition(first.definition, { ...selection, args: first.args });
|
|
289
287
|
followLabels();
|
|
290
|
-
while (
|
|
291
|
-
const selector = selectors[
|
|
288
|
+
while (selectorIndex < selectors.length && !isFailed) {
|
|
289
|
+
const selector = selectors[selectorIndex];
|
|
292
290
|
if (selector.kind === "Name") {
|
|
293
|
-
while (
|
|
294
|
-
if (
|
|
291
|
+
while (current?.kind === "Label") current = current.body;
|
|
292
|
+
if (current?.kind !== "Let") {
|
|
295
293
|
throw createError("A name selector here must be from a LET clause", location);
|
|
296
294
|
}
|
|
297
|
-
selection.lets.push(
|
|
298
|
-
const last = enterDefinition(
|
|
299
|
-
if (
|
|
295
|
+
selection.lets.push(current.definitions);
|
|
296
|
+
const last = enterDefinition(current.definitions);
|
|
297
|
+
if (isFailed) return reference;
|
|
300
298
|
if (last) {
|
|
301
299
|
return applyDefinition(last.definition, {
|
|
302
300
|
...selection,
|
|
@@ -307,11 +305,11 @@ const selectSubexpression = (
|
|
|
307
305
|
continue;
|
|
308
306
|
}
|
|
309
307
|
selectOperand(selector);
|
|
310
|
-
|
|
308
|
+
selectorIndex++;
|
|
311
309
|
}
|
|
312
|
-
if (
|
|
313
|
-
if (!
|
|
314
|
-
return createApplication(selection,
|
|
310
|
+
if (isFailed) return reference;
|
|
311
|
+
if (!current) throw createError("Subexpression selection failed", location);
|
|
312
|
+
return createApplication(selection, current);
|
|
315
313
|
};
|
|
316
314
|
|
|
317
315
|
const getQualifiedSelectors = (
|
|
@@ -322,7 +320,7 @@ const getQualifiedSelectors = (
|
|
|
322
320
|
) => {
|
|
323
321
|
if (!name.includes("!") || lookup(name)) return undefined;
|
|
324
322
|
const parts = name.split("!");
|
|
325
|
-
if (!parts.some((
|
|
323
|
+
if (!parts.some((_part, index) => lookup(parts.slice(0, index + 1).join("!")))) return undefined;
|
|
326
324
|
return getNameSelectors(name, args, counts);
|
|
327
325
|
};
|
|
328
326
|
|
|
@@ -332,9 +330,6 @@ const containsReference = (expression: Expression): boolean =>
|
|
|
332
330
|
(expression.kind === "Apply" && expression.operator.includes("!")) ||
|
|
333
331
|
getChildren(expression).some(containsReference);
|
|
334
332
|
|
|
335
|
-
// A reference that starts with a name isGoal holds for, such as a theorem whose statement is an
|
|
336
|
-
// ASSUME/PROVE, stays for name resolution to check. isOperator holds where an operator may be given,
|
|
337
|
-
// as the argument of an operator that may take one.
|
|
338
333
|
const resolveSubexpressions = (
|
|
339
334
|
expression: Expression,
|
|
340
335
|
lookup: Lookup,
|
|
@@ -403,7 +398,6 @@ const createLookup = (definitions: Definition[]): Lookup => {
|
|
|
403
398
|
export const resolveInstanceSubexpressions = (instance: Instance, module: Module): Instance =>
|
|
404
399
|
resolveInstance(instance, createLookup(module.definitions), () => false);
|
|
405
400
|
|
|
406
|
-
// Generator.selectorToNode resolves a name in a theorem, a proof, or a fact as it does in a definition.
|
|
407
401
|
export const resolveModuleSubexpressions = (module: Module, available: Definition[]): Module => {
|
|
408
402
|
const goals = new Set(
|
|
409
403
|
module.theorems.flatMap((theorem) =>
|
|
@@ -442,8 +436,6 @@ export const resolveModuleSubexpressions = (module: Module, available: Definitio
|
|
|
442
436
|
definitionLookup,
|
|
443
437
|
(name) => isGoal(name) && clauses.every((clause) => clause.name !== name),
|
|
444
438
|
);
|
|
445
|
-
// A name in a theorem, a proof, or a fact may also start with a step, a theorem, or a symbol that
|
|
446
|
-
// no definition names.
|
|
447
439
|
const isProofGoal = (name: string) => isGoal(name) || !lookup(name);
|
|
448
440
|
const resolveInProof = (expression: Expression) =>
|
|
449
441
|
resolveSubexpressions(expression, lookup, isProofGoal);
|
|
@@ -509,7 +501,6 @@ export const resolveModuleSubexpressions = (module: Module, available: Definitio
|
|
|
509
501
|
: proof;
|
|
510
502
|
const resolved = {
|
|
511
503
|
...module,
|
|
512
|
-
// A named theorem's statement is resolved as its definition.
|
|
513
504
|
theorems: module.theorems.map((theorem) => ({
|
|
514
505
|
...theorem,
|
|
515
506
|
statement:
|
|
@@ -151,12 +151,13 @@ export const createInstanceChecker = (getModule: (name: string) => ModuleContext
|
|
|
151
151
|
return [{ ...declaration, level: data.level, operator: undefined, isLeibniz: true }];
|
|
152
152
|
}
|
|
153
153
|
const operand = analyzer.toOperand(expression, scope);
|
|
154
|
+
const operator = operand.kind === "Operator" ? operand.data : undefined;
|
|
154
155
|
return [
|
|
155
156
|
{
|
|
156
157
|
...declaration,
|
|
157
158
|
level: operand.data.level,
|
|
158
|
-
operator
|
|
159
|
-
isLeibniz:
|
|
159
|
+
operator,
|
|
160
|
+
isLeibniz: operator === undefined || operator.nonLeibniz.size === 0,
|
|
160
161
|
},
|
|
161
162
|
];
|
|
162
163
|
});
|
|
@@ -178,14 +179,14 @@ export const createInstanceChecker = (getModule: (name: string) => ModuleContext
|
|
|
178
179
|
addMessage(getLevelMessage(item.name, maximum));
|
|
179
180
|
const operator = item.operator;
|
|
180
181
|
if (!operator) return;
|
|
181
|
-
|
|
182
|
+
for (let index = 0; index < item.arity; index++) {
|
|
182
183
|
const minimum = levels.argConstraints.get(getArgumentKey(item.name, index));
|
|
183
184
|
if (minimum !== undefined && getMaxLevel(operator, index) < minimum) {
|
|
184
185
|
addMessage(
|
|
185
186
|
`Level error in instantiating module '${check.module}':\nThe level of the argument ${index + 1} of the operator ${operator.name} \nmust be at least ${minimum}.`,
|
|
186
187
|
);
|
|
187
188
|
}
|
|
188
|
-
}
|
|
189
|
+
}
|
|
189
190
|
});
|
|
190
191
|
levels.argParams.forEach((key) => {
|
|
191
192
|
const parameter = parseArgumentParamKey(key);
|
package/src/successors.ts
CHANGED
|
@@ -44,7 +44,7 @@ import {
|
|
|
44
44
|
type Scope,
|
|
45
45
|
type State,
|
|
46
46
|
} from "./evaluate";
|
|
47
|
-
import {
|
|
47
|
+
import { forEachChild } from "./instances";
|
|
48
48
|
import { CORE_OPERATORS } from "./standard-modules";
|
|
49
49
|
import { getRandomSubset, nextPrime, type JavaRandom } from "./tlc/random";
|
|
50
50
|
import {
|
|
@@ -114,13 +114,11 @@ const assign = (partial: State, index: number, value: Value) => {
|
|
|
114
114
|
const getComputation = (run: Run) =>
|
|
115
115
|
run.isInit ? "initial states" : run.isEnabled ? "ENABLED" : "next states";
|
|
116
116
|
|
|
117
|
-
// TLC fails with an unexpected exception when it fails to compute the next states or ENABLED.
|
|
118
117
|
const createRunError = (run: Run, message: string) => {
|
|
119
118
|
const error = new TlaEvaluationError(message);
|
|
120
119
|
return run.isInit ? error : setExitCode(error, EXIT_STATUS.error);
|
|
121
120
|
};
|
|
122
121
|
|
|
123
|
-
// TLC words this differently for a literal it walks to rather than evaluates.
|
|
124
122
|
const getNonBooleanMessage = (
|
|
125
123
|
run: Run,
|
|
126
124
|
value: Value,
|
|
@@ -136,7 +134,6 @@ const getNonBooleanMessage = (
|
|
|
136
134
|
return `In computing ${getComputation(run)}, TLC expected a boolean expression,\nbut instead found ${formatValue(value)}.\n${node}`;
|
|
137
135
|
};
|
|
138
136
|
|
|
139
|
-
// TLC words an IF whose condition isn't a boolean differently for each computation.
|
|
140
137
|
const getIfConditionMessage = (run: Run, value: Value, expression: Expression) => {
|
|
141
138
|
const kind = getKindString(value);
|
|
142
139
|
const range = describeRange(expression);
|
|
@@ -151,7 +148,6 @@ const holds = (run: Run, expression: Expression, context: Context) =>
|
|
|
151
148
|
|
|
152
149
|
const CORE_OPERATOR_NAMES = new Set(CORE_OPERATORS.map((operator) => operator.name));
|
|
153
150
|
|
|
154
|
-
// TLC's initial states evaluate a built-in operator for its value, and report it in a plain message.
|
|
155
151
|
const isBuiltInOperation = (expression: Expression) =>
|
|
156
152
|
expression.kind === "Apply"
|
|
157
153
|
? CORE_OPERATOR_NAMES.has(expression.operator)
|
|
@@ -313,8 +309,7 @@ const isGuard = (expression: Expression, environment: Environment, isInit: boole
|
|
|
313
309
|
|
|
314
310
|
const NO_NAMES: ReadonlySet<string> = new Set();
|
|
315
311
|
|
|
316
|
-
|
|
317
|
-
export const getReadLocals = (
|
|
312
|
+
const getReadLocals = (
|
|
318
313
|
expression: Expression,
|
|
319
314
|
bound: ReadonlySet<string>,
|
|
320
315
|
): string[] | undefined => {
|
|
@@ -323,20 +318,18 @@ export const getReadLocals = (
|
|
|
323
318
|
return bound.has(expression.name) ? [] : [expression.name];
|
|
324
319
|
}
|
|
325
320
|
const names: string[] = [];
|
|
326
|
-
|
|
327
|
-
|
|
328
|
-
const childLocals =
|
|
321
|
+
let isReadOnly = true;
|
|
322
|
+
forEachChild(expression, (child, childNames) => {
|
|
323
|
+
const childLocals = isReadOnly
|
|
329
324
|
? getReadLocals(child, childNames.length === 0 ? bound : new Set([...bound, ...childNames]))
|
|
330
325
|
: [];
|
|
331
326
|
if (childLocals) names.push(...childLocals);
|
|
332
|
-
else
|
|
333
|
-
return child;
|
|
327
|
+
else isReadOnly = false;
|
|
334
328
|
});
|
|
335
|
-
return
|
|
329
|
+
return isReadOnly ? names : undefined;
|
|
336
330
|
};
|
|
337
331
|
|
|
338
|
-
|
|
339
|
-
const hasBranches = (
|
|
332
|
+
export const hasBranches = (
|
|
340
333
|
expression: Expression,
|
|
341
334
|
environment: Environment,
|
|
342
335
|
visited: Set<Definition>,
|
|
@@ -378,7 +371,6 @@ const toConjunct = (
|
|
|
378
371
|
return { kind: "Branch", expression, runner: getRunner(expression, environment, isInit) };
|
|
379
372
|
};
|
|
380
373
|
|
|
381
|
-
// Leading guards that read no inner bound hold for every inner binding, so they run once.
|
|
382
374
|
const getHoistedGuards = (expression: QuantifierExpression, environment: Environment) => {
|
|
383
375
|
if (expression.bounds.length < 2 || expression.body.kind !== "And") return undefined;
|
|
384
376
|
const names = expression.bounds.flatMap((bound) =>
|
|
@@ -422,8 +414,6 @@ const compileConjunction = (
|
|
|
422
414
|
context ??= getContext(run, scope, current);
|
|
423
415
|
for (let rest = index; rest < conjuncts.length; rest++) {
|
|
424
416
|
const conjunct = conjuncts[rest];
|
|
425
|
-
// Tool#getNextStates0 takes this shortcut with warnings on, though its comment says the
|
|
426
|
-
// shortcut skips the warning for a changed UNCHANGED variable. tla-ts still warns.
|
|
427
417
|
const state = run.current;
|
|
428
418
|
const changed =
|
|
429
419
|
state && conjunct.kind === "Unchanged"
|
|
@@ -585,8 +575,6 @@ const compileDynamicAssignment = (
|
|
|
585
575
|
};
|
|
586
576
|
};
|
|
587
577
|
|
|
588
|
-
// TLC walks the body of an applied function that is still lazy, which it evaluates as it
|
|
589
|
-
// computes the initial states eagerly, and otherwise applies it.
|
|
590
578
|
const compileFunctionAction = (
|
|
591
579
|
expression: Expression & { kind: "FunctionApplication" },
|
|
592
580
|
environment: Environment,
|
|
@@ -626,11 +614,10 @@ const compileFunctionAction = (
|
|
|
626
614
|
};
|
|
627
615
|
|
|
628
616
|
const compileUnchanged = (expression: Expression, environment: Environment): Runner => {
|
|
629
|
-
if (getUnchangedVariables(expression, environment))
|
|
630
|
-
return compileConjunction([getUnchangedWrapper(expression)], environment, false);
|
|
631
|
-
if (expression.kind === "Tuple")
|
|
632
|
-
return getRunner(getUnchangedWrapper(expression), environment, false);
|
|
633
617
|
const unchanged = getUnchangedWrapper(expression);
|
|
618
|
+
if (getUnchangedVariables(expression, environment))
|
|
619
|
+
return compileConjunction([unchanged], environment, false);
|
|
620
|
+
if (expression.kind === "Tuple") return getRunner(unchanged, environment, false);
|
|
634
621
|
return (run, scope, partial, action, isFixed, onComplete) => {
|
|
635
622
|
const binding =
|
|
636
623
|
expression.kind === "Identifier" ? lookupScope(scope, expression.name) : undefined;
|
|
@@ -646,7 +633,6 @@ const compileUnchanged = (expression: Expression, environment: Environment): Run
|
|
|
646
633
|
return;
|
|
647
634
|
}
|
|
648
635
|
const context = getContext(run, scope, partial);
|
|
649
|
-
// Tool#enabledUnchanged fails on an operator application, as its comment says.
|
|
650
636
|
if (run.isEnabled && expression.kind === "Apply") {
|
|
651
637
|
const operator = resolveApplyOperator(expression, context);
|
|
652
638
|
if (operator?.kind === "Closure" && operator.params.length === expression.args.length) {
|
|
@@ -678,10 +664,10 @@ const compileCall = (
|
|
|
678
664
|
if (global?.kind === "Builtin") return guard;
|
|
679
665
|
if (global?.kind === "Closure") {
|
|
680
666
|
const bindArguments = compileArgumentScope(global, expression.args, environment);
|
|
681
|
-
|
|
667
|
+
let bodyRunner: Runner | undefined;
|
|
682
668
|
return (run, scope, partial, action, isFixed, onComplete) => {
|
|
683
|
-
|
|
684
|
-
|
|
669
|
+
bodyRunner ??= getRunner(global.body, environment, isInit);
|
|
670
|
+
bodyRunner(
|
|
685
671
|
run,
|
|
686
672
|
bindArguments(getContext(run, scope, partial)),
|
|
687
673
|
partial,
|
|
@@ -718,7 +704,7 @@ const compileIdentifier = (
|
|
|
718
704
|
const definition = isLocallyResolved(expression)
|
|
719
705
|
? undefined
|
|
720
706
|
: getZeroArityBody(expression.name, environment);
|
|
721
|
-
|
|
707
|
+
let bodyRunner: Runner | undefined;
|
|
722
708
|
return (run, scope, partial, action, isFixed, onComplete) => {
|
|
723
709
|
const binding = lookupScope(scope, expression.name);
|
|
724
710
|
if (binding?.kind === "Thunk" && !binding.isReleased) {
|
|
@@ -732,8 +718,6 @@ const compileIdentifier = (
|
|
|
732
718
|
);
|
|
733
719
|
return;
|
|
734
720
|
}
|
|
735
|
-
// TLC computed a constant definition at startup, so it looks up its value. It walks the body
|
|
736
|
-
// of the configured INIT or NEXT, which isn't a reference in the source and has no range.
|
|
737
721
|
if (
|
|
738
722
|
binding ||
|
|
739
723
|
!definition ||
|
|
@@ -742,14 +726,11 @@ const compileIdentifier = (
|
|
|
742
726
|
guard(run, scope, partial, action, isFixed, onComplete);
|
|
743
727
|
return;
|
|
744
728
|
}
|
|
745
|
-
|
|
746
|
-
|
|
729
|
+
bodyRunner ??= getRunner(definition.body, environment, isInit);
|
|
730
|
+
bodyRunner(run, undefined, partial, isFixed ? action : definition.name, isFixed, onComplete);
|
|
747
731
|
};
|
|
748
732
|
};
|
|
749
733
|
|
|
750
|
-
// A disjunction of PlusCal actions skips the operands whose label guard, such as
|
|
751
|
-
// pc[self] = "L1", is false. TLC evaluates guards before the label's guard, so a skipped
|
|
752
|
-
// operand still runs them, for their errors.
|
|
753
734
|
interface LabelGuard {
|
|
754
735
|
variable: number;
|
|
755
736
|
argument: string;
|
|
@@ -774,7 +755,6 @@ const toLabelGuard = (expression: Expression, environment: Environment) => {
|
|
|
774
755
|
const getConjuncts = (expression: Expression): Expression[] =>
|
|
775
756
|
expression.kind === "And" ? expression.operands.flatMap(getConjuncts) : [expression];
|
|
776
757
|
|
|
777
|
-
// An operand with another conjunct first, such as an assignment, runs in full.
|
|
778
758
|
const isLeadingGuard = (expression: Expression, environment: Environment) =>
|
|
779
759
|
(expression.kind === "Identifier" ||
|
|
780
760
|
(expression.kind === "Apply" &&
|
|
@@ -1093,7 +1073,6 @@ const compileAction = (
|
|
|
1093
1073
|
const arm = arms.find((candidate) => {
|
|
1094
1074
|
const value = evaluate(candidate.condition, context);
|
|
1095
1075
|
if (typeof value === "boolean") return value;
|
|
1096
|
-
// TLC leaves out the space before the kind under ENABLED.
|
|
1097
1076
|
throw createRunError(
|
|
1098
1077
|
run,
|
|
1099
1078
|
`In computing ${getComputation(run)}, a non-boolean expression${run.isEnabled ? "" : " "}(${getKindString(value)}) was used as a guard condition of a CASE.\n${describeNode(candidate.source)}`,
|
|
@@ -1133,7 +1112,6 @@ const compileAction = (
|
|
|
1133
1112
|
return compileUnchanged(expression.expression, environment);
|
|
1134
1113
|
case "AngleAction": {
|
|
1135
1114
|
const body = getChildRunner(expression.action);
|
|
1136
|
-
// TLC compares the whole subscript of <<A>>_v, unlike UNCHANGED's, which it splits.
|
|
1137
1115
|
const unchanged: Expression = {
|
|
1138
1116
|
kind: "Unchanged",
|
|
1139
1117
|
expression: expression.subscript,
|
|
@@ -1225,7 +1203,6 @@ export const isEnabled = (expression: Expression, context: Context): boolean =>
|
|
|
1225
1203
|
);
|
|
1226
1204
|
}
|
|
1227
1205
|
const environment = context.environment;
|
|
1228
|
-
// TLC computes ENABLED again with its call stack recorded as it computes successors.
|
|
1229
1206
|
if (environment.callStack) return replayEnabled(expression, context.scope, state, environment);
|
|
1230
1207
|
const run: Run = {
|
|
1231
1208
|
environment,
|
|
@@ -1236,7 +1213,6 @@ export const isEnabled = (expression: Expression, context: Context): boolean =>
|
|
|
1236
1213
|
generator: undefined,
|
|
1237
1214
|
successors: 0,
|
|
1238
1215
|
};
|
|
1239
|
-
// TLC stops computing ENABLED at the first successor, so it skips the rest of the action.
|
|
1240
1216
|
getRunner(expression, environment, false)(
|
|
1241
1217
|
run,
|
|
1242
1218
|
context.scope,
|
|
@@ -1279,7 +1255,6 @@ export const forEachInitialState = (
|
|
|
1279
1255
|
run.isStopped = onIncomplete([...partial]);
|
|
1280
1256
|
return;
|
|
1281
1257
|
}
|
|
1282
|
-
// TLC reports an initial state that isn't completely specified as an illegal state.
|
|
1283
1258
|
throw setExitCode(new TlaIllegalStateError([...partial]), EXIT_STATUS.error);
|
|
1284
1259
|
}
|
|
1285
1260
|
run.isStopped = onState(partial);
|
|
@@ -1333,7 +1308,9 @@ export const forEachSuccessor = (
|
|
|
1333
1308
|
(partial, action) => {
|
|
1334
1309
|
if (run.isStopped) return;
|
|
1335
1310
|
if (!isComplete(partial)) {
|
|
1336
|
-
const missing = environment.variables.filter(
|
|
1311
|
+
const missing = environment.variables.filter(
|
|
1312
|
+
(_name, index) => partial[index] === undefined,
|
|
1313
|
+
);
|
|
1337
1314
|
throw new TlaIncompleteSuccessorError(
|
|
1338
1315
|
`Successor state is not completely specified by action ${action ?? "Next"}. The following variables are not assigned: ${missing.join(", ")}`,
|
|
1339
1316
|
partial,
|
package/src/symmetry.ts
CHANGED
|
@@ -20,7 +20,7 @@ import {
|
|
|
20
20
|
type Value,
|
|
21
21
|
} from "./values";
|
|
22
22
|
|
|
23
|
-
type Images = Map<string, ModelValue>;
|
|
23
|
+
export type Images = Map<string, ModelValue>;
|
|
24
24
|
|
|
25
25
|
const getPermutationKey = (permutation: Images) =>
|
|
26
26
|
[...permutation]
|
|
@@ -39,8 +39,6 @@ const composePermutations = (first: Images, second: Images) => {
|
|
|
39
39
|
return composed;
|
|
40
40
|
};
|
|
41
41
|
|
|
42
|
-
// Tool#getSymmetryPerms fails with a RuntimeException as TLC starts, which TLC reports as one it
|
|
43
|
-
// did not expect.
|
|
44
42
|
const createSymmetryError = (message: string) =>
|
|
45
43
|
setExitCode(new TlaEvaluationError(`${UNEXPECTED_EXCEPTION}${message}`), EXIT_STATUS.error);
|
|
46
44
|
|
|
@@ -57,7 +55,6 @@ const toImages = (value: Value) => {
|
|
|
57
55
|
return permutation;
|
|
58
56
|
};
|
|
59
57
|
|
|
60
|
-
// SyntaxTreeNode.getHumanReadableImage, which joins the tokens of an expression without spaces.
|
|
61
58
|
const getBoundImage = (pattern: BoundPattern, set: Expression | undefined) => {
|
|
62
59
|
const names = pattern.kind === "Name" ? pattern.name : `<<${pattern.names.join(",")}>>`;
|
|
63
60
|
return set ? `${names}\\in${getExpressionImage(set)}` : names;
|
|
@@ -122,8 +119,6 @@ export const getSymmetryGroup = (
|
|
|
122
119
|
if (!elements.every(isFunctionValue)) {
|
|
123
120
|
throw createSymmetryError("The symmetry values must be function records.");
|
|
124
121
|
}
|
|
125
|
-
// Tool#getSymmetryPerms warns about each permuted set with fewer than two elements, by the name
|
|
126
|
-
// the config substitutes for it. As many permuted sets as permutations means none has two.
|
|
127
122
|
const body = definition.body;
|
|
128
123
|
const permutedSets =
|
|
129
124
|
body.kind === "Apply" ? body.args : body.kind === "SetEnumeration" ? body.elements : [];
|
|
@@ -153,24 +148,22 @@ export const getSymmetryGroup = (
|
|
|
153
148
|
if (permutation.size > 0) group.set(getPermutationKey(permutation), permutation);
|
|
154
149
|
});
|
|
155
150
|
const generators = [...group.values()];
|
|
156
|
-
|
|
157
|
-
while (
|
|
151
|
+
let frontierStart = 0;
|
|
152
|
+
while (frontierStart < group.size) {
|
|
158
153
|
const members = [...group.values()];
|
|
159
154
|
const end = members.length;
|
|
160
155
|
generators.forEach((generator) =>
|
|
161
|
-
members.slice(
|
|
156
|
+
members.slice(frontierStart, end).forEach((member) => {
|
|
162
157
|
const composed = composePermutations(generator, member);
|
|
163
158
|
const key = getPermutationKey(composed);
|
|
164
159
|
if (composed.size > 0 && !group.has(key)) group.set(key, composed);
|
|
165
160
|
}),
|
|
166
161
|
);
|
|
167
|
-
|
|
162
|
+
frontierStart = end;
|
|
168
163
|
}
|
|
169
164
|
const movedNames = new Set(
|
|
170
165
|
[...group.values()].flatMap((images) => [...images.values()].map((image) => image.name)),
|
|
171
166
|
);
|
|
172
|
-
// Only a permutation of a constant that TLC holds as an enumerated set is checked. TLC binds a
|
|
173
|
-
// constant the config substitutes with <- to the definition, which it skips.
|
|
174
167
|
const substitutedNames = new Set(substitutions.map((substitution) => substitution.name));
|
|
175
168
|
warnSmallSets(
|
|
176
169
|
permutedSets.filter((node) => {
|
|
@@ -204,8 +197,6 @@ const permuteElements = (elements: Value[], images: Images) => {
|
|
|
204
197
|
return undefined;
|
|
205
198
|
};
|
|
206
199
|
|
|
207
|
-
// A permutation maps distinct elements to distinct elements and keeps the elements it doesn't move
|
|
208
|
-
// in order, so it sorts only the moved ones and merges them back.
|
|
209
200
|
const permuteSortedElements = (elements: Value[], images: Images) => {
|
|
210
201
|
const kept: Value[] = [];
|
|
211
202
|
const moved: Value[] = [];
|
|
@@ -231,9 +222,7 @@ const permuteSortedElements = (elements: Value[], images: Images) => {
|
|
|
231
222
|
return merged;
|
|
232
223
|
};
|
|
233
224
|
|
|
234
|
-
|
|
235
|
-
// doesn't move is returned itself, so that comparing it with itself stops at identity.
|
|
236
|
-
const permuteValue = (value: Value, images: Images): Value => {
|
|
225
|
+
export const permuteValue = (value: Value, images: Images): Value => {
|
|
237
226
|
if (typeof value !== "object") return value;
|
|
238
227
|
const kind = value.kind;
|
|
239
228
|
if (kind === "ModelValue") return images.get(value.name) ?? value;
|
|
@@ -249,8 +238,6 @@ const permuteValue = (value: Value, images: Images): Value => {
|
|
|
249
238
|
const permuted = createFunction(
|
|
250
239
|
domain.map((key, index): [Value, Value] => [key, range[index]]),
|
|
251
240
|
);
|
|
252
|
-
// A permutation often maps the domain to itself, such as a function over the symmetric set.
|
|
253
|
-
// Sharing the original domain array lets comparisons with other images skip the domain.
|
|
254
241
|
const isSameDomain = permuted.domain.every(
|
|
255
242
|
(key, index) => key === functionValue.domain[index],
|
|
256
243
|
);
|
|
@@ -266,8 +253,6 @@ const permuteValue = (value: Value, images: Images): Value => {
|
|
|
266
253
|
return elements ? createSet(elements) : set;
|
|
267
254
|
};
|
|
268
255
|
|
|
269
|
-
// TLC permutes the state under each permutation, variable by variable, and moves on to the next
|
|
270
|
-
// permutation as soon as a variable's image is larger than the smallest state's.
|
|
271
256
|
export const getRepresentative = (
|
|
272
257
|
state: Value[],
|
|
273
258
|
permutations: Images[],
|
package/src/tableau.ts
CHANGED
|
@@ -8,7 +8,7 @@ interface LiveBoolean {
|
|
|
8
8
|
value: boolean;
|
|
9
9
|
}
|
|
10
10
|
|
|
11
|
-
interface LiveState {
|
|
11
|
+
export interface LiveState {
|
|
12
12
|
kind: "State";
|
|
13
13
|
expression: Expression;
|
|
14
14
|
scope: Scope | undefined;
|
|
@@ -20,7 +20,7 @@ export interface LiveEnabled {
|
|
|
20
20
|
scope: Scope | undefined;
|
|
21
21
|
}
|
|
22
22
|
|
|
23
|
-
interface LiveAction {
|
|
23
|
+
export interface LiveAction {
|
|
24
24
|
kind: "Action";
|
|
25
25
|
expression: Expression;
|
|
26
26
|
subscript: Expression | undefined;
|