tla-ts 0.0.4-dev.6dec595 → 0.0.4-dev.7714e32
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 +44 -12
- package/dist/index.d.ts +44 -12
- 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 +76 -92
- package/dist/transfer.js +76 -92
- 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/bags.ts +22 -23
- package/src/builtins.ts +16 -8
- package/src/check.ts +131 -1154
- package/src/{cli-options.ts → cli/options.ts} +54 -9
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/{run-cli.ts → cli/tlc.ts} +112 -718
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +1 -1
- package/src/codegen.ts +17 -15
- package/src/config.ts +5 -5
- package/src/dependencies.ts +4 -6
- package/src/environment.ts +55 -60
- package/src/errors.ts +97 -35
- package/src/evaluate.ts +109 -108
- package/src/exit-codes.ts +1 -1
- package/src/fingerprints.ts +3 -3
- package/src/index.ts +10 -0
- package/src/instances.ts +56 -46
- package/src/java-overrides.ts +79 -41
- package/src/json.ts +31 -36
- package/src/levels.ts +10 -13
- package/src/{live-check.ts → liveness-checker.ts} +169 -142
- package/src/liveness.ts +38 -34
- 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} +172 -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 +39 -51
- package/src/parallel.ts +39 -66
- package/src/parser.ts +67 -74
- package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
- package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
- package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
- package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
- package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
- 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 +19 -24
- package/src/resolve.ts +15 -22
- package/src/runtime.ts +8 -8
- package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
- package/src/{sany-generator.ts → sany/generator.ts} +38 -55
- package/src/{sany-levels.ts → sany/levels.ts} +45 -48
- package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
- package/src/{sany-linter.ts → sany/linter.ts} +1 -1
- package/src/{sany-modules.ts → sany/modules.ts} +2 -2
- package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
- package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
- package/src/{sany-report.ts → sany/report.ts} +16 -17
- package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
- package/src/{sany-source.ts → sany/source.ts} +6 -7
- package/src/{sany-xml.ts → sany/xml.ts} +5 -6
- package/src/search.ts +969 -0
- package/src/spec-description.ts +26 -20
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +16 -20
- package/src/state-graph.ts +9 -8
- package/src/substitution-levels.ts +2 -2
- package/src/successors.ts +16 -19
- package/src/symmetry.ts +1 -1
- package/src/tableau.ts +6 -7
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
- package/src/{tlc-order.ts → tlc/order.ts} +7 -7
- package/src/{tlc-random.ts → tlc/random.ts} +3 -213
- package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
- package/src/transfer.ts +32 -32
- package/src/values.ts +80 -70
- package/src/worker.ts +62 -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/canonical.ts +0 -40
- package/src/obligation-expression.ts +0 -1060
- package/src/obligation-module.ts +0 -1042
- package/src/standard-ranges.ts +0 -116
- package/src/value-sources.ts +0 -29
- /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
- /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
- /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
|
@@ -0,0 +1,445 @@
|
|
|
1
|
+
// Ported from tlapm's src/backend/isabelle.ml (BSD licensed, see LICENSE-tlapm).
|
|
2
|
+
// An obligation as the Isabelle/TLA+ theory tlapm writes for Isabelle to prove with a tactic.
|
|
3
|
+
|
|
4
|
+
import { TlapmBugError, TlaProverError, TlaUnsupportedError } from "../../errors";
|
|
5
|
+
import { createContext, getBoundName, popNames, pushName } from "../../obligations/printer";
|
|
6
|
+
import type { Bound, Builtin, Expr, Sequent } from "../../obligations/expression";
|
|
7
|
+
import { getUnprintableError, pickle, printFact, splitFirstBound } from "../first-order";
|
|
8
|
+
|
|
9
|
+
const cook = (name: string) => `is${pickle(name)}`;
|
|
10
|
+
|
|
11
|
+
const ATOMS: Partial<Record<Builtin, string>> = {
|
|
12
|
+
TRUE: "TRUE",
|
|
13
|
+
FALSE: "FALSE",
|
|
14
|
+
STRING: "STRING",
|
|
15
|
+
BOOLEAN: "BOOLEAN",
|
|
16
|
+
Nat: "Nat",
|
|
17
|
+
Int: "Int",
|
|
18
|
+
Real: cook("Real"),
|
|
19
|
+
Infinity: cook("Infinity"),
|
|
20
|
+
Any: "Any",
|
|
21
|
+
};
|
|
22
|
+
|
|
23
|
+
const UNARY: Partial<Record<Builtin, string>> = {
|
|
24
|
+
Neg: "~",
|
|
25
|
+
DOMAIN: "DOMAIN",
|
|
26
|
+
SUBSET: "SUBSET",
|
|
27
|
+
UNION: "UNION",
|
|
28
|
+
};
|
|
29
|
+
|
|
30
|
+
const BINARY: Partial<Record<Builtin, string>> = {
|
|
31
|
+
Implies: "\\<Rightarrow>",
|
|
32
|
+
Equiv: "\\<Leftrightarrow>",
|
|
33
|
+
Conj: "\\<and>",
|
|
34
|
+
Disj: "\\<or>",
|
|
35
|
+
Eq: "=",
|
|
36
|
+
Neq: "\\<noteq>",
|
|
37
|
+
Subseteq: "\\<subseteq>",
|
|
38
|
+
Mem: "\\<in>",
|
|
39
|
+
Notmem: "\\<notin>",
|
|
40
|
+
Setminus: "\\\\",
|
|
41
|
+
Cap: "\\<inter>",
|
|
42
|
+
Cup: "\\<union>",
|
|
43
|
+
OneArg: ":>",
|
|
44
|
+
Extend: "@@",
|
|
45
|
+
};
|
|
46
|
+
|
|
47
|
+
const NONFIX: Partial<Record<Builtin, [string, number]>> = {
|
|
48
|
+
Plus: ["addint", 2],
|
|
49
|
+
Minus: ["subint", 2],
|
|
50
|
+
Uminus: ["minus", 1],
|
|
51
|
+
Times: ["mult", 2],
|
|
52
|
+
Ratio: [cook("/"), 2],
|
|
53
|
+
Quotient: [cook("\\div"), 2],
|
|
54
|
+
Remainder: [cook("%"), 2],
|
|
55
|
+
Exp: [cook("^"), 2],
|
|
56
|
+
Lteq: ["leq", 2],
|
|
57
|
+
Lt: ["less", 2],
|
|
58
|
+
Gteq: ["geq", 2],
|
|
59
|
+
Gt: ["greater", 2],
|
|
60
|
+
Range: ["intvl", 2],
|
|
61
|
+
Seq: ["Seq", 1],
|
|
62
|
+
Len: ["Len", 1],
|
|
63
|
+
BSeq: ["BSeq", 1],
|
|
64
|
+
Cat: [cook("\\circ"), 2],
|
|
65
|
+
Append: ["Append", 2],
|
|
66
|
+
Head: ["Head", 1],
|
|
67
|
+
Tail: ["Tail", 1],
|
|
68
|
+
SubSeq: ["SubSeq", 3],
|
|
69
|
+
SelectSeq: ["SelectSeq", 2],
|
|
70
|
+
Print: ["Print", 2],
|
|
71
|
+
PrintT: ["PrintT", 1],
|
|
72
|
+
Assert: ["Assert", 2],
|
|
73
|
+
JavaTime: ["JavaTime", 0],
|
|
74
|
+
TLCGet: ["TLCGet", 1],
|
|
75
|
+
TLCSet: ["TLCSet", 2],
|
|
76
|
+
Permutations: ["Permutations", 1],
|
|
77
|
+
SortSeq: ["SortSeq", 2],
|
|
78
|
+
RandomElement: ["RandomElement", 1],
|
|
79
|
+
ToString: ["ToString", 1],
|
|
80
|
+
};
|
|
81
|
+
|
|
82
|
+
// thy_header's tdoms_table: the operators the theory declares, with their arities.
|
|
83
|
+
const DECLARED: [string, number][] = [
|
|
84
|
+
["Real", 0],
|
|
85
|
+
["/", 2],
|
|
86
|
+
["\\div", 2],
|
|
87
|
+
["%", 2],
|
|
88
|
+
["..", 2],
|
|
89
|
+
["Infinity", 0],
|
|
90
|
+
["[]", 1],
|
|
91
|
+
["<>", 1],
|
|
92
|
+
];
|
|
93
|
+
|
|
94
|
+
const HEADER = [
|
|
95
|
+
"consts",
|
|
96
|
+
...DECLARED.map(
|
|
97
|
+
(declared) =>
|
|
98
|
+
` "${cook(declared[0])}" :: ${declared[1] === 0 ? "c" : `"[${Array(declared[1]).fill("c").join(",")}] => c"`}`,
|
|
99
|
+
),
|
|
100
|
+
"",
|
|
101
|
+
].join("\n");
|
|
102
|
+
|
|
103
|
+
const getSuccessors = (integer: string) => {
|
|
104
|
+
const count = Number.parseInt(integer, 10);
|
|
105
|
+
return `${"succ[".repeat(count)}0${"]".repeat(count)}`;
|
|
106
|
+
};
|
|
107
|
+
|
|
108
|
+
// thy_header.
|
|
109
|
+
const getTheoryHeader = (name: string, isVerbose: boolean) => [
|
|
110
|
+
"(* automatically generated -- do not edit manually *)",
|
|
111
|
+
`theory ${name} imports Constant Zenon begin`,
|
|
112
|
+
...(isVerbose ? ['ML_command \\<open> writeln ("*** TLAPS PARSED\\n"); \\<close>'] : []),
|
|
113
|
+
HEADER,
|
|
114
|
+
];
|
|
115
|
+
|
|
116
|
+
// pp_print_expr on an obligation after Backend.Prep has shipped it.
|
|
117
|
+
const printLemma = (sequent: Sequent) => {
|
|
118
|
+
const context = createContext();
|
|
119
|
+
const adjoin = (name: string) => pushName(context, pickle(name));
|
|
120
|
+
const bump = () => pushName(context, "");
|
|
121
|
+
|
|
122
|
+
// A binder's name binds in what prints inside it.
|
|
123
|
+
const withBound = (name: string, print: (bound: string) => string) => {
|
|
124
|
+
const printed = print(adjoin(name));
|
|
125
|
+
popNames(context, 1);
|
|
126
|
+
return printed;
|
|
127
|
+
};
|
|
128
|
+
|
|
129
|
+
// pp_print_expr: every expression, apart from the obligation's sequent, prints in parentheses.
|
|
130
|
+
const printExpr = (expression: Expr) => `(${formatExpr(expression)})`;
|
|
131
|
+
const delimited = (args: Expr[]) => args.map(printExpr).join(", ");
|
|
132
|
+
const nonfix = (name: string, args: Expr[]) => `(${name} (${delimited(args)}))`;
|
|
133
|
+
|
|
134
|
+
const printInternal = (builtin: Builtin, args: Expr[]): string => {
|
|
135
|
+
const atom = ATOMS[builtin];
|
|
136
|
+
if (atom !== undefined && args.length === 0) return atom;
|
|
137
|
+
const unary = UNARY[builtin];
|
|
138
|
+
if (unary !== undefined && args.length === 1) return `(${unary} ${printExpr(args[0])})`;
|
|
139
|
+
const binary = BINARY[builtin];
|
|
140
|
+
if (binary !== undefined && args.length === 2)
|
|
141
|
+
return `(${printExpr(args[0])} ${binary} ${printExpr(args[1])})`;
|
|
142
|
+
const operator = NONFIX[builtin];
|
|
143
|
+
if (operator && operator[1] === args.length) return nonfix(operator[0], args);
|
|
144
|
+
if (builtin === "Unprimable" && args.length === 1) return printExpr(args[0]);
|
|
145
|
+
// tlapm prints an irregular expression as the hash of its TLA+ text, but never makes one.
|
|
146
|
+
if (builtin === "Irregular" && args.length === 1) throw new TlaUnsupportedError("Irregular");
|
|
147
|
+
throw getUnprintableError(builtin, args.length, "Backend.Isabelle.pp_apply");
|
|
148
|
+
};
|
|
149
|
+
|
|
150
|
+
const printApply = (operator: Expr, args: Expr[]): string => {
|
|
151
|
+
switch (operator.kind) {
|
|
152
|
+
case "Ix": {
|
|
153
|
+
const name = getBoundName(context, operator.index);
|
|
154
|
+
if (operator.index <= 0 || name === undefined) throw new TlapmBugError();
|
|
155
|
+
return args.length === 0 ? name : `(${name} (${delimited(args)}))`;
|
|
156
|
+
}
|
|
157
|
+
case "Opaque": {
|
|
158
|
+
const name = pickle(operator.name);
|
|
159
|
+
return args.length === 0 ? `(${name} :: c)` : `(${name} (${delimited(args)}) :: c)`;
|
|
160
|
+
}
|
|
161
|
+
case "Internal":
|
|
162
|
+
return printInternal(operator.builtin, args);
|
|
163
|
+
// tlapm prints a lambda without the arguments it's applied to.
|
|
164
|
+
case "Lambda": {
|
|
165
|
+
const names = operator.params.map((param) => `${adjoin(param.name)} `).join("");
|
|
166
|
+
const printed = `\\<lambda> ${names}. ${printExpr(operator.body)}`;
|
|
167
|
+
popNames(context, operator.params.length);
|
|
168
|
+
return printed;
|
|
169
|
+
}
|
|
170
|
+
default:
|
|
171
|
+
throw new TlapmBugError();
|
|
172
|
+
}
|
|
173
|
+
};
|
|
174
|
+
|
|
175
|
+
const printQuant = (quantifier: "Forall" | "Exists", bounds: Bound[], body: Expr): string => {
|
|
176
|
+
if (bounds.length === 0) return formatExpr(body);
|
|
177
|
+
const split = splitFirstBound(quantifier, bounds, body);
|
|
178
|
+
const symbol = quantifier === "Forall" ? "\\<forall>" : "\\<exists>";
|
|
179
|
+
if (split.first.domain.kind === "NoDomain")
|
|
180
|
+
return withBound(split.first.name, (name) => `${symbol}${name} : ${printExpr(split.inner)}`);
|
|
181
|
+
if (split.first.domain.kind !== "Domain") throw new TlapmBugError();
|
|
182
|
+
const domain = printExpr(split.first.domain.expression);
|
|
183
|
+
return withBound(
|
|
184
|
+
split.first.name,
|
|
185
|
+
(name) => `${symbol} ${name} \\<in> ${domain} : ${printExpr(split.inner)}`,
|
|
186
|
+
);
|
|
187
|
+
};
|
|
188
|
+
|
|
189
|
+
// pp_print_sequent_inner: a sequent inside an expression, as a meta-level implication.
|
|
190
|
+
const printNestedSequent = (sequent: Sequent): string => {
|
|
191
|
+
if (sequent.context.length === 0) return printExpr(sequent.active);
|
|
192
|
+
const hyp = sequent.context[0];
|
|
193
|
+
const printRest = () =>
|
|
194
|
+
printNestedSequent({ context: sequent.context.slice(1), active: sequent.active });
|
|
195
|
+
switch (hyp.kind) {
|
|
196
|
+
case "Flex":
|
|
197
|
+
return withBound(hyp.name, (name) => `(\\<And> ${name} ${name}'.${printRest()})`);
|
|
198
|
+
case "Fresh": {
|
|
199
|
+
if (hyp.domain && hyp.domainVisibility === "Visible") {
|
|
200
|
+
const domain = printExpr(hyp.domain);
|
|
201
|
+
return withBound(
|
|
202
|
+
hyp.name,
|
|
203
|
+
(name) =>
|
|
204
|
+
`(\\<And> ${name} :: c. ${name} \\<in> ${domain} \\<Longrightarrow> ${printRest()})`,
|
|
205
|
+
);
|
|
206
|
+
}
|
|
207
|
+
const shape = `${"c => ".repeat(hyp.shape)}c`;
|
|
208
|
+
return withBound(hyp.name, (name) => `(\\<And> ${name} :: ${shape}. ${printRest()})`);
|
|
209
|
+
}
|
|
210
|
+
case "Fact": {
|
|
211
|
+
const fact = hyp.visibility === "Visible" ? printExpr(hyp.expression) : undefined;
|
|
212
|
+
bump();
|
|
213
|
+
const printed = fact ? `(${fact} \\<Longrightarrow> ${printRest()})` : printRest();
|
|
214
|
+
popNames(context, 1);
|
|
215
|
+
return printed;
|
|
216
|
+
}
|
|
217
|
+
case "Defn":
|
|
218
|
+
throw new TlaUnsupportedError("Inner definition");
|
|
219
|
+
}
|
|
220
|
+
};
|
|
221
|
+
|
|
222
|
+
const formatExpr = (expression: Expr): string => {
|
|
223
|
+
switch (expression.kind) {
|
|
224
|
+
case "Ix":
|
|
225
|
+
case "Internal":
|
|
226
|
+
case "Opaque":
|
|
227
|
+
case "Lambda":
|
|
228
|
+
return printApply(expression, []);
|
|
229
|
+
case "Apply":
|
|
230
|
+
return printApply(expression.operator, expression.args);
|
|
231
|
+
case "Bang":
|
|
232
|
+
throw new TlaProverError("Backend.Isabelle.module");
|
|
233
|
+
case "Sequent":
|
|
234
|
+
return printNestedSequent(expression.sequent);
|
|
235
|
+
case "With":
|
|
236
|
+
case "Parens":
|
|
237
|
+
return formatExpr(expression.expression);
|
|
238
|
+
case "Let":
|
|
239
|
+
throw new TlaUnsupportedError("LET");
|
|
240
|
+
case "List":
|
|
241
|
+
if (expression.bullet === "Refs" && expression.items.length === 0) return "TRUE";
|
|
242
|
+
if (expression.bullet === "Refs" && expression.items.length === 1)
|
|
243
|
+
return formatExpr(expression.items[0]);
|
|
244
|
+
return expression.items.map(printExpr).join(expression.bullet === "Or" ? " | " : " & ");
|
|
245
|
+
case "If":
|
|
246
|
+
return `cond(${printExpr(expression.condition)}, ${printExpr(expression.consequent)}, ${printExpr(expression.alternative)})`;
|
|
247
|
+
case "Quant":
|
|
248
|
+
return printQuant(expression.quantifier, expression.bounds, expression.body);
|
|
249
|
+
case "Tquant":
|
|
250
|
+
throw new TlaUnsupportedError(expression.quantifier === "Forall" ? "\\\\AA" : "\\\\EE");
|
|
251
|
+
case "Choose": {
|
|
252
|
+
if (!expression.domain)
|
|
253
|
+
return withBound(
|
|
254
|
+
expression.name,
|
|
255
|
+
(name) => `Choice(%${name}. ${printExpr(expression.body)})`,
|
|
256
|
+
);
|
|
257
|
+
const domain = printExpr(expression.domain);
|
|
258
|
+
return withBound(
|
|
259
|
+
expression.name,
|
|
260
|
+
(name) => `bChoice(${domain}, %${name}. ${printExpr(expression.body)})`,
|
|
261
|
+
);
|
|
262
|
+
}
|
|
263
|
+
case "SetSt": {
|
|
264
|
+
const domain = printExpr(expression.domain);
|
|
265
|
+
return withBound(
|
|
266
|
+
expression.name,
|
|
267
|
+
(name) => `subsetOf(${domain}, %${name}. ${printExpr(expression.body)})`,
|
|
268
|
+
);
|
|
269
|
+
}
|
|
270
|
+
case "SetOf": {
|
|
271
|
+
if (expression.bounds.length === 0) throw new TlapmBugError();
|
|
272
|
+
const bound = expression.bounds[0];
|
|
273
|
+
if (expression.bounds.length !== 1 || bound.domain.kind !== "Domain")
|
|
274
|
+
throw new TlaUnsupportedError("SetOf (multiple declared constants)");
|
|
275
|
+
const domain = printExpr(bound.domain.expression);
|
|
276
|
+
return withBound(
|
|
277
|
+
bound.name,
|
|
278
|
+
(name) => `setOfAll(${domain}, %${name}. ${printExpr(expression.element)})`,
|
|
279
|
+
);
|
|
280
|
+
}
|
|
281
|
+
case "SetEnum":
|
|
282
|
+
return `{${delimited(expression.elements)}}`;
|
|
283
|
+
case "Fcn": {
|
|
284
|
+
const bound = expression.bounds[0];
|
|
285
|
+
if (expression.bounds.length !== 1)
|
|
286
|
+
throw new TlaUnsupportedError("function (multiple declared constants)");
|
|
287
|
+
if (bound.domain.kind === "Ditto") throw new TlapmBugError();
|
|
288
|
+
const domain =
|
|
289
|
+
bound.domain.kind === "Domain" ? printExpr(bound.domain.expression) : undefined;
|
|
290
|
+
return withBound(bound.name, (name) => {
|
|
291
|
+
const printed = domain === undefined ? name : ` ${name} \\<in> ${domain} `;
|
|
292
|
+
return `[${printed} \\<mapsto> ${printExpr(expression.body)}]`;
|
|
293
|
+
});
|
|
294
|
+
}
|
|
295
|
+
case "FcnApp": {
|
|
296
|
+
const printedFunction = printExpr(expression.function);
|
|
297
|
+
return expression.args.length === 1
|
|
298
|
+
? `fapply (${printedFunction}, ${printExpr(expression.args[0])})`
|
|
299
|
+
: `fapply (${printedFunction}, <<${delimited(expression.args)}>>)`;
|
|
300
|
+
}
|
|
301
|
+
case "Arrow":
|
|
302
|
+
return `[${printExpr(expression.domain)} \\<rightarrow> ${printExpr(expression.range)}]`;
|
|
303
|
+
case "Rect":
|
|
304
|
+
return `[${expression.fields.map((field) => `''${field.name}'' : ${printExpr(field.value)}`).join(", ")}]`;
|
|
305
|
+
case "Record":
|
|
306
|
+
return `(${expression.fields.map((field) => `(''${field.name}'' :> ${printExpr(field.value)})`).join(" @@ ")})`;
|
|
307
|
+
case "Except": {
|
|
308
|
+
const specs = expression.specs.map((spec) => {
|
|
309
|
+
const trail = spec.trail
|
|
310
|
+
.map((point) =>
|
|
311
|
+
point.kind === "Dot" ? `[''${point.field}'']` : `[${printExpr(point.expression)}]`,
|
|
312
|
+
)
|
|
313
|
+
.join("");
|
|
314
|
+
return `!${trail} = ${printExpr(spec.value)}`;
|
|
315
|
+
});
|
|
316
|
+
return `[${printExpr(expression.function)} EXCEPT ${specs.join(", ")}]`;
|
|
317
|
+
}
|
|
318
|
+
case "Dot":
|
|
319
|
+
return `fapply (${printExpr(expression.expression)}, (''${expression.field}''))`;
|
|
320
|
+
case "Tuple":
|
|
321
|
+
return `<<${delimited(expression.elements)}>>`;
|
|
322
|
+
case "Product":
|
|
323
|
+
return expression.factors.length === 2
|
|
324
|
+
? `(${printExpr(expression.factors[0])} \\<times> ${printExpr(expression.factors[1])})`
|
|
325
|
+
: `Product(\\<langle>${delimited(expression.factors)}\\<rangle>)`;
|
|
326
|
+
case "Sub":
|
|
327
|
+
case "Tsub": {
|
|
328
|
+
const suffix = expression.kind === "Sub" ? "sub" : "tsub";
|
|
329
|
+
const name = expression.modal === "Box" ? cook(`a'box'${suffix}`) : `a'dia'${suffix}`;
|
|
330
|
+
return `${name}(${printExpr(expression.action)},${printExpr(expression.subscript)})`;
|
|
331
|
+
}
|
|
332
|
+
case "Fair":
|
|
333
|
+
return `${cook(expression.fairness === "Weak" ? "a'wf" : "a'sf")}(${printExpr(expression.subscript)},${printExpr(expression.action)})`;
|
|
334
|
+
case "Case": {
|
|
335
|
+
const conditions = delimited(expression.arms.map((arm) => arm.condition));
|
|
336
|
+
const bodies = delimited(expression.arms.map((arm) => arm.body));
|
|
337
|
+
return expression.other
|
|
338
|
+
? `CaseOther(<<${conditions}>>,<<${bodies}>>,${printExpr(expression.other)})`
|
|
339
|
+
: `Case(<<${conditions}>>,<<${bodies}>>)`;
|
|
340
|
+
}
|
|
341
|
+
case "String":
|
|
342
|
+
return `''${expression.value}''`;
|
|
343
|
+
case "Num":
|
|
344
|
+
if (expression.fraction !== "") throw new TlaUnsupportedError("real constants");
|
|
345
|
+
return `(${getSuccessors(expression.integer)})`;
|
|
346
|
+
case "At":
|
|
347
|
+
throw new TlapmBugError();
|
|
348
|
+
}
|
|
349
|
+
};
|
|
350
|
+
|
|
351
|
+
// pp_print_sequent_outer: the obligation's sequent as the lines of a lemma's fixes, assumes and
|
|
352
|
+
// shows. A pragma's definition ends it with an empty line in place of the goal.
|
|
353
|
+
const printSequent = (sequent: Sequent) => {
|
|
354
|
+
const lines: string[] = [];
|
|
355
|
+
for (const hyp of sequent.context) {
|
|
356
|
+
switch (hyp.kind) {
|
|
357
|
+
case "Flex": {
|
|
358
|
+
const name = adjoin(hyp.name);
|
|
359
|
+
lines.push(`fixes ${name} ${name}'`);
|
|
360
|
+
break;
|
|
361
|
+
}
|
|
362
|
+
case "Fresh": {
|
|
363
|
+
const domain =
|
|
364
|
+
hyp.domain && hyp.domainVisibility === "Visible" ? printExpr(hyp.domain) : undefined;
|
|
365
|
+
const name = adjoin(hyp.name);
|
|
366
|
+
lines.push(`fixes ${name}`);
|
|
367
|
+
if (domain === undefined) break;
|
|
368
|
+
lines.push(`assumes ${name}_in : "(${name} \\<in> ${domain})"`);
|
|
369
|
+
break;
|
|
370
|
+
}
|
|
371
|
+
case "Fact": {
|
|
372
|
+
const count = context.stack.length;
|
|
373
|
+
const fact =
|
|
374
|
+
hyp.visibility === "Visible"
|
|
375
|
+
? printFact(context, () => printExpr(hyp.expression))
|
|
376
|
+
: undefined;
|
|
377
|
+
bump();
|
|
378
|
+
if (fact instanceof TlaUnsupportedError) {
|
|
379
|
+
lines.push(`(* omitted temporal assumption : ${fact.message} *)`);
|
|
380
|
+
break;
|
|
381
|
+
}
|
|
382
|
+
if (fact === undefined) break;
|
|
383
|
+
lines.push(`assumes v'${count}: "${fact}"`);
|
|
384
|
+
break;
|
|
385
|
+
}
|
|
386
|
+
case "Defn":
|
|
387
|
+
if (hyp.definition.kind === "Bpragma") return [...lines, ""];
|
|
388
|
+
lines.push(`(* usable definition ${hyp.definition.name} suppressed *)`);
|
|
389
|
+
adjoin(hyp.definition.name);
|
|
390
|
+
break;
|
|
391
|
+
}
|
|
392
|
+
}
|
|
393
|
+
return [...lines, `shows "${printExpr(sequent.active)}"`];
|
|
394
|
+
};
|
|
395
|
+
|
|
396
|
+
try {
|
|
397
|
+
const lines = printSequent(sequent);
|
|
398
|
+
return {
|
|
399
|
+
text: lines.join("\n"),
|
|
400
|
+
isAssumed: lines.some((line) => line.startsWith("assumes ")),
|
|
401
|
+
};
|
|
402
|
+
} catch (error) {
|
|
403
|
+
if (!(error instanceof TlaUnsupportedError)) throw error;
|
|
404
|
+
throw new TlaProverError(`isabelle : unsupported operator ${error.message}`);
|
|
405
|
+
}
|
|
406
|
+
};
|
|
407
|
+
|
|
408
|
+
// thy_temp: the theory tlapm writes for Isabelle to prove obligation id.
|
|
409
|
+
export const encodeIsabelle = (id: number, sequent: Sequent, tactic: string): string => {
|
|
410
|
+
const lemma = printLemma(sequent);
|
|
411
|
+
return [
|
|
412
|
+
...getTheoryHeader(`tlapm_${id}`, false),
|
|
413
|
+
`lemma ob'${id}:`,
|
|
414
|
+
`${lemma.text}(is "PROP ?ob'${id}")`,
|
|
415
|
+
"proof -",
|
|
416
|
+
`show "PROP ?ob'${id}"`,
|
|
417
|
+
`${lemma.isAssumed ? "using assms " : ""}by ${tactic}`,
|
|
418
|
+
"qed",
|
|
419
|
+
"end",
|
|
420
|
+
"",
|
|
421
|
+
].join("\n");
|
|
422
|
+
};
|
|
423
|
+
|
|
424
|
+
interface IsabelleProof {
|
|
425
|
+
id: number;
|
|
426
|
+
sequent: Sequent;
|
|
427
|
+
tactic: string;
|
|
428
|
+
}
|
|
429
|
+
|
|
430
|
+
// Isabelle.thy_init, thy_write and thy_close.
|
|
431
|
+
export const encodeIsabelleTheory = (name: string, proofs: IsabelleProof[]) =>
|
|
432
|
+
[
|
|
433
|
+
...getTheoryHeader(name, true),
|
|
434
|
+
...proofs.flatMap((proof) => [
|
|
435
|
+
`lemma ob'${proof.id}:`,
|
|
436
|
+
`${printLemma(proof.sequent).text}(is "PROP ?ob'${proof.id}")`,
|
|
437
|
+
"proof -",
|
|
438
|
+
`ML_command \\<open> writeln "*** TLAPS ENTER ${proof.id}"; \\<close>`,
|
|
439
|
+
`show "PROP ?ob'${proof.id}"`,
|
|
440
|
+
`using assms by ${proof.tactic}`,
|
|
441
|
+
`ML_command \\<open> writeln "*** TLAPS EXIT ${proof.id}"; \\<close> qed`,
|
|
442
|
+
]),
|
|
443
|
+
"end",
|
|
444
|
+
"",
|
|
445
|
+
].join("\n");
|