tla-ts 0.0.4-dev.a297123 → 0.0.4-dev.b254db0
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 +33 -143
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +35 -1
- package/dist/index.d.ts +35 -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-cli.cjs +37 -47
- package/dist/run-cli.js +37 -47
- 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/check.ts +1 -0
- package/src/codegen.ts +5 -3
- package/src/errors.ts +86 -0
- package/src/evaluate.ts +54 -19
- package/src/index.ts +10 -0
- package/src/{obligation-action.ts → obligations/action.ts} +265 -55
- package/src/{obligation-anon.ts → obligations/anon.ts} +47 -37
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +38 -61
- package/src/{obligation-expression.ts → obligations/expression.ts} +78 -45
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +147 -74
- package/src/{obligations.ts → obligations/index.ts} +29 -13
- package/src/{obligation-levels.ts → obligations/levels.ts} +14 -5
- package/src/{obligation-module.ts → obligations/module.ts} +56 -33
- 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 -1
- package/src/{obligation-source.ts → obligations/source.ts} +159 -97
- package/src/obligations/temporal.ts +319 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
- package/src/ocaml-marshal.ts +166 -0
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +100 -0
- package/src/prove/deciders.ts +33 -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 +503 -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 +547 -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 +441 -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 +363 -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 +402 -0
- package/src/prove/isabelle/pure/name.ts +110 -0
- package/src/prove/isabelle/pure/net.ts +262 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +650 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +353 -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 +156 -0
- package/src/prove/isabelle/pure/simplifier.ts +112 -0
- package/src/prove/isabelle/pure/table.ts +208 -0
- package/src/prove/isabelle/pure/tactic.ts +276 -0
- package/src/prove/isabelle/pure/tactical.ts +347 -0
- package/src/prove/isabelle/pure/term-ord.ts +159 -0
- package/src/prove/isabelle/pure/term.ts +808 -0
- package/src/prove/isabelle/pure/thm.ts +806 -0
- package/src/prove/isabelle/pure/type.ts +133 -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 +521 -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 +557 -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 +25 -0
- package/src/prove/prove.ts +505 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +256 -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 +222 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +636 -0
- package/src/prove/smt/encode.ts +166 -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 +182 -0
- package/src/prove/smt/rewrite.ts +773 -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 +147 -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 +656 -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 +740 -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/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 +437 -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 +181 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/run-cli.ts +334 -75
- package/src/standard-modules.ts +5 -2
- package/src/successors.ts +24 -5
- package/src/tlapm-cache.ts +236 -0
- package/src/tlc-random.ts +55 -32
- package/src/tlc-version.ts +8 -7
- package/src/values.ts +80 -35
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
|
@@ -0,0 +1,25 @@
|
|
|
1
|
+
// Ported from Isabelle2025's Pure/variable.ML, the import and export of schematic variables.
|
|
2
|
+
// Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and
|
|
3
|
+
// contributors, see LICENSE.
|
|
4
|
+
|
|
5
|
+
import { variantList } from "./name";
|
|
6
|
+
import { addFreeNames, addVars, mkFree, type Var } from "./term";
|
|
7
|
+
import { generalize, instantiate, type Thm } from "./thm";
|
|
8
|
+
|
|
9
|
+
// Variable.trade with import true: fixes the schematic variables of a theorem as fresh free ones,
|
|
10
|
+
// derives theorems from it, and makes those variables schematic again.
|
|
11
|
+
export const trade = (derive: (thm: Thm) => readonly Thm[], thm: Thm): Thm[] => {
|
|
12
|
+
const vars = addVars(thm.prop, [] as Var[]);
|
|
13
|
+
const names = variantList(
|
|
14
|
+
thm.hyps.reduce((used, hyp) => addFreeNames(hyp, used), addFreeNames(thm.prop, [])),
|
|
15
|
+
vars.map((variable) => variable.name),
|
|
16
|
+
);
|
|
17
|
+
const derived = derive(
|
|
18
|
+
instantiate(
|
|
19
|
+
vars.map((variable, index) => ({ variable, term: mkFree(names[index], variable.type) })),
|
|
20
|
+
thm,
|
|
21
|
+
),
|
|
22
|
+
);
|
|
23
|
+
const index = derived.reduce((maxidx, result) => Math.max(maxidx, result.maxidx), thm.maxidx) + 1;
|
|
24
|
+
return derived.map((result) => generalize(names, index, result));
|
|
25
|
+
};
|
|
@@ -0,0 +1,101 @@
|
|
|
1
|
+
// The classical reasoner and hypsubst as PredicateLogic.thy and SetTheory.thy of Isabelle/TLA+
|
|
2
|
+
// instantiate them (BSD licensed, see LICENSE): the Hypsubst and Classical functor arguments, the
|
|
3
|
+
// claset with its nets as the reference heap orders them, and SetTheory's bspec wrapper.
|
|
4
|
+
|
|
5
|
+
import { TlaIsabelleError } from "../../../errors";
|
|
6
|
+
import { emptyNet } from "../pure/net";
|
|
7
|
+
import { thenGoal, type GoalTactic } from "../pure/tactical";
|
|
8
|
+
import type { Limits } from "../pure/interrupt";
|
|
9
|
+
import {
|
|
10
|
+
assumeTac,
|
|
11
|
+
dresolveTac,
|
|
12
|
+
insertTaggedBrl,
|
|
13
|
+
type NetPair,
|
|
14
|
+
type TaggedRule,
|
|
15
|
+
} from "../pure/tactic";
|
|
16
|
+
import type { Term } from "../pure/term";
|
|
17
|
+
import type { Thm } from "../pure/thm";
|
|
18
|
+
import { addbefore, type Claset, type ClassicalData } from "../provers/classical";
|
|
19
|
+
import { hypSubstTac, type HypsubstData } from "../provers/hypsubst";
|
|
20
|
+
import type { LogicNetItem, LogicNetPair, TlaLogic } from "./logic";
|
|
21
|
+
|
|
22
|
+
export const getFact = (logic: TlaLogic, name: string): Thm => {
|
|
23
|
+
const thms = logic.facts.get(name);
|
|
24
|
+
if (thms === undefined || thms.length !== 1)
|
|
25
|
+
throw new TlaIsabelleError("ERROR", `Undefined fact: ${name}`);
|
|
26
|
+
return thms[0];
|
|
27
|
+
};
|
|
28
|
+
|
|
29
|
+
const destBinary = (name: string, term: Term): [Term, Term] => {
|
|
30
|
+
if (
|
|
31
|
+
term.kind === "App" &&
|
|
32
|
+
term.fun.kind === "App" &&
|
|
33
|
+
term.fun.fun.kind === "Const" &&
|
|
34
|
+
term.fun.fun.name === name
|
|
35
|
+
)
|
|
36
|
+
return [term.fun.arg, term.arg];
|
|
37
|
+
throw new TlaIsabelleError("TERM", `dest ${name}`);
|
|
38
|
+
};
|
|
39
|
+
|
|
40
|
+
export const destTrueprop = (term: Term): Term => {
|
|
41
|
+
if (
|
|
42
|
+
term.kind === "App" &&
|
|
43
|
+
term.fun.kind === "Const" &&
|
|
44
|
+
term.fun.name === "PredicateLogic.Trueprop"
|
|
45
|
+
)
|
|
46
|
+
return term.arg;
|
|
47
|
+
throw new TlaIsabelleError("TERM", "dest_Trueprop");
|
|
48
|
+
};
|
|
49
|
+
|
|
50
|
+
export const getHypsubstData = (logic: TlaLogic): HypsubstData => ({
|
|
51
|
+
destTrueprop,
|
|
52
|
+
destEq: (term) => destBinary("PredicateLogic.eq", term),
|
|
53
|
+
destImp: (term) => destBinary("PredicateLogic.imp", term),
|
|
54
|
+
eqReflection: getFact(logic, "PredicateLogic.eq_reflection"),
|
|
55
|
+
revEqReflection: getFact(logic, "PredicateLogic.meta_to_obj_eq"),
|
|
56
|
+
impIntr: getFact(logic, "PredicateLogic.impI"),
|
|
57
|
+
revMp: getFact(logic, "PredicateLogic.rev_mp"),
|
|
58
|
+
subst: getFact(logic, "PredicateLogic.subst"),
|
|
59
|
+
sym: getFact(logic, "PredicateLogic.sym"),
|
|
60
|
+
thinRefl: getFact(logic, "PredicateLogic.thin_refl"),
|
|
61
|
+
});
|
|
62
|
+
|
|
63
|
+
export const getClassicalData = (logic: TlaLogic): ClassicalData => {
|
|
64
|
+
const hypsubst = getHypsubstData(logic);
|
|
65
|
+
return {
|
|
66
|
+
impElim: getFact(logic, "PredicateLogic.impCE'"),
|
|
67
|
+
notElim: getFact(logic, "PredicateLogic.notE"),
|
|
68
|
+
swap: getFact(logic, "PredicateLogic.swap"),
|
|
69
|
+
classical: getFact(logic, "PredicateLogic.classical"),
|
|
70
|
+
judgment: "PredicateLogic.Trueprop",
|
|
71
|
+
hypSubstTacs: [(limits: Limits) => hypSubstTac({ limits, data: hypsubst })],
|
|
72
|
+
};
|
|
73
|
+
};
|
|
74
|
+
|
|
75
|
+
// Net.content lists a leaf's items newest first, so inserting them in reverse rebuilds the leaf.
|
|
76
|
+
const toNetPair = (pair: LogicNetPair<LogicNetItem>): NetPair<TaggedRule> => {
|
|
77
|
+
const insertAll = (items: readonly LogicNetItem[], netpair: NetPair<TaggedRule>) =>
|
|
78
|
+
items.reduceRight((result, item) => insertTaggedBrl(item, result), netpair);
|
|
79
|
+
return insertAll(pair.elim, insertAll(pair.intro, { intro: emptyNet, elim: emptyNet }));
|
|
80
|
+
};
|
|
81
|
+
|
|
82
|
+
export const getClaset = (logic: TlaLogic, limits: Limits): Claset => {
|
|
83
|
+
const claset: Claset = {
|
|
84
|
+
safeIs: logic.claset.safeIs,
|
|
85
|
+
safeEs: logic.claset.safeEs,
|
|
86
|
+
unsafeIs: logic.claset.unsafeIs,
|
|
87
|
+
unsafeEs: logic.claset.unsafeEs,
|
|
88
|
+
swrappers: [],
|
|
89
|
+
uwrappers: [],
|
|
90
|
+
safe0: toNetPair(logic.claset.safe0),
|
|
91
|
+
safep: toNetPair(logic.claset.safep),
|
|
92
|
+
unsafe: toNetPair(logic.claset.unsafe),
|
|
93
|
+
dup: toNetPair(logic.claset.dup),
|
|
94
|
+
};
|
|
95
|
+
// SetTheory.thy: ctxt addbefore ("bspec", fn ctxt' => dresolve_tac ctxt' @{thms bspec} THEN' assume_tac ctxt')
|
|
96
|
+
const bspec: GoalTactic = thenGoal(
|
|
97
|
+
dresolveTac(limits, [getFact(logic, "SetTheory.bspec")]),
|
|
98
|
+
assumeTac(limits),
|
|
99
|
+
);
|
|
100
|
+
return addbefore(claset, "bspec", bspec);
|
|
101
|
+
};
|
|
@@ -0,0 +1,74 @@
|
|
|
1
|
+
// The proof context of a theory tlapm writes, as the Isabelle/TLA+ heap sets it up: its simpset,
|
|
2
|
+
// claset, context rules and atomize rules, and Blast instantiated as PredicateLogic.thy does.
|
|
3
|
+
|
|
4
|
+
import { TlaIsabelleError } from "../../../errors";
|
|
5
|
+
import type { ProofContext } from "../isar/method";
|
|
6
|
+
import { emptyNet } from "../pure/net";
|
|
7
|
+
import type { Limits } from "../pure/interrupt";
|
|
8
|
+
import { insertTaggedBrl, type NetPair } from "../pure/tactic";
|
|
9
|
+
import { blastDepthTac, blastTac, type BlastContext } from "../provers/blast/blast";
|
|
10
|
+
import type { ClassicalContext } from "../provers/classical";
|
|
11
|
+
import { blastHypSubstTac } from "../provers/hypsubst";
|
|
12
|
+
import type { ContextRule } from "../tools/intuitionistic";
|
|
13
|
+
import { getClaset, getClassicalData, getFact, getHypsubstData } from "./classical-setup";
|
|
14
|
+
import type { LogicExtraNetItem, LogicNetPair, TlaLogic } from "./logic";
|
|
15
|
+
import { getSimpset } from "./simpdata";
|
|
16
|
+
|
|
17
|
+
// The atomize rules, newest first as Object_Logic keeps them.
|
|
18
|
+
const ATOMIZE_RULES = [
|
|
19
|
+
"Zenon.atomize_object_bAll",
|
|
20
|
+
"Zenon.atomize_meta_bAll",
|
|
21
|
+
"PredicateLogic.atomize_conj",
|
|
22
|
+
"PredicateLogic.atomize_eq",
|
|
23
|
+
"PredicateLogic.atomize_not",
|
|
24
|
+
"PredicateLogic.atomize_imp",
|
|
25
|
+
"PredicateLogic.atomize_all",
|
|
26
|
+
];
|
|
27
|
+
|
|
28
|
+
// Net.content lists a leaf's items newest first, so inserting them in reverse rebuilds the leaf.
|
|
29
|
+
const toNetPair = (pair: LogicNetPair<LogicExtraNetItem>): NetPair<ContextRule> => {
|
|
30
|
+
const insertAll = (items: readonly LogicExtraNetItem[], netpair: NetPair<ContextRule>) =>
|
|
31
|
+
items.reduceRight((result, item) => insertTaggedBrl(item, result), netpair);
|
|
32
|
+
return insertAll(pair.elim, insertAll(pair.intro, { intro: emptyNet, elim: emptyNet }));
|
|
33
|
+
};
|
|
34
|
+
|
|
35
|
+
export const getProofContext = (logic: TlaLogic, limits: Limits): ProofContext => {
|
|
36
|
+
const atomizeRules = ATOMIZE_RULES.map((name) => getFact(logic, name));
|
|
37
|
+
const classical = { limits, claset: getClaset(logic, limits), data: getClassicalData(logic) };
|
|
38
|
+
const hypsubst = getHypsubstData(logic);
|
|
39
|
+
const toBlastContext = (context: ClassicalContext): BlastContext => ({
|
|
40
|
+
limits: context.limits,
|
|
41
|
+
claset: context.claset,
|
|
42
|
+
consts: logic.consts,
|
|
43
|
+
elimTemplates: new WeakMap(),
|
|
44
|
+
introTemplates: new WeakMap(),
|
|
45
|
+
data: {
|
|
46
|
+
trueprop: "PredicateLogic.Trueprop",
|
|
47
|
+
equalityName: "PredicateLogic.eq",
|
|
48
|
+
notName: "PredicateLogic.not",
|
|
49
|
+
notE: getFact(logic, "PredicateLogic.notE"),
|
|
50
|
+
ccontr: getFact(logic, "PredicateLogic.contradiction"),
|
|
51
|
+
hypSubstTac: (blastLimits) => blastHypSubstTac({ limits: blastLimits, data: hypsubst }),
|
|
52
|
+
classical: getFact(logic, "PredicateLogic.classical"),
|
|
53
|
+
atomize: atomizeRules,
|
|
54
|
+
},
|
|
55
|
+
});
|
|
56
|
+
return {
|
|
57
|
+
limits,
|
|
58
|
+
simpset: getSimpset(logic),
|
|
59
|
+
classical,
|
|
60
|
+
intuitionistic: {
|
|
61
|
+
limits,
|
|
62
|
+
safeRules: toNetPair(logic.contextRules.bang),
|
|
63
|
+
rules: toNetPair(logic.contextRules.plain),
|
|
64
|
+
},
|
|
65
|
+
atomizeRules,
|
|
66
|
+
blastDepthTac: (context, limit) => blastDepthTac(toBlastContext(context), limit),
|
|
67
|
+
blastTac: (context) => blastTac(toBlastContext(context)),
|
|
68
|
+
getFact: (name) => {
|
|
69
|
+
const facts = logic.facts.get(logic.factNames.get(name) ?? name);
|
|
70
|
+
if (facts === undefined) throw new TlaIsabelleError("ERROR", `Undefined fact: ${name}`);
|
|
71
|
+
return facts;
|
|
72
|
+
},
|
|
73
|
+
};
|
|
74
|
+
};
|