tla-ts 0.0.3 → 0.0.4-dev.1a3acf6
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 +46 -115
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +194 -8
- package/dist/index.d.ts +194 -8
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +1006 -0
- package/dist/prove.js +1006 -0
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +1377 -18
- package/dist/transfer.js +1377 -18
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +24 -11
- package/src/ast.ts +149 -8
- package/src/bags.ts +26 -30
- package/src/builtins.ts +45 -19
- package/src/bundled-modules.ts +3 -3
- package/src/check.ts +1182 -900
- package/src/cli/options.ts +109 -0
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/cli/tlc.ts +941 -0
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +9 -2
- package/src/codegen.ts +112 -51
- package/src/config.ts +254 -181
- package/src/dependencies.ts +5 -7
- package/src/environment.ts +579 -184
- package/src/errors.ts +287 -4
- package/src/evaluate.ts +1095 -365
- package/src/exit-codes.ts +22 -43
- package/src/fingerprints.ts +49 -14
- package/src/index.ts +11 -0
- package/src/instances.ts +73 -60
- package/src/java-overrides.ts +183 -66
- package/src/json.ts +31 -36
- package/src/levels.ts +197 -54
- package/src/lexer.ts +127 -30
- package/src/liveness-checker.ts +894 -0
- package/src/liveness.ts +246 -596
- package/src/{obligation-action.ts → obligations/action.ts} +248 -74
- package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +618 -0
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/obligations/generate.ts +457 -0
- package/src/{obligations.ts → obligations/index.ts} +46 -32
- package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
- package/src/obligations/module.ts +445 -0
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +195 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/obligations/regroup.ts +100 -0
- package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
- package/src/{obligation-source.ts → obligations/source.ts} +174 -216
- package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +184 -235
- package/src/parallel.ts +156 -91
- package/src/parser.ts +490 -188
- package/src/pcal/ast.ts +755 -0
- package/src/pcal/parse.ts +1487 -0
- package/src/pcal/tokenize.ts +487 -0
- package/src/pcal/translate.ts +1151 -0
- package/src/pcal/validate.ts +444 -0
- package/src/prover/decide-pool.ts +95 -0
- package/src/prover/deciders.ts +33 -0
- package/src/prover/first-order.ts +175 -0
- package/src/prover/isabelle/LICENSE +36 -0
- package/src/prover/isabelle/LICENSE-tlapm +26 -0
- package/src/prover/isabelle/decide.ts +44 -0
- package/src/prover/isabelle/encode.ts +445 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prover/isabelle/isar/method.ts +367 -0
- package/src/prover/isabelle/isar/proof.ts +28 -0
- package/src/prover/isabelle/isar/statement.ts +57 -0
- package/src/prover/isabelle/isar/theory.ts +192 -0
- package/src/prover/isabelle/isar/type-check.ts +278 -0
- package/src/prover/isabelle/provers/blast/blast.ts +258 -0
- package/src/prover/isabelle/provers/blast/branch.ts +322 -0
- package/src/prover/isabelle/provers/blast/prove.ts +347 -0
- package/src/prover/isabelle/provers/blast/rules.ts +330 -0
- package/src/prover/isabelle/provers/blast/state.ts +180 -0
- package/src/prover/isabelle/provers/blast/term.ts +546 -0
- package/src/prover/isabelle/provers/clasimp.ts +150 -0
- package/src/prover/isabelle/provers/classical.ts +389 -0
- package/src/prover/isabelle/provers/hypsubst.ts +433 -0
- package/src/prover/isabelle/pure/bicompose.ts +174 -0
- package/src/prover/isabelle/pure/consts.ts +32 -0
- package/src/prover/isabelle/pure/conv.ts +79 -0
- package/src/prover/isabelle/pure/drule.ts +264 -0
- package/src/prover/isabelle/pure/envir.ts +331 -0
- package/src/prover/isabelle/pure/goal.ts +53 -0
- package/src/prover/isabelle/pure/interrupt.ts +16 -0
- package/src/prover/isabelle/pure/list.ts +12 -0
- package/src/prover/isabelle/pure/logic.ts +330 -0
- package/src/prover/isabelle/pure/name.ts +98 -0
- package/src/prover/isabelle/pure/net.ts +215 -0
- package/src/prover/isabelle/pure/object-logic.ts +41 -0
- package/src/prover/isabelle/pure/pattern.ts +631 -0
- package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prover/isabelle/pure/rewriter.ts +602 -0
- package/src/prover/isabelle/pure/search.ts +68 -0
- package/src/prover/isabelle/pure/seq.ts +133 -0
- package/src/prover/isabelle/pure/simplifier.ts +106 -0
- package/src/prover/isabelle/pure/table.ts +201 -0
- package/src/prover/isabelle/pure/tactic.ts +168 -0
- package/src/prover/isabelle/pure/tactical.ts +264 -0
- package/src/prover/isabelle/pure/term-ord.ts +105 -0
- package/src/prover/isabelle/pure/term.ts +688 -0
- package/src/prover/isabelle/pure/thm.ts +783 -0
- package/src/prover/isabelle/pure/type.ts +121 -0
- package/src/prover/isabelle/pure/unify.ts +753 -0
- package/src/prover/isabelle/pure/variable.ts +25 -0
- package/src/prover/isabelle/tla/classical-setup.ts +101 -0
- package/src/prover/isabelle/tla/context.ts +74 -0
- package/src/prover/isabelle/tla/logic-data.ts +5 -0
- package/src/prover/isabelle/tla/logic.ts +215 -0
- package/src/prover/isabelle/tla/simpdata.ts +241 -0
- package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prover/ocaml.ts +22 -0
- package/src/prover/prep/action.ts +508 -0
- package/src/prover/prep/enabled-axioms.ts +189 -0
- package/src/prover/prep/fingerprint.ts +388 -0
- package/src/prover/prep/level-comparison.ts +529 -0
- package/src/prover/prep/md5.ts +60 -0
- package/src/prover/prep/methods.ts +221 -0
- package/src/prover/prep/normalize.ts +309 -0
- package/src/prover/prove-worker.ts +22 -0
- package/src/prover/prove.ts +492 -0
- package/src/prover/ptl/decide.ts +68 -0
- package/src/prover/ptl/encode.ts +244 -0
- package/src/prover/ptl/sat.ts +151 -0
- package/src/prover/ptl/tableau.ts +276 -0
- package/src/prover/smt/axioms.ts +209 -0
- package/src/prover/smt/context.ts +108 -0
- package/src/prover/smt/data.ts +636 -0
- package/src/prover/smt/encode.ts +275 -0
- package/src/prover/smt/extensionality.ts +65 -0
- package/src/prover/smt/flatten.ts +112 -0
- package/src/prover/smt/format.ts +154 -0
- package/src/prover/smt/instances.ts +181 -0
- package/src/prover/smt/rewrite.ts +766 -0
- package/src/prover/smt/solver/act-cache.ts +265 -0
- package/src/prover/smt/solver/arith-rewriter.ts +962 -0
- package/src/prover/smt/solver/array.ts +22 -0
- package/src/prover/smt/solver/asserted-formulas.ts +469 -0
- package/src/prover/smt/solver/ast-lt.ts +157 -0
- package/src/prover/smt/solver/ast-util.ts +91 -0
- package/src/prover/smt/solver/ast.ts +1315 -0
- package/src/prover/smt/solver/auf-solver.ts +572 -0
- package/src/prover/smt/solver/case-split-queue.ts +178 -0
- package/src/prover/smt/solver/cg-table.ts +175 -0
- package/src/prover/smt/solver/clause.ts +276 -0
- package/src/prover/smt/solver/conflict-resolution.ts +343 -0
- package/src/prover/smt/solver/context.ts +1292 -0
- package/src/prover/smt/solver/ctx-simplify.ts +334 -0
- package/src/prover/smt/solver/der.ts +224 -0
- package/src/prover/smt/solver/dyn-ack.ts +141 -0
- package/src/prover/smt/solver/e-matching.ts +659 -0
- package/src/prover/smt/solver/enode.ts +259 -0
- package/src/prover/smt/solver/expr-ref.ts +21 -0
- package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prover/smt/solver/fingerprints.ts +92 -0
- package/src/prover/smt/solver/flat-literals.ts +51 -0
- package/src/prover/smt/solver/goal.ts +138 -0
- package/src/prover/smt/solver/hash.ts +173 -0
- package/src/prover/smt/solver/hashtable.ts +166 -0
- package/src/prover/smt/solver/internalizer.ts +1381 -0
- package/src/prover/smt/solver/lbool.ts +5 -0
- package/src/prover/smt/solver/literal.ts +24 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prover/smt/solver/lp/constraints.ts +78 -0
- package/src/prover/smt/solver/lp/containers.ts +296 -0
- package/src/prover/smt/solver/lp/core-solver.ts +504 -0
- package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prover/smt/solver/lp/dependency.ts +51 -0
- package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prover/smt/solver/lp/explanation.ts +46 -0
- package/src/prover/smt/solver/lp/gomory.ts +255 -0
- package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prover/smt/solver/lp/hnf.ts +281 -0
- package/src/prover/smt/solver/lp/int-cube.ts +295 -0
- package/src/prover/smt/solver/lp/int-solver.ts +514 -0
- package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prover/smt/solver/lp/lar-term.ts +62 -0
- package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prover/smt/solver/lp/nex.ts +120 -0
- package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prover/smt/solver/lp/nla-core.ts +968 -0
- package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prover/smt/solver/lp/nla-order.ts +307 -0
- package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prover/smt/solver/lp/nla-types.ts +124 -0
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prover/smt/solver/lp/pdd.ts +971 -0
- package/src/prover/smt/solver/lp/random-updater.ts +138 -0
- package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prover/smt/solver/lp/union-find.ts +96 -0
- package/src/prover/smt/solver/mam-compiler.ts +847 -0
- package/src/prover/smt/solver/mam-interpreter.ts +400 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prover/smt/solver/model-checker.ts +347 -0
- package/src/prover/smt/solver/model-evaluator.ts +262 -0
- package/src/prover/smt/solver/model-finder.ts +155 -0
- package/src/prover/smt/solver/model-generator.ts +97 -0
- package/src/prover/smt/solver/model-macro-solver.ts +728 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prover/smt/solver/nlsat/explain.ts +607 -0
- package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prover/smt/solver/nlsat/solver.ts +911 -0
- package/src/prover/smt/solver/nlsat/types.ts +43 -0
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prover/smt/solver/nnf.ts +469 -0
- package/src/prover/smt/solver/pattern-inference.ts +351 -0
- package/src/prover/smt/solver/poly-rewriter.ts +477 -0
- package/src/prover/smt/solver/propagate-values.ts +83 -0
- package/src/prover/smt/solver/proto-model.ts +551 -0
- package/src/prover/smt/solver/pull-quant.ts +139 -0
- package/src/prover/smt/solver/qe-lite-der.ts +526 -0
- package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prover/smt/solver/qe-lite.ts +381 -0
- package/src/prover/smt/solver/qi-queue.ts +362 -0
- package/src/prover/smt/solver/quant-tactics.ts +117 -0
- package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prover/smt/solver/quantifier-manager.ts +186 -0
- package/src/prover/smt/solver/random-gen.ts +10 -0
- package/src/prover/smt/solver/rational.ts +165 -0
- package/src/prover/smt/solver/ref-vector.ts +62 -0
- package/src/prover/smt/solver/relevancy.ts +247 -0
- package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prover/smt/solver/rewriter.ts +843 -0
- package/src/prover/smt/solver/rlimit.ts +79 -0
- package/src/prover/smt/solver/smtlib-parser.ts +526 -0
- package/src/prover/smt/solver/solver.ts +71 -0
- package/src/prover/smt/solver/sort.ts +35 -0
- package/src/prover/smt/solver/sticky-generations.ts +69 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prover/smt/solver/theory-lra-model.ts +243 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prover/smt/solver/theory-lra-state.ts +43 -0
- package/src/prover/smt/solver/theory-lra.ts +56 -0
- package/src/prover/smt/solver/var-subst.ts +258 -0
- package/src/prover/smt/solver/z3-license.txt +10 -0
- package/src/prover/smt/table.ts +170 -0
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/prover/tlapm/tlapm.ts +96 -0
- package/src/prover/tlaps-module.ts +510 -0
- package/src/prover/verdict.ts +13 -0
- package/src/prover/zenon/LICENSE +32 -0
- package/src/prover/zenon/check/check.ts +105 -0
- package/src/prover/zenon/check/definitions.ts +144 -0
- package/src/prover/zenon/check/equality.ts +182 -0
- package/src/prover/zenon/check/functions.ts +62 -0
- package/src/prover/zenon/check/keys.ts +125 -0
- package/src/prover/zenon/check/propositional.ts +104 -0
- package/src/prover/zenon/check/records.ts +188 -0
- package/src/prover/zenon/check/relations.ts +121 -0
- package/src/prover/zenon/check/rewrites.ts +224 -0
- package/src/prover/zenon/check/sets.ts +302 -0
- package/src/prover/zenon/check/terms.ts +127 -0
- package/src/prover/zenon/check/tla.ts +126 -0
- package/src/prover/zenon/decide.ts +107 -0
- package/src/prover/zenon/encode.ts +378 -0
- package/src/prover/zenon/eqrel.ts +300 -0
- package/src/prover/zenon/equality-rules.ts +435 -0
- package/src/prover/zenon/expr.ts +551 -0
- package/src/prover/zenon/index-table.ts +350 -0
- package/src/prover/zenon/isar-case.ts +513 -0
- package/src/prover/zenon/isar.ts +1249 -0
- package/src/prover/zenon/limits.ts +15 -0
- package/src/prover/zenon/llproof.ts +173 -0
- package/src/prover/zenon/mltoll.ts +1566 -0
- package/src/prover/zenon/node.ts +297 -0
- package/src/prover/zenon/ocaml.ts +169 -0
- package/src/prover/zenon/parse.ts +247 -0
- package/src/prover/zenon/phrase.ts +191 -0
- package/src/prover/zenon/proof.ts +198 -0
- package/src/prover/zenon/propositional-rules.ts +387 -0
- package/src/prover/zenon/rules.ts +94 -0
- package/src/prover/zenon/search.ts +288 -0
- package/src/prover/zenon/tla/functions.ts +151 -0
- package/src/prover/zenon/tla/llproof.ts +480 -0
- package/src/prover/zenon/tla/records.ts +225 -0
- package/src/prover/zenon/tla/rewrites.ts +447 -0
- package/src/prover/zenon/tla/sets.ts +304 -0
- package/src/prover/zenon/tla/terms.ts +162 -0
- package/src/prover/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +39 -27
- package/src/resolve.ts +1474 -426
- package/src/runtime.ts +25 -7
- package/src/sany/builtins.ts +147 -0
- package/src/sany/generator.ts +3111 -0
- package/src/sany/levels.ts +1205 -0
- package/src/sany/lexer.ts +544 -0
- package/src/sany/linter.ts +122 -0
- package/src/sany/modules.ts +1398 -0
- package/src/sany/nodes.ts +463 -0
- package/src/sany/parse-error.ts +2161 -0
- package/src/sany/report.ts +355 -0
- package/src/sany/selectors.ts +736 -0
- package/src/sany/source.ts +247 -0
- package/src/sany/xml.ts +1016 -0
- package/src/search.ts +969 -0
- package/src/spec-description.ts +66 -29
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +215 -164
- package/src/state-graph.ts +181 -0
- package/src/subexpressions.ts +231 -171
- package/src/substitution-levels.ts +40 -19
- package/src/successors.ts +253 -125
- package/src/symmetry.ts +194 -54
- package/src/tableau.ts +60 -32
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-modules.ts → tlc/jar-data.ts} +4 -0
- package/src/tlc/messages.ts +441 -0
- package/src/{tlc-order.ts → tlc/order.ts} +84 -16
- package/src/{tlc-random.ts → tlc/random.ts} +30 -189
- package/src/tlc/replay.ts +659 -0
- package/src/{tlc-summary.ts → tlc/summary.ts} +20 -5
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +59 -50
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +63 -45
- package/src/tlc/version.ts +19 -0
- package/src/transfer.ts +44 -32
- package/src/values.ts +843 -241
- package/src/worker.ts +62 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -28
- package/dist/run-cli.js +0 -28
- package/src/canonical.ts +0 -39
- package/src/cli-options.ts +0 -58
- package/src/obligation-expression.ts +0 -1060
- package/src/obligation-module.ts +0 -1042
- package/src/run-cli.ts +0 -478
|
@@ -0,0 +1,1205 @@
|
|
|
1
|
+
import { ACTION_LEVEL, CONSTANT_LEVEL, TEMPORAL_LEVEL, VARIABLE_LEVEL } from "../levels";
|
|
2
|
+
import {
|
|
3
|
+
addSanyMessage,
|
|
4
|
+
CONSTANT_DECL_KIND,
|
|
5
|
+
VARIABLE_DECL_KIND,
|
|
6
|
+
formatSanyLocation,
|
|
7
|
+
getDeclarations,
|
|
8
|
+
getOpDefs,
|
|
9
|
+
getSymbolArity,
|
|
10
|
+
getThmOrAssumpDefs,
|
|
11
|
+
type ArgLevelConstraint,
|
|
12
|
+
type ArgLevelParam,
|
|
13
|
+
type ExprOrOpArgNode,
|
|
14
|
+
type FormalParamNode,
|
|
15
|
+
type InstanceNode,
|
|
16
|
+
type LevelFields,
|
|
17
|
+
type ModuleNode,
|
|
18
|
+
type OpApplNode,
|
|
19
|
+
type OpDeclNode,
|
|
20
|
+
type OpDefNode,
|
|
21
|
+
type ProofNode,
|
|
22
|
+
type SanyLocation,
|
|
23
|
+
type SanyMessage,
|
|
24
|
+
type SemanticNode,
|
|
25
|
+
type Subst,
|
|
26
|
+
type SymbolNode,
|
|
27
|
+
type ThmOrAssumpDefNode,
|
|
28
|
+
} from "./nodes";
|
|
29
|
+
|
|
30
|
+
// A port of the levelCheck methods of SANY's semantic nodes: the levels, weights and Leibniz flags
|
|
31
|
+
// its XMLExporter writes, and the level errors it reports. Each check returns what SANY's returns,
|
|
32
|
+
// which is whether the node is free of level errors, or true for the nodes that ignore that.
|
|
33
|
+
|
|
34
|
+
type AnyDefNode = OpDefNode | ThmOrAssumpDefNode;
|
|
35
|
+
|
|
36
|
+
interface LevelCheck {
|
|
37
|
+
messages: SanyMessage[];
|
|
38
|
+
isTlc174: boolean;
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
const addError = (check: LevelCheck, location: SanyLocation, text: string, code?: string) =>
|
|
42
|
+
addSanyMessage(check.messages, {
|
|
43
|
+
location,
|
|
44
|
+
text,
|
|
45
|
+
isWarning: false,
|
|
46
|
+
...(code !== undefined && !check.isTlc174 && { code }),
|
|
47
|
+
});
|
|
48
|
+
|
|
49
|
+
const addAll = <Item>(target: Set<Item>, source: Iterable<Item>) => {
|
|
50
|
+
for (const item of source) target.add(item);
|
|
51
|
+
};
|
|
52
|
+
|
|
53
|
+
const getArgLevelKey = (operator: SymbolNode, index: number, param: SymbolNode) =>
|
|
54
|
+
`${operator.id}:${index}:${param.id}`;
|
|
55
|
+
|
|
56
|
+
const addArgLevelParam = (
|
|
57
|
+
target: Map<string, ArgLevelParam>,
|
|
58
|
+
operator: SymbolNode,
|
|
59
|
+
index: number,
|
|
60
|
+
param: SymbolNode,
|
|
61
|
+
) => {
|
|
62
|
+
target.set(getArgLevelKey(operator, index, param), { op: operator, index, param });
|
|
63
|
+
};
|
|
64
|
+
|
|
65
|
+
const addArgLevelParams = (
|
|
66
|
+
target: Map<string, ArgLevelParam>,
|
|
67
|
+
source: Map<string, ArgLevelParam>,
|
|
68
|
+
isIncluded: (argLevelParam: ArgLevelParam) => boolean = () => true,
|
|
69
|
+
) => {
|
|
70
|
+
source.forEach((argLevelParam, key) => {
|
|
71
|
+
if (isIncluded(argLevelParam)) target.set(key, argLevelParam);
|
|
72
|
+
});
|
|
73
|
+
};
|
|
74
|
+
|
|
75
|
+
// SetOfLevelConstraints.put keeps the lowest bound.
|
|
76
|
+
const putLevelConstraint = (target: Map<SymbolNode, number>, param: SymbolNode, level: number) => {
|
|
77
|
+
target.set(param, Math.min(level, target.get(param) ?? TEMPORAL_LEVEL));
|
|
78
|
+
};
|
|
79
|
+
|
|
80
|
+
const putLevelConstraints = (
|
|
81
|
+
target: Map<SymbolNode, number>,
|
|
82
|
+
source: Map<SymbolNode, number>,
|
|
83
|
+
isIncluded: (param: SymbolNode) => boolean = () => true,
|
|
84
|
+
) => {
|
|
85
|
+
source.forEach((level, param) => {
|
|
86
|
+
if (isIncluded(param)) putLevelConstraint(target, param, level);
|
|
87
|
+
});
|
|
88
|
+
};
|
|
89
|
+
|
|
90
|
+
const getArgLevelConstraintKey = (param: SymbolNode, position: number) => `${param.id}:${position}`;
|
|
91
|
+
|
|
92
|
+
// SetOfArgLevelConstraints.put keeps the highest bound.
|
|
93
|
+
const putArgLevelConstraint = (
|
|
94
|
+
target: Map<string, ArgLevelConstraint>,
|
|
95
|
+
param: SymbolNode,
|
|
96
|
+
position: number,
|
|
97
|
+
level: number,
|
|
98
|
+
) => {
|
|
99
|
+
const key = getArgLevelConstraintKey(param, position);
|
|
100
|
+
const old = target.get(key)?.level ?? CONSTANT_LEVEL;
|
|
101
|
+
target.set(key, { param, position, level: Math.max(level, old) });
|
|
102
|
+
};
|
|
103
|
+
|
|
104
|
+
const putArgLevelConstraints = (
|
|
105
|
+
target: Map<string, ArgLevelConstraint>,
|
|
106
|
+
source: Map<string, ArgLevelConstraint>,
|
|
107
|
+
isIncluded: (constraint: ArgLevelConstraint) => boolean = () => true,
|
|
108
|
+
) => {
|
|
109
|
+
source.forEach((constraint) => {
|
|
110
|
+
if (isIncluded(constraint)) {
|
|
111
|
+
putArgLevelConstraint(target, constraint.param, constraint.position, constraint.level);
|
|
112
|
+
}
|
|
113
|
+
});
|
|
114
|
+
};
|
|
115
|
+
|
|
116
|
+
const shareLevels = (node: LevelFields, source: LevelFields) => {
|
|
117
|
+
node.levelParams = source.levelParams;
|
|
118
|
+
node.allParams = source.allParams;
|
|
119
|
+
node.levelConstraints = source.levelConstraints;
|
|
120
|
+
node.argLevelConstraints = source.argLevelConstraints;
|
|
121
|
+
node.argLevelParams = source.argLevelParams;
|
|
122
|
+
};
|
|
123
|
+
|
|
124
|
+
const mergeLevels = (node: LevelFields, part: LevelFields) => {
|
|
125
|
+
addAll(node.levelParams, part.levelParams);
|
|
126
|
+
addAll(node.allParams, part.allParams);
|
|
127
|
+
putLevelConstraints(node.levelConstraints, part.levelConstraints);
|
|
128
|
+
putArgLevelConstraints(node.argLevelConstraints, part.argLevelConstraints);
|
|
129
|
+
addArgLevelParams(node.argLevelParams, part.argLevelParams);
|
|
130
|
+
};
|
|
131
|
+
|
|
132
|
+
// ArgLevelParam.occur.
|
|
133
|
+
const isOccurring = (argLevelParam: ArgLevelParam, symbols: SymbolNode[]) =>
|
|
134
|
+
symbols.includes(argLevelParam.op) || symbols.includes(argLevelParam.param);
|
|
135
|
+
|
|
136
|
+
const isParam = (symbol: SymbolNode): symbol is FormalParamNode | OpDeclNode =>
|
|
137
|
+
symbol.kind === "OpDecl" || symbol.kind === "FormalParam";
|
|
138
|
+
|
|
139
|
+
const isLevelNode = (node: SemanticNode): node is Exclude<SemanticNode, ModuleNode> =>
|
|
140
|
+
node.kind !== "Module";
|
|
141
|
+
|
|
142
|
+
const isAnyDef = (symbol: SymbolNode): symbol is AnyDefNode =>
|
|
143
|
+
symbol.kind === "OpDef" || symbol.kind === "ThmOrAssumpDef";
|
|
144
|
+
|
|
145
|
+
const getIndex = (definition: AnyDefNode, index: number) =>
|
|
146
|
+
definition.kind === "OpDef" && definition.arity < 0 ? 0 : index;
|
|
147
|
+
|
|
148
|
+
const getWeight = (definition: AnyDefNode, index: number) =>
|
|
149
|
+
definition.kind === "OpDef" ? (definition.weights[getIndex(definition, index)] ?? 0) : 0;
|
|
150
|
+
|
|
151
|
+
const getMaxLevel = (definition: AnyDefNode, index: number) =>
|
|
152
|
+
definition.maxLevels[getIndex(definition, index)] ?? TEMPORAL_LEVEL;
|
|
153
|
+
|
|
154
|
+
const getMinMaxLevel = (definition: AnyDefNode, operand: number, position: number) =>
|
|
155
|
+
definition.minMaxLevel?.[operand]?.[position] ?? CONSTANT_LEVEL;
|
|
156
|
+
|
|
157
|
+
const isLeibnizArgument = (definition: AnyDefNode, index: number) =>
|
|
158
|
+
definition.kind === "OpDef"
|
|
159
|
+
? (definition.isLeibnizArg?.[getIndex(definition, index)] ?? true)
|
|
160
|
+
: (definition.isLeibnizArg[index] ?? true);
|
|
161
|
+
|
|
162
|
+
const getOpLevelCond = (definition: AnyDefNode, operand: number, other: number, index: number) =>
|
|
163
|
+
definition.opLevelCond?.[operand]?.[other]?.[index] ?? false;
|
|
164
|
+
|
|
165
|
+
const getBoundSymbols = (node: OpApplNode) => [
|
|
166
|
+
...(node.unbounded ?? []),
|
|
167
|
+
...(node.bounded ?? []).flat(),
|
|
168
|
+
];
|
|
169
|
+
|
|
170
|
+
const getSubstitute = (symbol: SymbolNode, substs: Subst[]) =>
|
|
171
|
+
substs.find((subst) => subst.op === symbol)?.expr;
|
|
172
|
+
|
|
173
|
+
// Subst.paramSet and Subst.allParamSet.
|
|
174
|
+
const getSubstitutedParams = (param: SymbolNode, substs: Subst[], isAll: boolean) => {
|
|
175
|
+
const substitute = getSubstitute(param, substs);
|
|
176
|
+
if (substitute === undefined) return new Set([param]);
|
|
177
|
+
return isAll ? substitute.allParams : substitute.levelParams;
|
|
178
|
+
};
|
|
179
|
+
|
|
180
|
+
// Subst.getSubALPSet.
|
|
181
|
+
const getSubstitutedArgLevelParams = (source: Map<string, ArgLevelParam>, substs: Subst[]) => {
|
|
182
|
+
const result = new Map<string, ArgLevelParam>();
|
|
183
|
+
source.forEach((argLevelParam, key) => {
|
|
184
|
+
const substitute = getSubstitute(argLevelParam.op, substs);
|
|
185
|
+
if (substitute === undefined) {
|
|
186
|
+
result.set(key, argLevelParam);
|
|
187
|
+
return;
|
|
188
|
+
}
|
|
189
|
+
if (substitute.kind !== "OpArg" || !isParam(substitute.op)) return;
|
|
190
|
+
const operator = substitute.op;
|
|
191
|
+
getSubstitutedParams(argLevelParam.param, substs, false).forEach((param) =>
|
|
192
|
+
addArgLevelParam(result, operator, argLevelParam.index, param),
|
|
193
|
+
);
|
|
194
|
+
});
|
|
195
|
+
return result;
|
|
196
|
+
};
|
|
197
|
+
|
|
198
|
+
interface ConstraintSource {
|
|
199
|
+
levelConstraints: Map<SymbolNode, number>;
|
|
200
|
+
argLevelConstraints: Map<string, ArgLevelConstraint>;
|
|
201
|
+
argLevelParams: Map<string, ArgLevelParam>;
|
|
202
|
+
}
|
|
203
|
+
|
|
204
|
+
// Subst.getSubLCSet.
|
|
205
|
+
const getSubstitutedLevelConstraints = (
|
|
206
|
+
body: ConstraintSource,
|
|
207
|
+
substs: Subst[],
|
|
208
|
+
isConstant: boolean,
|
|
209
|
+
iteration: number,
|
|
210
|
+
check: LevelCheck,
|
|
211
|
+
) => {
|
|
212
|
+
const result = new Map<SymbolNode, number>();
|
|
213
|
+
body.levelConstraints.forEach((bound, param) => {
|
|
214
|
+
const level =
|
|
215
|
+
isConstant || param.kind !== "OpDecl"
|
|
216
|
+
? bound
|
|
217
|
+
: param.declKind === CONSTANT_DECL_KIND
|
|
218
|
+
? CONSTANT_LEVEL
|
|
219
|
+
: param.declKind === VARIABLE_DECL_KIND
|
|
220
|
+
? VARIABLE_LEVEL
|
|
221
|
+
: bound;
|
|
222
|
+
getSubstitutedParams(param, substs, false).forEach((substituted) =>
|
|
223
|
+
putLevelConstraint(result, substituted, level),
|
|
224
|
+
);
|
|
225
|
+
});
|
|
226
|
+
body.argLevelParams.forEach((argLevelParam) => {
|
|
227
|
+
const substitute = getSubstitute(argLevelParam.op, substs);
|
|
228
|
+
if (substitute?.kind !== "OpArg" || substitute.op.kind !== "OpDef") return;
|
|
229
|
+
checkLevel(substitute.op, iteration, check);
|
|
230
|
+
const level = getMaxLevel(substitute.op, argLevelParam.index);
|
|
231
|
+
getSubstitutedParams(argLevelParam.param, substs, false).forEach((substituted) =>
|
|
232
|
+
putLevelConstraint(result, substituted, level),
|
|
233
|
+
);
|
|
234
|
+
});
|
|
235
|
+
return result;
|
|
236
|
+
};
|
|
237
|
+
|
|
238
|
+
// Subst.getSubALCSet.
|
|
239
|
+
const getSubstitutedArgLevelConstraints = (
|
|
240
|
+
body: ConstraintSource,
|
|
241
|
+
substs: Subst[],
|
|
242
|
+
iteration: number,
|
|
243
|
+
check: LevelCheck,
|
|
244
|
+
) => {
|
|
245
|
+
const result = new Map<string, ArgLevelConstraint>();
|
|
246
|
+
body.argLevelConstraints.forEach((constraint) => {
|
|
247
|
+
const substitute = getSubstitute(constraint.param, substs);
|
|
248
|
+
if (substitute === undefined) {
|
|
249
|
+
putArgLevelConstraint(result, constraint.param, constraint.position, constraint.level);
|
|
250
|
+
} else if (substitute.kind === "OpArg" && isParam(substitute.op)) {
|
|
251
|
+
putArgLevelConstraint(result, substitute.op, constraint.position, constraint.level);
|
|
252
|
+
}
|
|
253
|
+
});
|
|
254
|
+
body.argLevelParams.forEach((argLevelParam) => {
|
|
255
|
+
const paramSubstitute = getSubstitute(argLevelParam.param, substs);
|
|
256
|
+
if (paramSubstitute === undefined) return;
|
|
257
|
+
const operatorSubstitute = getSubstitute(argLevelParam.op, substs);
|
|
258
|
+
const operator =
|
|
259
|
+
operatorSubstitute === undefined
|
|
260
|
+
? argLevelParam.op
|
|
261
|
+
: operatorSubstitute.kind === "OpArg"
|
|
262
|
+
? operatorSubstitute.op
|
|
263
|
+
: undefined;
|
|
264
|
+
if (operator === undefined || !isParam(operator)) return;
|
|
265
|
+
checkLevel(paramSubstitute, iteration, check);
|
|
266
|
+
putArgLevelConstraint(result, operator, argLevelParam.index, paramSubstitute.level);
|
|
267
|
+
});
|
|
268
|
+
return result;
|
|
269
|
+
};
|
|
270
|
+
|
|
271
|
+
// ModuleNode.isConstant.
|
|
272
|
+
const isConstantModule = (module: ModuleNode, check: LevelCheck) => {
|
|
273
|
+
if (getDeclarations(module, VARIABLE_DECL_KIND).length > 0) return false;
|
|
274
|
+
checkModuleLevels(module, check);
|
|
275
|
+
if (getOpDefs(module).some((definition) => (definition.body?.level ?? 0) !== CONSTANT_LEVEL)) {
|
|
276
|
+
return false;
|
|
277
|
+
}
|
|
278
|
+
return module.topLevel.every((node) => node.kind !== "Theorem" || node.level === CONSTANT_LEVEL);
|
|
279
|
+
};
|
|
280
|
+
|
|
281
|
+
// The parts of OpDefNode.levelCheck and ThmOrAssumpDefNode.levelCheck that follow the body's.
|
|
282
|
+
const checkDefinitionBody = (node: AnyDefNode, params: FormalParamNode[], body: LevelFields) => {
|
|
283
|
+
node.minMaxLevel = params.map((param) =>
|
|
284
|
+
Array.from(
|
|
285
|
+
{ length: param.arity },
|
|
286
|
+
(_, position) =>
|
|
287
|
+
body.argLevelConstraints.get(getArgLevelConstraintKey(param, position))?.level ??
|
|
288
|
+
CONSTANT_LEVEL,
|
|
289
|
+
),
|
|
290
|
+
);
|
|
291
|
+
node.opLevelCond = params.map((param) =>
|
|
292
|
+
params.map((other) =>
|
|
293
|
+
Array.from({ length: param.arity }, (_, index) =>
|
|
294
|
+
body.argLevelParams.has(getArgLevelKey(param, index, other)),
|
|
295
|
+
),
|
|
296
|
+
),
|
|
297
|
+
);
|
|
298
|
+
addAll(node.levelParams, body.levelParams);
|
|
299
|
+
addAll(node.allParams, body.allParams);
|
|
300
|
+
addAll(node.nonLeibnizParams, body.nonLeibnizParams);
|
|
301
|
+
params.forEach((param, index) => {
|
|
302
|
+
node.levelParams.delete(param);
|
|
303
|
+
node.allParams.delete(param);
|
|
304
|
+
if (!node.nonLeibnizParams.has(param)) return;
|
|
305
|
+
node.nonLeibnizParams.delete(param);
|
|
306
|
+
if (node.isLeibnizArg) node.isLeibnizArg[index] = false;
|
|
307
|
+
node.isLeibniz = false;
|
|
308
|
+
});
|
|
309
|
+
node.levelConstraints = new Map(body.levelConstraints);
|
|
310
|
+
params.forEach((param) => node.levelConstraints.delete(param));
|
|
311
|
+
node.argLevelConstraints = new Map(body.argLevelConstraints);
|
|
312
|
+
params.forEach((param) => {
|
|
313
|
+
for (let position = 0; position < param.arity; position++) {
|
|
314
|
+
node.argLevelConstraints.delete(getArgLevelConstraintKey(param, position));
|
|
315
|
+
}
|
|
316
|
+
});
|
|
317
|
+
addArgLevelParams(
|
|
318
|
+
node.argLevelParams,
|
|
319
|
+
body.argLevelParams,
|
|
320
|
+
(argLevelParam) =>
|
|
321
|
+
!params.some((param) => param === argLevelParam.op) ||
|
|
322
|
+
!params.some((param) => param === argLevelParam.param),
|
|
323
|
+
);
|
|
324
|
+
};
|
|
325
|
+
|
|
326
|
+
// The checks of OpApplNode.levelCheck that compare the levels of the arguments of a defined
|
|
327
|
+
// operator with the levels it allows.
|
|
328
|
+
const checkArguments = (
|
|
329
|
+
node: OpApplNode,
|
|
330
|
+
operator: AnyDefNode,
|
|
331
|
+
isOperatorCorrect: boolean,
|
|
332
|
+
iteration: number,
|
|
333
|
+
check: LevelCheck,
|
|
334
|
+
) => {
|
|
335
|
+
node.operands.forEach((operand, index) => {
|
|
336
|
+
if (operand === undefined) return;
|
|
337
|
+
if (operand.level > getMaxLevel(operator, index)) {
|
|
338
|
+
if (isOperatorCorrect && checkLevel(operand, iteration, check)) {
|
|
339
|
+
addError(
|
|
340
|
+
check,
|
|
341
|
+
node.location,
|
|
342
|
+
`Level error in applying operator ${operator.name}:\nThe level of argument ${index + 1} exceeds the maximum level allowed by the operator.`,
|
|
343
|
+
);
|
|
344
|
+
}
|
|
345
|
+
node.levelCorrect = false;
|
|
346
|
+
}
|
|
347
|
+
if (operand.kind !== "OpArg" || !isAnyDef(operand.op)) return;
|
|
348
|
+
const argument = operand.op;
|
|
349
|
+
checkLevel(argument, iteration, check);
|
|
350
|
+
const arity = getSymbolArity(argument);
|
|
351
|
+
for (let position = 0; position < arity; position++) {
|
|
352
|
+
const minimum = getMinMaxLevel(operator, index, position);
|
|
353
|
+
if (getMaxLevel(argument, position) >= minimum) continue;
|
|
354
|
+
if (isOperatorCorrect && checkLevel(operand, iteration, check)) {
|
|
355
|
+
addError(
|
|
356
|
+
check,
|
|
357
|
+
node.location,
|
|
358
|
+
`Level error in applying operator ${operator.name}:\nThe permitted level of argument ${position + 1} of the operator argument ${index + 1} \nmust be at least ${minimum}.`,
|
|
359
|
+
);
|
|
360
|
+
}
|
|
361
|
+
node.levelCorrect = false;
|
|
362
|
+
}
|
|
363
|
+
node.operands.forEach((other, otherIndex) => {
|
|
364
|
+
for (let position = 0; position < arity; position++) {
|
|
365
|
+
if (
|
|
366
|
+
other === undefined ||
|
|
367
|
+
!getOpLevelCond(operator, index, otherIndex, position) ||
|
|
368
|
+
other.level <= getMaxLevel(argument, position)
|
|
369
|
+
) {
|
|
370
|
+
continue;
|
|
371
|
+
}
|
|
372
|
+
if (checkLevel(operand, iteration, check) && checkLevel(other, iteration, check)) {
|
|
373
|
+
addError(
|
|
374
|
+
check,
|
|
375
|
+
node.location,
|
|
376
|
+
`Level error in applying operator ${operator.name}:\nThe level of argument ${otherIndex + 1} exceeds the maximum level allowed by the operator.`,
|
|
377
|
+
"HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED",
|
|
378
|
+
);
|
|
379
|
+
}
|
|
380
|
+
node.levelCorrect = false;
|
|
381
|
+
}
|
|
382
|
+
});
|
|
383
|
+
});
|
|
384
|
+
node.ranges.forEach((range, index) => {
|
|
385
|
+
const isRangeCorrect = checkLevel(range, iteration, check);
|
|
386
|
+
if (range.level <= ACTION_LEVEL) return;
|
|
387
|
+
if (isRangeCorrect) {
|
|
388
|
+
addError(
|
|
389
|
+
check,
|
|
390
|
+
node.location,
|
|
391
|
+
`Level error in applying operator ${operator.name}:\nThe level of the range for the bounded variable ${formatSanyLocation(node.bounded?.[index]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`,
|
|
392
|
+
);
|
|
393
|
+
}
|
|
394
|
+
node.levelCorrect = false;
|
|
395
|
+
});
|
|
396
|
+
};
|
|
397
|
+
|
|
398
|
+
// The level constraints OpApplNode.levelCheck derives for an application of a defined operator.
|
|
399
|
+
const constrainArguments = (
|
|
400
|
+
node: OpApplNode,
|
|
401
|
+
operator: AnyDefNode,
|
|
402
|
+
boundSymbols: Set<SymbolNode>,
|
|
403
|
+
iteration: number,
|
|
404
|
+
check: LevelCheck,
|
|
405
|
+
) => {
|
|
406
|
+
const params = operator.params ?? [];
|
|
407
|
+
const getArgument = (symbol: SymbolNode) =>
|
|
408
|
+
node.operands.find((_, index) => params[index] === symbol);
|
|
409
|
+
putLevelConstraints(node.levelConstraints, operator.levelConstraints);
|
|
410
|
+
node.operands.forEach((operand) => {
|
|
411
|
+
if (operand === undefined) return;
|
|
412
|
+
putLevelConstraints(
|
|
413
|
+
node.levelConstraints,
|
|
414
|
+
operand.levelConstraints,
|
|
415
|
+
(param) => !boundSymbols.has(param),
|
|
416
|
+
);
|
|
417
|
+
});
|
|
418
|
+
node.ranges.forEach((range) =>
|
|
419
|
+
putLevelConstraints(node.levelConstraints, range.levelConstraints),
|
|
420
|
+
);
|
|
421
|
+
node.operands.forEach((operand, index) => {
|
|
422
|
+
const level = getMaxLevel(operator, index);
|
|
423
|
+
operand?.levelParams.forEach((param) =>
|
|
424
|
+
putLevelConstraint(node.levelConstraints, param, level),
|
|
425
|
+
);
|
|
426
|
+
});
|
|
427
|
+
node.operands.forEach((operand, index) => {
|
|
428
|
+
if (operand?.kind !== "OpArg" || !isAnyDef(operand.op)) return;
|
|
429
|
+
const argument = operand.op;
|
|
430
|
+
checkLevel(argument, iteration, check);
|
|
431
|
+
const arity = getSymbolArity(argument);
|
|
432
|
+
node.operands.forEach((other, otherIndex) => {
|
|
433
|
+
for (let position = 0; position < arity; position++) {
|
|
434
|
+
if (!getOpLevelCond(operator, index, otherIndex, position)) continue;
|
|
435
|
+
const level = getMaxLevel(argument, position);
|
|
436
|
+
other?.levelParams.forEach((param) =>
|
|
437
|
+
putLevelConstraint(node.levelConstraints, param, level),
|
|
438
|
+
);
|
|
439
|
+
if (!argument.isLeibniz && !isLeibnizArgument(argument, position) && other) {
|
|
440
|
+
addAll(node.nonLeibnizParams, other.allParams);
|
|
441
|
+
}
|
|
442
|
+
}
|
|
443
|
+
});
|
|
444
|
+
});
|
|
445
|
+
operator.argLevelParams.forEach((argLevelParam) => {
|
|
446
|
+
const argument = getArgument(argLevelParam.op);
|
|
447
|
+
if (argument?.kind !== "OpArg" || !isAnyDef(argument.op)) return;
|
|
448
|
+
checkLevel(argument.op, iteration, check);
|
|
449
|
+
putLevelConstraint(
|
|
450
|
+
node.levelConstraints,
|
|
451
|
+
argLevelParam.param,
|
|
452
|
+
getMaxLevel(argument.op, argLevelParam.index),
|
|
453
|
+
);
|
|
454
|
+
});
|
|
455
|
+
putArgLevelConstraints(node.argLevelConstraints, operator.argLevelConstraints);
|
|
456
|
+
node.operands.forEach((operand) => {
|
|
457
|
+
if (operand) putArgLevelConstraints(node.argLevelConstraints, operand.argLevelConstraints);
|
|
458
|
+
});
|
|
459
|
+
node.ranges.forEach((range) =>
|
|
460
|
+
putArgLevelConstraints(node.argLevelConstraints, range.argLevelConstraints),
|
|
461
|
+
);
|
|
462
|
+
node.operands.forEach((operand, index) => {
|
|
463
|
+
if (operand?.kind !== "OpArg" || !isParam(operand.op)) return;
|
|
464
|
+
const argument = operand.op;
|
|
465
|
+
for (let position = 0; position < argument.arity; position++) {
|
|
466
|
+
putArgLevelConstraint(
|
|
467
|
+
node.argLevelConstraints,
|
|
468
|
+
argument,
|
|
469
|
+
position,
|
|
470
|
+
getMinMaxLevel(operator, index, position),
|
|
471
|
+
);
|
|
472
|
+
}
|
|
473
|
+
node.operands.forEach((other, otherIndex) => {
|
|
474
|
+
for (let position = 0; position < argument.arity; position++) {
|
|
475
|
+
if (other === undefined || !getOpLevelCond(operator, index, otherIndex, position)) {
|
|
476
|
+
continue;
|
|
477
|
+
}
|
|
478
|
+
putArgLevelConstraint(node.argLevelConstraints, argument, position, other.level);
|
|
479
|
+
}
|
|
480
|
+
});
|
|
481
|
+
});
|
|
482
|
+
operator.argLevelParams.forEach((argLevelParam) => {
|
|
483
|
+
const argument = getArgument(argLevelParam.op);
|
|
484
|
+
if (argument === undefined) return;
|
|
485
|
+
checkLevel(argument, iteration, check);
|
|
486
|
+
putArgLevelConstraint(
|
|
487
|
+
node.argLevelConstraints,
|
|
488
|
+
argLevelParam.op,
|
|
489
|
+
argLevelParam.index,
|
|
490
|
+
argument.level,
|
|
491
|
+
);
|
|
492
|
+
});
|
|
493
|
+
node.operands.forEach((operand) => {
|
|
494
|
+
if (operand === undefined) return;
|
|
495
|
+
addArgLevelParams(
|
|
496
|
+
node.argLevelParams,
|
|
497
|
+
operand.argLevelParams,
|
|
498
|
+
(argLevelParam) => !boundSymbols.has(argLevelParam.param),
|
|
499
|
+
);
|
|
500
|
+
});
|
|
501
|
+
node.ranges.forEach((range) => addArgLevelParams(node.argLevelParams, range.argLevelParams));
|
|
502
|
+
operator.argLevelParams.forEach((argLevelParam, key) => {
|
|
503
|
+
const argument = getArgument(argLevelParam.op);
|
|
504
|
+
if (argument === undefined) {
|
|
505
|
+
const paramArgument = getArgument(argLevelParam.param);
|
|
506
|
+
if (paramArgument === undefined) node.argLevelParams.set(key, argLevelParam);
|
|
507
|
+
else {
|
|
508
|
+
checkLevel(paramArgument, iteration, check);
|
|
509
|
+
paramArgument.levelParams.forEach((param) =>
|
|
510
|
+
addArgLevelParam(node.argLevelParams, argLevelParam.op, argLevelParam.index, param),
|
|
511
|
+
);
|
|
512
|
+
}
|
|
513
|
+
return;
|
|
514
|
+
}
|
|
515
|
+
if (argument.kind === "OpArg" && isParam(argument.op)) {
|
|
516
|
+
addArgLevelParam(node.argLevelParams, argument.op, argLevelParam.index, argLevelParam.param);
|
|
517
|
+
}
|
|
518
|
+
});
|
|
519
|
+
node.operands.forEach((operand, index) => {
|
|
520
|
+
if (operand?.kind !== "OpArg" || !isParam(operand.op)) return;
|
|
521
|
+
const argument = operand.op;
|
|
522
|
+
node.operands.forEach((other, otherIndex) => {
|
|
523
|
+
for (let position = 0; position < argument.arity; position++) {
|
|
524
|
+
if (other === undefined || !getOpLevelCond(operator, index, otherIndex, position)) {
|
|
525
|
+
continue;
|
|
526
|
+
}
|
|
527
|
+
other.levelParams.forEach((param) =>
|
|
528
|
+
addArgLevelParam(node.argLevelParams, argument, position, param),
|
|
529
|
+
);
|
|
530
|
+
}
|
|
531
|
+
});
|
|
532
|
+
});
|
|
533
|
+
};
|
|
534
|
+
|
|
535
|
+
// The operators OpApplNode.levelCheck rejects with both temporal and action arguments, and how its
|
|
536
|
+
// message names them.
|
|
537
|
+
const LOGICAL_OPERATOR_NAMES = new Map([
|
|
538
|
+
["\\land", "\\land"],
|
|
539
|
+
["\\lor", "\\lor"],
|
|
540
|
+
["=>", "=>"],
|
|
541
|
+
["\\equiv", "\\equiv"],
|
|
542
|
+
["$ConjList", "Conjunction list"],
|
|
543
|
+
["$DisjList", "Disjunction list"],
|
|
544
|
+
]);
|
|
545
|
+
|
|
546
|
+
// The checks at the end of OpApplNode.levelCheck of the temporal operators and quantifiers. TLC
|
|
547
|
+
// 1.7.4's SANY reports these errors but leaves the node level-correct, so an operator applied to it
|
|
548
|
+
// still checks its level.
|
|
549
|
+
const checkTemporalApplication = (node: OpApplNode, check: LevelCheck) => {
|
|
550
|
+
const addTemporalError = (location: SanyLocation, text: string) => {
|
|
551
|
+
addError(check, location, text);
|
|
552
|
+
if (!check.isTlc174) node.levelCorrect = false;
|
|
553
|
+
};
|
|
554
|
+
const name = node.operator.name;
|
|
555
|
+
const first = node.operands[0];
|
|
556
|
+
if (
|
|
557
|
+
(name === "[]" || name === "<>") &&
|
|
558
|
+
first?.level === ACTION_LEVEL &&
|
|
559
|
+
first.kind === "OpAppl"
|
|
560
|
+
) {
|
|
561
|
+
const isBoxed = name === "[]";
|
|
562
|
+
if (first.operator.name !== (isBoxed ? "$SquareAct" : "$AngleAct")) {
|
|
563
|
+
addTemporalError(
|
|
564
|
+
node.location,
|
|
565
|
+
isBoxed
|
|
566
|
+
? "[] followed by action not of form [A]_v."
|
|
567
|
+
: "<> followed by action not of form <<A>>_v.",
|
|
568
|
+
);
|
|
569
|
+
}
|
|
570
|
+
}
|
|
571
|
+
if (
|
|
572
|
+
(name === "~>" || name === "-+->") &&
|
|
573
|
+
(first?.level === ACTION_LEVEL || node.operands[1]?.level === ACTION_LEVEL)
|
|
574
|
+
) {
|
|
575
|
+
addTemporalError(
|
|
576
|
+
node.location,
|
|
577
|
+
"Action used where only temporal formula or state predicate allowed.",
|
|
578
|
+
);
|
|
579
|
+
}
|
|
580
|
+
const logicalName = LOGICAL_OPERATOR_NAMES.get(name);
|
|
581
|
+
if (
|
|
582
|
+
logicalName !== undefined &&
|
|
583
|
+
node.operands.some((operand) => operand?.level === TEMPORAL_LEVEL) &&
|
|
584
|
+
node.operands.some((operand) => operand?.level === ACTION_LEVEL)
|
|
585
|
+
) {
|
|
586
|
+
addTemporalError(
|
|
587
|
+
node.location,
|
|
588
|
+
`${logicalName} has both temporal formula and action as arguments.`,
|
|
589
|
+
);
|
|
590
|
+
}
|
|
591
|
+
if (node.level === TEMPORAL_LEVEL && (name === "$BoundedExists" || name === "$BoundedForall")) {
|
|
592
|
+
node.ranges.forEach((range) => {
|
|
593
|
+
if (range.level === ACTION_LEVEL) {
|
|
594
|
+
addTemporalError(range.location, "Action-level bound of quantified temporal formula.");
|
|
595
|
+
}
|
|
596
|
+
});
|
|
597
|
+
}
|
|
598
|
+
};
|
|
599
|
+
|
|
600
|
+
const checkApplication = (node: OpApplNode, iteration: number, check: LevelCheck) => {
|
|
601
|
+
if (node.levelChecked >= iteration) return node.levelCorrect;
|
|
602
|
+
node.levelChecked = iteration;
|
|
603
|
+
node.levelCorrect = true;
|
|
604
|
+
const operands = node.operands.filter(
|
|
605
|
+
(operand): operand is ExprOrOpArgNode => operand !== undefined,
|
|
606
|
+
);
|
|
607
|
+
operands.forEach((operand) => {
|
|
608
|
+
if (!checkLevel(operand, iteration, check)) node.levelCorrect = false;
|
|
609
|
+
});
|
|
610
|
+
node.ranges.forEach((range) => {
|
|
611
|
+
if (!checkLevel(range, iteration, check)) node.levelCorrect = false;
|
|
612
|
+
});
|
|
613
|
+
const operator = node.operator;
|
|
614
|
+
if (isAnyDef(operator)) {
|
|
615
|
+
const isOperatorCorrect = checkLevel(operator, iteration, check);
|
|
616
|
+
checkArguments(node, operator, isOperatorCorrect, iteration, check);
|
|
617
|
+
node.level = node.operands.reduce(
|
|
618
|
+
(level, operand, index) =>
|
|
619
|
+
operand !== undefined && getWeight(operator, index) === 1
|
|
620
|
+
? Math.max(level, operand.level)
|
|
621
|
+
: level,
|
|
622
|
+
operator.level,
|
|
623
|
+
);
|
|
624
|
+
node.ranges.forEach((range) => {
|
|
625
|
+
node.level = Math.max(node.level, range.level);
|
|
626
|
+
});
|
|
627
|
+
addAll(node.levelParams, operator.levelParams);
|
|
628
|
+
addAll(node.allParams, operator.allParams);
|
|
629
|
+
addAll(node.nonLeibnizParams, operator.nonLeibnizParams);
|
|
630
|
+
node.operands.forEach((operand, index) => {
|
|
631
|
+
if (operand === undefined) return;
|
|
632
|
+
if (getWeight(operator, index) === 1) addAll(node.levelParams, operand.levelParams);
|
|
633
|
+
addAll(node.allParams, operand.allParams);
|
|
634
|
+
addAll(node.nonLeibnizParams, operand.nonLeibnizParams);
|
|
635
|
+
if (!isLeibnizArgument(operator, index)) addAll(node.nonLeibnizParams, operand.allParams);
|
|
636
|
+
});
|
|
637
|
+
node.ranges.forEach((range) => {
|
|
638
|
+
addAll(node.levelParams, range.levelParams);
|
|
639
|
+
addAll(node.allParams, range.allParams);
|
|
640
|
+
addAll(node.nonLeibnizParams, range.nonLeibnizParams);
|
|
641
|
+
});
|
|
642
|
+
const boundSymbols = new Set<SymbolNode>(getBoundSymbols(node));
|
|
643
|
+
boundSymbols.forEach((symbol) => {
|
|
644
|
+
node.levelParams.delete(symbol);
|
|
645
|
+
node.allParams.delete(symbol);
|
|
646
|
+
node.nonLeibnizParams.delete(symbol);
|
|
647
|
+
});
|
|
648
|
+
constrainArguments(node, operator, boundSymbols, iteration, check);
|
|
649
|
+
} else {
|
|
650
|
+
checkLevel(operator, iteration, check);
|
|
651
|
+
node.level = operands.reduce(
|
|
652
|
+
(level, operand) => Math.max(level, operand.level),
|
|
653
|
+
operator.kind === "Module" ? 0 : operator.level,
|
|
654
|
+
);
|
|
655
|
+
node.levelParams = new Set([operator]);
|
|
656
|
+
node.allParams.add(operator);
|
|
657
|
+
operands.forEach((operand, index) => {
|
|
658
|
+
addAll(node.levelParams, operand.levelParams);
|
|
659
|
+
addAll(node.allParams, operand.allParams);
|
|
660
|
+
addAll(node.nonLeibnizParams, operand.nonLeibnizParams);
|
|
661
|
+
putLevelConstraints(node.levelConstraints, operand.levelConstraints);
|
|
662
|
+
putArgLevelConstraint(node.argLevelConstraints, operator, index, operand.level);
|
|
663
|
+
putArgLevelConstraints(node.argLevelConstraints, operand.argLevelConstraints);
|
|
664
|
+
operand.levelParams.forEach((param) =>
|
|
665
|
+
addArgLevelParam(node.argLevelParams, operator, index, param),
|
|
666
|
+
);
|
|
667
|
+
addArgLevelParams(node.argLevelParams, operand.argLevelParams);
|
|
668
|
+
});
|
|
669
|
+
}
|
|
670
|
+
checkTemporalApplication(node, check);
|
|
671
|
+
return node.levelCorrect;
|
|
672
|
+
};
|
|
673
|
+
|
|
674
|
+
const checkDefinition = (node: OpDefNode, iteration: number, check: LevelCheck) => {
|
|
675
|
+
if (node.levelChecked >= iteration || (!node.inRecursiveSection && node.levelChecked > 0)) {
|
|
676
|
+
return node.levelCorrect;
|
|
677
|
+
}
|
|
678
|
+
node.levelChecked = iteration;
|
|
679
|
+
const body = node.body;
|
|
680
|
+
if (body === undefined) {
|
|
681
|
+
node.levelCorrect = node.step === undefined || checkLevel(node.step, iteration, check);
|
|
682
|
+
return node.levelCorrect;
|
|
683
|
+
}
|
|
684
|
+
node.levelCorrect = checkLevel(body, iteration, check);
|
|
685
|
+
node.level = Math.max(node.level, body.level);
|
|
686
|
+
const params = node.params ?? [];
|
|
687
|
+
params.forEach((param, index) => {
|
|
688
|
+
const bound = body.levelConstraints.get(param);
|
|
689
|
+
if (bound !== undefined) node.maxLevels[index] = Math.min(node.maxLevels[index], bound);
|
|
690
|
+
if (body.levelParams.has(param)) node.weights[index] = Math.max(node.weights[index], 1);
|
|
691
|
+
});
|
|
692
|
+
checkDefinitionBody(node, params, body);
|
|
693
|
+
return node.levelCorrect;
|
|
694
|
+
};
|
|
695
|
+
|
|
696
|
+
const checkTheoremDefinition = (node: ThmOrAssumpDefNode, iteration: number, check: LevelCheck) => {
|
|
697
|
+
if (node.levelChecked >= iteration) return node.levelCorrect;
|
|
698
|
+
node.levelChecked = iteration;
|
|
699
|
+
node.maxLevels = node.params.map(() => TEMPORAL_LEVEL);
|
|
700
|
+
// SANY allocates isLeibnizArg anew for each parameter, so only the last one starts out Leibniz.
|
|
701
|
+
node.isLeibnizArg = node.params.map((_, index) => index === node.params.length - 1);
|
|
702
|
+
if (node.params.length > 0) node.isLeibniz = true;
|
|
703
|
+
node.levelCorrect = checkLevel(node.body, iteration, check);
|
|
704
|
+
node.level = node.body.level;
|
|
705
|
+
node.params.forEach((param, index) => {
|
|
706
|
+
const bound = node.body.levelConstraints.get(param);
|
|
707
|
+
if (bound !== undefined) node.maxLevels[index] = bound;
|
|
708
|
+
});
|
|
709
|
+
checkDefinitionBody(node, node.params, node.body);
|
|
710
|
+
return node.levelCorrect;
|
|
711
|
+
};
|
|
712
|
+
|
|
713
|
+
// ModuleNode.levelCheck: the definitions of each recursive section are checked twice, the second
|
|
714
|
+
// time with the highest level and the parameters of the section's recursive operators.
|
|
715
|
+
export const checkModuleLevels = (module: ModuleNode, check: LevelCheck) => {
|
|
716
|
+
if (module.isLevelChecked) return module.levelCorrect;
|
|
717
|
+
module.isLevelChecked = true;
|
|
718
|
+
const sections = module.opDefsInRecursiveSection;
|
|
719
|
+
let first = 0;
|
|
720
|
+
while (first < sections.length) {
|
|
721
|
+
const section = sections[first].recursiveSection;
|
|
722
|
+
let end = first;
|
|
723
|
+
while (end < sections.length && sections[end].recursiveSection === section) {
|
|
724
|
+
const definition = sections[end];
|
|
725
|
+
if (definition.inRecursive) {
|
|
726
|
+
definition.levelChecked = 1;
|
|
727
|
+
definition.maxLevels = definition.maxLevels.map(() => ACTION_LEVEL);
|
|
728
|
+
definition.weights = definition.weights.map(() => 1);
|
|
729
|
+
} else definition.levelChecked = 0;
|
|
730
|
+
end++;
|
|
731
|
+
}
|
|
732
|
+
const members = sections.slice(first, end);
|
|
733
|
+
const levelParams = new Set<SymbolNode>();
|
|
734
|
+
const allParams = new Set<SymbolNode>();
|
|
735
|
+
let maxLevel = 0;
|
|
736
|
+
members.forEach((definition) => {
|
|
737
|
+
if (definition.inRecursive) definition.levelChecked = 0;
|
|
738
|
+
checkDefinition(definition, 1, check);
|
|
739
|
+
if (!definition.inRecursive) return;
|
|
740
|
+
definition.maxLevels.forEach((level, index) => {
|
|
741
|
+
if (level >= ACTION_LEVEL) return;
|
|
742
|
+
addError(
|
|
743
|
+
check,
|
|
744
|
+
definition.location,
|
|
745
|
+
`Argument ${index + 1} of recursive operator ${definition.name} is primed`,
|
|
746
|
+
);
|
|
747
|
+
});
|
|
748
|
+
maxLevel = Math.max(maxLevel, definition.level);
|
|
749
|
+
addAll(levelParams, definition.levelParams);
|
|
750
|
+
addAll(allParams, definition.allParams);
|
|
751
|
+
});
|
|
752
|
+
members.forEach((definition) => {
|
|
753
|
+
if (definition.inRecursive) definition.levelChecked = 2;
|
|
754
|
+
definition.level = Math.max(definition.level, maxLevel);
|
|
755
|
+
addAll(definition.levelParams, levelParams);
|
|
756
|
+
addAll(definition.allParams, allParams);
|
|
757
|
+
});
|
|
758
|
+
members.forEach((definition) => {
|
|
759
|
+
if (definition.inRecursive) definition.levelChecked = 1;
|
|
760
|
+
checkDefinition(definition, 2, check);
|
|
761
|
+
});
|
|
762
|
+
first = end;
|
|
763
|
+
}
|
|
764
|
+
module.levelCorrect = true;
|
|
765
|
+
const recordCorrectness = (isNodeCorrect: boolean) => {
|
|
766
|
+
if (!isNodeCorrect) module.levelCorrect = false;
|
|
767
|
+
};
|
|
768
|
+
module.definitions
|
|
769
|
+
.filter((definition): definition is ModuleNode => definition.kind === "Module")
|
|
770
|
+
.forEach((inner) => recordCorrectness(checkModuleLevels(inner, check)));
|
|
771
|
+
const definitions = getOpDefs(module);
|
|
772
|
+
definitions.forEach((definition) => recordCorrectness(checkDefinition(definition, 1, check)));
|
|
773
|
+
getThmOrAssumpDefs(module).forEach((definition) =>
|
|
774
|
+
recordCorrectness(checkTheoremDefinition(definition, 1, check)),
|
|
775
|
+
);
|
|
776
|
+
module.topLevel.forEach((node) => recordCorrectness(checkLevel(node, 1, check)));
|
|
777
|
+
if (!isConstantModule(module, check)) {
|
|
778
|
+
getDeclarations(module, CONSTANT_DECL_KIND).forEach((declaration) =>
|
|
779
|
+
putLevelConstraint(module.levelConstraints, declaration, CONSTANT_LEVEL),
|
|
780
|
+
);
|
|
781
|
+
}
|
|
782
|
+
definitions.forEach((definition) => {
|
|
783
|
+
putLevelConstraints(module.levelConstraints, definition.levelConstraints);
|
|
784
|
+
putArgLevelConstraints(module.argLevelConstraints, definition.argLevelConstraints);
|
|
785
|
+
addArgLevelParams(
|
|
786
|
+
module.argLevelParams,
|
|
787
|
+
definition.argLevelParams,
|
|
788
|
+
(argLevelParam) => !isOccurring(argLevelParam, definition.params ?? []),
|
|
789
|
+
);
|
|
790
|
+
});
|
|
791
|
+
module.topLevel.forEach((node) => {
|
|
792
|
+
putLevelConstraints(module.levelConstraints, node.levelConstraints);
|
|
793
|
+
putArgLevelConstraints(module.argLevelConstraints, node.argLevelConstraints);
|
|
794
|
+
addArgLevelParams(module.argLevelParams, node.argLevelParams);
|
|
795
|
+
});
|
|
796
|
+
return module.levelCorrect;
|
|
797
|
+
};
|
|
798
|
+
|
|
799
|
+
// LevelNode.levelCheckSubnodes, which skips modules.
|
|
800
|
+
const checkSubnodes = (
|
|
801
|
+
node: LevelFields,
|
|
802
|
+
subnodes: SemanticNode[],
|
|
803
|
+
iteration: number,
|
|
804
|
+
check: LevelCheck,
|
|
805
|
+
) => {
|
|
806
|
+
if (node.levelChecked >= iteration) return node.levelCorrect;
|
|
807
|
+
node.levelChecked = iteration;
|
|
808
|
+
subnodes.forEach((subnode) => {
|
|
809
|
+
if (!isLevelNode(subnode)) return;
|
|
810
|
+
if (subnode.kind === "OpDef" && subnode.defKind === "ModuleInstance") return;
|
|
811
|
+
node.levelCorrect = checkLevel(subnode, iteration, check) && node.levelCorrect;
|
|
812
|
+
node.level = Math.max(node.level, subnode.level);
|
|
813
|
+
mergeLevels(node, subnode);
|
|
814
|
+
addAll(node.nonLeibnizParams, subnode.nonLeibnizParams);
|
|
815
|
+
});
|
|
816
|
+
return node.levelCorrect;
|
|
817
|
+
};
|
|
818
|
+
|
|
819
|
+
// TheoremNode.LevelCheckTemporal: the steps of the proof of a temporal theorem that must be
|
|
820
|
+
// constant.
|
|
821
|
+
const checkTemporalProof = (proof: ProofNode | undefined, check: LevelCheck) => {
|
|
822
|
+
if (proof?.kind !== "NonLeafProof") return;
|
|
823
|
+
proof.steps.forEach((step) => {
|
|
824
|
+
if (step.kind !== "Theorem" || step.body.kind !== "OpAppl") return;
|
|
825
|
+
const name = step.body.operator.name;
|
|
826
|
+
if (name === "$Take" || name === "$Witness" || name === "$Have") {
|
|
827
|
+
if (step.body.level !== CONSTANT_LEVEL) {
|
|
828
|
+
addError(
|
|
829
|
+
check,
|
|
830
|
+
step.body.location,
|
|
831
|
+
"Non-constant TAKE, WITNESS, or HAVE for temporal goal.",
|
|
832
|
+
);
|
|
833
|
+
}
|
|
834
|
+
} else if (name === "$Pfcase") {
|
|
835
|
+
if (step.body.level !== CONSTANT_LEVEL) {
|
|
836
|
+
addError(check, step.body.location, "Non-constant CASE for temporal goal.");
|
|
837
|
+
}
|
|
838
|
+
checkTemporalProof(step.proof, check);
|
|
839
|
+
} else if (name === "$Qed") checkTemporalProof(step.proof, check);
|
|
840
|
+
});
|
|
841
|
+
};
|
|
842
|
+
|
|
843
|
+
// InstanceNode.levelCheck.
|
|
844
|
+
const checkInstance = (node: InstanceNode, iteration: number, check: LevelCheck) => {
|
|
845
|
+
if (node.levelChecked >= iteration) return node.levelCorrect;
|
|
846
|
+
node.levelChecked = iteration;
|
|
847
|
+
node.levelParams = new Set();
|
|
848
|
+
node.levelCorrect = true;
|
|
849
|
+
const module = node.module;
|
|
850
|
+
if (!checkModuleLevels(module, check)) node.levelCorrect = false;
|
|
851
|
+
node.substs.forEach((subst) => {
|
|
852
|
+
if (!checkLevel(subst.expr, iteration, check)) node.levelCorrect = false;
|
|
853
|
+
});
|
|
854
|
+
const isConstant = isConstantModule(module, check);
|
|
855
|
+
node.substs.forEach((subst) => {
|
|
856
|
+
if (!isConstant && subst.expr.level > subst.op.level) {
|
|
857
|
+
if (checkLevel(subst.expr, iteration, check)) {
|
|
858
|
+
addError(
|
|
859
|
+
check,
|
|
860
|
+
node.location,
|
|
861
|
+
`Level error in instantiating module '${module.name}':\nThe level of the expression or operator substituted for '${subst.op.name}' \nmust be at most ${subst.op.level}.`,
|
|
862
|
+
);
|
|
863
|
+
}
|
|
864
|
+
node.levelCorrect = false;
|
|
865
|
+
}
|
|
866
|
+
if (
|
|
867
|
+
subst.expr.kind === "OpArg" &&
|
|
868
|
+
subst.expr.op.kind === "OpDef" &&
|
|
869
|
+
(subst.expr.op.defKind === "UserDefined" || subst.expr.op.defKind === "BuiltIn") &&
|
|
870
|
+
!subst.expr.op.isLeibniz
|
|
871
|
+
) {
|
|
872
|
+
addError(
|
|
873
|
+
check,
|
|
874
|
+
node.location,
|
|
875
|
+
`Error in instantiating module '${module.name}':\n A non-Leibniz operator substituted for '${subst.op.name}'.`,
|
|
876
|
+
);
|
|
877
|
+
}
|
|
878
|
+
});
|
|
879
|
+
node.substs.forEach((subst) => {
|
|
880
|
+
const bound = module.levelConstraints.get(subst.op);
|
|
881
|
+
if (bound !== undefined && subst.expr.level > bound) {
|
|
882
|
+
if (checkLevel(subst.expr, iteration, check)) {
|
|
883
|
+
addError(
|
|
884
|
+
check,
|
|
885
|
+
node.location,
|
|
886
|
+
`Level error in instantiating module '${module.name}':\nThe level of the expression or operator substituted for '${subst.op.name}' \nmust be at most ${bound}.`,
|
|
887
|
+
);
|
|
888
|
+
}
|
|
889
|
+
node.levelCorrect = false;
|
|
890
|
+
}
|
|
891
|
+
if (subst.op.arity <= 0 || subst.expr.kind !== "OpArg" || subst.expr.op.kind !== "OpDef")
|
|
892
|
+
return;
|
|
893
|
+
const definition = subst.expr.op;
|
|
894
|
+
const isDefinitionCorrect = checkLevel(definition, iteration, check);
|
|
895
|
+
for (let position = 0; position < subst.op.arity; position++) {
|
|
896
|
+
const minimum = module.argLevelConstraints.get(
|
|
897
|
+
getArgLevelConstraintKey(subst.op, position),
|
|
898
|
+
)?.level;
|
|
899
|
+
if (minimum === undefined || getMaxLevel(definition, position) >= minimum) continue;
|
|
900
|
+
if (isDefinitionCorrect) {
|
|
901
|
+
addError(
|
|
902
|
+
check,
|
|
903
|
+
node.location,
|
|
904
|
+
`Level error in instantiating module '${module.name}':\nThe level of the argument ${position + 1} of the operator ${definition.name} \nmust be at least ${minimum}.`,
|
|
905
|
+
);
|
|
906
|
+
}
|
|
907
|
+
node.levelCorrect = false;
|
|
908
|
+
}
|
|
909
|
+
});
|
|
910
|
+
module.argLevelParams.forEach((argLevelParam) => {
|
|
911
|
+
node.substs.forEach((opSubst) => {
|
|
912
|
+
node.substs.forEach((paramSubst) => {
|
|
913
|
+
if (argLevelParam.op !== opSubst.op || argLevelParam.param !== paramSubst.op) return;
|
|
914
|
+
if (opSubst.expr.kind !== "OpArg") return;
|
|
915
|
+
const operator = opSubst.expr.op;
|
|
916
|
+
const isOperatorCorrect = checkLevel(operator, iteration, check);
|
|
917
|
+
if (operator.kind !== "OpDef") return;
|
|
918
|
+
const maximum = getMaxLevel(operator, argLevelParam.index);
|
|
919
|
+
if (paramSubst.expr.level <= maximum) return;
|
|
920
|
+
if (isOperatorCorrect && checkLevel(paramSubst.expr, iteration, check)) {
|
|
921
|
+
addError(
|
|
922
|
+
check,
|
|
923
|
+
node.location,
|
|
924
|
+
`Level error when instantiating module '${module.name}':\nThe level of the argument ${argLevelParam.index} of the operator ${opSubst.op.name}' \nmust be at most ${maximum}.`,
|
|
925
|
+
);
|
|
926
|
+
}
|
|
927
|
+
node.levelCorrect = false;
|
|
928
|
+
});
|
|
929
|
+
});
|
|
930
|
+
});
|
|
931
|
+
const isOutside = (symbol: SymbolNode) => !node.params.some((param) => param === symbol);
|
|
932
|
+
putLevelConstraints(
|
|
933
|
+
node.levelConstraints,
|
|
934
|
+
getSubstitutedLevelConstraints(module, node.substs, isConstant, iteration, check),
|
|
935
|
+
isOutside,
|
|
936
|
+
);
|
|
937
|
+
node.substs.forEach((subst) =>
|
|
938
|
+
putLevelConstraints(node.levelConstraints, subst.expr.levelConstraints, isOutside),
|
|
939
|
+
);
|
|
940
|
+
putArgLevelConstraints(
|
|
941
|
+
node.argLevelConstraints,
|
|
942
|
+
getSubstitutedArgLevelConstraints(module, node.substs, iteration, check),
|
|
943
|
+
(constraint) => isOutside(constraint.param),
|
|
944
|
+
);
|
|
945
|
+
node.substs.forEach((subst) =>
|
|
946
|
+
putArgLevelConstraints(node.argLevelConstraints, subst.expr.argLevelConstraints, (constraint) =>
|
|
947
|
+
isOutside(constraint.param),
|
|
948
|
+
),
|
|
949
|
+
);
|
|
950
|
+
addArgLevelParams(
|
|
951
|
+
node.argLevelParams,
|
|
952
|
+
getSubstitutedArgLevelParams(module.argLevelParams, node.substs),
|
|
953
|
+
(argLevelParam) => !isOccurring(argLevelParam, node.params),
|
|
954
|
+
);
|
|
955
|
+
node.substs.forEach((subst) =>
|
|
956
|
+
addArgLevelParams(
|
|
957
|
+
node.argLevelParams,
|
|
958
|
+
subst.expr.argLevelParams,
|
|
959
|
+
(argLevelParam) => !isOccurring(argLevelParam, node.params),
|
|
960
|
+
),
|
|
961
|
+
);
|
|
962
|
+
return node.levelCorrect;
|
|
963
|
+
};
|
|
964
|
+
|
|
965
|
+
const checkLevel = (node: SemanticNode, iteration: number, check: LevelCheck): boolean => {
|
|
966
|
+
if (!isLevelNode(node)) return checkModuleLevels(node, check);
|
|
967
|
+
switch (node.kind) {
|
|
968
|
+
case "OpAppl":
|
|
969
|
+
return checkApplication(node, iteration, check);
|
|
970
|
+
case "OpDef":
|
|
971
|
+
return checkDefinition(node, iteration, check);
|
|
972
|
+
case "ThmOrAssumpDef":
|
|
973
|
+
return checkTheoremDefinition(node, iteration, check);
|
|
974
|
+
case "FormalParam":
|
|
975
|
+
if (node.levelChecked !== 0) return true;
|
|
976
|
+
node.levelChecked = iteration;
|
|
977
|
+
node.levelParams.add(node);
|
|
978
|
+
node.allParams.add(node);
|
|
979
|
+
return true;
|
|
980
|
+
case "OpDecl":
|
|
981
|
+
return true;
|
|
982
|
+
case "Numeral":
|
|
983
|
+
case "String":
|
|
984
|
+
case "Decimal":
|
|
985
|
+
if (node.levelChecked < iteration) node.levelChecked = iteration;
|
|
986
|
+
return true;
|
|
987
|
+
case "OpArg": {
|
|
988
|
+
if (node.levelChecked >= iteration) return node.levelCorrect;
|
|
989
|
+
node.levelChecked = iteration;
|
|
990
|
+
const operator = node.op;
|
|
991
|
+
node.levelCorrect = checkLevel(operator, iteration, check);
|
|
992
|
+
if (operator.kind === "Module") return node.levelCorrect;
|
|
993
|
+
node.level = operator.level;
|
|
994
|
+
shareLevels(node, operator);
|
|
995
|
+
return node.levelCorrect;
|
|
996
|
+
}
|
|
997
|
+
case "LetIn": {
|
|
998
|
+
if (node.levelChecked >= iteration) return node.levelCorrect;
|
|
999
|
+
node.levelChecked = iteration;
|
|
1000
|
+
node.levelCorrect = true;
|
|
1001
|
+
const definitions = node.opDefs.filter(
|
|
1002
|
+
(definition) => definition.kind !== "OpDef" || definition.defKind !== "ModuleInstance",
|
|
1003
|
+
);
|
|
1004
|
+
definitions.forEach((definition) => {
|
|
1005
|
+
if (!checkLevel(definition, iteration, check)) node.levelCorrect = false;
|
|
1006
|
+
});
|
|
1007
|
+
if (!checkLevel(node.body, iteration, check)) node.levelCorrect = false;
|
|
1008
|
+
node.instances.forEach((instance) => {
|
|
1009
|
+
if (!checkLevel(instance, iteration, check)) node.levelCorrect = false;
|
|
1010
|
+
});
|
|
1011
|
+
node.level = node.body.level;
|
|
1012
|
+
node.levelParams = new Set(node.body.levelParams);
|
|
1013
|
+
node.allParams = new Set(node.body.allParams);
|
|
1014
|
+
putLevelConstraints(node.levelConstraints, node.body.levelConstraints);
|
|
1015
|
+
definitions.forEach((definition) =>
|
|
1016
|
+
putLevelConstraints(node.levelConstraints, definition.levelConstraints),
|
|
1017
|
+
);
|
|
1018
|
+
putArgLevelConstraints(node.argLevelConstraints, node.body.argLevelConstraints);
|
|
1019
|
+
definitions.forEach((definition) =>
|
|
1020
|
+
putArgLevelConstraints(node.argLevelConstraints, definition.argLevelConstraints),
|
|
1021
|
+
);
|
|
1022
|
+
addArgLevelParams(node.argLevelParams, node.body.argLevelParams);
|
|
1023
|
+
definitions.forEach((definition) => {
|
|
1024
|
+
const params = definition.kind === "OpDef" ? (definition.params ?? []) : [];
|
|
1025
|
+
addArgLevelParams(
|
|
1026
|
+
node.argLevelParams,
|
|
1027
|
+
definition.argLevelParams,
|
|
1028
|
+
(argLevelParam) => !isOccurring(argLevelParam, params),
|
|
1029
|
+
);
|
|
1030
|
+
});
|
|
1031
|
+
node.instances.forEach((instance) =>
|
|
1032
|
+
addArgLevelParams(node.argLevelParams, instance.argLevelParams),
|
|
1033
|
+
);
|
|
1034
|
+
return node.levelCorrect;
|
|
1035
|
+
}
|
|
1036
|
+
case "Label": {
|
|
1037
|
+
if (node.levelChecked >= iteration) return true;
|
|
1038
|
+
node.levelChecked = iteration;
|
|
1039
|
+
node.params.forEach((param) => checkLevel(param, iteration, check));
|
|
1040
|
+
const isCorrect = checkLevel(node.body, iteration, check);
|
|
1041
|
+
node.level = node.body.level;
|
|
1042
|
+
shareLevels(node, node.body);
|
|
1043
|
+
return isCorrect;
|
|
1044
|
+
}
|
|
1045
|
+
case "At": {
|
|
1046
|
+
if (node.levelChecked >= iteration) return true;
|
|
1047
|
+
node.levelChecked = iteration;
|
|
1048
|
+
const args = node.except.operands;
|
|
1049
|
+
const first = args[0];
|
|
1050
|
+
if (first === undefined) return true;
|
|
1051
|
+
checkLevel(first, iteration, check);
|
|
1052
|
+
node.level = first.level;
|
|
1053
|
+
const parts = [first];
|
|
1054
|
+
for (const argument of args.slice(1)) {
|
|
1055
|
+
if (argument === undefined) continue;
|
|
1056
|
+
checkLevel(argument, iteration, check);
|
|
1057
|
+
if (argument === node.component) break;
|
|
1058
|
+
node.level = Math.max(node.level, argument.level);
|
|
1059
|
+
parts.push(argument);
|
|
1060
|
+
}
|
|
1061
|
+
parts.forEach((part) => mergeLevels(node, part));
|
|
1062
|
+
return true;
|
|
1063
|
+
}
|
|
1064
|
+
case "SubstIn":
|
|
1065
|
+
case "APSubstIn": {
|
|
1066
|
+
if (node.levelChecked >= iteration) return node.levelCorrect;
|
|
1067
|
+
node.levelChecked = iteration;
|
|
1068
|
+
node.levelCorrect = true;
|
|
1069
|
+
const body = node.body;
|
|
1070
|
+
if (!checkLevel(body, iteration, check)) node.levelCorrect = false;
|
|
1071
|
+
node.substs.forEach((subst) => {
|
|
1072
|
+
if (!checkLevel(subst.expr, iteration, check)) node.levelCorrect = false;
|
|
1073
|
+
});
|
|
1074
|
+
node.level = node.substs.reduce(
|
|
1075
|
+
(level, subst) =>
|
|
1076
|
+
body.levelParams.has(subst.op) ? Math.max(level, subst.expr.level) : level,
|
|
1077
|
+
body.level,
|
|
1078
|
+
);
|
|
1079
|
+
body.levelParams.forEach((param) =>
|
|
1080
|
+
addAll(node.levelParams, getSubstitutedParams(param, node.substs, false)),
|
|
1081
|
+
);
|
|
1082
|
+
if (node.kind === "APSubstIn") {
|
|
1083
|
+
body.allParams.forEach((param) =>
|
|
1084
|
+
addAll(node.allParams, getSubstitutedParams(param, node.substs, true)),
|
|
1085
|
+
);
|
|
1086
|
+
} else {
|
|
1087
|
+
node.allParams = new Set(body.allParams);
|
|
1088
|
+
node.nonLeibnizParams = new Set(body.nonLeibnizParams);
|
|
1089
|
+
node.substs.forEach((subst) => {
|
|
1090
|
+
if (!node.allParams.has(subst.op)) return;
|
|
1091
|
+
node.allParams.delete(subst.op);
|
|
1092
|
+
addAll(node.allParams, subst.expr.allParams);
|
|
1093
|
+
addAll(node.nonLeibnizParams, subst.expr.nonLeibnizParams);
|
|
1094
|
+
if (node.nonLeibnizParams.has(subst.op)) {
|
|
1095
|
+
node.nonLeibnizParams.delete(subst.op);
|
|
1096
|
+
addAll(node.nonLeibnizParams, subst.expr.allParams);
|
|
1097
|
+
}
|
|
1098
|
+
});
|
|
1099
|
+
}
|
|
1100
|
+
const isConstant = isConstantModule(node.instantiatedModule, check);
|
|
1101
|
+
node.levelConstraints = getSubstitutedLevelConstraints(
|
|
1102
|
+
body,
|
|
1103
|
+
node.substs,
|
|
1104
|
+
isConstant,
|
|
1105
|
+
iteration,
|
|
1106
|
+
check,
|
|
1107
|
+
);
|
|
1108
|
+
node.argLevelConstraints = getSubstitutedArgLevelConstraints(
|
|
1109
|
+
body,
|
|
1110
|
+
node.substs,
|
|
1111
|
+
iteration,
|
|
1112
|
+
check,
|
|
1113
|
+
);
|
|
1114
|
+
node.argLevelParams = getSubstitutedArgLevelParams(body.argLevelParams, node.substs);
|
|
1115
|
+
return node.levelCorrect;
|
|
1116
|
+
}
|
|
1117
|
+
case "Instance":
|
|
1118
|
+
return checkInstance(node, iteration, check);
|
|
1119
|
+
case "Assume": {
|
|
1120
|
+
if (node.levelChecked >= iteration) return true;
|
|
1121
|
+
node.levelChecked = iteration;
|
|
1122
|
+
const isBodyCorrect = checkLevel(node.body, iteration, check);
|
|
1123
|
+
const isDefinitionCorrect = !node.definition || checkLevel(node.definition, iteration, check);
|
|
1124
|
+
// AssumeNode's getters return its expression's levels.
|
|
1125
|
+
node.level = node.body.level;
|
|
1126
|
+
shareLevels(node, node.body);
|
|
1127
|
+
if (node.level !== CONSTANT_LEVEL) {
|
|
1128
|
+
addError(
|
|
1129
|
+
check,
|
|
1130
|
+
node.location,
|
|
1131
|
+
`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${node.level}.`,
|
|
1132
|
+
);
|
|
1133
|
+
}
|
|
1134
|
+
return isBodyCorrect && isDefinitionCorrect;
|
|
1135
|
+
}
|
|
1136
|
+
case "Theorem": {
|
|
1137
|
+
// TheoremNode declares its own levelChecked, so levelCheckSubnodes still runs on the
|
|
1138
|
+
// theorem's definition, or its statement when it has none, and its proof.
|
|
1139
|
+
if (node.levelChecked >= iteration) return true;
|
|
1140
|
+
const isCorrect = checkSubnodes(
|
|
1141
|
+
node,
|
|
1142
|
+
[node.definition ?? node.body, ...(node.proof ? [node.proof] : [])],
|
|
1143
|
+
iteration,
|
|
1144
|
+
check,
|
|
1145
|
+
);
|
|
1146
|
+
const body = node.body;
|
|
1147
|
+
if (
|
|
1148
|
+
body.kind === "OpAppl" &&
|
|
1149
|
+
body.operator.name === "$Pick" &&
|
|
1150
|
+
body.level === TEMPORAL_LEVEL
|
|
1151
|
+
) {
|
|
1152
|
+
body.ranges.forEach((range) => {
|
|
1153
|
+
if (range.level === CONSTANT_LEVEL) return;
|
|
1154
|
+
addError(check, range.location, "Non-constant bound of temporal PICK.");
|
|
1155
|
+
});
|
|
1156
|
+
}
|
|
1157
|
+
if (body.level === TEMPORAL_LEVEL) checkTemporalProof(node.proof, check);
|
|
1158
|
+
return isCorrect;
|
|
1159
|
+
}
|
|
1160
|
+
case "LeafProof":
|
|
1161
|
+
case "UseOrHide":
|
|
1162
|
+
return checkSubnodes(node, node.facts, iteration, check);
|
|
1163
|
+
case "NonLeafProof":
|
|
1164
|
+
return checkSubnodes(node, [...node.steps, ...node.instances], iteration, check);
|
|
1165
|
+
case "DefStep":
|
|
1166
|
+
return checkSubnodes(node, node.defs, iteration, check);
|
|
1167
|
+
case "NewSymb": {
|
|
1168
|
+
if (node.levelChecked >= iteration) return node.levelCorrect;
|
|
1169
|
+
node.levelChecked = iteration;
|
|
1170
|
+
node.level = node.declaration.level;
|
|
1171
|
+
if (node.set === undefined) return node.levelCorrect;
|
|
1172
|
+
node.levelCorrect = checkLevel(node.set, iteration, check);
|
|
1173
|
+
node.level = Math.max(node.level, node.set.level);
|
|
1174
|
+
if (node.level === TEMPORAL_LEVEL) {
|
|
1175
|
+
node.levelCorrect = false;
|
|
1176
|
+
addError(check, node.location, "Level error:\nTemporal formula used as set.");
|
|
1177
|
+
}
|
|
1178
|
+
shareLevels(node, node.set);
|
|
1179
|
+
return node.levelCorrect;
|
|
1180
|
+
}
|
|
1181
|
+
case "AssumeProve": {
|
|
1182
|
+
if (node.levelChecked >= iteration) return node.levelCorrect;
|
|
1183
|
+
node.levelChecked = iteration;
|
|
1184
|
+
node.levelCorrect = true;
|
|
1185
|
+
node.assumptions.forEach((assumption) => {
|
|
1186
|
+
if (!checkLevel(assumption, iteration, check)) node.levelCorrect = false;
|
|
1187
|
+
});
|
|
1188
|
+
checkLevel(node.goal, iteration, check);
|
|
1189
|
+
node.level = node.assumptions.reduce(
|
|
1190
|
+
(level, assumption) => Math.max(level, assumption.level),
|
|
1191
|
+
node.goal.level,
|
|
1192
|
+
);
|
|
1193
|
+
[node.goal, ...node.assumptions].forEach((part) => mergeLevels(node, part));
|
|
1194
|
+
// LevelNode.addTemporalLevelConstraintToConstants.
|
|
1195
|
+
if (node.levelCorrect) {
|
|
1196
|
+
node.levelParams.forEach((param) => {
|
|
1197
|
+
if (param.kind === "OpDecl" && param.declKind === CONSTANT_DECL_KIND) {
|
|
1198
|
+
putLevelConstraint(node.levelConstraints, param, ACTION_LEVEL);
|
|
1199
|
+
}
|
|
1200
|
+
});
|
|
1201
|
+
}
|
|
1202
|
+
return node.levelCorrect;
|
|
1203
|
+
}
|
|
1204
|
+
}
|
|
1205
|
+
};
|