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/resolve.ts
CHANGED
|
@@ -22,7 +22,6 @@ import {
|
|
|
22
22
|
} from "./ast";
|
|
23
23
|
import { formatRange, TlaSyntaxError, type SanyError } from "./errors";
|
|
24
24
|
|
|
25
|
-
// A parameter is also a bound name, and a NEW symbol has a kind for each level.
|
|
26
25
|
export type SymbolKind =
|
|
27
26
|
| "Builtin"
|
|
28
27
|
| "Constant"
|
|
@@ -33,7 +32,6 @@ export type SymbolKind =
|
|
|
33
32
|
| "Parameter"
|
|
34
33
|
| `New${NewSymbol["level"]}`;
|
|
35
34
|
|
|
36
|
-
// Two symbols at one range are one node to SANY.
|
|
37
35
|
interface Binding {
|
|
38
36
|
kind: SymbolKind;
|
|
39
37
|
arity: number;
|
|
@@ -53,9 +51,6 @@ interface Goal {
|
|
|
53
51
|
isInProof: boolean;
|
|
54
52
|
}
|
|
55
53
|
|
|
56
|
-
// isPending holds for an operator a RECURSIVE declaration names until its definition.
|
|
57
|
-
// isNonFact holds for the name of a USE, HIDE, DEFINE or INSTANCE step, which SANY takes neither as
|
|
58
|
-
// a fact nor as an expression.
|
|
59
54
|
interface LocalName extends Binding {
|
|
60
55
|
name: string;
|
|
61
56
|
parent: LocalName | undefined;
|
|
@@ -111,7 +106,6 @@ const renamedArities = new WeakMap<Expression, number>();
|
|
|
111
106
|
|
|
112
107
|
export const KEY_SEPARATOR = "@";
|
|
113
108
|
|
|
114
|
-
// A key is a name, the separator, and an id, so the operator @@ is not one.
|
|
115
109
|
const isKey = (name: string) => {
|
|
116
110
|
const index = name.lastIndexOf(KEY_SEPARATOR);
|
|
117
111
|
return index > 0 && index < name.length - 1;
|
|
@@ -151,7 +145,6 @@ const getModuleBinding = (name: string, unit: Unit, range: SourceRange | undefin
|
|
|
151
145
|
const isSameRange = (left: SourceRange | undefined, right: SourceRange | undefined) =>
|
|
152
146
|
left !== undefined && right !== undefined && formatRange(left) === formatRange(right);
|
|
153
147
|
|
|
154
|
-
// A symbol SANY never sees, such as a generated one, binds.
|
|
155
148
|
const isBindable = (name: string, current: Binding | undefined, added: Binding, unit: Unit) => {
|
|
156
149
|
if (current === undefined) return true;
|
|
157
150
|
if (isSameRange(current.range, added.range)) return false;
|
|
@@ -266,7 +259,6 @@ const getNameRange = (location: SourceLocation, name: string): SourceRange => ({
|
|
|
266
259
|
end: { line: location.line, column: location.column + name.length - 1 },
|
|
267
260
|
});
|
|
268
261
|
|
|
269
|
-
// SANY reports a name at its tokens, such as M ! ⊕ for M!\oplus.
|
|
270
262
|
const getSpelledNameRange = (
|
|
271
263
|
expression: Expression & { kind: "Identifier" | "Apply" | "OperatorReference" },
|
|
272
264
|
name: string,
|
|
@@ -278,7 +270,6 @@ const getSpelledNameRange = (
|
|
|
278
270
|
: getNameRange(expression.location, expression.spelling ?? name);
|
|
279
271
|
};
|
|
280
272
|
|
|
281
|
-
// SANY reports an operator symbol applied to operands as one it cannot resolve.
|
|
282
273
|
const getFixity = (expression: Expression) => {
|
|
283
274
|
if (expression.kind !== "Apply") return undefined;
|
|
284
275
|
if (expression.args.length === 2) return "infix";
|
|
@@ -286,7 +277,6 @@ const getFixity = (expression: Expression) => {
|
|
|
286
277
|
return isBefore(expression.location, expression.args[0].location) ? "prefix" : "postfix";
|
|
287
278
|
};
|
|
288
279
|
|
|
289
|
-
// SANY names an undefined operator symbol such as + differently from an undefined identifier.
|
|
290
280
|
const isOperatorSymbol = (name: string) => !/^[\p{L}\d_]/u.test(name);
|
|
291
281
|
|
|
292
282
|
const isStepName = (name: string) =>
|
|
@@ -305,7 +295,7 @@ export const getNameSelectors = (
|
|
|
305
295
|
): Selector[] => {
|
|
306
296
|
const parts = name.split("!");
|
|
307
297
|
const partCounts =
|
|
308
|
-
counts ?? parts.map((
|
|
298
|
+
counts ?? parts.map((_part, index) => (index === parts.length - 1 ? args.length : 0));
|
|
309
299
|
return parts.map((part, index) => {
|
|
310
300
|
const start = partCounts.slice(0, index).reduce((sum, count) => sum + count, 0);
|
|
311
301
|
return { kind: "Name", name: part, args: args.slice(start, start + partCounts[index]) };
|
|
@@ -434,7 +424,6 @@ const findLabel = (expression: Expression, name: string): LabelExpression | unde
|
|
|
434
424
|
);
|
|
435
425
|
};
|
|
436
426
|
|
|
437
|
-
// SANY drops a label in the scope of a NEW in a nested ASSUME, after it reports the label.
|
|
438
427
|
const findClauseLabel = (
|
|
439
428
|
clause: Expression | NewSymbol | AssumeProve,
|
|
440
429
|
name: string,
|
|
@@ -460,9 +449,6 @@ const getOperandName = (operand: number | "<<" | ">>") =>
|
|
|
460
449
|
|
|
461
450
|
const SCOPE_MESSAGE = "within the scope of a declaration\n from outside that declaration's scope.";
|
|
462
451
|
|
|
463
|
-
// A part in the scope of a NEW in its ASSUME may be selected only within the theorem's proof, or
|
|
464
|
-
// only after the proof of a SUFFICES step. A label takes its own arguments, and an operand must
|
|
465
|
-
// exist, unless the part selected depends on bound names.
|
|
466
452
|
const checkSelection = (
|
|
467
453
|
reference: Reference,
|
|
468
454
|
selectors: Selector[],
|
|
@@ -600,7 +586,6 @@ const checkSelection = (
|
|
|
600
586
|
}
|
|
601
587
|
};
|
|
602
588
|
|
|
603
|
-
// Generator.generateLabel reports a label where it may not appear, and skips the label's body.
|
|
604
589
|
const isLabelReported = (label: LabelExpression, unit: Unit) => {
|
|
605
590
|
const message = unit.isGenerated
|
|
606
591
|
? undefined
|
|
@@ -616,9 +601,6 @@ const isLabelReported = (label: LabelExpression, unit: Unit) => {
|
|
|
616
601
|
return true;
|
|
617
602
|
};
|
|
618
603
|
|
|
619
|
-
// Generator.generateLabel reports, after the label's body, each parameter that names no bound name,
|
|
620
|
-
// then formalParamsEqual each parameter given twice, each name bound since the label scope began
|
|
621
|
-
// that the label leaves out, and the parameters it adds, and then a label of a name already used.
|
|
622
604
|
const checkLabel = (label: LabelExpression, scope: LocalName | undefined, unit: Unit) => {
|
|
623
605
|
const range = label.location.range;
|
|
624
606
|
if (!range || unit.isGenerated) return;
|
|
@@ -683,9 +665,6 @@ const checkReference = (
|
|
|
683
665
|
return goal !== undefined;
|
|
684
666
|
};
|
|
685
667
|
|
|
686
|
-
// Generator.selectorToNode reports an unknown operator and goes on without analyzing its arguments,
|
|
687
|
-
// so its arity is undefined. It does the same for an operator given the wrong number of arguments,
|
|
688
|
-
// and for a name that selects nothing, after the arguments of the parts before.
|
|
689
668
|
const getSymbolArity = (
|
|
690
669
|
expression: Expression & { kind: "Identifier" | "Apply" | "OperatorReference" },
|
|
691
670
|
name: string,
|
|
@@ -717,8 +696,6 @@ const getSymbolArity = (
|
|
|
717
696
|
renamedArities.set(expression, symbol.arity);
|
|
718
697
|
return symbol.arity;
|
|
719
698
|
}
|
|
720
|
-
// A name such as Inv!P1 selects the label P1 of a definition or theorem, which takes its own
|
|
721
|
-
// arguments.
|
|
722
699
|
const prefix = name.includes("!") ? name.slice(0, name.indexOf("!")) : "";
|
|
723
700
|
const isSelected =
|
|
724
701
|
prefix !== "" &&
|
|
@@ -772,9 +749,6 @@ const markRecursiveConstructions = (expression: Expression, name: string): void
|
|
|
772
749
|
getChildren(expression).forEach((child) => markRecursiveConstructions(child, name));
|
|
773
750
|
};
|
|
774
751
|
|
|
775
|
-
// SANY binds the parameters, reports a name already bound unless a RECURSIVE declaration of this
|
|
776
|
-
// level awaits the definition, analyzes the body, and then binds the name. A function binds the
|
|
777
|
-
// bound names before it looks up the name, and binds the name only where nothing else does.
|
|
778
752
|
const resolveDefinition = (
|
|
779
753
|
definition: Definition,
|
|
780
754
|
scope: LocalName | undefined,
|
|
@@ -833,8 +807,6 @@ const resolveDefinition = (
|
|
|
833
807
|
);
|
|
834
808
|
};
|
|
835
809
|
|
|
836
|
-
// SANY analyzes an INSTANCE in a LET where it appears, before the definitions that follow it, which
|
|
837
|
-
// tla-ts generates at its location and analyzes without reporting.
|
|
838
810
|
const resolveDefinitions = (
|
|
839
811
|
definitions: Definition[],
|
|
840
812
|
scope: LocalName | undefined,
|
|
@@ -878,7 +850,7 @@ const resolveDefinitions = (
|
|
|
878
850
|
range: definition.location.range,
|
|
879
851
|
parent: current,
|
|
880
852
|
};
|
|
881
|
-
if (isInstantiated(definition)) return local;
|
|
853
|
+
if (isInstantiated(definition)) return { ...local, params: getParamArities(definition) };
|
|
882
854
|
const isInstanced = instances.some((instance) => instance.location === definition.location);
|
|
883
855
|
const isGenerated = unit.isGenerated || definition.isLocal || isKey(definition.name);
|
|
884
856
|
const inner = isInstanced
|
|
@@ -893,7 +865,6 @@ const resolveDefinitions = (
|
|
|
893
865
|
return resolveInstances(resolved, () => true);
|
|
894
866
|
};
|
|
895
867
|
|
|
896
|
-
// The INSTANCE that a name such as K!C starts with, whose arguments SANY requires at its name.
|
|
897
868
|
const findInstance = (name: string, scope: LocalName | undefined, unit: Unit) => {
|
|
898
869
|
const prefix = name.split("!")[0];
|
|
899
870
|
const binding =
|
|
@@ -903,8 +874,6 @@ const findInstance = (name: string, scope: LocalName | undefined, unit: Unit) =>
|
|
|
903
874
|
return binding?.kind === "Instance" ? { name: prefix, arity: binding.arity } : undefined;
|
|
904
875
|
};
|
|
905
876
|
|
|
906
|
-
// SANY reports an INSTANCE given the wrong number of arguments at its name, as in K!C or
|
|
907
|
-
// K(1, 2)!C, and goes on without analyzing them.
|
|
908
877
|
const isInstanceArityReported = (
|
|
909
878
|
expression: Expression,
|
|
910
879
|
scope: LocalName | undefined,
|
|
@@ -930,9 +899,6 @@ const isInstanceArityReported = (
|
|
|
930
899
|
return true;
|
|
931
900
|
};
|
|
932
901
|
|
|
933
|
-
// OpDefNode#match reports each argument that gives no operator of the parameter's arity, or one
|
|
934
|
-
// whose own parameters take operators. tla-ts lets an operator whose parameters it does not know
|
|
935
|
-
// take any argument.
|
|
936
902
|
const resolveApply = (
|
|
937
903
|
expression: Expression & { kind: "Apply" },
|
|
938
904
|
scope: LocalName | undefined,
|
|
@@ -963,8 +929,7 @@ const resolveApply = (
|
|
|
963
929
|
const expected = params[index] ?? 0;
|
|
964
930
|
const range = arg.location.range;
|
|
965
931
|
if (expected === 0) {
|
|
966
|
-
//
|
|
967
|
-
// a name.
|
|
932
|
+
// Deviation from SANY: SANY fails here with an internal error; tla-ts words it as for a name.
|
|
968
933
|
if (arg.kind === "Lambda" && arg.operator !== undefined) {
|
|
969
934
|
report(range, `The operator ${arg.operator} requires 1 arguments.`);
|
|
970
935
|
} else if (arg.kind === "Lambda" && range) {
|
|
@@ -977,7 +942,6 @@ const resolveApply = (
|
|
|
977
942
|
} else resolveExpression(arg, scope, unit);
|
|
978
943
|
return true;
|
|
979
944
|
}
|
|
980
|
-
// A name that selects a subexpression gives an operator of the names it leaves unbound.
|
|
981
945
|
if (arg.kind === "Lambda") {
|
|
982
946
|
resolveExpression(arg, scope, unit);
|
|
983
947
|
const isMatched = arg.params.length === expected;
|
|
@@ -998,13 +962,11 @@ const resolveApply = (
|
|
|
998
962
|
resolveExpression(arg, scope, unit);
|
|
999
963
|
return true;
|
|
1000
964
|
}
|
|
1001
|
-
// Generator.selectorToNode: a name such as K(1)!C names an operator, but none of its parts
|
|
1002
|
-
// may take arguments.
|
|
1003
965
|
if (arg.kind === "Apply" && arg.argumentCounts?.at(-1) === 0) {
|
|
1004
|
-
const
|
|
966
|
+
const selectorIndex = arg.argumentCounts.findIndex((count) => count > 0);
|
|
1005
967
|
report(
|
|
1006
|
-
arg.selectorRanges?.[
|
|
1007
|
-
`Selector \`${arg.operator.split("!")[
|
|
968
|
+
arg.selectorRanges?.[selectorIndex],
|
|
969
|
+
`Selector \`${arg.operator.split("!")[selectorIndex]}' should not have argument(s).`,
|
|
1008
970
|
);
|
|
1009
971
|
return false;
|
|
1010
972
|
}
|
|
@@ -1216,8 +1178,6 @@ const resolveExpression = (
|
|
|
1216
1178
|
}
|
|
1217
1179
|
};
|
|
1218
1180
|
|
|
1219
|
-
// A fact that is a name may also select an ASSUME/PROVE or a NEW clause or name a theorem or
|
|
1220
|
-
// assumption. SANY analyzes any other fact as an expression.
|
|
1221
1181
|
const checkFacts = (facts: Fact[], scope: LocalName | undefined, unit: Unit) =>
|
|
1222
1182
|
facts.forEach((fact) => {
|
|
1223
1183
|
if (
|
|
@@ -1247,8 +1207,6 @@ const resolveNewSymbol = (symbol: NewSymbol, scope: LocalName | undefined, unit:
|
|
|
1247
1207
|
);
|
|
1248
1208
|
};
|
|
1249
1209
|
|
|
1250
|
-
// The NEW symbols of an ASSUME stay in scope for its conclusion and the proof that follows. SANY
|
|
1251
|
-
// forbids a label in the scope of a NEW in a nested ASSUME.
|
|
1252
1210
|
const resolveAssumeProve = (
|
|
1253
1211
|
assumeProve: AssumeProve,
|
|
1254
1212
|
scope: LocalName | undefined,
|
|
@@ -1291,7 +1249,6 @@ const resolveProof = (proof: Proof | undefined, scope: LocalName | undefined, ou
|
|
|
1291
1249
|
proof.steps.reduce((current, step) => resolveStep(step, current, unit), scope);
|
|
1292
1250
|
};
|
|
1293
1251
|
|
|
1294
|
-
// A LET or a step binds the name of the INSTANCE after the names it adds.
|
|
1295
1252
|
const resolveLocalInstance = (instance: Instance, scope: LocalName | undefined, unit: Unit) => {
|
|
1296
1253
|
const instanced = resolveInstance(instance, scope, unit);
|
|
1297
1254
|
return instance.name === undefined
|
|
@@ -1304,8 +1261,6 @@ const resolveLocalInstance = (instance: Instance, scope: LocalName | undefined,
|
|
|
1304
1261
|
);
|
|
1305
1262
|
};
|
|
1306
1263
|
|
|
1307
|
-
// Generator.generateProof binds the name of a step after its statement and before its proof, or
|
|
1308
|
-
// after the step where it takes no proof.
|
|
1309
1264
|
const resolveStep = (
|
|
1310
1265
|
step: ProofStep,
|
|
1311
1266
|
scope: LocalName | undefined,
|
|
@@ -1323,8 +1278,6 @@ const resolveStep = (
|
|
|
1323
1278
|
? parent
|
|
1324
1279
|
: { name: step.name, arity: 0, kind: "Theorem", parent, isNonFact: true };
|
|
1325
1280
|
switch (body.kind) {
|
|
1326
|
-
// The NEW symbols of a SUFFICES ASSUME are in scope after its proof, and those of any other
|
|
1327
|
-
// ASSUME in its proof.
|
|
1328
1281
|
case "Assert": {
|
|
1329
1282
|
const assumed = resolveStatement(body.statement, scope, stepUnit);
|
|
1330
1283
|
const proofScope = body.isSuffices ? scope : assumed;
|
|
@@ -1391,7 +1344,6 @@ const resolveStep = (
|
|
|
1391
1344
|
}
|
|
1392
1345
|
};
|
|
1393
1346
|
|
|
1394
|
-
// SANY binds the name of a theorem after its statement and before its proof.
|
|
1395
1347
|
const resolveTheorem = (theorem: Theorem, unit: Unit) => {
|
|
1396
1348
|
const isDefinition = theorem.name !== undefined && theorem.statement.kind !== "AssumeProve";
|
|
1397
1349
|
const scope = isDefinition ? undefined : resolveStatement(theorem.statement, undefined, unit);
|
|
@@ -1434,7 +1386,6 @@ export interface ModuleUnit {
|
|
|
1434
1386
|
|
|
1435
1387
|
export const MODULE_START: SourceLocation = { line: 0, column: 0 };
|
|
1436
1388
|
|
|
1437
|
-
// A named theorem or assumption is linked as a definition too.
|
|
1438
1389
|
export const isTheoremDefinition = (module: Module, definition: Definition) =>
|
|
1439
1390
|
[...module.theorems, ...module.assumptions].some(
|
|
1440
1391
|
(item) =>
|
|
@@ -1454,9 +1405,6 @@ const createSymbols = (module: Module, imported: Symbols) => {
|
|
|
1454
1405
|
return symbols;
|
|
1455
1406
|
};
|
|
1456
1407
|
|
|
1457
|
-
// Generator.processSubst analyzes the explicit substitutions in the order they appear, then the
|
|
1458
|
-
// implicit ones, and then reports each declaration left without one. The parameters of the INSTANCE
|
|
1459
|
-
// are in scope.
|
|
1460
1408
|
const checkSubstitutions = (
|
|
1461
1409
|
instance: Instance,
|
|
1462
1410
|
declarations: Declaration[],
|
|
@@ -1529,8 +1477,6 @@ const checkSubstitutions = (
|
|
|
1529
1477
|
return substitutions;
|
|
1530
1478
|
};
|
|
1531
1479
|
|
|
1532
|
-
// Generator.processSubst analyzes an INSTANCE in a LET or a proof, which then binds the names the
|
|
1533
|
-
// INSTANCE adds.
|
|
1534
1480
|
const resolveInstance = (instance: Instance, scope: LocalName | undefined, unit: Unit) => {
|
|
1535
1481
|
const instanced = unit.getInstance(instance);
|
|
1536
1482
|
checkSubstitutions(instance, instanced.declarations, instanced.instancer, scope, unit);
|
|
@@ -1572,16 +1518,12 @@ export const resolveSubstitutions = (
|
|
|
1572
1518
|
});
|
|
1573
1519
|
};
|
|
1574
1520
|
|
|
1575
|
-
|
|
1576
|
-
|
|
1577
|
-
|
|
1578
|
-
|
|
1579
|
-
|
|
1580
|
-
|
|
1581
|
-
check: (reported: SanyError[], warned: SanyError[]) => void;
|
|
1582
|
-
}[],
|
|
1583
|
-
warnings: SanyError[],
|
|
1584
|
-
) => {
|
|
1521
|
+
interface SemanticUnit {
|
|
1522
|
+
location: SourceLocation;
|
|
1523
|
+
check: (reported: SanyError[], warned: SanyError[]) => void;
|
|
1524
|
+
}
|
|
1525
|
+
|
|
1526
|
+
export const collectSemanticErrors = (units: SemanticUnit[], warnings: SanyError[]) => {
|
|
1585
1527
|
const errors: SanyError[] = [];
|
|
1586
1528
|
const addUnique = (list: SanyError[], item: SanyError) => {
|
|
1587
1529
|
if (
|
|
@@ -1617,7 +1559,6 @@ export const collectSemanticErrors = (
|
|
|
1617
1559
|
return errors;
|
|
1618
1560
|
};
|
|
1619
1561
|
|
|
1620
|
-
// SANY reports a RECURSIVE declaration that no definition follows at the end.
|
|
1621
1562
|
export const resolveModule = (module: Module, unit: ModuleUnit) => {
|
|
1622
1563
|
const symbols = createSymbols(module, unit.imported);
|
|
1623
1564
|
const facts = new Set([
|
|
@@ -1639,41 +1580,44 @@ export const resolveModule = (module: Module, unit: ModuleUnit) => {
|
|
|
1639
1580
|
);
|
|
1640
1581
|
const recursive = new Set<Binding>();
|
|
1641
1582
|
const declarations: { declaration: Declaration; binding: ModuleBinding | undefined }[] = [];
|
|
1642
|
-
const
|
|
1583
|
+
const createCheck = (
|
|
1643
1584
|
location: SourceLocation,
|
|
1644
1585
|
self: Definition | undefined,
|
|
1645
|
-
errors: SanyError[],
|
|
1646
|
-
warnings: SanyError[],
|
|
1647
1586
|
hasLabelScope: boolean,
|
|
1648
|
-
|
|
1649
|
-
|
|
1650
|
-
getInstance: unit.getInstance,
|
|
1651
|
-
definitions: unit.definitions,
|
|
1652
|
-
getKey: unit.getKey,
|
|
1587
|
+
check: (inner: Unit) => void,
|
|
1588
|
+
): SemanticUnit => ({
|
|
1653
1589
|
location,
|
|
1654
|
-
|
|
1655
|
-
|
|
1656
|
-
|
|
1657
|
-
|
|
1658
|
-
|
|
1659
|
-
|
|
1660
|
-
|
|
1661
|
-
|
|
1662
|
-
|
|
1663
|
-
|
|
1664
|
-
|
|
1665
|
-
|
|
1590
|
+
check: (errors, warnings) =>
|
|
1591
|
+
check({
|
|
1592
|
+
imported: symbols,
|
|
1593
|
+
getInstance: unit.getInstance,
|
|
1594
|
+
definitions: unit.definitions,
|
|
1595
|
+
getKey: unit.getKey,
|
|
1596
|
+
location,
|
|
1597
|
+
self,
|
|
1598
|
+
facts,
|
|
1599
|
+
goals,
|
|
1600
|
+
bindings,
|
|
1601
|
+
errors,
|
|
1602
|
+
warnings,
|
|
1603
|
+
hasLabelScope,
|
|
1604
|
+
isLabelForbidden: false,
|
|
1605
|
+
isInExcept: false,
|
|
1606
|
+
labelParams: [],
|
|
1607
|
+
labels: new Set(),
|
|
1608
|
+
isGenerated: false,
|
|
1609
|
+
}),
|
|
1666
1610
|
});
|
|
1667
1611
|
const bindDeclarations = (declarations: Declaration[], kind: "Constant" | "Variable") =>
|
|
1668
|
-
declarations.map((declaration) =>
|
|
1669
|
-
|
|
1670
|
-
check: (errors: SanyError[], warnings: SanyError[]) =>
|
|
1612
|
+
declarations.map((declaration) =>
|
|
1613
|
+
createCheck(declaration.location, undefined, false, (inner) =>
|
|
1671
1614
|
bindModuleName(
|
|
1672
1615
|
declaration.name,
|
|
1673
1616
|
{ kind, arity: declaration.arity, range: declaration.location.range },
|
|
1674
|
-
|
|
1617
|
+
inner,
|
|
1675
1618
|
),
|
|
1676
|
-
|
|
1619
|
+
),
|
|
1620
|
+
);
|
|
1677
1621
|
return collectSemanticErrors(
|
|
1678
1622
|
[
|
|
1679
1623
|
...unit.reports.map((report) => ({
|
|
@@ -1687,9 +1631,8 @@ export const resolveModule = (module: Module, unit: ModuleUnit) => {
|
|
|
1687
1631
|
...bindDeclarations(module.variables, "Variable"),
|
|
1688
1632
|
...module.units
|
|
1689
1633
|
.flatMap((item) => (item.kind === "Recursive" ? item.declarations : []))
|
|
1690
|
-
.map((declaration) =>
|
|
1691
|
-
|
|
1692
|
-
check: (errors: SanyError[], warnings: SanyError[]) => {
|
|
1634
|
+
.map((declaration) =>
|
|
1635
|
+
createCheck(declaration.location, undefined, false, (inner) => {
|
|
1693
1636
|
const binding: ModuleBinding = {
|
|
1694
1637
|
kind: "Definition",
|
|
1695
1638
|
arity: declaration.arity,
|
|
@@ -1701,19 +1644,17 @@ export const resolveModule = (module: Module, unit: ModuleUnit) => {
|
|
|
1701
1644
|
declaration.name,
|
|
1702
1645
|
bindings.get(declaration.name),
|
|
1703
1646
|
binding,
|
|
1704
|
-
|
|
1647
|
+
inner,
|
|
1705
1648
|
);
|
|
1706
1649
|
if (isBound) {
|
|
1707
1650
|
bindings.set(declaration.name, binding);
|
|
1708
1651
|
recursive.add(binding);
|
|
1709
1652
|
}
|
|
1710
1653
|
declarations.push({ declaration, binding: isBound ? binding : undefined });
|
|
1711
|
-
},
|
|
1712
|
-
|
|
1713
|
-
...module.definitions.map((definition) =>
|
|
1714
|
-
|
|
1715
|
-
check: (errors: SanyError[], warnings: SanyError[]) => {
|
|
1716
|
-
const inner = createUnit(definition.location, definition, errors, warnings, true);
|
|
1654
|
+
}),
|
|
1655
|
+
),
|
|
1656
|
+
...module.definitions.map((definition) =>
|
|
1657
|
+
createCheck(definition.location, definition, true, (inner) => {
|
|
1717
1658
|
if (isTheoremDefinition(module, definition)) {
|
|
1718
1659
|
resolveExpression(definition.body, undefined, inner);
|
|
1719
1660
|
} else if (resolveDefinition(definition, undefined, inner, recursive)) {
|
|
@@ -1724,12 +1665,10 @@ export const resolveModule = (module: Module, unit: ModuleUnit) => {
|
|
|
1724
1665
|
position: definition.location,
|
|
1725
1666
|
});
|
|
1726
1667
|
}
|
|
1727
|
-
},
|
|
1728
|
-
|
|
1729
|
-
...module.instances.map((instance) =>
|
|
1730
|
-
|
|
1731
|
-
check: (errors: SanyError[], warnings: SanyError[]) => {
|
|
1732
|
-
const inner = createUnit(instance.location, undefined, errors, warnings, false);
|
|
1668
|
+
}),
|
|
1669
|
+
),
|
|
1670
|
+
...module.instances.map((instance) =>
|
|
1671
|
+
createCheck(instance.location, undefined, false, (inner) => {
|
|
1733
1672
|
bindParams(undefined, instance.params, inner);
|
|
1734
1673
|
unit.instanced
|
|
1735
1674
|
.get(instance)
|
|
@@ -1741,18 +1680,10 @@ export const resolveModule = (module: Module, unit: ModuleUnit) => {
|
|
|
1741
1680
|
inner,
|
|
1742
1681
|
);
|
|
1743
1682
|
}
|
|
1744
|
-
},
|
|
1745
|
-
|
|
1746
|
-
...module.assumptions.map((assumption) =>
|
|
1747
|
-
location
|
|
1748
|
-
check: (errors: SanyError[], warnings: SanyError[]) => {
|
|
1749
|
-
const inner = createUnit(
|
|
1750
|
-
assumption.location,
|
|
1751
|
-
undefined,
|
|
1752
|
-
errors,
|
|
1753
|
-
warnings,
|
|
1754
|
-
assumption.name !== undefined,
|
|
1755
|
-
);
|
|
1683
|
+
}),
|
|
1684
|
+
),
|
|
1685
|
+
...module.assumptions.map((assumption) =>
|
|
1686
|
+
createCheck(assumption.location, undefined, assumption.name !== undefined, (inner) => {
|
|
1756
1687
|
resolveExpression(assumption.expression, undefined, inner);
|
|
1757
1688
|
if (assumption.name !== undefined) {
|
|
1758
1689
|
bindModuleName(
|
|
@@ -1761,25 +1692,18 @@ export const resolveModule = (module: Module, unit: ModuleUnit) => {
|
|
|
1761
1692
|
inner,
|
|
1762
1693
|
);
|
|
1763
1694
|
}
|
|
1764
|
-
},
|
|
1765
|
-
|
|
1766
|
-
...module.theorems.map((theorem) =>
|
|
1767
|
-
location
|
|
1768
|
-
|
|
1769
|
-
|
|
1770
|
-
|
|
1771
|
-
|
|
1772
|
-
|
|
1773
|
-
|
|
1774
|
-
|
|
1775
|
-
|
|
1776
|
-
check: (errors: SanyError[], warnings: SanyError[]) =>
|
|
1777
|
-
checkFacts(
|
|
1778
|
-
use.facts,
|
|
1779
|
-
undefined,
|
|
1780
|
-
createUnit(use.location, undefined, errors, warnings, false),
|
|
1781
|
-
),
|
|
1782
|
-
})),
|
|
1695
|
+
}),
|
|
1696
|
+
),
|
|
1697
|
+
...module.theorems.map((theorem) =>
|
|
1698
|
+
createCheck(theorem.location, undefined, theorem.name !== undefined, (inner) =>
|
|
1699
|
+
resolveTheorem(theorem, inner),
|
|
1700
|
+
),
|
|
1701
|
+
),
|
|
1702
|
+
...module.uses.map((use) =>
|
|
1703
|
+
createCheck(use.location, undefined, false, (inner) =>
|
|
1704
|
+
checkFacts(use.facts, undefined, inner),
|
|
1705
|
+
),
|
|
1706
|
+
),
|
|
1783
1707
|
{
|
|
1784
1708
|
location: module.location.range?.end ?? module.location,
|
|
1785
1709
|
check: (errors: SanyError[]) =>
|
package/src/runtime.ts
CHANGED
|
@@ -19,17 +19,16 @@ export interface CheckerRuntime {
|
|
|
19
19
|
| undefined;
|
|
20
20
|
evaluateAtStartup: <Result>(evaluate: () => Result) => Result;
|
|
21
21
|
pause: (() => void) | undefined;
|
|
22
|
+
readLine: (() => string | undefined) | undefined;
|
|
22
23
|
warn: (code: number, text: string) => void;
|
|
23
|
-
// TLC's -nowarning turns the warnings off, and with them the shortcut that evaluates the rest
|
|
24
|
-
// of an action once it assigns every variable, since that shortcut skips a warning.
|
|
25
24
|
isWarningEnabled: boolean;
|
|
26
|
-
// TLC's -tool, under which the message of an error that TLC raises with a code holds the
|
|
27
|
-
// code's markers, which AssertError compares with.
|
|
28
25
|
isTool: boolean;
|
|
29
26
|
version: TlcVersion;
|
|
30
27
|
seed: bigint;
|
|
31
28
|
isSeen: (state: Value[]) => boolean;
|
|
29
|
+
markExplored: ((state: Value[]) => void) | undefined;
|
|
32
30
|
getSuccessorAction: (state: Value[], next: Value[]) => SpecAction | undefined;
|
|
31
|
+
toRecord: (state: Value[]) => Record<string, Value>;
|
|
33
32
|
generatedStates: number;
|
|
34
33
|
distinctStates: number;
|
|
35
34
|
initialStates: number;
|
|
@@ -45,14 +44,11 @@ export interface CheckerRuntime {
|
|
|
45
44
|
startedAt: number;
|
|
46
45
|
}
|
|
47
46
|
|
|
48
|
-
// TLC's RandomEnumerableValues keeps one java.util.Random per thread, seeded with -seed. The
|
|
49
|
-
// main thread evaluates constants, assumptions, and initial states with it. A worker reseeds
|
|
50
|
-
// its Random with the fingerprint of each state it expands, XORed with the seed, so a state's
|
|
51
|
-
// successors are the same whatever order the workers expand states in.
|
|
52
47
|
export const createRuntime = (checkDeadlock: boolean, seed = 0n): CheckerRuntime => {
|
|
53
48
|
const startupRandom = createJavaRandom(seed);
|
|
54
|
-
const
|
|
55
|
-
|
|
49
|
+
const workerRandom = createJavaRandom(seed);
|
|
50
|
+
let seededState: Value[] | undefined;
|
|
51
|
+
let isStartup = false;
|
|
56
52
|
const runtime: CheckerRuntime = {
|
|
57
53
|
getLevel: () => 0,
|
|
58
54
|
getBehavior: () => [],
|
|
@@ -60,30 +56,33 @@ export const createRuntime = (checkDeadlock: boolean, seed = 0n): CheckerRuntime
|
|
|
60
56
|
counterExample: undefined,
|
|
61
57
|
deferred: undefined,
|
|
62
58
|
isSeen: () => false,
|
|
59
|
+
markExplored: undefined,
|
|
63
60
|
getSuccessorAction: () => undefined,
|
|
61
|
+
toRecord: () => ({}),
|
|
64
62
|
setLivenessSource: () => {},
|
|
65
63
|
getCurrentState: () => undefined,
|
|
66
64
|
getFingerprint: getTlcFingerprint,
|
|
67
65
|
getSimulationValue: undefined,
|
|
68
66
|
getRandom: () => {
|
|
69
|
-
const state =
|
|
67
|
+
const state = isStartup ? undefined : runtime.getCurrentState();
|
|
70
68
|
if (state === undefined) return startupRandom;
|
|
71
|
-
if (state !==
|
|
72
|
-
|
|
73
|
-
|
|
69
|
+
if (state !== seededState) {
|
|
70
|
+
workerRandom.setSeed(runtime.getFingerprint(state) ^ BigInt.asUintN(64, seed));
|
|
71
|
+
seededState = state;
|
|
74
72
|
}
|
|
75
|
-
return
|
|
73
|
+
return workerRandom;
|
|
76
74
|
},
|
|
77
75
|
evaluateAtStartup: (evaluate) => {
|
|
78
|
-
const wasStartup =
|
|
79
|
-
|
|
76
|
+
const wasStartup = isStartup;
|
|
77
|
+
isStartup = true;
|
|
80
78
|
try {
|
|
81
79
|
return evaluate();
|
|
82
80
|
} finally {
|
|
83
|
-
|
|
81
|
+
isStartup = wasStartup;
|
|
84
82
|
}
|
|
85
83
|
},
|
|
86
84
|
pause: undefined,
|
|
85
|
+
readLine: undefined,
|
|
87
86
|
warn: () => {},
|
|
88
87
|
isWarningEnabled: true,
|
|
89
88
|
isTool: false,
|
package/src/sany/builtins.ts
CHANGED
|
@@ -1,7 +1,5 @@
|
|
|
1
1
|
import type { FormalParamNode, LevelFields, OpDefNode, SanyLocation } from "./nodes";
|
|
2
2
|
|
|
3
|
-
// Name, arity, level, maximum argument levels and argument weights. SANY leaves the levels of
|
|
4
|
-
// "." and \neg unset.
|
|
5
3
|
const BUILTIN_OPERATORS: [string, number, number, number[] | undefined, number[] | undefined][] = [
|
|
6
4
|
["STRING", 0, 0, [], []],
|
|
7
5
|
["FALSE", 0, 0, [], []],
|
|
@@ -105,7 +103,7 @@ export const createBuiltins = (getId: () => number) =>
|
|
|
105
103
|
const params =
|
|
106
104
|
arity < 0
|
|
107
105
|
? undefined
|
|
108
|
-
: Array.from({ length: arity }, (
|
|
106
|
+
: Array.from({ length: arity }, (_value, index): FormalParamNode => ({
|
|
109
107
|
...createLevelFields(getId()),
|
|
110
108
|
kind: "FormalParam",
|
|
111
109
|
name: `Formal_${index}`,
|