tla-ts 0.0.9 → 0.0.10-dev.63a6693bd
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 +29 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +29 -29
- package/dist/deciders.js +42 -42
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +106 -10
- package/dist/index.d.ts +106 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +117 -37
- package/dist/prove.js +116 -36
- package/dist/run.cjs +143 -31
- package/dist/run.js +143 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +129 -104
- package/dist/transfer.js +129 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +48 -62
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +599 -754
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +14 -25
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +361 -0
- package/src/cli/tlc.ts +309 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +14 -53
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +169 -335
- package/src/errors.ts +71 -55
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +80 -100
- package/src/liveness-checker.ts +103 -153
- package/src/liveness.ts +150 -109
- package/src/obligations/action.ts +8 -39
- package/src/obligations/anonymize.ts +88 -82
- package/src/obligations/equality.ts +1 -1
- package/src/obligations/expression.ts +20 -21
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +46 -49
- package/src/obligations/index.ts +2 -13
- package/src/obligations/levels.ts +4 -8
- package/src/obligations/module.ts +28 -53
- package/src/obligations/normalize.ts +7 -25
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +1 -10
- package/src/obligations/printer.ts +47 -46
- package/src/obligations/proof.ts +1 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +42 -58
- package/src/obligations/source.ts +48 -78
- package/src/obligations/subexpression.ts +5 -11
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +13 -19
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +57 -71
- package/src/parser.ts +584 -316
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +3 -7
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +0 -6
- package/src/prover/isabelle/encode.ts +11 -23
- package/src/prover/isabelle/isar/inner-syntax.ts +114 -115
- package/src/prover/isabelle/isar/method.ts +29 -53
- package/src/prover/isabelle/isar/proof.ts +1 -10
- package/src/prover/isabelle/isar/statement.ts +1 -6
- package/src/prover/isabelle/isar/theory.ts +26 -36
- package/src/prover/isabelle/isar/type-check.ts +17 -31
- package/src/prover/isabelle/provers/blast/blast.ts +17 -104
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +14 -42
- package/src/prover/isabelle/provers/hypsubst.ts +28 -51
- package/src/prover/isabelle/pure/bicompose.ts +25 -38
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +3 -17
- package/src/prover/isabelle/pure/drule.ts +33 -42
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +1 -7
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +2 -15
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +3 -10
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
- package/src/prover/isabelle/pure/rewriter.ts +31 -67
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +4 -12
- package/src/prover/isabelle/pure/table.ts +3 -32
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +48 -47
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +27 -47
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +17 -24
- package/src/prover/isabelle/tla/context.ts +15 -18
- package/src/prover/isabelle/tla/logic.ts +14 -32
- package/src/prover/isabelle/tla/simpdata.ts +46 -43
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +14 -54
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +33 -39
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +87 -100
- package/src/prover/ptl/decide.ts +7 -12
- package/src/prover/ptl/encode.ts +14 -36
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +12 -26
- package/src/prover/smt/axioms.ts +0 -7
- package/src/prover/smt/context.ts +20 -28
- package/src/prover/smt/data.ts +433 -424
- package/src/prover/smt/encode.ts +43 -52
- package/src/prover/smt/extensionality.ts +0 -10
- package/src/prover/smt/flatten.ts +3 -22
- package/src/prover/smt/format.ts +5 -10
- package/src/prover/smt/instances.ts +0 -10
- package/src/prover/smt/rewrite.ts +663 -667
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -48
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +1 -43
- package/src/prover/smt/solver/ast-lt.ts +1 -11
- package/src/prover/smt/solver/ast-util.ts +1 -6
- package/src/prover/smt/solver/ast.ts +1 -165
- package/src/prover/smt/solver/auf-solver.ts +8 -44
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +1 -18
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/conflict-resolution.ts +0 -9
- package/src/prover/smt/solver/context.ts +7 -64
- package/src/prover/smt/solver/ctx-simplify.ts +14 -41
- package/src/prover/smt/solver/der.ts +2 -21
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +4 -35
- package/src/prover/smt/solver/enode.ts +1 -21
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +1 -6
- package/src/prover/smt/solver/fingerprints.ts +1 -12
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/goal.ts +2 -14
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +1 -12
- package/src/prover/smt/solver/internalizer.ts +7 -100
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +10 -31
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +15 -36
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +36 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +1 -6
- package/src/prover/smt/solver/mam-compiler.ts +18 -58
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
- package/src/prover/smt/solver/model-checker.ts +3 -37
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +15 -32
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +23 -88
- package/src/prover/smt/solver/nlsat/algebraic.ts +63 -159
- package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +10 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -159
- package/src/prover/smt/solver/nlsat/solver.ts +18 -90
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nnf.ts +3 -38
- package/src/prover/smt/solver/pattern-inference.ts +2 -15
- package/src/prover/smt/solver/poly-rewriter.ts +3 -23
- package/src/prover/smt/solver/propagate-values.ts +1 -10
- package/src/prover/smt/solver/proto-model.ts +3 -52
- package/src/prover/smt/solver/pull-quant.ts +1 -12
- package/src/prover/smt/solver/qe-lite-der.ts +1 -29
- package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
- package/src/prover/smt/solver/qe-lite.ts +3 -33
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/quant-tactics.ts +5 -22
- package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
- package/src/prover/smt/solver/quantifier-manager.ts +2 -13
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +1 -8
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +2 -15
- package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
- package/src/prover/smt/solver/rewriter.ts +3 -85
- package/src/prover/smt/solver/rlimit.ts +2 -20
- package/src/prover/smt/solver/smtlib-parser.ts +80 -131
- package/src/prover/smt/solver/solver.ts +23 -34
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
- package/src/prover/smt/solver/theory-lra-bounds.ts +1 -7
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +6 -43
- package/src/prover/smt/solver/theory-lra-model.ts +4 -19
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
- package/src/prover/smt/solver/theory-lra-state.ts +3 -8
- package/src/prover/smt/solver/theory-lra.ts +1 -8
- package/src/prover/smt/solver/var-subst.ts +2 -26
- package/src/prover/smt/table.ts +0 -8
- package/src/prover/tlapm/cache.ts +45 -40
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/verdict.ts +7 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +2 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +8 -26
- package/src/prover/zenon/index-table.ts +26 -57
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +36 -64
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -20
- package/src/prover/zenon/mltoll.ts +66 -104
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +4 -12
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +5 -31
- package/src/prover/zenon/tla/functions.ts +59 -31
- package/src/prover/zenon/tla/llproof.ts +67 -76
- package/src/prover/zenon/tla/records.ts +57 -33
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +83 -53
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +66 -64
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -184
- package/src/runtime.ts +22 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +6 -34
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +1 -9
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +541 -163
- package/src/simulate.ts +709 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +0 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -31
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +266 -99
- package/src/symmetry.ts +33 -25
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -67
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +36 -47
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +139 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
package/src/prover/smt/data.ts
CHANGED
|
@@ -1,6 +1,3 @@
|
|
|
1
|
-
// encode/n_data.ml: the declaration, dependencies, and axioms of each symbol tlapm's SMT encoding
|
|
2
|
-
// uses.
|
|
3
|
-
|
|
4
1
|
import { TlaUnsupportedError } from "../../errors";
|
|
5
2
|
import {
|
|
6
3
|
getComponentSet,
|
|
@@ -57,9 +54,7 @@ export interface SymbolSpec {
|
|
|
57
54
|
axioms: Axiom[];
|
|
58
55
|
}
|
|
59
56
|
|
|
60
|
-
// N_data.s: what the symbols collected so far change about the axioms of the next ones.
|
|
61
57
|
export interface CollectState {
|
|
62
|
-
// The fields of each record symbol the obligation uses.
|
|
63
58
|
recordFields: Map<string, string[]>;
|
|
64
59
|
strings: string[];
|
|
65
60
|
isFunConstr: boolean;
|
|
@@ -72,23 +67,421 @@ export interface CollectState {
|
|
|
72
67
|
|
|
73
68
|
const SEQUENCE_DEPS = ["Mem", "Seq", "Len", "FunApp", "NatSet", "Cast_Int", "Proj_Int"];
|
|
74
69
|
|
|
75
|
-
|
|
70
|
+
const INT_EXP = tla("IntExp");
|
|
71
|
+
|
|
72
|
+
const SUB_SEQ_RANGE = `(${SUB_SEQ} s (${CAST_INT} x) (${CAST_INT} y))`;
|
|
73
|
+
|
|
74
|
+
const createSpec = (
|
|
75
|
+
declaration: string | undefined,
|
|
76
|
+
deps: string[],
|
|
77
|
+
axioms: Axiom[],
|
|
78
|
+
): SymbolSpec => ({ declaration, deps, axioms });
|
|
79
|
+
|
|
80
|
+
const declareSpec = (name: string, arity: number, deps: string[], axioms: Axiom[], sort = "Idv") =>
|
|
81
|
+
createSpec(declare(tla(name), arity, sort), deps, axioms);
|
|
82
|
+
|
|
83
|
+
const getSetOperationDef = (name: string, condition: string) =>
|
|
84
|
+
axiom(
|
|
85
|
+
`${name}Def`,
|
|
86
|
+
[],
|
|
87
|
+
`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${MEM} x (${tla(name)} a b)) ${condition}) :pattern ((${MEM} x (${tla(name)} a b))) :pattern ((${MEM} x a) (${tla(name)} a b)) :pattern ((${MEM} x b) (${tla(name)} a b))))`,
|
|
88
|
+
);
|
|
89
|
+
|
|
90
|
+
const STATIC_SPECS = new Map(
|
|
91
|
+
Object.entries({
|
|
92
|
+
IntExp: declareSpec(
|
|
93
|
+
"IntExp",
|
|
94
|
+
2,
|
|
95
|
+
["Mem", "IntSet", "Cast_Int", "TIntLteq", "TIntLit_0", "TIntLit_1"],
|
|
96
|
+
[
|
|
97
|
+
axiom(
|
|
98
|
+
"IntExpTyping",
|
|
99
|
+
[],
|
|
100
|
+
`(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (or (distinct x (${CAST_INT} 0)) (${INT_LTEQ} (${CAST_INT} 1) y))) (${MEM} (${INT_EXP} x y) ${INT_SET})) :pattern ((${INT_EXP} x y))))`,
|
|
101
|
+
),
|
|
102
|
+
],
|
|
103
|
+
),
|
|
104
|
+
SelectSeq: createSpec(
|
|
105
|
+
undefined,
|
|
106
|
+
[
|
|
107
|
+
"Mem",
|
|
108
|
+
"Seq",
|
|
109
|
+
"Len",
|
|
110
|
+
"Append",
|
|
111
|
+
"FunApp",
|
|
112
|
+
"FunDom",
|
|
113
|
+
"IntSet",
|
|
114
|
+
"NatSet",
|
|
115
|
+
"Tuple_0",
|
|
116
|
+
"Proj_Int",
|
|
117
|
+
],
|
|
118
|
+
[
|
|
119
|
+
axiom("SeqSelectseqTyping", [], undefined),
|
|
120
|
+
axiom("SeqSelectseqLen", [], undefined),
|
|
121
|
+
axiom("SeqSelectseqNil", [], undefined),
|
|
122
|
+
axiom("SeqSelectseqApp", [], undefined),
|
|
123
|
+
axiom("SeqSelectseqAppend", [], undefined),
|
|
124
|
+
],
|
|
125
|
+
),
|
|
126
|
+
Choose: createSpec(undefined, [], [axiom("ChooseDef", [], undefined)]),
|
|
127
|
+
Mem: declareSpec(
|
|
128
|
+
"Mem",
|
|
129
|
+
2,
|
|
130
|
+
["SetExtTrigger"],
|
|
131
|
+
[
|
|
132
|
+
axiom(
|
|
133
|
+
"SetExt",
|
|
134
|
+
[],
|
|
135
|
+
`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${MEM} z x) (${MEM} z y))) (= x y)) :pattern ((${SET_EXT_TRIGGER} x y))))`,
|
|
136
|
+
),
|
|
137
|
+
],
|
|
138
|
+
"Bool",
|
|
139
|
+
),
|
|
140
|
+
SubsetEq: declareSpec(
|
|
141
|
+
"SubsetEq",
|
|
142
|
+
2,
|
|
143
|
+
["Mem"],
|
|
144
|
+
[
|
|
145
|
+
axiom(
|
|
146
|
+
"SubsetEqIntro",
|
|
147
|
+
[],
|
|
148
|
+
`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (=> (${MEM} z x) (${MEM} z y))) (${SUBSET_EQ} x y)) :pattern ((${SUBSET_EQ} x y))))`,
|
|
149
|
+
),
|
|
150
|
+
axiom(
|
|
151
|
+
"SubsetEqElim",
|
|
152
|
+
[],
|
|
153
|
+
`(forall ((x Idv) (y Idv) (z Idv)) (! (=> (and (${SUBSET_EQ} x y) (${MEM} z x)) (${MEM} z y)) :pattern ((${SUBSET_EQ} x y) (${MEM} z x))))`,
|
|
154
|
+
),
|
|
155
|
+
],
|
|
156
|
+
"Bool",
|
|
157
|
+
),
|
|
158
|
+
Union: declareSpec(
|
|
159
|
+
"Union",
|
|
160
|
+
1,
|
|
161
|
+
["Mem"],
|
|
162
|
+
[
|
|
163
|
+
axiom(
|
|
164
|
+
"UnionIntro",
|
|
165
|
+
[],
|
|
166
|
+
`(forall ((a Idv) (x Idv) (y Idv)) (! (=> (and (${MEM} y a) (${MEM} x y)) (${MEM} x (${UNION} a))) :pattern ((${MEM} y a) (${MEM} x (${UNION} a))) :pattern ((${MEM} x y) (${MEM} x (${UNION} a))) :pattern ((${MEM} y a) (${MEM} x y) (${UNION} a))))`,
|
|
167
|
+
),
|
|
168
|
+
axiom(
|
|
169
|
+
"UnionElim",
|
|
170
|
+
[],
|
|
171
|
+
`(forall ((a Idv) (x Idv)) (! (=> (${MEM} x (${UNION} a)) (exists ((y Idv)) (and (${MEM} y a) (${MEM} x y)))) :pattern ((${MEM} x (${UNION} a)))))`,
|
|
172
|
+
),
|
|
173
|
+
],
|
|
174
|
+
),
|
|
175
|
+
Subset: declareSpec(
|
|
176
|
+
"Subset",
|
|
177
|
+
1,
|
|
178
|
+
["Mem", "SubsetEq"],
|
|
179
|
+
[
|
|
180
|
+
axiom(
|
|
181
|
+
"SubsetDefAlt",
|
|
182
|
+
[],
|
|
183
|
+
`(forall ((a Idv) (x Idv)) (! (= (${MEM} x (${SUBSET} a)) (${SUBSET_EQ} x a)) :pattern ((${MEM} x (${SUBSET} a))) :pattern ((${SUBSET_EQ} x a) (${SUBSET} a))))`,
|
|
184
|
+
),
|
|
185
|
+
],
|
|
186
|
+
),
|
|
187
|
+
Cup: declareSpec(
|
|
188
|
+
"Cup",
|
|
189
|
+
2,
|
|
190
|
+
["Mem"],
|
|
191
|
+
[getSetOperationDef("Cup", `(or (${MEM} x a) (${MEM} x b))`)],
|
|
192
|
+
),
|
|
193
|
+
Cap: declareSpec(
|
|
194
|
+
"Cap",
|
|
195
|
+
2,
|
|
196
|
+
["Mem", "SetEnum_0", "SetExtTrigger"],
|
|
197
|
+
[
|
|
198
|
+
getSetOperationDef("Cap", `(and (${MEM} x a) (${MEM} x b))`),
|
|
199
|
+
axiom(
|
|
200
|
+
"DisjointTrigger",
|
|
201
|
+
[],
|
|
202
|
+
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} (${CAP} x y) ${tla("SetEnum_0")}) :pattern ((${CAP} x y))))`,
|
|
203
|
+
),
|
|
204
|
+
],
|
|
205
|
+
),
|
|
206
|
+
SetMinus: declareSpec(
|
|
207
|
+
"SetMinus",
|
|
208
|
+
2,
|
|
209
|
+
["Mem"],
|
|
210
|
+
[getSetOperationDef("SetMinus", `(and (${MEM} x a) (not (${MEM} x b)))`)],
|
|
211
|
+
),
|
|
212
|
+
SetSt: createSpec(
|
|
213
|
+
undefined,
|
|
214
|
+
["Mem", "SetEnum_0", "SetExtTrigger"],
|
|
215
|
+
[axiom("SetStDef", [], undefined), axiom("EmptyComprehensionTrigger", [], undefined)],
|
|
216
|
+
),
|
|
217
|
+
NatSet: declareSpec(
|
|
218
|
+
"NatSet",
|
|
219
|
+
0,
|
|
220
|
+
["IntSet", "TIntLit_0", "Cast_Int", "IntLteq"],
|
|
221
|
+
[
|
|
222
|
+
axiom(
|
|
223
|
+
"NatSetDef",
|
|
224
|
+
[],
|
|
225
|
+
`(forall ((x Idv)) (! (= (${MEM} x ${NAT_SET}) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} (${CAST_INT} 0) x))) :pattern ((${MEM} x ${NAT_SET}))))`,
|
|
226
|
+
),
|
|
227
|
+
],
|
|
228
|
+
),
|
|
229
|
+
IntRange: declareSpec(
|
|
230
|
+
"IntRange",
|
|
231
|
+
2,
|
|
232
|
+
["Mem", "IntSet", "IntLteq"],
|
|
233
|
+
[
|
|
234
|
+
axiom(
|
|
235
|
+
"IntRangeDef",
|
|
236
|
+
[],
|
|
237
|
+
`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${MEM} x (${INT_RANGE} a b)) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} a x) (${INT_LTEQ} x b))) :pattern ((${MEM} x (${INT_RANGE} a b)))))`,
|
|
238
|
+
),
|
|
239
|
+
],
|
|
240
|
+
),
|
|
241
|
+
FunIsafcn: declareSpec(
|
|
242
|
+
"FunIsafcn",
|
|
243
|
+
1,
|
|
244
|
+
["Mem", "FunDom", "FunFcn", "FunApp"],
|
|
245
|
+
[
|
|
246
|
+
axiom(
|
|
247
|
+
"FunExt",
|
|
248
|
+
[],
|
|
249
|
+
`(forall ((f Idv) (g Idv)) (! (=> (and (${FUN_ISAFCN} f) (${FUN_ISAFCN} g) (= (${FUN_DOM} f) (${FUN_DOM} g)) (forall ((x Idv)) (=> (${MEM} x (${FUN_DOM} f)) (= (${FUN_APP} f x) (${FUN_APP} g x))))) (= f g)) :pattern ((${FUN_ISAFCN} f) (${FUN_ISAFCN} g))))`,
|
|
250
|
+
),
|
|
251
|
+
],
|
|
252
|
+
"Bool",
|
|
253
|
+
),
|
|
254
|
+
FunDom: declareSpec("FunDom", 1, ["FunFcn"], [axiom("FunDomDef", [], undefined)]),
|
|
255
|
+
FunApp: declareSpec("FunApp", 2, ["Mem", "FunFcn"], [axiom("FunAppDef", [], undefined)]),
|
|
256
|
+
// tlapm labels SeqSetElim1 and SeqSetElim2 SetSetElim1 and SetSetElim2.
|
|
257
|
+
Seq: declareSpec(
|
|
258
|
+
"Seq",
|
|
259
|
+
1,
|
|
260
|
+
[
|
|
261
|
+
"Mem",
|
|
262
|
+
"Len",
|
|
263
|
+
"FunIsafcn",
|
|
264
|
+
"FunDom",
|
|
265
|
+
"FunApp",
|
|
266
|
+
"IntSet",
|
|
267
|
+
"NatSet",
|
|
268
|
+
"IntRange",
|
|
269
|
+
"Cast_Int",
|
|
270
|
+
"Proj_Int",
|
|
271
|
+
],
|
|
272
|
+
[
|
|
273
|
+
axiom(
|
|
274
|
+
"SeqSetIntro",
|
|
275
|
+
[],
|
|
276
|
+
`(forall ((a Idv) (s Idv)) (! (=> (and (${FUN_ISAFCN} s) (>= (${PROJ_INT} (${LEN} s)) 0) (forall ((i Idv)) (= (${MEM} i (${FUN_DOM} s)) (and (${MEM} i ${INT_SET}) (<= 1 (${PROJ_INT} i)) (<= (${PROJ_INT} i) (${PROJ_INT} (${LEN} s)))))) (forall ((i Int)) (=> (and (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (${MEM} (${FUN_APP} s (${CAST_INT} i)) a)))) (${MEM} s (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)))))`,
|
|
277
|
+
),
|
|
278
|
+
axiom(
|
|
279
|
+
"SeqSetElim1",
|
|
280
|
+
[],
|
|
281
|
+
`(forall ((a Idv) (s Idv)) (! (=> (${MEM} s (${SEQ} a)) (and (${FUN_ISAFCN} s) (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${LEN} s))))) :pattern ((${MEM} s (${SEQ} a)))))`,
|
|
282
|
+
"SetSetElim1",
|
|
283
|
+
),
|
|
284
|
+
axiom(
|
|
285
|
+
"SeqSetElim2",
|
|
286
|
+
[],
|
|
287
|
+
`(forall ((a Idv) (s Idv) (i Int)) (! (=> (and (${MEM} s (${SEQ} a)) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (${MEM} (${FUN_APP} s (${CAST_INT} i)) a)) :pattern ((${MEM} s (${SEQ} a)) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
288
|
+
"SetSetElim2",
|
|
289
|
+
),
|
|
290
|
+
],
|
|
291
|
+
),
|
|
292
|
+
Len: declareSpec(
|
|
293
|
+
"Len",
|
|
294
|
+
1,
|
|
295
|
+
["FunDom", "IntRange", "Cast_Int"],
|
|
296
|
+
[
|
|
297
|
+
axiom(
|
|
298
|
+
"SeqLenDef",
|
|
299
|
+
[],
|
|
300
|
+
`(forall ((s Idv) (z Int)) (=> (and (>= z 0) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${CAST_INT} z)))) (= (${LEN} s) (${CAST_INT} z))))`,
|
|
301
|
+
),
|
|
302
|
+
],
|
|
303
|
+
),
|
|
304
|
+
BSeq: declareSpec("BSeq", 1, [], []),
|
|
305
|
+
Cat: declareSpec("Cat", 2, SEQUENCE_DEPS, [
|
|
306
|
+
axiom(
|
|
307
|
+
"SeqCatTyping",
|
|
308
|
+
[],
|
|
309
|
+
`(forall ((a Idv) (s Idv) (t Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} t (${SEQ} a))) (${MEM} (${CAT} s t) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${CAT} s t)) :pattern ((${MEM} t (${SEQ} a)) (${CAT} s t))))`,
|
|
310
|
+
),
|
|
311
|
+
axiom(
|
|
312
|
+
"SeqCatLen",
|
|
313
|
+
[],
|
|
314
|
+
`(forall ((s Idv) (t Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET})) (= (${LEN} (${CAT} s t)) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) (${PROJ_INT} (${LEN} t)))))) :pattern ((${CAT} s t))))`,
|
|
315
|
+
),
|
|
316
|
+
axiom(
|
|
317
|
+
"SeqCatApp1",
|
|
318
|
+
[],
|
|
319
|
+
`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (= (${FUN_APP} (${CAT} s t) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} i)))) :pattern ((${FUN_APP} (${CAT} s t) (${CAST_INT} i))) :pattern ((${CAT} s t) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
320
|
+
),
|
|
321
|
+
axiom(
|
|
322
|
+
"SeqCatApp2",
|
|
323
|
+
[],
|
|
324
|
+
`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (<= i (+ (${PROJ_INT} (${LEN} s)) (${PROJ_INT} (${LEN} t)))) (< (${PROJ_INT} (${LEN} s)) i)) (= (${FUN_APP} (${CAT} s t) (${CAST_INT} i)) (${FUN_APP} t (${CAST_INT} (- i (${PROJ_INT} (${LEN} s))))))) :pattern ((${FUN_APP} (${CAT} s t) (${CAST_INT} i)))))`,
|
|
325
|
+
),
|
|
326
|
+
]),
|
|
327
|
+
Append: declareSpec("Append", 2, SEQUENCE_DEPS, [
|
|
328
|
+
axiom(
|
|
329
|
+
"SeqAppendTyping",
|
|
330
|
+
[],
|
|
331
|
+
`(forall ((a Idv) (s Idv) (x Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} x a)) (${MEM} (${APPEND} s x) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${APPEND} s x))))`,
|
|
332
|
+
),
|
|
333
|
+
axiom(
|
|
334
|
+
"SeqAppendLen",
|
|
335
|
+
[],
|
|
336
|
+
`(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${LEN} (${APPEND} s x)) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) 1)))) :pattern ((${APPEND} s x))))`,
|
|
337
|
+
),
|
|
338
|
+
axiom(
|
|
339
|
+
"SeqAppendApp1",
|
|
340
|
+
[],
|
|
341
|
+
`(forall ((s Idv) (x Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (= (${FUN_APP} (${APPEND} s x) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} i)))) :pattern ((${FUN_APP} (${APPEND} s x) (${CAST_INT} i))) :pattern ((${APPEND} s x) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
342
|
+
),
|
|
343
|
+
axiom(
|
|
344
|
+
"SeqAppendApp2",
|
|
345
|
+
[],
|
|
346
|
+
`(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_APP} (${APPEND} s x) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) 1))) x)) :pattern ((${APPEND} s x))))`,
|
|
347
|
+
),
|
|
348
|
+
]),
|
|
349
|
+
Head: declareSpec(
|
|
350
|
+
"Head",
|
|
351
|
+
1,
|
|
352
|
+
["FunApp", "Cast_Int"],
|
|
353
|
+
[
|
|
354
|
+
axiom(
|
|
355
|
+
"SeqHeadDef",
|
|
356
|
+
[],
|
|
357
|
+
`(forall ((s Idv)) (! (= (${HEAD} s) (${FUN_APP} s (${CAST_INT} 1))) :pattern ((${HEAD} s))))`,
|
|
358
|
+
),
|
|
359
|
+
],
|
|
360
|
+
),
|
|
361
|
+
Tail: declareSpec("Tail", 1, SEQUENCE_DEPS, [
|
|
362
|
+
axiom(
|
|
363
|
+
"SeqTailTyping",
|
|
364
|
+
[],
|
|
365
|
+
`(forall ((a Idv) (s Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (distinct (${PROJ_INT} (${LEN} s)) 0)) (${MEM} (${TAIL} s) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${TAIL} s))))`,
|
|
366
|
+
),
|
|
367
|
+
axiom(
|
|
368
|
+
"SeqTailLen",
|
|
369
|
+
[],
|
|
370
|
+
`(forall ((s Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${PROJ_INT} (${LEN} s)) 0)) (= (${LEN} (${TAIL} s)) (${CAST_INT} (- (${PROJ_INT} (${LEN} s)) 1)))) :pattern ((${TAIL} s))))`,
|
|
371
|
+
),
|
|
372
|
+
axiom(
|
|
373
|
+
"SeqTailApp",
|
|
374
|
+
[],
|
|
375
|
+
`(forall ((s Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${PROJ_INT} (${LEN} s)) 0) (<= 1 i) (<= i (- (${PROJ_INT} (${LEN} s)) 1))) (= (${FUN_APP} (${TAIL} s) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} (+ i 1))))) :pattern ((${FUN_APP} (${TAIL} s) (${CAST_INT} i)))))`,
|
|
376
|
+
),
|
|
377
|
+
]),
|
|
378
|
+
SubSeq: declareSpec(
|
|
379
|
+
"SubSeq",
|
|
380
|
+
3,
|
|
381
|
+
["Mem", "Seq", "Len", "FunApp", "IntSet", "Cast_Int", "Proj_Int"],
|
|
382
|
+
[
|
|
383
|
+
axiom(
|
|
384
|
+
"SeqSubseqTyping",
|
|
385
|
+
[],
|
|
386
|
+
`(forall ((a Idv) (s Idv) (x Int) (y Int)) (! (=> (or (< y x) (and (${MEM} s (${SEQ} a)) (<= 1 x) (<= y (${PROJ_INT} (${LEN} s))))) (${MEM} ${SUB_SEQ_RANGE} (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) ${SUB_SEQ_RANGE})))`,
|
|
387
|
+
),
|
|
388
|
+
axiom(
|
|
389
|
+
"SeqSubseqLen",
|
|
390
|
+
[],
|
|
391
|
+
`(forall ((s Idv) (x Int) (y Int)) (! (and (=> (<= x (+ y 1)) (= (${LEN} ${SUB_SEQ_RANGE}) (${CAST_INT} (- (+ y 1) x)))) (=> (> x (+ y 1)) (= (${LEN} ${SUB_SEQ_RANGE}) (${CAST_INT} 0)))) :pattern (${SUB_SEQ_RANGE})))`,
|
|
392
|
+
),
|
|
393
|
+
axiom(
|
|
394
|
+
"SeqSubseqApp",
|
|
395
|
+
[],
|
|
396
|
+
`(forall ((s Idv) (x Int) (y Int) (z Int)) (! (=> (and (<= 1 x) (<= 1 z) (<= z (- (+ y 1) x))) (= (${FUN_APP} ${SUB_SEQ_RANGE} (${CAST_INT} z)) (${FUN_APP} s (${CAST_INT} (- (+ z x) 1))))) :pattern ((${FUN_APP} ${SUB_SEQ_RANGE} (${CAST_INT} z)))))`,
|
|
397
|
+
),
|
|
398
|
+
],
|
|
399
|
+
),
|
|
400
|
+
Cast_Int: createSpec(
|
|
401
|
+
declare(tla("Cast_Int"), 1, "Idv", "Int"),
|
|
402
|
+
["Mem", "IntSet", "Proj_Int"],
|
|
403
|
+
[
|
|
404
|
+
axiom(
|
|
405
|
+
"CastInjAlt",
|
|
406
|
+
["Int"],
|
|
407
|
+
`(forall ((x Int)) (! (= x (${PROJ_INT} (${CAST_INT} x))) :pattern ((${CAST_INT} x))))`,
|
|
408
|
+
),
|
|
409
|
+
axiom(
|
|
410
|
+
"TypeGuardIntro",
|
|
411
|
+
["Int"],
|
|
412
|
+
`(forall ((z Int)) (! (${MEM} (${CAST_INT} z) ${INT_SET}) :pattern ((${CAST_INT} z))))`,
|
|
413
|
+
),
|
|
414
|
+
axiom(
|
|
415
|
+
"TypeGuardElim",
|
|
416
|
+
["Int"],
|
|
417
|
+
`(forall ((x Idv)) (! (=> (${MEM} x ${INT_SET}) (= x (${CAST_INT} (${PROJ_INT} x)))) :pattern ((${MEM} x ${INT_SET}))))`,
|
|
418
|
+
),
|
|
419
|
+
],
|
|
420
|
+
),
|
|
421
|
+
Cast_Bool: createSpec(
|
|
422
|
+
declare(tla("Cast_Bool"), 1, "Idv", "Bool"),
|
|
423
|
+
["Mem", "BoolSet", "Tt_Idv"],
|
|
424
|
+
[
|
|
425
|
+
axiom(
|
|
426
|
+
"CastInjAlt",
|
|
427
|
+
["Bool"],
|
|
428
|
+
`(and (= (${CAST_BOOL} true) ${TT_IDV}) (distinct (${CAST_BOOL} false) ${TT_IDV}))`,
|
|
429
|
+
),
|
|
430
|
+
axiom(
|
|
431
|
+
"TypeGuardIntro",
|
|
432
|
+
["Bool"],
|
|
433
|
+
`(forall ((z Bool)) (! (${MEM} (${CAST_BOOL} z) ${BOOL_SET}) :pattern ((${CAST_BOOL} z))))`,
|
|
434
|
+
),
|
|
435
|
+
axiom(
|
|
436
|
+
"TypeGuardElim",
|
|
437
|
+
["Bool"],
|
|
438
|
+
`(forall ((x Idv)) (! (=> (${MEM} x ${BOOL_SET}) (or (= x (${CAST_BOOL} true)) (= x (${CAST_BOOL} false)))) :pattern ((${MEM} x ${BOOL_SET}))))`,
|
|
439
|
+
),
|
|
440
|
+
],
|
|
441
|
+
),
|
|
442
|
+
Proj_Int: createSpec(declare(tla("Proj_Int"), 1, "Int"), [], []),
|
|
443
|
+
TrigEq_Set$Idv$: declareSpec(
|
|
444
|
+
"TrigEq_Set$Idv$",
|
|
445
|
+
2,
|
|
446
|
+
["SetExtTrigger"],
|
|
447
|
+
[
|
|
448
|
+
axiom(
|
|
449
|
+
"ExtTrigEqDef",
|
|
450
|
+
["Set$Idv$"],
|
|
451
|
+
`(forall ((x Idv) (y Idv)) (! (= (${TRIG_EQ} x y) (= x y)) :pattern ((${TRIG_EQ} x y))))`,
|
|
452
|
+
),
|
|
453
|
+
axiom(
|
|
454
|
+
"ExtTrigEqTrigger",
|
|
455
|
+
["Idv"],
|
|
456
|
+
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} x y) :pattern ((${TRIG_EQ} x y))))`,
|
|
457
|
+
),
|
|
458
|
+
],
|
|
459
|
+
"Bool",
|
|
460
|
+
),
|
|
461
|
+
SetExtTrigger: declareSpec("SetExtTrigger", 2, [], [], "Bool"),
|
|
462
|
+
IsSetOf: declareSpec("IsSetOf", 1, [], [], "Bool"),
|
|
463
|
+
BoolSet: declareSpec("BoolSet", 0, [], []),
|
|
464
|
+
StrSet: declareSpec("StrSet", 0, [], []),
|
|
465
|
+
IntSet: declareSpec("IntSet", 0, [], []),
|
|
466
|
+
Tt_Idv: declareSpec("Tt_Idv", 0, [], []),
|
|
467
|
+
TIntLteq: createSpec(undefined, ["IntLteq"], [getTyping("IntLteq")]),
|
|
468
|
+
}),
|
|
469
|
+
);
|
|
470
|
+
|
|
76
471
|
export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec => {
|
|
77
|
-
const spec = (declaration: string | undefined, deps: string[], axioms: Axiom[]) => ({
|
|
78
|
-
declaration,
|
|
79
|
-
deps,
|
|
80
|
-
axioms,
|
|
81
|
-
});
|
|
82
472
|
const symbol = tla(name);
|
|
83
|
-
const fixed = (arity: number, deps: string[], axioms: Axiom[], sort = "Idv") =>
|
|
84
|
-
spec(declare(symbol, arity, sort), deps, axioms);
|
|
85
473
|
const enumeration = /^SetEnum_(\d+)$/.exec(name);
|
|
86
474
|
if (enumeration)
|
|
87
|
-
return
|
|
475
|
+
return declareSpec(
|
|
476
|
+
name,
|
|
477
|
+
Number(enumeration[1]),
|
|
478
|
+
["Mem"],
|
|
479
|
+
getEnumeration(Number(enumeration[1])),
|
|
480
|
+
);
|
|
88
481
|
const setOf = /^SetOf_(\d+)$/.exec(name);
|
|
89
482
|
if (setOf) {
|
|
90
483
|
const count = Number(setOf[1]);
|
|
91
|
-
return
|
|
484
|
+
return createSpec(
|
|
92
485
|
undefined,
|
|
93
486
|
["Mem", "IsSetOf"],
|
|
94
487
|
[
|
|
@@ -111,7 +504,8 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
111
504
|
axiom("StrLitDistinct", [value, other], `(distinct ${symbol} ${tla(`StrLit_${other}`)})`),
|
|
112
505
|
);
|
|
113
506
|
state.strings.push(value);
|
|
114
|
-
return
|
|
507
|
+
return declareSpec(
|
|
508
|
+
name,
|
|
115
509
|
0,
|
|
116
510
|
["Mem", "StrSet"],
|
|
117
511
|
[axiom("StrLitIsstr", [value], `(${MEM} ${symbol} ${STR_SET})`), ...distinct],
|
|
@@ -125,12 +519,13 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
125
519
|
count === 0
|
|
126
520
|
? ["FunIsafcn", "Cast_Int", "Seq", "Len"]
|
|
127
521
|
: ["FunIsafcn", "FunDom", "FunApp", `SetEnum_${count}`, "Cast_Int", "Mem", "Seq", "Len"];
|
|
128
|
-
return
|
|
522
|
+
return declareSpec(name, count, deps, getTupleAxioms(count, state.isExcept));
|
|
129
523
|
}
|
|
130
524
|
const product = /^Product_(\d+)$/.exec(name);
|
|
131
525
|
if (product) {
|
|
132
526
|
const count = Number(product[1]);
|
|
133
|
-
return
|
|
527
|
+
return declareSpec(
|
|
528
|
+
name,
|
|
134
529
|
count,
|
|
135
530
|
["Mem", `Tuple_${count}`, "FunApp", "Cast_Int", "Proj_Int"],
|
|
136
531
|
getComponentSet("Product", [count], symbol, tla(`Tuple_${count}`), getIntegers(count), "t"),
|
|
@@ -139,7 +534,8 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
139
534
|
const fields = state.recordFields.get(name);
|
|
140
535
|
if (fields && name.startsWith("Record_")) {
|
|
141
536
|
state.records.push(fields);
|
|
142
|
-
return
|
|
537
|
+
return declareSpec(
|
|
538
|
+
name,
|
|
143
539
|
fields.length,
|
|
144
540
|
[
|
|
145
541
|
"FunIsafcn",
|
|
@@ -153,190 +549,31 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
153
549
|
}
|
|
154
550
|
if (fields && name.startsWith("RecordSet_")) {
|
|
155
551
|
const record = `Record_${fields.join("_")}`;
|
|
156
|
-
return
|
|
552
|
+
return declareSpec(
|
|
553
|
+
name,
|
|
157
554
|
fields.length,
|
|
158
555
|
["Mem", record, "FunApp", ...fields.map((field) => `StrLit_${field}`)],
|
|
159
556
|
getComponentSet("RecSet", [fields], symbol, tla(record), getFieldKeys(fields), "r"),
|
|
160
557
|
);
|
|
161
558
|
}
|
|
162
559
|
const anonymous = state.anonymous.get(name);
|
|
163
|
-
if (anonymous !== undefined) return
|
|
560
|
+
if (anonymous !== undefined) return declareSpec(name, anonymous, [], []);
|
|
561
|
+
const known = STATIC_SPECS.get(name);
|
|
562
|
+
if (known) return known;
|
|
164
563
|
const typed = TYPED_OPERATORS[name];
|
|
165
564
|
if (typed)
|
|
166
|
-
return
|
|
565
|
+
return declareSpec(
|
|
566
|
+
name,
|
|
567
|
+
typed[1],
|
|
568
|
+
["Cast_Int"],
|
|
569
|
+
[getTyping(name)],
|
|
570
|
+
name === "IntLteq" ? "Bool" : "Idv",
|
|
571
|
+
);
|
|
167
572
|
switch (name) {
|
|
168
|
-
// SMT-LIB has no exponentiation, so IntExp keeps only its typing.
|
|
169
|
-
case "IntExp":
|
|
170
|
-
return fixed(
|
|
171
|
-
2,
|
|
172
|
-
["Mem", "IntSet", "Cast_Int", "TIntLteq", "TIntLit_0", "TIntLit_1"],
|
|
173
|
-
[
|
|
174
|
-
axiom(
|
|
175
|
-
"IntExpTyping",
|
|
176
|
-
[],
|
|
177
|
-
`(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (or (distinct x (${CAST_INT} 0)) (${INT_LTEQ} (${CAST_INT} 1) y))) (${MEM} (${symbol} x y) ${INT_SET})) :pattern ((${symbol} x y))))`,
|
|
178
|
-
),
|
|
179
|
-
],
|
|
180
|
-
);
|
|
181
|
-
case "SelectSeq":
|
|
182
|
-
return spec(
|
|
183
|
-
undefined,
|
|
184
|
-
[
|
|
185
|
-
"Mem",
|
|
186
|
-
"Seq",
|
|
187
|
-
"Len",
|
|
188
|
-
"Append",
|
|
189
|
-
"FunApp",
|
|
190
|
-
"FunDom",
|
|
191
|
-
"IntSet",
|
|
192
|
-
"NatSet",
|
|
193
|
-
"Tuple_0",
|
|
194
|
-
"Proj_Int",
|
|
195
|
-
],
|
|
196
|
-
[
|
|
197
|
-
axiom("SeqSelectseqTyping", [], undefined),
|
|
198
|
-
axiom("SeqSelectseqLen", [], undefined),
|
|
199
|
-
axiom("SeqSelectseqNil", [], undefined),
|
|
200
|
-
axiom("SeqSelectseqApp", [], undefined),
|
|
201
|
-
axiom("SeqSelectseqAppend", [], undefined),
|
|
202
|
-
],
|
|
203
|
-
);
|
|
204
|
-
case "Choose":
|
|
205
|
-
return spec(undefined, [], [axiom("ChooseDef", [], undefined)]);
|
|
206
|
-
case "Mem":
|
|
207
|
-
return fixed(
|
|
208
|
-
2,
|
|
209
|
-
["SetExtTrigger"],
|
|
210
|
-
[
|
|
211
|
-
axiom(
|
|
212
|
-
"SetExt",
|
|
213
|
-
[],
|
|
214
|
-
`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${MEM} z x) (${MEM} z y))) (= x y)) :pattern ((${SET_EXT_TRIGGER} x y))))`,
|
|
215
|
-
),
|
|
216
|
-
],
|
|
217
|
-
"Bool",
|
|
218
|
-
);
|
|
219
|
-
case "SubsetEq":
|
|
220
|
-
return fixed(
|
|
221
|
-
2,
|
|
222
|
-
["Mem"],
|
|
223
|
-
[
|
|
224
|
-
axiom(
|
|
225
|
-
"SubsetEqIntro",
|
|
226
|
-
[],
|
|
227
|
-
`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (=> (${MEM} z x) (${MEM} z y))) (${SUBSET_EQ} x y)) :pattern ((${SUBSET_EQ} x y))))`,
|
|
228
|
-
),
|
|
229
|
-
axiom(
|
|
230
|
-
"SubsetEqElim",
|
|
231
|
-
[],
|
|
232
|
-
`(forall ((x Idv) (y Idv) (z Idv)) (! (=> (and (${SUBSET_EQ} x y) (${MEM} z x)) (${MEM} z y)) :pattern ((${SUBSET_EQ} x y) (${MEM} z x))))`,
|
|
233
|
-
),
|
|
234
|
-
],
|
|
235
|
-
"Bool",
|
|
236
|
-
);
|
|
237
|
-
case "Union":
|
|
238
|
-
return fixed(
|
|
239
|
-
1,
|
|
240
|
-
["Mem"],
|
|
241
|
-
[
|
|
242
|
-
axiom(
|
|
243
|
-
"UnionIntro",
|
|
244
|
-
[],
|
|
245
|
-
`(forall ((a Idv) (x Idv) (y Idv)) (! (=> (and (${MEM} y a) (${MEM} x y)) (${MEM} x (${UNION} a))) :pattern ((${MEM} y a) (${MEM} x (${UNION} a))) :pattern ((${MEM} x y) (${MEM} x (${UNION} a))) :pattern ((${MEM} y a) (${MEM} x y) (${UNION} a))))`,
|
|
246
|
-
),
|
|
247
|
-
axiom(
|
|
248
|
-
"UnionElim",
|
|
249
|
-
[],
|
|
250
|
-
`(forall ((a Idv) (x Idv)) (! (=> (${MEM} x (${UNION} a)) (exists ((y Idv)) (and (${MEM} y a) (${MEM} x y)))) :pattern ((${MEM} x (${UNION} a)))))`,
|
|
251
|
-
),
|
|
252
|
-
],
|
|
253
|
-
);
|
|
254
|
-
case "Subset":
|
|
255
|
-
return fixed(
|
|
256
|
-
1,
|
|
257
|
-
["Mem", "SubsetEq"],
|
|
258
|
-
[
|
|
259
|
-
axiom(
|
|
260
|
-
"SubsetDefAlt",
|
|
261
|
-
[],
|
|
262
|
-
`(forall ((a Idv) (x Idv)) (! (= (${MEM} x (${SUBSET} a)) (${SUBSET_EQ} x a)) :pattern ((${MEM} x (${SUBSET} a))) :pattern ((${SUBSET_EQ} x a) (${SUBSET} a))))`,
|
|
263
|
-
),
|
|
264
|
-
],
|
|
265
|
-
);
|
|
266
|
-
case "Cup":
|
|
267
|
-
case "Cap":
|
|
268
|
-
case "SetMinus": {
|
|
269
|
-
const condition =
|
|
270
|
-
name === "Cup"
|
|
271
|
-
? "(or (MEM x a) (MEM x b))"
|
|
272
|
-
: name === "Cap"
|
|
273
|
-
? "(and (MEM x a) (MEM x b))"
|
|
274
|
-
: "(and (MEM x a) (not (MEM x b)))";
|
|
275
|
-
const definition = axiom(
|
|
276
|
-
`${name}Def`,
|
|
277
|
-
[],
|
|
278
|
-
`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${MEM} x (${symbol} a b)) ${condition.replaceAll("MEM", MEM)}) :pattern ((${MEM} x (${symbol} a b))) :pattern ((${MEM} x a) (${symbol} a b)) :pattern ((${MEM} x b) (${symbol} a b))))`,
|
|
279
|
-
);
|
|
280
|
-
if (name !== "Cap") return fixed(2, ["Mem"], [definition]);
|
|
281
|
-
return fixed(
|
|
282
|
-
2,
|
|
283
|
-
["Mem", "SetEnum_0", "SetExtTrigger"],
|
|
284
|
-
[
|
|
285
|
-
definition,
|
|
286
|
-
axiom(
|
|
287
|
-
"DisjointTrigger",
|
|
288
|
-
[],
|
|
289
|
-
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} (${CAP} x y) ${tla("SetEnum_0")}) :pattern ((${CAP} x y))))`,
|
|
290
|
-
),
|
|
291
|
-
],
|
|
292
|
-
);
|
|
293
|
-
}
|
|
294
|
-
case "SetSt":
|
|
295
|
-
return spec(
|
|
296
|
-
undefined,
|
|
297
|
-
["Mem", "SetEnum_0", "SetExtTrigger"],
|
|
298
|
-
[axiom("SetStDef", [], undefined), axiom("EmptyComprehensionTrigger", [], undefined)],
|
|
299
|
-
);
|
|
300
|
-
case "NatSet":
|
|
301
|
-
return fixed(
|
|
302
|
-
0,
|
|
303
|
-
["IntSet", "TIntLit_0", "Cast_Int", "IntLteq"],
|
|
304
|
-
[
|
|
305
|
-
axiom(
|
|
306
|
-
"NatSetDef",
|
|
307
|
-
[],
|
|
308
|
-
`(forall ((x Idv)) (! (= (${MEM} x ${NAT_SET}) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} (${CAST_INT} 0) x))) :pattern ((${MEM} x ${NAT_SET}))))`,
|
|
309
|
-
),
|
|
310
|
-
],
|
|
311
|
-
);
|
|
312
|
-
case "IntRange":
|
|
313
|
-
return fixed(
|
|
314
|
-
2,
|
|
315
|
-
["Mem", "IntSet", "IntLteq"],
|
|
316
|
-
[
|
|
317
|
-
axiom(
|
|
318
|
-
"IntRangeDef",
|
|
319
|
-
[],
|
|
320
|
-
`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${MEM} x (${INT_RANGE} a b)) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} a x) (${INT_LTEQ} x b))) :pattern ((${MEM} x (${INT_RANGE} a b)))))`,
|
|
321
|
-
),
|
|
322
|
-
],
|
|
323
|
-
);
|
|
324
|
-
case "FunIsafcn":
|
|
325
|
-
return fixed(
|
|
326
|
-
1,
|
|
327
|
-
["Mem", "FunDom", "FunFcn", "FunApp"],
|
|
328
|
-
[
|
|
329
|
-
axiom(
|
|
330
|
-
"FunExt",
|
|
331
|
-
[],
|
|
332
|
-
`(forall ((f Idv) (g Idv)) (! (=> (and (${FUN_ISAFCN} f) (${FUN_ISAFCN} g) (= (${FUN_DOM} f) (${FUN_DOM} g)) (forall ((x Idv)) (=> (${MEM} x (${FUN_DOM} f)) (= (${FUN_APP} f x) (${FUN_APP} g x))))) (= f g)) :pattern ((${FUN_ISAFCN} f) (${FUN_ISAFCN} g))))`,
|
|
333
|
-
),
|
|
334
|
-
],
|
|
335
|
-
"Bool",
|
|
336
|
-
);
|
|
337
573
|
case "FunSet":
|
|
338
574
|
state.isFunSet = true;
|
|
339
|
-
return
|
|
575
|
+
return declareSpec(
|
|
576
|
+
name,
|
|
340
577
|
2,
|
|
341
578
|
["Mem", "FunIsafcn", "FunDom", "FunApp"],
|
|
342
579
|
[
|
|
@@ -360,7 +597,7 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
360
597
|
);
|
|
361
598
|
case "FunFcn":
|
|
362
599
|
state.isFunConstr = true;
|
|
363
|
-
return
|
|
600
|
+
return createSpec(
|
|
364
601
|
undefined,
|
|
365
602
|
["FunIsafcn"],
|
|
366
603
|
[
|
|
@@ -368,14 +605,11 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
368
605
|
...(state.isFunSet ? [axiom("FunTyping", [], undefined)] : []),
|
|
369
606
|
],
|
|
370
607
|
);
|
|
371
|
-
case "FunDom":
|
|
372
|
-
return fixed(1, ["FunFcn"], [axiom("FunDomDef", [], undefined)]);
|
|
373
|
-
case "FunApp":
|
|
374
|
-
return fixed(2, ["Mem", "FunFcn"], [axiom("FunAppDef", [], undefined)]);
|
|
375
608
|
case "FunExcept": {
|
|
376
609
|
state.isExcept = true;
|
|
377
610
|
const updated = `(${FUN_EXCEPT} f x y)`;
|
|
378
|
-
return
|
|
611
|
+
return declareSpec(
|
|
612
|
+
name,
|
|
379
613
|
3,
|
|
380
614
|
["Mem", "FunIsafcn", "FunDom", "FunApp"],
|
|
381
615
|
[
|
|
@@ -404,233 +638,8 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
404
638
|
],
|
|
405
639
|
);
|
|
406
640
|
}
|
|
407
|
-
// tlapm labels SeqSetElim1 and SeqSetElim2 SetSetElim1 and SetSetElim2.
|
|
408
|
-
case "Seq":
|
|
409
|
-
return fixed(
|
|
410
|
-
1,
|
|
411
|
-
[
|
|
412
|
-
"Mem",
|
|
413
|
-
"Len",
|
|
414
|
-
"FunIsafcn",
|
|
415
|
-
"FunDom",
|
|
416
|
-
"FunApp",
|
|
417
|
-
"IntSet",
|
|
418
|
-
"NatSet",
|
|
419
|
-
"IntRange",
|
|
420
|
-
"Cast_Int",
|
|
421
|
-
"Proj_Int",
|
|
422
|
-
],
|
|
423
|
-
[
|
|
424
|
-
axiom(
|
|
425
|
-
"SeqSetIntro",
|
|
426
|
-
[],
|
|
427
|
-
`(forall ((a Idv) (s Idv)) (! (=> (and (${FUN_ISAFCN} s) (>= (${PROJ_INT} (${LEN} s)) 0) (forall ((i Idv)) (= (${MEM} i (${FUN_DOM} s)) (and (${MEM} i ${INT_SET}) (<= 1 (${PROJ_INT} i)) (<= (${PROJ_INT} i) (${PROJ_INT} (${LEN} s)))))) (forall ((i Int)) (=> (and (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (${MEM} (${FUN_APP} s (${CAST_INT} i)) a)))) (${MEM} s (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)))))`,
|
|
428
|
-
),
|
|
429
|
-
axiom(
|
|
430
|
-
"SeqSetElim1",
|
|
431
|
-
[],
|
|
432
|
-
`(forall ((a Idv) (s Idv)) (! (=> (${MEM} s (${SEQ} a)) (and (${FUN_ISAFCN} s) (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${LEN} s))))) :pattern ((${MEM} s (${SEQ} a)))))`,
|
|
433
|
-
"SetSetElim1",
|
|
434
|
-
),
|
|
435
|
-
axiom(
|
|
436
|
-
"SeqSetElim2",
|
|
437
|
-
[],
|
|
438
|
-
`(forall ((a Idv) (s Idv) (i Int)) (! (=> (and (${MEM} s (${SEQ} a)) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (${MEM} (${FUN_APP} s (${CAST_INT} i)) a)) :pattern ((${MEM} s (${SEQ} a)) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
439
|
-
"SetSetElim2",
|
|
440
|
-
),
|
|
441
|
-
],
|
|
442
|
-
);
|
|
443
|
-
case "Len":
|
|
444
|
-
return fixed(
|
|
445
|
-
1,
|
|
446
|
-
["FunDom", "IntRange", "Cast_Int"],
|
|
447
|
-
[
|
|
448
|
-
axiom(
|
|
449
|
-
"SeqLenDef",
|
|
450
|
-
[],
|
|
451
|
-
`(forall ((s Idv) (z Int)) (=> (and (>= z 0) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${CAST_INT} z)))) (= (${LEN} s) (${CAST_INT} z))))`,
|
|
452
|
-
),
|
|
453
|
-
],
|
|
454
|
-
);
|
|
455
|
-
case "BSeq":
|
|
456
|
-
return fixed(1, [], []);
|
|
457
|
-
case "Cat":
|
|
458
|
-
return fixed(2, SEQUENCE_DEPS, [
|
|
459
|
-
axiom(
|
|
460
|
-
"SeqCatTyping",
|
|
461
|
-
[],
|
|
462
|
-
`(forall ((a Idv) (s Idv) (t Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} t (${SEQ} a))) (${MEM} (${CAT} s t) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${CAT} s t)) :pattern ((${MEM} t (${SEQ} a)) (${CAT} s t))))`,
|
|
463
|
-
),
|
|
464
|
-
axiom(
|
|
465
|
-
"SeqCatLen",
|
|
466
|
-
[],
|
|
467
|
-
`(forall ((s Idv) (t Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET})) (= (${LEN} (${CAT} s t)) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) (${PROJ_INT} (${LEN} t)))))) :pattern ((${CAT} s t))))`,
|
|
468
|
-
),
|
|
469
|
-
axiom(
|
|
470
|
-
"SeqCatApp1",
|
|
471
|
-
[],
|
|
472
|
-
`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (= (${FUN_APP} (${CAT} s t) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} i)))) :pattern ((${FUN_APP} (${CAT} s t) (${CAST_INT} i))) :pattern ((${CAT} s t) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
473
|
-
),
|
|
474
|
-
axiom(
|
|
475
|
-
"SeqCatApp2",
|
|
476
|
-
[],
|
|
477
|
-
`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (<= i (+ (${PROJ_INT} (${LEN} s)) (${PROJ_INT} (${LEN} t)))) (< (${PROJ_INT} (${LEN} s)) i)) (= (${FUN_APP} (${CAT} s t) (${CAST_INT} i)) (${FUN_APP} t (${CAST_INT} (- i (${PROJ_INT} (${LEN} s))))))) :pattern ((${FUN_APP} (${CAT} s t) (${CAST_INT} i)))))`,
|
|
478
|
-
),
|
|
479
|
-
]);
|
|
480
|
-
case "Append":
|
|
481
|
-
return fixed(2, SEQUENCE_DEPS, [
|
|
482
|
-
axiom(
|
|
483
|
-
"SeqAppendTyping",
|
|
484
|
-
[],
|
|
485
|
-
`(forall ((a Idv) (s Idv) (x Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} x a)) (${MEM} (${APPEND} s x) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${APPEND} s x))))`,
|
|
486
|
-
),
|
|
487
|
-
axiom(
|
|
488
|
-
"SeqAppendLen",
|
|
489
|
-
[],
|
|
490
|
-
`(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${LEN} (${APPEND} s x)) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) 1)))) :pattern ((${APPEND} s x))))`,
|
|
491
|
-
),
|
|
492
|
-
axiom(
|
|
493
|
-
"SeqAppendApp1",
|
|
494
|
-
[],
|
|
495
|
-
`(forall ((s Idv) (x Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (= (${FUN_APP} (${APPEND} s x) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} i)))) :pattern ((${FUN_APP} (${APPEND} s x) (${CAST_INT} i))) :pattern ((${APPEND} s x) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
496
|
-
),
|
|
497
|
-
axiom(
|
|
498
|
-
"SeqAppendApp2",
|
|
499
|
-
[],
|
|
500
|
-
`(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_APP} (${APPEND} s x) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) 1))) x)) :pattern ((${APPEND} s x))))`,
|
|
501
|
-
),
|
|
502
|
-
]);
|
|
503
|
-
case "Head":
|
|
504
|
-
return fixed(
|
|
505
|
-
1,
|
|
506
|
-
["FunApp", "Cast_Int"],
|
|
507
|
-
[
|
|
508
|
-
axiom(
|
|
509
|
-
"SeqHeadDef",
|
|
510
|
-
[],
|
|
511
|
-
`(forall ((s Idv)) (! (= (${HEAD} s) (${FUN_APP} s (${CAST_INT} 1))) :pattern ((${HEAD} s))))`,
|
|
512
|
-
),
|
|
513
|
-
],
|
|
514
|
-
);
|
|
515
|
-
case "Tail":
|
|
516
|
-
return fixed(1, SEQUENCE_DEPS, [
|
|
517
|
-
axiom(
|
|
518
|
-
"SeqTailTyping",
|
|
519
|
-
[],
|
|
520
|
-
`(forall ((a Idv) (s Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (distinct (${PROJ_INT} (${LEN} s)) 0)) (${MEM} (${TAIL} s) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${TAIL} s))))`,
|
|
521
|
-
),
|
|
522
|
-
axiom(
|
|
523
|
-
"SeqTailLen",
|
|
524
|
-
[],
|
|
525
|
-
`(forall ((s Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${PROJ_INT} (${LEN} s)) 0)) (= (${LEN} (${TAIL} s)) (${CAST_INT} (- (${PROJ_INT} (${LEN} s)) 1)))) :pattern ((${TAIL} s))))`,
|
|
526
|
-
),
|
|
527
|
-
axiom(
|
|
528
|
-
"SeqTailApp",
|
|
529
|
-
[],
|
|
530
|
-
`(forall ((s Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${PROJ_INT} (${LEN} s)) 0) (<= 1 i) (<= i (- (${PROJ_INT} (${LEN} s)) 1))) (= (${FUN_APP} (${TAIL} s) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} (+ i 1))))) :pattern ((${FUN_APP} (${TAIL} s) (${CAST_INT} i)))))`,
|
|
531
|
-
),
|
|
532
|
-
]);
|
|
533
|
-
case "SubSeq": {
|
|
534
|
-
const range = `(${SUB_SEQ} s (${CAST_INT} x) (${CAST_INT} y))`;
|
|
535
|
-
return fixed(
|
|
536
|
-
3,
|
|
537
|
-
["Mem", "Seq", "Len", "FunApp", "IntSet", "Cast_Int", "Proj_Int"],
|
|
538
|
-
[
|
|
539
|
-
axiom(
|
|
540
|
-
"SeqSubseqTyping",
|
|
541
|
-
[],
|
|
542
|
-
`(forall ((a Idv) (s Idv) (x Int) (y Int)) (! (=> (or (< y x) (and (${MEM} s (${SEQ} a)) (<= 1 x) (<= y (${PROJ_INT} (${LEN} s))))) (${MEM} ${range} (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) ${range})))`,
|
|
543
|
-
),
|
|
544
|
-
axiom(
|
|
545
|
-
"SeqSubseqLen",
|
|
546
|
-
[],
|
|
547
|
-
`(forall ((s Idv) (x Int) (y Int)) (! (and (=> (<= x (+ y 1)) (= (${LEN} ${range}) (${CAST_INT} (- (+ y 1) x)))) (=> (> x (+ y 1)) (= (${LEN} ${range}) (${CAST_INT} 0)))) :pattern (${range})))`,
|
|
548
|
-
),
|
|
549
|
-
axiom(
|
|
550
|
-
"SeqSubseqApp",
|
|
551
|
-
[],
|
|
552
|
-
`(forall ((s Idv) (x Int) (y Int) (z Int)) (! (=> (and (<= 1 x) (<= 1 z) (<= z (- (+ y 1) x))) (= (${FUN_APP} ${range} (${CAST_INT} z)) (${FUN_APP} s (${CAST_INT} (- (+ z x) 1))))) :pattern ((${FUN_APP} ${range} (${CAST_INT} z)))))`,
|
|
553
|
-
),
|
|
554
|
-
],
|
|
555
|
-
);
|
|
556
|
-
}
|
|
557
|
-
case "Cast_Int":
|
|
558
|
-
return spec(
|
|
559
|
-
declare(symbol, 1, "Idv", "Int"),
|
|
560
|
-
["Mem", "IntSet", "Proj_Int"],
|
|
561
|
-
[
|
|
562
|
-
axiom(
|
|
563
|
-
"CastInjAlt",
|
|
564
|
-
["Int"],
|
|
565
|
-
`(forall ((x Int)) (! (= x (${PROJ_INT} (${CAST_INT} x))) :pattern ((${CAST_INT} x))))`,
|
|
566
|
-
),
|
|
567
|
-
axiom(
|
|
568
|
-
"TypeGuardIntro",
|
|
569
|
-
["Int"],
|
|
570
|
-
`(forall ((z Int)) (! (${MEM} (${CAST_INT} z) ${INT_SET}) :pattern ((${CAST_INT} z))))`,
|
|
571
|
-
),
|
|
572
|
-
axiom(
|
|
573
|
-
"TypeGuardElim",
|
|
574
|
-
["Int"],
|
|
575
|
-
`(forall ((x Idv)) (! (=> (${MEM} x ${INT_SET}) (= x (${CAST_INT} (${PROJ_INT} x)))) :pattern ((${MEM} x ${INT_SET}))))`,
|
|
576
|
-
),
|
|
577
|
-
],
|
|
578
|
-
);
|
|
579
|
-
case "Cast_Bool":
|
|
580
|
-
return spec(
|
|
581
|
-
declare(symbol, 1, "Idv", "Bool"),
|
|
582
|
-
["Mem", "BoolSet", "Tt_Idv"],
|
|
583
|
-
[
|
|
584
|
-
axiom(
|
|
585
|
-
"CastInjAlt",
|
|
586
|
-
["Bool"],
|
|
587
|
-
`(and (= (${CAST_BOOL} true) ${TT_IDV}) (distinct (${CAST_BOOL} false) ${TT_IDV}))`,
|
|
588
|
-
),
|
|
589
|
-
axiom(
|
|
590
|
-
"TypeGuardIntro",
|
|
591
|
-
["Bool"],
|
|
592
|
-
`(forall ((z Bool)) (! (${MEM} (${CAST_BOOL} z) ${BOOL_SET}) :pattern ((${CAST_BOOL} z))))`,
|
|
593
|
-
),
|
|
594
|
-
axiom(
|
|
595
|
-
"TypeGuardElim",
|
|
596
|
-
["Bool"],
|
|
597
|
-
`(forall ((x Idv)) (! (=> (${MEM} x ${BOOL_SET}) (or (= x (${CAST_BOOL} true)) (= x (${CAST_BOOL} false)))) :pattern ((${MEM} x ${BOOL_SET}))))`,
|
|
598
|
-
),
|
|
599
|
-
],
|
|
600
|
-
);
|
|
601
|
-
case "Proj_Int":
|
|
602
|
-
return spec(declare(symbol, 1, "Int"), [], []);
|
|
603
|
-
case "TrigEq_Set$Idv$":
|
|
604
|
-
return fixed(
|
|
605
|
-
2,
|
|
606
|
-
["SetExtTrigger"],
|
|
607
|
-
[
|
|
608
|
-
axiom(
|
|
609
|
-
"ExtTrigEqDef",
|
|
610
|
-
["Set$Idv$"],
|
|
611
|
-
`(forall ((x Idv) (y Idv)) (! (= (${TRIG_EQ} x y) (= x y)) :pattern ((${TRIG_EQ} x y))))`,
|
|
612
|
-
),
|
|
613
|
-
axiom(
|
|
614
|
-
"ExtTrigEqTrigger",
|
|
615
|
-
["Idv"],
|
|
616
|
-
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} x y) :pattern ((${TRIG_EQ} x y))))`,
|
|
617
|
-
),
|
|
618
|
-
],
|
|
619
|
-
"Bool",
|
|
620
|
-
);
|
|
621
|
-
case "SetExtTrigger":
|
|
622
|
-
case "IsSetOf":
|
|
623
|
-
return fixed(name === "IsSetOf" ? 1 : 2, [], [], "Bool");
|
|
624
|
-
case "BoolSet":
|
|
625
|
-
case "StrSet":
|
|
626
|
-
case "IntSet":
|
|
627
|
-
case "Tt_Idv":
|
|
628
|
-
return fixed(0, [], []);
|
|
629
|
-
case "TIntLteq":
|
|
630
|
-
return spec(undefined, ["IntLteq"], [getTyping("IntLteq")]);
|
|
631
641
|
default:
|
|
632
|
-
|
|
633
|
-
if (name.startsWith("TIntLit_")) return spec(undefined, [], []);
|
|
642
|
+
if (name.startsWith("TIntLit_")) return createSpec(undefined, [], []);
|
|
634
643
|
throw new TlaUnsupportedError(`the symbol ${name}`);
|
|
635
644
|
}
|
|
636
645
|
};
|