tla-ts 0.0.4-dev.4819fb7 → 0.0.4-dev.55f2117
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 +37 -126
- 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 +33 -1
- package/dist/index.d.ts +33 -1
- 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 +996 -0
- package/dist/prove.js +996 -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 +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/ast.ts +2 -2
- package/src/check.ts +8 -7
- package/src/{cli-options.ts → cli/options.ts} +1 -1
- package/src/{run-cli.ts → cli/run.ts} +302 -100
- package/src/cli.ts +1 -1
- package/src/codegen.ts +26 -7
- package/src/config.ts +2 -2
- package/src/environment.ts +9 -9
- package/src/errors.ts +89 -30
- package/src/evaluate.ts +58 -23
- package/src/index.ts +10 -0
- package/src/levels.ts +1 -1
- package/src/live-check.ts +1 -1
- package/src/liveness.ts +1 -1
- package/src/{obligation-action.ts → obligations/action.ts} +247 -69
- package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
- package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
- package/src/{obligations.ts → obligations/index.ts} +32 -16
- package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
- package/src/{obligation-module.ts → obligations/module.ts} +113 -121
- package/src/obligations/pickle.ts +98 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/{obligation-source.ts → obligations/source.ts} +154 -99
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +4 -20
- package/src/parallel.ts +13 -46
- package/src/parser.ts +1 -1
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -2
- package/src/{pcal-parse.ts → pcal/parse.ts} +3 -3
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +2 -2
- package/src/{pcal-translate.ts → pcal/translate.ts} +2 -2
- package/src/{pcal-validate.ts → pcal/validate.ts} +6 -6
- package/src/prove/decide-pool.ts +95 -0
- package/src/prove/deciders.ts +33 -0
- package/src/prove/first-order.ts +78 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +446 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +546 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +433 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +331 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +330 -0
- package/src/prove/isabelle/pure/name.ts +98 -0
- package/src/prove/isabelle/pure/net.ts +215 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +631 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +133 -0
- package/src/prove/isabelle/pure/simplifier.ts +106 -0
- package/src/prove/isabelle/pure/table.ts +201 -0
- package/src/prove/isabelle/pure/tactic.ts +168 -0
- package/src/prove/isabelle/pure/tactical.ts +264 -0
- package/src/prove/isabelle/pure/term-ord.ts +105 -0
- package/src/prove/isabelle/pure/term.ts +688 -0
- package/src/prove/isabelle/pure/thm.ts +783 -0
- package/src/prove/isabelle/pure/type.ts +121 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +508 -0
- package/src/prove/prep/defs.ts +33 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +529 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +22 -0
- package/src/prove/prove.ts +498 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +255 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +209 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +636 -0
- package/src/prove/smt/encode.ts +164 -0
- package/src/prove/smt/extensionality.ts +65 -0
- package/src/prove/smt/flatten.ts +112 -0
- package/src/prove/smt/format.ts +154 -0
- package/src/prove/smt/instances.ts +181 -0
- package/src/prove/smt/rewrite.ts +772 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +91 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/cache.ts +236 -0
- package/src/prove/tlapm/ocaml-marshal.ts +166 -0
- package/src/prove/tlapm/tlapm.ts +96 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +18 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +379 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +162 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +1 -1
- package/src/resolve.ts +1 -1
- package/src/runtime.ts +2 -2
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +14 -14
- package/src/{sany-levels.ts → sany/levels.ts} +2 -2
- package/src/{sany-lexer.ts → sany/lexer.ts} +1 -1
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +15 -15
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -3
- package/src/{sany-source.ts → sany/source.ts} +6 -6
- package/src/{sany-xml.ts → sany/xml.ts} +5 -5
- package/src/spec-description.ts +1 -1
- package/src/{standard-levels.ts → standard/levels.ts} +1 -1
- package/src/{standard-modules.ts → standard/modules.ts} +17 -14
- package/src/{standard-ranges.ts → standard/ranges.ts} +1 -1
- package/src/state-graph.ts +1 -1
- package/src/successors.ts +25 -6
- package/src/symmetry.ts +1 -1
- package/src/{tlc-messages.ts → tlc/messages.ts} +2 -2
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +58 -35
- package/src/{tlc-replay.ts → tlc/replay.ts} +5 -5
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +14 -8
- package/src/{tlc-version.ts → tlc/version.ts} +8 -7
- package/src/values.ts +81 -36
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -55
- package/dist/run-cli.js +0 -55
- package/src/value-sources.ts +0 -29
- /package/src/{sany-nodes.ts → sany/nodes.ts} +0 -0
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
|
@@ -0,0 +1,579 @@
|
|
|
1
|
+
// Parses Isabelle's inner syntax, the terms inside quotes, as far as tlapm's theory printer
|
|
2
|
+
// (isabelle.ml) uses it. The notation and its priorities come from Isabelle2025's Pure and from
|
|
3
|
+
// the Isabelle/TLA+ theories that declare it: PredicateLogic, SetTheory, Functions, Tuples,
|
|
4
|
+
// Strings and CaseExpressions. The translations those theories declare apply while parsing, so a
|
|
5
|
+
// term comes out as constants, names, applications and abstractions only.
|
|
6
|
+
|
|
7
|
+
import { TlaIsabelleError } from "../../../errors";
|
|
8
|
+
import { funT, mkType, propT, type Typ } from "../pure/term";
|
|
9
|
+
|
|
10
|
+
const TLA_TYPE = mkType("PredicateLogic.c");
|
|
11
|
+
|
|
12
|
+
// A parsed term before names resolve and types are inferred. A name is a bound or free variable
|
|
13
|
+
// or a constant; a constant comes from notation.
|
|
14
|
+
export type Ast =
|
|
15
|
+
| { readonly kind: "name"; readonly name: string }
|
|
16
|
+
| { readonly kind: "const"; readonly name: string }
|
|
17
|
+
| { readonly kind: "app"; readonly fun: Ast; readonly arg: Ast }
|
|
18
|
+
| {
|
|
19
|
+
readonly kind: "abs";
|
|
20
|
+
readonly name: string;
|
|
21
|
+
readonly type: Typ | undefined;
|
|
22
|
+
readonly body: Ast;
|
|
23
|
+
}
|
|
24
|
+
| { readonly kind: "constrain"; readonly term: Ast; readonly type: Typ };
|
|
25
|
+
|
|
26
|
+
type Token =
|
|
27
|
+
| { readonly kind: "id"; readonly text: string }
|
|
28
|
+
| { readonly kind: "delimiter"; readonly text: string }
|
|
29
|
+
| { readonly kind: "string"; readonly text: string }
|
|
30
|
+
| { readonly kind: "end" };
|
|
31
|
+
|
|
32
|
+
const DELIMITERS = [
|
|
33
|
+
"::",
|
|
34
|
+
":>",
|
|
35
|
+
"<<",
|
|
36
|
+
">>",
|
|
37
|
+
"@@",
|
|
38
|
+
"=>",
|
|
39
|
+
"\\",
|
|
40
|
+
"(",
|
|
41
|
+
")",
|
|
42
|
+
"[",
|
|
43
|
+
"]",
|
|
44
|
+
"{",
|
|
45
|
+
"}",
|
|
46
|
+
",",
|
|
47
|
+
":",
|
|
48
|
+
".",
|
|
49
|
+
"%",
|
|
50
|
+
"=",
|
|
51
|
+
"&",
|
|
52
|
+
"|",
|
|
53
|
+
"~",
|
|
54
|
+
"!",
|
|
55
|
+
"0",
|
|
56
|
+
];
|
|
57
|
+
|
|
58
|
+
const KEYWORDS = new Set(["EXCEPT", "DOMAIN", "SUBSET", "UNION", "PROP"]);
|
|
59
|
+
|
|
60
|
+
const isLetter = (char: string) => /[A-Za-z]/.test(char);
|
|
61
|
+
const isIdChar = (char: string) => /[A-Za-z0-9_']/.test(char);
|
|
62
|
+
|
|
63
|
+
const tokenize = (text: string): Token[] => {
|
|
64
|
+
const tokens: Token[] = [];
|
|
65
|
+
let position = 0;
|
|
66
|
+
while (position < text.length) {
|
|
67
|
+
const char = text[position];
|
|
68
|
+
if (/\s/.test(char)) {
|
|
69
|
+
position += 1;
|
|
70
|
+
continue;
|
|
71
|
+
}
|
|
72
|
+
if (text.startsWith("''", position)) {
|
|
73
|
+
const end = text.indexOf("''", position + 2);
|
|
74
|
+
if (end < 0) throw new TlaIsabelleError("ERROR", "Inner lexical error: unterminated string");
|
|
75
|
+
tokens.push({ kind: "string", text: text.slice(position + 2, end) });
|
|
76
|
+
position = end + 2;
|
|
77
|
+
continue;
|
|
78
|
+
}
|
|
79
|
+
if (text.startsWith("\\<", position) && isLetter(text[position + 2] ?? "")) {
|
|
80
|
+
const end = text.indexOf(">", position);
|
|
81
|
+
tokens.push({ kind: "delimiter", text: text.slice(position, end + 1) });
|
|
82
|
+
position = end + 1;
|
|
83
|
+
continue;
|
|
84
|
+
}
|
|
85
|
+
if (isLetter(char)) {
|
|
86
|
+
let end = position + 1;
|
|
87
|
+
while (
|
|
88
|
+
end < text.length &&
|
|
89
|
+
(isIdChar(text[end]) || (text[end] === "." && isLetter(text[end + 1] ?? "")))
|
|
90
|
+
)
|
|
91
|
+
end += 1;
|
|
92
|
+
const word = text.slice(position, end);
|
|
93
|
+
tokens.push(
|
|
94
|
+
KEYWORDS.has(word) ? { kind: "delimiter", text: word } : { kind: "id", text: word },
|
|
95
|
+
);
|
|
96
|
+
position = end;
|
|
97
|
+
continue;
|
|
98
|
+
}
|
|
99
|
+
const delimiter = DELIMITERS.find((candidate) => text.startsWith(candidate, position));
|
|
100
|
+
if (delimiter === undefined)
|
|
101
|
+
throw new TlaIsabelleError(
|
|
102
|
+
"ERROR",
|
|
103
|
+
`Inner lexical error at: ${text.slice(position, position + 20)}`,
|
|
104
|
+
);
|
|
105
|
+
tokens.push({ kind: "delimiter", text: delimiter });
|
|
106
|
+
position += delimiter.length;
|
|
107
|
+
}
|
|
108
|
+
tokens.push({ kind: "end" });
|
|
109
|
+
return tokens;
|
|
110
|
+
};
|
|
111
|
+
|
|
112
|
+
const constant = (name: string): Ast => ({ kind: "const", name });
|
|
113
|
+
const apply = (fun: Ast, ...args: Ast[]) =>
|
|
114
|
+
args.reduce<Ast>((result, arg) => ({ kind: "app", fun: result, arg }), fun);
|
|
115
|
+
|
|
116
|
+
// Strings.thy: a string is the tuple of its characters, each a pair of nibbles.
|
|
117
|
+
const nibble = (value: number): Ast =>
|
|
118
|
+
value === 0
|
|
119
|
+
? constant("Integers.zero")
|
|
120
|
+
: apply(constant("Functions.fapply"), constant("Integers.succ"), nibble(value - 1));
|
|
121
|
+
|
|
122
|
+
const stringTerm = (text: string) =>
|
|
123
|
+
[...text].reduce((tuple, char) => {
|
|
124
|
+
const code = char.charCodeAt(0);
|
|
125
|
+
if (code >= 128) throw new TlaIsabelleError("ERROR", `Non-ASCII symbol: ${char}`);
|
|
126
|
+
return apply(
|
|
127
|
+
constant("Tuples.Append"),
|
|
128
|
+
tuple,
|
|
129
|
+
apply(constant("Strings.char"), nibble(code >> 4), nibble(code & 15)),
|
|
130
|
+
);
|
|
131
|
+
}, constant("Tuples.emptySeq"));
|
|
132
|
+
|
|
133
|
+
const tuple = (elements: readonly Ast[]) =>
|
|
134
|
+
elements.reduce(
|
|
135
|
+
(result, element) => apply(constant("Tuples.Append"), result, element),
|
|
136
|
+
constant("Tuples.emptySeq"),
|
|
137
|
+
);
|
|
138
|
+
|
|
139
|
+
interface Infix {
|
|
140
|
+
readonly constant: string;
|
|
141
|
+
readonly left: number;
|
|
142
|
+
readonly right: number;
|
|
143
|
+
readonly priority: number;
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
const infixl = (name: string, priority: number): Infix => ({
|
|
147
|
+
constant: name,
|
|
148
|
+
left: priority,
|
|
149
|
+
right: priority + 1,
|
|
150
|
+
priority,
|
|
151
|
+
});
|
|
152
|
+
const infixr = (name: string, priority: number): Infix => ({
|
|
153
|
+
constant: name,
|
|
154
|
+
left: priority + 1,
|
|
155
|
+
right: priority,
|
|
156
|
+
priority,
|
|
157
|
+
});
|
|
158
|
+
|
|
159
|
+
const INFIXES = new Map<string, Infix>([
|
|
160
|
+
["\\<Rightarrow>", infixr("PredicateLogic.imp", 25)],
|
|
161
|
+
["=>", infixr("PredicateLogic.imp", 25)],
|
|
162
|
+
["\\<Leftrightarrow>", infixr("PredicateLogic.iff", 25)],
|
|
163
|
+
["\\<or>", infixr("PredicateLogic.disj", 30)],
|
|
164
|
+
["|", infixr("PredicateLogic.disj", 30)],
|
|
165
|
+
["\\<and>", infixr("PredicateLogic.conj", 35)],
|
|
166
|
+
["&", infixr("PredicateLogic.conj", 35)],
|
|
167
|
+
["=", infixl("PredicateLogic.eq", 50)],
|
|
168
|
+
["\\<noteq>", infixl("PredicateLogic.not_equal", 50)],
|
|
169
|
+
["\\<in>", infixl("SetTheory.in", 50)],
|
|
170
|
+
["\\<notin>", infixl("SetTheory.notin", 50)],
|
|
171
|
+
["\\<subseteq>", infixl("SetTheory.subset", 50)],
|
|
172
|
+
["\\<union>", infixl("SetTheory.union", 65)],
|
|
173
|
+
["\\", infixl("SetTheory.setminus", 65)],
|
|
174
|
+
["\\<inter>", infixl("SetTheory.inter", 70)],
|
|
175
|
+
["@@", infixl("Functions.extend", 70)],
|
|
176
|
+
[":>", infixl("Functions.oneArg", 75)],
|
|
177
|
+
["\\<times>", infixr("Tuples.prod", 100)],
|
|
178
|
+
]);
|
|
179
|
+
|
|
180
|
+
const PREFIXES = new Map<
|
|
181
|
+
string,
|
|
182
|
+
{ readonly constant: string; readonly argument: number; readonly priority: number }
|
|
183
|
+
>([
|
|
184
|
+
["~", { constant: "PredicateLogic.not", argument: 40, priority: 40 }],
|
|
185
|
+
["\\<not>", { constant: "PredicateLogic.not", argument: 40, priority: 40 }],
|
|
186
|
+
["SUBSET", { constant: "SetTheory.SUBSET", argument: 100, priority: 90 }],
|
|
187
|
+
["UNION", { constant: "SetTheory.UNION", argument: 100, priority: 90 }],
|
|
188
|
+
["DOMAIN", { constant: "Functions.DOMAIN", argument: 100, priority: 90 }],
|
|
189
|
+
]);
|
|
190
|
+
|
|
191
|
+
// A parse result: the term, its priority, and whether it is a proposition rather than an object
|
|
192
|
+
// of the logic, which Isabelle tells apart by syntactic category.
|
|
193
|
+
interface Parsed {
|
|
194
|
+
readonly ast: Ast;
|
|
195
|
+
readonly priority: number;
|
|
196
|
+
readonly isProp: boolean;
|
|
197
|
+
}
|
|
198
|
+
|
|
199
|
+
const MAX_PRIORITY = 1000;
|
|
200
|
+
|
|
201
|
+
class Parser {
|
|
202
|
+
private position = 0;
|
|
203
|
+
|
|
204
|
+
constructor(private readonly tokens: readonly Token[]) {}
|
|
205
|
+
|
|
206
|
+
private peek(offset = 0): Token {
|
|
207
|
+
return this.tokens[Math.min(this.position + offset, this.tokens.length - 1)];
|
|
208
|
+
}
|
|
209
|
+
|
|
210
|
+
private isDelimiter(text: string, offset = 0) {
|
|
211
|
+
const token = this.peek(offset);
|
|
212
|
+
return token.kind === "delimiter" && token.text === text;
|
|
213
|
+
}
|
|
214
|
+
|
|
215
|
+
private next(): Token {
|
|
216
|
+
const token = this.peek();
|
|
217
|
+
this.position += 1;
|
|
218
|
+
return token;
|
|
219
|
+
}
|
|
220
|
+
|
|
221
|
+
private expect(text: string) {
|
|
222
|
+
if (!this.isDelimiter(text)) throw this.syntaxError();
|
|
223
|
+
this.position += 1;
|
|
224
|
+
}
|
|
225
|
+
|
|
226
|
+
private syntaxError() {
|
|
227
|
+
const token = this.peek();
|
|
228
|
+
return new TlaIsabelleError(
|
|
229
|
+
"ERROR",
|
|
230
|
+
`Inner syntax error at: ${token.kind === "end" ? "end of input" : token.kind === "string" ? `''${token.text}''` : token.text}`,
|
|
231
|
+
);
|
|
232
|
+
}
|
|
233
|
+
|
|
234
|
+
private identifier(): string {
|
|
235
|
+
const token = this.next();
|
|
236
|
+
if (token.kind !== "id") throw this.syntaxError();
|
|
237
|
+
return token.text;
|
|
238
|
+
}
|
|
239
|
+
|
|
240
|
+
atEnd() {
|
|
241
|
+
return this.peek().kind === "end";
|
|
242
|
+
}
|
|
243
|
+
|
|
244
|
+
// A type: c, prop, a function type, or [c, c] => c.
|
|
245
|
+
type(): Typ {
|
|
246
|
+
const domains = this.isDelimiter("[") ? this.typeList() : undefined;
|
|
247
|
+
const atom = domains === undefined ? this.typeAtom() : undefined;
|
|
248
|
+
if (this.isDelimiter("=>") || this.isDelimiter("\\<Rightarrow>")) {
|
|
249
|
+
this.position += 1;
|
|
250
|
+
const range = this.type();
|
|
251
|
+
return (domains ?? [atom ?? TLA_TYPE]).reduceRight(
|
|
252
|
+
(result, domain) => funT(domain, result),
|
|
253
|
+
range,
|
|
254
|
+
);
|
|
255
|
+
}
|
|
256
|
+
if (atom === undefined) throw this.syntaxError();
|
|
257
|
+
return atom;
|
|
258
|
+
}
|
|
259
|
+
|
|
260
|
+
private typeList(): Typ[] {
|
|
261
|
+
this.expect("[");
|
|
262
|
+
const types = [this.type()];
|
|
263
|
+
while (this.isDelimiter(",")) {
|
|
264
|
+
this.position += 1;
|
|
265
|
+
types.push(this.type());
|
|
266
|
+
}
|
|
267
|
+
this.expect("]");
|
|
268
|
+
return types;
|
|
269
|
+
}
|
|
270
|
+
|
|
271
|
+
private typeAtom(): Typ {
|
|
272
|
+
if (this.isDelimiter("(")) {
|
|
273
|
+
this.position += 1;
|
|
274
|
+
const type = this.type();
|
|
275
|
+
this.expect(")");
|
|
276
|
+
return type;
|
|
277
|
+
}
|
|
278
|
+
const name = this.identifier();
|
|
279
|
+
if (name === "c") return TLA_TYPE;
|
|
280
|
+
if (name === "prop") return propT;
|
|
281
|
+
throw new TlaIsabelleError("ERROR", `Undefined type name: ${name}`);
|
|
282
|
+
}
|
|
283
|
+
|
|
284
|
+
// Binder variables, each optionally constrained: x, x :: c.
|
|
285
|
+
private binders(isConstrainable: boolean): { name: string; type: Typ | undefined }[] {
|
|
286
|
+
const binders: { name: string; type: Typ | undefined }[] = [];
|
|
287
|
+
while (this.peek().kind === "id") {
|
|
288
|
+
const name = this.identifier();
|
|
289
|
+
if (isConstrainable && this.isDelimiter("::")) {
|
|
290
|
+
this.position += 1;
|
|
291
|
+
binders.push({ name, type: this.type() });
|
|
292
|
+
} else binders.push({ name, type: undefined });
|
|
293
|
+
}
|
|
294
|
+
if (binders.length === 0) throw this.syntaxError();
|
|
295
|
+
return binders;
|
|
296
|
+
}
|
|
297
|
+
|
|
298
|
+
private commaList(close: string): Ast[] {
|
|
299
|
+
if (this.isDelimiter(close)) {
|
|
300
|
+
this.position += 1;
|
|
301
|
+
return [];
|
|
302
|
+
}
|
|
303
|
+
const items = [this.logic(0)];
|
|
304
|
+
while (this.isDelimiter(",")) {
|
|
305
|
+
this.position += 1;
|
|
306
|
+
items.push(this.logic(0));
|
|
307
|
+
}
|
|
308
|
+
this.expect(close);
|
|
309
|
+
return items;
|
|
310
|
+
}
|
|
311
|
+
|
|
312
|
+
// An object-logic term of at least the given priority.
|
|
313
|
+
logic(minimum: number): Ast {
|
|
314
|
+
const parsed = this.expression(minimum);
|
|
315
|
+
if (parsed.isProp)
|
|
316
|
+
throw new TlaIsabelleError("ERROR", "Inner syntax error: proposition in term position");
|
|
317
|
+
return parsed.ast;
|
|
318
|
+
}
|
|
319
|
+
|
|
320
|
+
// A proposition: an object-logic term becomes one through Trueprop, as PredicateLogic's
|
|
321
|
+
// "(_)" 5 mixfix declares.
|
|
322
|
+
prop(minimum: number): Ast {
|
|
323
|
+
const parsed = this.expression(minimum);
|
|
324
|
+
return parsed.isProp ? parsed.ast : apply(constant("PredicateLogic.Trueprop"), parsed.ast);
|
|
325
|
+
}
|
|
326
|
+
|
|
327
|
+
private expression(minimum: number): Parsed {
|
|
328
|
+
let left = this.prefix(minimum);
|
|
329
|
+
for (;;) {
|
|
330
|
+
const token = this.peek();
|
|
331
|
+
if (token.kind !== "delimiter") return left;
|
|
332
|
+
if (token.text === "\\<Longrightarrow>") {
|
|
333
|
+
if (minimum > 1 || (left.isProp && left.priority < 2)) return left;
|
|
334
|
+
this.position += 1;
|
|
335
|
+
const premise = left.isProp
|
|
336
|
+
? left.ast
|
|
337
|
+
: apply(constant("PredicateLogic.Trueprop"), left.ast);
|
|
338
|
+
left = {
|
|
339
|
+
ast: apply(constant("Pure.imp"), premise, this.prop(1)),
|
|
340
|
+
priority: 1,
|
|
341
|
+
isProp: true,
|
|
342
|
+
};
|
|
343
|
+
continue;
|
|
344
|
+
}
|
|
345
|
+
if (left.isProp) return left;
|
|
346
|
+
if (token.text === "::") {
|
|
347
|
+
if (minimum > 3 || left.priority < 4) return left;
|
|
348
|
+
this.position += 1;
|
|
349
|
+
left = {
|
|
350
|
+
ast: { kind: "constrain", term: left.ast, type: this.type() },
|
|
351
|
+
priority: 3,
|
|
352
|
+
isProp: false,
|
|
353
|
+
};
|
|
354
|
+
continue;
|
|
355
|
+
}
|
|
356
|
+
if (token.text === "(") {
|
|
357
|
+
if (left.priority < MAX_PRIORITY) return left;
|
|
358
|
+
this.position += 1;
|
|
359
|
+
const args = this.commaList(")");
|
|
360
|
+
if (args.length === 0) throw this.syntaxError();
|
|
361
|
+
left = { ast: apply(left.ast, ...args), priority: MAX_PRIORITY, isProp: false };
|
|
362
|
+
continue;
|
|
363
|
+
}
|
|
364
|
+
if (token.text === "[") {
|
|
365
|
+
if (minimum > 90 || left.priority < 89) return left;
|
|
366
|
+
this.position += 1;
|
|
367
|
+
const index = this.logic(0);
|
|
368
|
+
this.expect("]");
|
|
369
|
+
left = {
|
|
370
|
+
ast: apply(constant("Functions.fapply"), left.ast, index),
|
|
371
|
+
priority: 90,
|
|
372
|
+
isProp: false,
|
|
373
|
+
};
|
|
374
|
+
continue;
|
|
375
|
+
}
|
|
376
|
+
const infix = INFIXES.get(token.text);
|
|
377
|
+
if (infix === undefined || infix.priority < minimum || left.priority < infix.left)
|
|
378
|
+
return left;
|
|
379
|
+
this.position += 1;
|
|
380
|
+
left = {
|
|
381
|
+
ast: apply(constant(infix.constant), left.ast, this.logic(infix.right)),
|
|
382
|
+
priority: infix.priority,
|
|
383
|
+
isProp: false,
|
|
384
|
+
};
|
|
385
|
+
}
|
|
386
|
+
}
|
|
387
|
+
|
|
388
|
+
private prefix(minimum: number): Parsed {
|
|
389
|
+
const token = this.next();
|
|
390
|
+
const term = (ast: Ast, priority = MAX_PRIORITY): Parsed => ({ ast, priority, isProp: false });
|
|
391
|
+
if (token.kind === "end") {
|
|
392
|
+
this.position -= 1;
|
|
393
|
+
throw this.syntaxError();
|
|
394
|
+
}
|
|
395
|
+
if (token.kind === "id") return term({ kind: "name", name: token.text });
|
|
396
|
+
if (token.kind === "string") return term(stringTerm(token.text));
|
|
397
|
+
switch (token.text) {
|
|
398
|
+
case "(": {
|
|
399
|
+
const inner = this.expression(0);
|
|
400
|
+
this.expect(")");
|
|
401
|
+
return { ...inner, priority: MAX_PRIORITY };
|
|
402
|
+
}
|
|
403
|
+
case "0":
|
|
404
|
+
return term(constant("Integers.zero"));
|
|
405
|
+
case "{":
|
|
406
|
+
if (this.isDelimiter("}")) {
|
|
407
|
+
this.position += 1;
|
|
408
|
+
return term(constant("SetTheory.emptyset"), 100);
|
|
409
|
+
}
|
|
410
|
+
return term(
|
|
411
|
+
this.commaList("}").reduceRight(
|
|
412
|
+
(set, element) => apply(constant("SetTheory.addElt"), element, set),
|
|
413
|
+
constant("SetTheory.emptyset"),
|
|
414
|
+
),
|
|
415
|
+
);
|
|
416
|
+
case "<<":
|
|
417
|
+
return term(
|
|
418
|
+
this.isDelimiter(">>")
|
|
419
|
+
? (this.next(), constant("Tuples.emptySeq"))
|
|
420
|
+
: tuple(this.commaList(">>")),
|
|
421
|
+
);
|
|
422
|
+
case "\\<langle>":
|
|
423
|
+
return term(tuple(this.commaList("\\<rangle>")));
|
|
424
|
+
case "[":
|
|
425
|
+
return this.bracket();
|
|
426
|
+
case "\\<forall>":
|
|
427
|
+
case "\\<exists>":
|
|
428
|
+
return term(this.quantifier(token.text === "\\<forall>"), 10);
|
|
429
|
+
case "%":
|
|
430
|
+
case "\\<lambda>": {
|
|
431
|
+
if (minimum > 3) throw this.syntaxError();
|
|
432
|
+
const binders = this.binders(true);
|
|
433
|
+
this.expect(".");
|
|
434
|
+
const body = this.logic(3);
|
|
435
|
+
return term(
|
|
436
|
+
binders.reduceRight<Ast>(
|
|
437
|
+
(result, binder) => ({
|
|
438
|
+
kind: "abs",
|
|
439
|
+
name: binder.name,
|
|
440
|
+
type: binder.type,
|
|
441
|
+
body: result,
|
|
442
|
+
}),
|
|
443
|
+
body,
|
|
444
|
+
),
|
|
445
|
+
3,
|
|
446
|
+
);
|
|
447
|
+
}
|
|
448
|
+
case "\\<And>": {
|
|
449
|
+
if (minimum > 0) throw this.syntaxError();
|
|
450
|
+
const binders = this.binders(true);
|
|
451
|
+
this.expect(".");
|
|
452
|
+
const body = this.prop(0);
|
|
453
|
+
return {
|
|
454
|
+
ast: binders.reduceRight<Ast>(
|
|
455
|
+
(result, binder) =>
|
|
456
|
+
apply(constant("Pure.all"), {
|
|
457
|
+
kind: "abs",
|
|
458
|
+
name: binder.name,
|
|
459
|
+
type: binder.type,
|
|
460
|
+
body: result,
|
|
461
|
+
}),
|
|
462
|
+
body,
|
|
463
|
+
),
|
|
464
|
+
priority: 0,
|
|
465
|
+
isProp: true,
|
|
466
|
+
};
|
|
467
|
+
}
|
|
468
|
+
}
|
|
469
|
+
const prefix = PREFIXES.get(token.text);
|
|
470
|
+
if (prefix === undefined || prefix.priority < minimum) {
|
|
471
|
+
this.position -= 1;
|
|
472
|
+
throw this.syntaxError();
|
|
473
|
+
}
|
|
474
|
+
return term(apply(constant(prefix.constant), this.logic(prefix.argument)), prefix.priority);
|
|
475
|
+
}
|
|
476
|
+
|
|
477
|
+
// \<forall>x, y : P and \<forall>x, y \<in> S : P, with \<exists> alike.
|
|
478
|
+
private quantifier(isForall: boolean): Ast {
|
|
479
|
+
const names = [this.identifier()];
|
|
480
|
+
while (this.isDelimiter(",")) {
|
|
481
|
+
this.position += 1;
|
|
482
|
+
names.push(this.identifier());
|
|
483
|
+
}
|
|
484
|
+
if (this.isDelimiter(":")) {
|
|
485
|
+
this.position += 1;
|
|
486
|
+
const body = this.logic(10);
|
|
487
|
+
const quantifier = constant(isForall ? "PredicateLogic.All" : "PredicateLogic.Ex");
|
|
488
|
+
return names.reduceRight(
|
|
489
|
+
(result, name) => apply(quantifier, { kind: "abs", name, type: undefined, body: result }),
|
|
490
|
+
body,
|
|
491
|
+
);
|
|
492
|
+
}
|
|
493
|
+
this.expect("\\<in>");
|
|
494
|
+
const domain = this.logic(0);
|
|
495
|
+
this.expect(":");
|
|
496
|
+
const body = this.logic(0);
|
|
497
|
+
const quantifier = constant(isForall ? "SetTheory.bAll" : "SetTheory.bEx");
|
|
498
|
+
return names.reduceRight(
|
|
499
|
+
(result, name) =>
|
|
500
|
+
apply(quantifier, domain, { kind: "abs", name, type: undefined, body: result }),
|
|
501
|
+
body,
|
|
502
|
+
);
|
|
503
|
+
}
|
|
504
|
+
|
|
505
|
+
// The bracketed forms: [x \<in> S \<mapsto> e], [S \<rightarrow> T], [f EXCEPT ![x] = e, ...]
|
|
506
|
+
// and [d : r, ...].
|
|
507
|
+
private bracket(): Parsed {
|
|
508
|
+
if (this.peek().kind === "id" && this.isDelimiter("\\<in>", 1)) {
|
|
509
|
+
const name = this.identifier();
|
|
510
|
+
this.position += 1;
|
|
511
|
+
const domain = this.logic(0);
|
|
512
|
+
this.expect("\\<mapsto>");
|
|
513
|
+
const body = this.logic(0);
|
|
514
|
+
this.expect("]");
|
|
515
|
+
return {
|
|
516
|
+
ast: apply(constant("Functions.Fcn"), domain, { kind: "abs", name, type: undefined, body }),
|
|
517
|
+
priority: 900,
|
|
518
|
+
isProp: false,
|
|
519
|
+
};
|
|
520
|
+
}
|
|
521
|
+
const first = this.logic(0);
|
|
522
|
+
if (this.isDelimiter("\\<rightarrow>")) {
|
|
523
|
+
this.position += 1;
|
|
524
|
+
const range = this.logic(0);
|
|
525
|
+
this.expect("]");
|
|
526
|
+
return {
|
|
527
|
+
ast: apply(constant("Functions.FuncSet"), first, range),
|
|
528
|
+
priority: 900,
|
|
529
|
+
isProp: false,
|
|
530
|
+
};
|
|
531
|
+
}
|
|
532
|
+
if (this.isDelimiter("EXCEPT")) {
|
|
533
|
+
this.position += 1;
|
|
534
|
+
let result = first;
|
|
535
|
+
for (;;) {
|
|
536
|
+
this.expect("!");
|
|
537
|
+
this.expect("[");
|
|
538
|
+
const index = this.logic(0);
|
|
539
|
+
this.expect("]");
|
|
540
|
+
this.expect("=");
|
|
541
|
+
result = apply(constant("Functions.except"), result, index, this.logic(0));
|
|
542
|
+
if (!this.isDelimiter(",")) break;
|
|
543
|
+
this.position += 1;
|
|
544
|
+
}
|
|
545
|
+
this.expect("]");
|
|
546
|
+
return { ast: result, priority: 900, isProp: false };
|
|
547
|
+
}
|
|
548
|
+
this.expect(":");
|
|
549
|
+
const domains = [first];
|
|
550
|
+
const ranges = [this.logic(0)];
|
|
551
|
+
while (this.isDelimiter(",")) {
|
|
552
|
+
this.position += 1;
|
|
553
|
+
domains.push(this.logic(0));
|
|
554
|
+
this.expect(":");
|
|
555
|
+
ranges.push(this.logic(0));
|
|
556
|
+
}
|
|
557
|
+
this.expect("]");
|
|
558
|
+
return {
|
|
559
|
+
ast: apply(constant("Tuples.EnumFuncSet"), tuple(domains), tuple(ranges)),
|
|
560
|
+
priority: MAX_PRIORITY,
|
|
561
|
+
isProp: false,
|
|
562
|
+
};
|
|
563
|
+
}
|
|
564
|
+
}
|
|
565
|
+
|
|
566
|
+
const parseWith = <Result>(text: string, parse: (parser: Parser) => Result): Result => {
|
|
567
|
+
const parser = new Parser(tokenize(text));
|
|
568
|
+
const result = parse(parser);
|
|
569
|
+
if (!parser.atEnd())
|
|
570
|
+
throw new TlaIsabelleError(
|
|
571
|
+
"ERROR",
|
|
572
|
+
`Inner syntax error: trailing input in ${text.slice(0, 40)}`,
|
|
573
|
+
);
|
|
574
|
+
return result;
|
|
575
|
+
};
|
|
576
|
+
|
|
577
|
+
export const parseProp = (text: string) => parseWith(text, (parser) => parser.prop(0));
|
|
578
|
+
|
|
579
|
+
export const parseType = (text: string) => parseWith(text, (parser) => parser.type());
|