@stevenvo780/st-lang 4.2.0 → 4.4.0
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/dist/index.d.ts +8 -0
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +70 -1
- package/dist/index.js.map +1 -1
- package/dist/lambda-calc/church.d.ts +8 -0
- package/dist/lambda-calc/church.d.ts.map +1 -0
- package/dist/lambda-calc/church.js +67 -0
- package/dist/lambda-calc/church.js.map +1 -0
- package/dist/lambda-calc/combinators.d.ts +8 -0
- package/dist/lambda-calc/combinators.d.ts.map +1 -0
- package/dist/lambda-calc/combinators.js +24 -0
- package/dist/lambda-calc/combinators.js.map +1 -0
- package/dist/lambda-calc/index.d.ts +8 -0
- package/dist/lambda-calc/index.d.ts.map +1 -0
- package/dist/lambda-calc/index.js +48 -0
- package/dist/lambda-calc/index.js.map +1 -0
- package/dist/lambda-calc/reduce.d.ts +18 -0
- package/dist/lambda-calc/reduce.d.ts.map +1 -0
- package/dist/lambda-calc/reduce.js +174 -0
- package/dist/lambda-calc/reduce.js.map +1 -0
- package/dist/lambda-calc/substitution.d.ts +6 -0
- package/dist/lambda-calc/substitution.d.ts.map +1 -0
- package/dist/lambda-calc/substitution.js +120 -0
- package/dist/lambda-calc/substitution.js.map +1 -0
- package/dist/lambda-calc/types.d.ts +19 -0
- package/dist/lambda-calc/types.d.ts.map +1 -0
- package/dist/lambda-calc/types.js +72 -0
- package/dist/lambda-calc/types.js.map +1 -0
- package/dist/mltt/equality.d.ts +9 -0
- package/dist/mltt/equality.d.ts.map +1 -0
- package/dist/mltt/equality.js +79 -0
- package/dist/mltt/equality.js.map +1 -0
- package/dist/mltt/index.d.ts +8 -0
- package/dist/mltt/index.d.ts.map +1 -0
- package/dist/mltt/index.js +49 -0
- package/dist/mltt/index.js.map +1 -0
- package/dist/mltt/infer.d.ts +17 -0
- package/dist/mltt/infer.d.ts.map +1 -0
- package/dist/mltt/infer.js +269 -0
- package/dist/mltt/infer.js.map +1 -0
- package/dist/mltt/normalize.d.ts +7 -0
- package/dist/mltt/normalize.d.ts.map +1 -0
- package/dist/mltt/normalize.js +131 -0
- package/dist/mltt/normalize.js.map +1 -0
- package/dist/mltt/substitute.d.ts +4 -0
- package/dist/mltt/substitute.d.ts.map +1 -0
- package/dist/mltt/substitute.js +94 -0
- package/dist/mltt/substitute.js.map +1 -0
- package/dist/mltt/types.d.ts +72 -0
- package/dist/mltt/types.d.ts.map +1 -0
- package/dist/mltt/types.js +211 -0
- package/dist/mltt/types.js.map +1 -0
- package/dist/profiles/intuitionistic-nj/formula.d.ts +19 -0
- package/dist/profiles/intuitionistic-nj/formula.d.ts.map +1 -0
- package/dist/profiles/intuitionistic-nj/formula.js +99 -0
- package/dist/profiles/intuitionistic-nj/formula.js.map +1 -0
- package/dist/profiles/intuitionistic-nj/index.d.ts +5 -0
- package/dist/profiles/intuitionistic-nj/index.d.ts.map +1 -0
- package/dist/profiles/intuitionistic-nj/index.js +24 -0
- package/dist/profiles/intuitionistic-nj/index.js.map +1 -0
- package/dist/profiles/intuitionistic-nj/kripke.d.ts +17 -0
- package/dist/profiles/intuitionistic-nj/kripke.d.ts.map +1 -0
- package/dist/profiles/intuitionistic-nj/kripke.js +206 -0
- package/dist/profiles/intuitionistic-nj/kripke.js.map +1 -0
- package/dist/profiles/intuitionistic-nj/prover.d.ts +13 -0
- package/dist/profiles/intuitionistic-nj/prover.d.ts.map +1 -0
- package/dist/profiles/intuitionistic-nj/prover.js +418 -0
- package/dist/profiles/intuitionistic-nj/prover.js.map +1 -0
- package/dist/profiles/intuitionistic-nj/types.d.ts +55 -0
- package/dist/profiles/intuitionistic-nj/types.d.ts.map +1 -0
- package/dist/profiles/intuitionistic-nj/types.js +21 -0
- package/dist/profiles/intuitionistic-nj/types.js.map +1 -0
- package/dist/profiles/many-valued/index.d.ts +39 -0
- package/dist/profiles/many-valued/index.d.ts.map +1 -0
- package/dist/profiles/many-valued/index.js +250 -0
- package/dist/profiles/many-valued/index.js.map +1 -0
- package/dist/profiles/modal-frame-axioms/formula.d.ts +23 -0
- package/dist/profiles/modal-frame-axioms/formula.d.ts.map +1 -0
- package/dist/profiles/modal-frame-axioms/formula.js +158 -0
- package/dist/profiles/modal-frame-axioms/formula.js.map +1 -0
- package/dist/profiles/modal-frame-axioms/index.d.ts +6 -0
- package/dist/profiles/modal-frame-axioms/index.d.ts.map +1 -0
- package/dist/profiles/modal-frame-axioms/index.js +41 -0
- package/dist/profiles/modal-frame-axioms/index.js.map +1 -0
- package/dist/profiles/modal-frame-axioms/systems.d.ts +29 -0
- package/dist/profiles/modal-frame-axioms/systems.d.ts.map +1 -0
- package/dist/profiles/modal-frame-axioms/systems.js +96 -0
- package/dist/profiles/modal-frame-axioms/systems.js.map +1 -0
- package/dist/profiles/modal-frame-axioms/tableau.d.ts +12 -0
- package/dist/profiles/modal-frame-axioms/tableau.d.ts.map +1 -0
- package/dist/profiles/modal-frame-axioms/tableau.js +299 -0
- package/dist/profiles/modal-frame-axioms/tableau.js.map +1 -0
- package/dist/profiles/modal-frame-axioms/types.d.ts +61 -0
- package/dist/profiles/modal-frame-axioms/types.d.ts.map +1 -0
- package/dist/profiles/modal-frame-axioms/types.js +27 -0
- package/dist/profiles/modal-frame-axioms/types.js.map +1 -0
- package/dist/profiles/mu-calculus/check.d.ts +15 -0
- package/dist/profiles/mu-calculus/check.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/check.js +172 -0
- package/dist/profiles/mu-calculus/check.js.map +1 -0
- package/dist/profiles/mu-calculus/ctl-translate.d.ts +61 -0
- package/dist/profiles/mu-calculus/ctl-translate.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/ctl-translate.js +181 -0
- package/dist/profiles/mu-calculus/ctl-translate.js.map +1 -0
- package/dist/profiles/mu-calculus/index.d.ts +7 -0
- package/dist/profiles/mu-calculus/index.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/index.js +33 -0
- package/dist/profiles/mu-calculus/index.js.map +1 -0
- package/dist/profiles/mu-calculus/types.d.ts +51 -0
- package/dist/profiles/mu-calculus/types.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/types.js +42 -0
- package/dist/profiles/mu-calculus/types.js.map +1 -0
- package/dist/profiles/mu-calculus/wellformed.d.ts +40 -0
- package/dist/profiles/mu-calculus/wellformed.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/wellformed.js +160 -0
- package/dist/profiles/mu-calculus/wellformed.js.map +1 -0
- package/dist/profiles/sequent-lk/cut-elimination.d.ts +11 -0
- package/dist/profiles/sequent-lk/cut-elimination.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/cut-elimination.js +216 -0
- package/dist/profiles/sequent-lk/cut-elimination.js.map +1 -0
- package/dist/profiles/sequent-lk/index.d.ts +5 -0
- package/dist/profiles/sequent-lk/index.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/index.js +24 -0
- package/dist/profiles/sequent-lk/index.js.map +1 -0
- package/dist/profiles/sequent-lk/prover.d.ts +25 -0
- package/dist/profiles/sequent-lk/prover.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/prover.js +532 -0
- package/dist/profiles/sequent-lk/prover.js.map +1 -0
- package/dist/profiles/sequent-lk/types.d.ts +55 -0
- package/dist/profiles/sequent-lk/types.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/types.js +18 -0
- package/dist/profiles/sequent-lk/types.js.map +1 -0
- package/dist/profiles/sequent-lk/util.d.ts +18 -0
- package/dist/profiles/sequent-lk/util.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/util.js +71 -0
- package/dist/profiles/sequent-lk/util.js.map +1 -0
- package/dist/profiles/substructural/index.d.ts +4 -0
- package/dist/profiles/substructural/index.d.ts.map +1 -0
- package/dist/profiles/substructural/index.js +22 -0
- package/dist/profiles/substructural/index.js.map +1 -0
- package/dist/profiles/substructural/prover.d.ts +13 -0
- package/dist/profiles/substructural/prover.d.ts.map +1 -0
- package/dist/profiles/substructural/prover.js +481 -0
- package/dist/profiles/substructural/prover.js.map +1 -0
- package/dist/profiles/substructural/types.d.ts +72 -0
- package/dist/profiles/substructural/types.d.ts.map +1 -0
- package/dist/profiles/substructural/types.js +27 -0
- package/dist/profiles/substructural/types.js.map +1 -0
- package/dist/refinement-types/checker.d.ts +19 -0
- package/dist/refinement-types/checker.d.ts.map +1 -0
- package/dist/refinement-types/checker.js +248 -0
- package/dist/refinement-types/checker.js.map +1 -0
- package/dist/refinement-types/index.d.ts +11 -0
- package/dist/refinement-types/index.d.ts.map +1 -0
- package/dist/refinement-types/index.js +51 -0
- package/dist/refinement-types/index.js.map +1 -0
- package/dist/refinement-types/predicate.d.ts +31 -0
- package/dist/refinement-types/predicate.d.ts.map +1 -0
- package/dist/refinement-types/predicate.js +369 -0
- package/dist/refinement-types/predicate.js.map +1 -0
- package/dist/refinement-types/solver.d.ts +24 -0
- package/dist/refinement-types/solver.d.ts.map +1 -0
- package/dist/refinement-types/solver.js +207 -0
- package/dist/refinement-types/solver.js.map +1 -0
- package/dist/refinement-types/subtype.d.ts +14 -0
- package/dist/refinement-types/subtype.d.ts.map +1 -0
- package/dist/refinement-types/subtype.js +39 -0
- package/dist/refinement-types/subtype.js.map +1 -0
- package/dist/refinement-types/types.d.ts +64 -0
- package/dist/refinement-types/types.d.ts.map +1 -0
- package/dist/refinement-types/types.js +130 -0
- package/dist/refinement-types/types.js.map +1 -0
- package/dist/runtime/abduction/entails.d.ts +21 -0
- package/dist/runtime/abduction/entails.d.ts.map +1 -0
- package/dist/runtime/abduction/entails.js +308 -0
- package/dist/runtime/abduction/entails.js.map +1 -0
- package/dist/runtime/abduction/find.d.ts +18 -0
- package/dist/runtime/abduction/find.d.ts.map +1 -0
- package/dist/runtime/abduction/find.js +202 -0
- package/dist/runtime/abduction/find.js.map +1 -0
- package/dist/runtime/abduction/index.d.ts +4 -0
- package/dist/runtime/abduction/index.d.ts.map +1 -0
- package/dist/runtime/abduction/index.js +26 -0
- package/dist/runtime/abduction/index.js.map +1 -0
- package/dist/runtime/abduction/types.d.ts +78 -0
- package/dist/runtime/abduction/types.d.ts.map +1 -0
- package/dist/runtime/abduction/types.js +23 -0
- package/dist/runtime/abduction/types.js.map +1 -0
- package/dist/runtime/anti-unification/anti-unify.d.ts +22 -0
- package/dist/runtime/anti-unification/anti-unify.d.ts.map +1 -0
- package/dist/runtime/anti-unification/anti-unify.js +154 -0
- package/dist/runtime/anti-unification/anti-unify.js.map +1 -0
- package/dist/runtime/anti-unification/index.d.ts +6 -0
- package/dist/runtime/anti-unification/index.d.ts.map +1 -0
- package/dist/runtime/anti-unification/index.js +23 -0
- package/dist/runtime/anti-unification/index.js.map +1 -0
- package/dist/runtime/anti-unification/many.d.ts +49 -0
- package/dist/runtime/anti-unification/many.d.ts.map +1 -0
- package/dist/runtime/anti-unification/many.js +185 -0
- package/dist/runtime/anti-unification/many.js.map +1 -0
- package/dist/runtime/anti-unification/term-utils.d.ts +40 -0
- package/dist/runtime/anti-unification/term-utils.d.ts.map +1 -0
- package/dist/runtime/anti-unification/term-utils.js +173 -0
- package/dist/runtime/anti-unification/term-utils.js.map +1 -0
- package/dist/runtime/anti-unification/types.d.ts +41 -0
- package/dist/runtime/anti-unification/types.d.ts.map +1 -0
- package/dist/runtime/anti-unification/types.js +26 -0
- package/dist/runtime/anti-unification/types.js.map +1 -0
- package/dist/runtime/bayesian/factor.d.ts +22 -0
- package/dist/runtime/bayesian/factor.d.ts.map +1 -0
- package/dist/runtime/bayesian/factor.js +249 -0
- package/dist/runtime/bayesian/factor.js.map +1 -0
- package/dist/runtime/bayesian/index.d.ts +3 -0
- package/dist/runtime/bayesian/index.d.ts.map +1 -0
- package/dist/runtime/bayesian/index.js +25 -0
- package/dist/runtime/bayesian/index.js.map +1 -0
- package/dist/runtime/bayesian/inference.d.ts +6 -0
- package/dist/runtime/bayesian/inference.d.ts.map +1 -0
- package/dist/runtime/bayesian/inference.js +260 -0
- package/dist/runtime/bayesian/inference.js.map +1 -0
- package/dist/runtime/bayesian/types.d.ts +19 -0
- package/dist/runtime/bayesian/types.d.ts.map +1 -0
- package/dist/runtime/bayesian/types.js +9 -0
- package/dist/runtime/bayesian/types.js.map +1 -0
- package/dist/runtime/bisimulation/index.d.ts +4 -0
- package/dist/runtime/bisimulation/index.d.ts.map +1 -0
- package/dist/runtime/bisimulation/index.js +21 -0
- package/dist/runtime/bisimulation/index.js.map +1 -0
- package/dist/runtime/bisimulation/operations.d.ts +40 -0
- package/dist/runtime/bisimulation/operations.d.ts.map +1 -0
- package/dist/runtime/bisimulation/operations.js +219 -0
- package/dist/runtime/bisimulation/operations.js.map +1 -0
- package/dist/runtime/bisimulation/paige-tarjan.d.ts +8 -0
- package/dist/runtime/bisimulation/paige-tarjan.d.ts.map +1 -0
- package/dist/runtime/bisimulation/paige-tarjan.js +199 -0
- package/dist/runtime/bisimulation/paige-tarjan.js.map +1 -0
- package/dist/runtime/bisimulation/types.d.ts +26 -0
- package/dist/runtime/bisimulation/types.d.ts.map +1 -0
- package/dist/runtime/bisimulation/types.js +22 -0
- package/dist/runtime/bisimulation/types.js.map +1 -0
- package/dist/runtime/csp/ac3.d.ts +20 -0
- package/dist/runtime/csp/ac3.d.ts.map +1 -0
- package/dist/runtime/csp/ac3.js +165 -0
- package/dist/runtime/csp/ac3.js.map +1 -0
- package/dist/runtime/csp/backtrack.d.ts +15 -0
- package/dist/runtime/csp/backtrack.d.ts.map +1 -0
- package/dist/runtime/csp/backtrack.js +233 -0
- package/dist/runtime/csp/backtrack.js.map +1 -0
- package/dist/runtime/csp/builtins.d.ts +27 -0
- package/dist/runtime/csp/builtins.d.ts.map +1 -0
- package/dist/runtime/csp/builtins.js +109 -0
- package/dist/runtime/csp/builtins.js.map +1 -0
- package/dist/runtime/csp/index.d.ts +5 -0
- package/dist/runtime/csp/index.d.ts.map +1 -0
- package/dist/runtime/csp/index.js +23 -0
- package/dist/runtime/csp/index.js.map +1 -0
- package/dist/runtime/csp/types.d.ts +54 -0
- package/dist/runtime/csp/types.d.ts.map +1 -0
- package/dist/runtime/csp/types.js +14 -0
- package/dist/runtime/csp/types.js.map +1 -0
- package/dist/runtime/fca/context.d.ts +46 -0
- package/dist/runtime/fca/context.d.ts.map +1 -0
- package/dist/runtime/fca/context.js +155 -0
- package/dist/runtime/fca/context.js.map +1 -0
- package/dist/runtime/fca/implications.d.ts +10 -0
- package/dist/runtime/fca/implications.d.ts.map +1 -0
- package/dist/runtime/fca/implications.js +33 -0
- package/dist/runtime/fca/implications.js.map +1 -0
- package/dist/runtime/fca/index.d.ts +6 -0
- package/dist/runtime/fca/index.d.ts.map +1 -0
- package/dist/runtime/fca/index.js +39 -0
- package/dist/runtime/fca/index.js.map +1 -0
- package/dist/runtime/fca/lattice.d.ts +10 -0
- package/dist/runtime/fca/lattice.d.ts.map +1 -0
- package/dist/runtime/fca/lattice.js +86 -0
- package/dist/runtime/fca/lattice.js.map +1 -0
- package/dist/runtime/fca/next-closure.d.ts +12 -0
- package/dist/runtime/fca/next-closure.d.ts.map +1 -0
- package/dist/runtime/fca/next-closure.js +99 -0
- package/dist/runtime/fca/next-closure.js.map +1 -0
- package/dist/runtime/fca/types.d.ts +31 -0
- package/dist/runtime/fca/types.d.ts.map +1 -0
- package/dist/runtime/fca/types.js +30 -0
- package/dist/runtime/fca/types.js.map +1 -0
- package/dist/runtime/markov-logic/grounding.d.ts +19 -0
- package/dist/runtime/markov-logic/grounding.d.ts.map +1 -0
- package/dist/runtime/markov-logic/grounding.js +252 -0
- package/dist/runtime/markov-logic/grounding.js.map +1 -0
- package/dist/runtime/markov-logic/index.d.ts +6 -0
- package/dist/runtime/markov-logic/index.d.ts.map +1 -0
- package/dist/runtime/markov-logic/index.js +47 -0
- package/dist/runtime/markov-logic/index.js.map +1 -0
- package/dist/runtime/markov-logic/inference.d.ts +77 -0
- package/dist/runtime/markov-logic/inference.d.ts.map +1 -0
- package/dist/runtime/markov-logic/inference.js +382 -0
- package/dist/runtime/markov-logic/inference.js.map +1 -0
- package/dist/runtime/markov-logic/parser.d.ts +25 -0
- package/dist/runtime/markov-logic/parser.d.ts.map +1 -0
- package/dist/runtime/markov-logic/parser.js +264 -0
- package/dist/runtime/markov-logic/parser.js.map +1 -0
- package/dist/runtime/markov-logic/types.d.ts +64 -0
- package/dist/runtime/markov-logic/types.d.ts.map +1 -0
- package/dist/runtime/markov-logic/types.js +17 -0
- package/dist/runtime/markov-logic/types.js.map +1 -0
- package/dist/runtime/pi-calculus/congruence.d.ts +15 -0
- package/dist/runtime/pi-calculus/congruence.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/congruence.js +271 -0
- package/dist/runtime/pi-calculus/congruence.js.map +1 -0
- package/dist/runtime/pi-calculus/index.d.ts +6 -0
- package/dist/runtime/pi-calculus/index.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/index.js +30 -0
- package/dist/runtime/pi-calculus/index.js.map +1 -0
- package/dist/runtime/pi-calculus/names.d.ts +28 -0
- package/dist/runtime/pi-calculus/names.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/names.js +182 -0
- package/dist/runtime/pi-calculus/names.js.map +1 -0
- package/dist/runtime/pi-calculus/reduction.d.ts +25 -0
- package/dist/runtime/pi-calculus/reduction.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/reduction.js +338 -0
- package/dist/runtime/pi-calculus/reduction.js.map +1 -0
- package/dist/runtime/pi-calculus/substitution.d.ts +11 -0
- package/dist/runtime/pi-calculus/substitution.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/substitution.js +109 -0
- package/dist/runtime/pi-calculus/substitution.js.map +1 -0
- package/dist/runtime/pi-calculus/types.d.ts +38 -0
- package/dist/runtime/pi-calculus/types.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/types.js +22 -0
- package/dist/runtime/pi-calculus/types.js.map +1 -0
- package/dist/runtime/planning/astar.d.ts +10 -0
- package/dist/runtime/planning/astar.d.ts.map +1 -0
- package/dist/runtime/planning/astar.js +155 -0
- package/dist/runtime/planning/astar.js.map +1 -0
- package/dist/runtime/planning/bfs.d.ts +17 -0
- package/dist/runtime/planning/bfs.d.ts.map +1 -0
- package/dist/runtime/planning/bfs.js +87 -0
- package/dist/runtime/planning/bfs.js.map +1 -0
- package/dist/runtime/planning/ground.d.ts +55 -0
- package/dist/runtime/planning/ground.d.ts.map +1 -0
- package/dist/runtime/planning/ground.js +154 -0
- package/dist/runtime/planning/ground.js.map +1 -0
- package/dist/runtime/planning/heuristic.d.ts +29 -0
- package/dist/runtime/planning/heuristic.d.ts.map +1 -0
- package/dist/runtime/planning/heuristic.js +172 -0
- package/dist/runtime/planning/heuristic.js.map +1 -0
- package/dist/runtime/planning/index.d.ts +6 -0
- package/dist/runtime/planning/index.d.ts.map +1 -0
- package/dist/runtime/planning/index.js +38 -0
- package/dist/runtime/planning/index.js.map +1 -0
- package/dist/runtime/planning/types.d.ts +100 -0
- package/dist/runtime/planning/types.d.ts.map +1 -0
- package/dist/runtime/planning/types.js +22 -0
- package/dist/runtime/planning/types.js.map +1 -0
- package/dist/runtime/proof-minify/index.d.ts +3 -0
- package/dist/runtime/proof-minify/index.d.ts.map +1 -0
- package/dist/runtime/proof-minify/index.js +13 -0
- package/dist/runtime/proof-minify/index.js.map +1 -0
- package/dist/runtime/proof-minify/minify.d.ts +13 -0
- package/dist/runtime/proof-minify/minify.d.ts.map +1 -0
- package/dist/runtime/proof-minify/minify.js +540 -0
- package/dist/runtime/proof-minify/minify.js.map +1 -0
- package/dist/runtime/proof-minify/types.d.ts +89 -0
- package/dist/runtime/proof-minify/types.d.ts.map +1 -0
- package/dist/runtime/proof-minify/types.js +16 -0
- package/dist/runtime/proof-minify/types.js.map +1 -0
- package/dist/runtime/symbolic-diff/constructors.d.ts +16 -0
- package/dist/runtime/symbolic-diff/constructors.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/constructors.js +75 -0
- package/dist/runtime/symbolic-diff/constructors.js.map +1 -0
- package/dist/runtime/symbolic-diff/differentiate.d.ts +22 -0
- package/dist/runtime/symbolic-diff/differentiate.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/differentiate.js +107 -0
- package/dist/runtime/symbolic-diff/differentiate.js.map +1 -0
- package/dist/runtime/symbolic-diff/evaluate.d.ts +3 -0
- package/dist/runtime/symbolic-diff/evaluate.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/evaluate.js +47 -0
- package/dist/runtime/symbolic-diff/evaluate.js.map +1 -0
- package/dist/runtime/symbolic-diff/index.d.ts +9 -0
- package/dist/runtime/symbolic-diff/index.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/index.js +34 -0
- package/dist/runtime/symbolic-diff/index.js.map +1 -0
- package/dist/runtime/symbolic-diff/parse.d.ts +16 -0
- package/dist/runtime/symbolic-diff/parse.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/parse.js +212 -0
- package/dist/runtime/symbolic-diff/parse.js.map +1 -0
- package/dist/runtime/symbolic-diff/simplify.d.ts +11 -0
- package/dist/runtime/symbolic-diff/simplify.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/simplify.js +214 -0
- package/dist/runtime/symbolic-diff/simplify.js.map +1 -0
- package/dist/runtime/symbolic-diff/stringify.d.ts +3 -0
- package/dist/runtime/symbolic-diff/stringify.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/stringify.js +69 -0
- package/dist/runtime/symbolic-diff/stringify.js.map +1 -0
- package/dist/runtime/symbolic-diff/types.d.ts +35 -0
- package/dist/runtime/symbolic-diff/types.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/types.js +9 -0
- package/dist/runtime/symbolic-diff/types.js.map +1 -0
- package/dist/runtime/term-rewriting/critical-pairs.d.ts +38 -0
- package/dist/runtime/term-rewriting/critical-pairs.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/critical-pairs.js +109 -0
- package/dist/runtime/term-rewriting/critical-pairs.js.map +1 -0
- package/dist/runtime/term-rewriting/index.d.ts +9 -0
- package/dist/runtime/term-rewriting/index.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/index.js +38 -0
- package/dist/runtime/term-rewriting/index.js.map +1 -0
- package/dist/runtime/term-rewriting/knuth-bendix.d.ts +29 -0
- package/dist/runtime/term-rewriting/knuth-bendix.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/knuth-bendix.js +196 -0
- package/dist/runtime/term-rewriting/knuth-bendix.js.map +1 -0
- package/dist/runtime/term-rewriting/lpo.d.ts +17 -0
- package/dist/runtime/term-rewriting/lpo.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/lpo.js +158 -0
- package/dist/runtime/term-rewriting/lpo.js.map +1 -0
- package/dist/runtime/term-rewriting/rewrite.d.ts +44 -0
- package/dist/runtime/term-rewriting/rewrite.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/rewrite.js +189 -0
- package/dist/runtime/term-rewriting/rewrite.js.map +1 -0
- package/dist/runtime/term-rewriting/term-utils.d.ts +64 -0
- package/dist/runtime/term-rewriting/term-utils.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/term-utils.js +360 -0
- package/dist/runtime/term-rewriting/term-utils.js.map +1 -0
- package/dist/runtime/term-rewriting/types.d.ts +66 -0
- package/dist/runtime/term-rewriting/types.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/types.js +21 -0
- package/dist/runtime/term-rewriting/types.js.map +1 -0
- package/dist/runtime/theorem-cache/cache.d.ts +100 -0
- package/dist/runtime/theorem-cache/cache.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/cache.js +213 -0
- package/dist/runtime/theorem-cache/cache.js.map +1 -0
- package/dist/runtime/theorem-cache/canonical.d.ts +59 -0
- package/dist/runtime/theorem-cache/canonical.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/canonical.js +105 -0
- package/dist/runtime/theorem-cache/canonical.js.map +1 -0
- package/dist/runtime/theorem-cache/index.d.ts +6 -0
- package/dist/runtime/theorem-cache/index.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/index.js +16 -0
- package/dist/runtime/theorem-cache/index.js.map +1 -0
- package/dist/runtime/theorem-cache/pattern.d.ts +24 -0
- package/dist/runtime/theorem-cache/pattern.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/pattern.js +80 -0
- package/dist/runtime/theorem-cache/pattern.js.map +1 -0
- package/dist/system-f/index.d.ts +7 -0
- package/dist/system-f/index.d.ts.map +1 -0
- package/dist/system-f/index.js +48 -0
- package/dist/system-f/index.js.map +1 -0
- package/dist/system-f/infer.d.ts +9 -0
- package/dist/system-f/infer.d.ts.map +1 -0
- package/dist/system-f/infer.js +94 -0
- package/dist/system-f/infer.js.map +1 -0
- package/dist/system-f/reduce.d.ts +15 -0
- package/dist/system-f/reduce.d.ts.map +1 -0
- package/dist/system-f/reduce.js +259 -0
- package/dist/system-f/reduce.js.map +1 -0
- package/dist/system-f/types.d.ts +53 -0
- package/dist/system-f/types.d.ts.map +1 -0
- package/dist/system-f/types.js +157 -0
- package/dist/system-f/types.js.map +1 -0
- package/dist/tests/abduction/abduction.test.d.ts +2 -0
- package/dist/tests/abduction/abduction.test.d.ts.map +1 -0
- package/dist/tests/abduction/abduction.test.js +380 -0
- package/dist/tests/abduction/abduction.test.js.map +1 -0
- package/dist/tests/anti-unification/anti-unify.test.d.ts +2 -0
- package/dist/tests/anti-unification/anti-unify.test.d.ts.map +1 -0
- package/dist/tests/anti-unification/anti-unify.test.js +219 -0
- package/dist/tests/anti-unification/anti-unify.test.js.map +1 -0
- package/dist/tests/bayesian/bayesian.test.d.ts +2 -0
- package/dist/tests/bayesian/bayesian.test.d.ts.map +1 -0
- package/dist/tests/bayesian/bayesian.test.js +328 -0
- package/dist/tests/bayesian/bayesian.test.js.map +1 -0
- package/dist/tests/bisimulation/paige-tarjan.test.d.ts +2 -0
- package/dist/tests/bisimulation/paige-tarjan.test.d.ts.map +1 -0
- package/dist/tests/bisimulation/paige-tarjan.test.js +254 -0
- package/dist/tests/bisimulation/paige-tarjan.test.js.map +1 -0
- package/dist/tests/coverage-fill-aristotelian.test.js +1 -1
- package/dist/tests/coverage-fill-aristotelian.test.js.map +1 -1
- package/dist/tests/coverage-fill-fallacies.test.js +1 -1
- package/dist/tests/coverage-fill-fallacies.test.js.map +1 -1
- package/dist/tests/coverage-fill-format.test.js +1 -1
- package/dist/tests/coverage-fill-format.test.js.map +1 -1
- package/dist/tests/coverage-fill-intuitionistic.test.js +1 -1
- package/dist/tests/coverage-fill-intuitionistic.test.js.map +1 -1
- package/dist/tests/coverage-fill-probabilistic.test.js +1 -1
- package/dist/tests/coverage-fill-probabilistic.test.js.map +1 -1
- package/dist/tests/csp/csp.test.d.ts +2 -0
- package/dist/tests/csp/csp.test.d.ts.map +1 -0
- package/dist/tests/csp/csp.test.js +292 -0
- package/dist/tests/csp/csp.test.js.map +1 -0
- package/dist/tests/fca/fca.test.d.ts +2 -0
- package/dist/tests/fca/fca.test.d.ts.map +1 -0
- package/dist/tests/fca/fca.test.js +317 -0
- package/dist/tests/fca/fca.test.js.map +1 -0
- package/dist/tests/intuitionistic-nj/nj.test.d.ts +2 -0
- package/dist/tests/intuitionistic-nj/nj.test.d.ts.map +1 -0
- package/dist/tests/intuitionistic-nj/nj.test.js +216 -0
- package/dist/tests/intuitionistic-nj/nj.test.js.map +1 -0
- package/dist/tests/lambda-calc/lambda-calc.test.d.ts +2 -0
- package/dist/tests/lambda-calc/lambda-calc.test.d.ts.map +1 -0
- package/dist/tests/lambda-calc/lambda-calc.test.js +164 -0
- package/dist/tests/lambda-calc/lambda-calc.test.js.map +1 -0
- package/dist/tests/many-valued/many-valued.test.d.ts +2 -0
- package/dist/tests/many-valued/many-valued.test.d.ts.map +1 -0
- package/dist/tests/many-valued/many-valued.test.js +150 -0
- package/dist/tests/many-valued/many-valued.test.js.map +1 -0
- package/dist/tests/markov-logic/markov-logic.test.d.ts +2 -0
- package/dist/tests/markov-logic/markov-logic.test.d.ts.map +1 -0
- package/dist/tests/markov-logic/markov-logic.test.js +349 -0
- package/dist/tests/markov-logic/markov-logic.test.js.map +1 -0
- package/dist/tests/mltt/mltt.test.d.ts +2 -0
- package/dist/tests/mltt/mltt.test.d.ts.map +1 -0
- package/dist/tests/mltt/mltt.test.js +181 -0
- package/dist/tests/mltt/mltt.test.js.map +1 -0
- package/dist/tests/modal-frame-axioms/frame-axioms.test.d.ts +2 -0
- package/dist/tests/modal-frame-axioms/frame-axioms.test.d.ts.map +1 -0
- package/dist/tests/modal-frame-axioms/frame-axioms.test.js +236 -0
- package/dist/tests/modal-frame-axioms/frame-axioms.test.js.map +1 -0
- package/dist/tests/mu-calculus/check.test.d.ts +2 -0
- package/dist/tests/mu-calculus/check.test.d.ts.map +1 -0
- package/dist/tests/mu-calculus/check.test.js +234 -0
- package/dist/tests/mu-calculus/check.test.js.map +1 -0
- package/dist/tests/pi-calculus/pi-calculus.test.d.ts +2 -0
- package/dist/tests/pi-calculus/pi-calculus.test.d.ts.map +1 -0
- package/dist/tests/pi-calculus/pi-calculus.test.js +273 -0
- package/dist/tests/pi-calculus/pi-calculus.test.js.map +1 -0
- package/dist/tests/planning/planning.test.d.ts +2 -0
- package/dist/tests/planning/planning.test.d.ts.map +1 -0
- package/dist/tests/planning/planning.test.js +397 -0
- package/dist/tests/planning/planning.test.js.map +1 -0
- package/dist/tests/proof-minify/minify.test.d.ts +2 -0
- package/dist/tests/proof-minify/minify.test.d.ts.map +1 -0
- package/dist/tests/proof-minify/minify.test.js +281 -0
- package/dist/tests/proof-minify/minify.test.js.map +1 -0
- package/dist/tests/refinement-types/refinement-types.test.d.ts +2 -0
- package/dist/tests/refinement-types/refinement-types.test.d.ts.map +1 -0
- package/dist/tests/refinement-types/refinement-types.test.js +174 -0
- package/dist/tests/refinement-types/refinement-types.test.js.map +1 -0
- package/dist/tests/sequent-lk/prover.test.d.ts +2 -0
- package/dist/tests/sequent-lk/prover.test.d.ts.map +1 -0
- package/dist/tests/sequent-lk/prover.test.js +317 -0
- package/dist/tests/sequent-lk/prover.test.js.map +1 -0
- package/dist/tests/substructural/prover.test.d.ts +2 -0
- package/dist/tests/substructural/prover.test.d.ts.map +1 -0
- package/dist/tests/substructural/prover.test.js +271 -0
- package/dist/tests/substructural/prover.test.js.map +1 -0
- package/dist/tests/symbolic-diff/symbolic-diff.test.d.ts +2 -0
- package/dist/tests/symbolic-diff/symbolic-diff.test.d.ts.map +1 -0
- package/dist/tests/symbolic-diff/symbolic-diff.test.js +278 -0
- package/dist/tests/symbolic-diff/symbolic-diff.test.js.map +1 -0
- package/dist/tests/system-f/system-f.test.d.ts +2 -0
- package/dist/tests/system-f/system-f.test.d.ts.map +1 -0
- package/dist/tests/system-f/system-f.test.js +217 -0
- package/dist/tests/system-f/system-f.test.js.map +1 -0
- package/dist/tests/term-rewriting/critical-pairs.test.d.ts +2 -0
- package/dist/tests/term-rewriting/critical-pairs.test.d.ts.map +1 -0
- package/dist/tests/term-rewriting/critical-pairs.test.js +34 -0
- package/dist/tests/term-rewriting/critical-pairs.test.js.map +1 -0
- package/dist/tests/term-rewriting/knuth-bendix.test.d.ts +2 -0
- package/dist/tests/term-rewriting/knuth-bendix.test.d.ts.map +1 -0
- package/dist/tests/term-rewriting/knuth-bendix.test.js +94 -0
- package/dist/tests/term-rewriting/knuth-bendix.test.js.map +1 -0
- package/dist/tests/term-rewriting/lpo.test.d.ts +2 -0
- package/dist/tests/term-rewriting/lpo.test.d.ts.map +1 -0
- package/dist/tests/term-rewriting/lpo.test.js +57 -0
- package/dist/tests/term-rewriting/lpo.test.js.map +1 -0
- package/dist/tests/term-rewriting/rewrite.test.d.ts +2 -0
- package/dist/tests/term-rewriting/rewrite.test.d.ts.map +1 -0
- package/dist/tests/term-rewriting/rewrite.test.js +56 -0
- package/dist/tests/term-rewriting/rewrite.test.js.map +1 -0
- package/dist/tests/term-rewriting/term-utils.test.d.ts +2 -0
- package/dist/tests/term-rewriting/term-utils.test.d.ts.map +1 -0
- package/dist/tests/term-rewriting/term-utils.test.js +58 -0
- package/dist/tests/term-rewriting/term-utils.test.js.map +1 -0
- package/dist/tests/theorem-cache/cache.test.d.ts +2 -0
- package/dist/tests/theorem-cache/cache.test.d.ts.map +1 -0
- package/dist/tests/theorem-cache/cache.test.js +510 -0
- package/dist/tests/theorem-cache/cache.test.js.map +1 -0
- package/package.json +1 -1
|
@@ -0,0 +1,281 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
// ============================================================
|
|
3
|
+
// ST Proof Minification — Tests
|
|
4
|
+
// ============================================================
|
|
5
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
6
|
+
const vitest_1 = require("vitest");
|
|
7
|
+
const proof_minify_1 = require("../../runtime/proof-minify");
|
|
8
|
+
// ── Helpers de construcción ──────────────────────────────────
|
|
9
|
+
function ax(conclusion) {
|
|
10
|
+
return { conclusion, rule: 'axiom', premises: [] };
|
|
11
|
+
}
|
|
12
|
+
function hyp(conclusion) {
|
|
13
|
+
return { conclusion, rule: 'hypothesis', premises: [] };
|
|
14
|
+
}
|
|
15
|
+
function mp(conclusion, ant, impl) {
|
|
16
|
+
return { conclusion, rule: 'MP', premises: [ant, impl] };
|
|
17
|
+
}
|
|
18
|
+
function andI(left, right) {
|
|
19
|
+
return {
|
|
20
|
+
conclusion: `${left.conclusion} ∧ ${right.conclusion}`,
|
|
21
|
+
rule: '∧I',
|
|
22
|
+
premises: [left, right],
|
|
23
|
+
};
|
|
24
|
+
}
|
|
25
|
+
function andE1(conjunct, conj) {
|
|
26
|
+
return { conclusion: conjunct, rule: '∧E1', premises: [conj] };
|
|
27
|
+
}
|
|
28
|
+
function cut(conclusion, left, right) {
|
|
29
|
+
return { conclusion, rule: 'cut', premises: [left, right] };
|
|
30
|
+
}
|
|
31
|
+
function weaken(conclusion, ...premises) {
|
|
32
|
+
return { conclusion, rule: 'weakening', premises };
|
|
33
|
+
}
|
|
34
|
+
// ── Tests ────────────────────────────────────────────────────
|
|
35
|
+
(0, vitest_1.describe)('proof-minify: counts y depth', () => {
|
|
36
|
+
(0, vitest_1.it)('countNodes/depth funcionan correctamente sobre un árbol simple', () => {
|
|
37
|
+
const proof = mp('B', ax('A'), ax('A → B'));
|
|
38
|
+
const result = (0, proof_minify_1.minifyProof)(proof, { rules: [] }); // no aplicar reglas
|
|
39
|
+
(0, vitest_1.expect)(result.original.nodes).toBe(3);
|
|
40
|
+
(0, vitest_1.expect)(result.original.depth).toBe(1);
|
|
41
|
+
});
|
|
42
|
+
});
|
|
43
|
+
(0, vitest_1.describe)('proof-minify: detrivialize ∧I/∧E', () => {
|
|
44
|
+
(0, vitest_1.it)('colapsa ∧E1 ∘ ∧I al sub-árbol correspondiente', () => {
|
|
45
|
+
// (A ∧ B) introducido y luego eliminado a A.
|
|
46
|
+
const intro = andI(ax('A'), ax('B'));
|
|
47
|
+
const elim = andE1('A', intro);
|
|
48
|
+
const result = (0, proof_minify_1.minifyProof)(elim);
|
|
49
|
+
(0, vitest_1.expect)(result.minified.conclusion).toBe('A');
|
|
50
|
+
(0, vitest_1.expect)(result.minified.rule).toBe('axiom');
|
|
51
|
+
(0, vitest_1.expect)(result.minified.premises).toHaveLength(0);
|
|
52
|
+
(0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThanOrEqual(2);
|
|
53
|
+
});
|
|
54
|
+
(0, vitest_1.it)('detrivializa anidados: ∧E1 ∘ ∧I ∘ ∧E1 ∘ ∧I', () => {
|
|
55
|
+
// Construimos: (((A ∧ B) ∧ C) , extracción de A vía dos eliminaciones)
|
|
56
|
+
const innerIntro = andI(ax('A'), ax('B'));
|
|
57
|
+
const elim1 = andE1('A', innerIntro);
|
|
58
|
+
const outerIntro = andI(elim1, ax('C'));
|
|
59
|
+
const elim2 = andE1('A', outerIntro);
|
|
60
|
+
const result = (0, proof_minify_1.minifyProof)(elim2);
|
|
61
|
+
(0, vitest_1.expect)(result.minified.rule).toBe('axiom');
|
|
62
|
+
(0, vitest_1.expect)(result.minified.conclusion).toBe('A');
|
|
63
|
+
});
|
|
64
|
+
});
|
|
65
|
+
(0, vitest_1.describe)('proof-minify: compact MP chains', () => {
|
|
66
|
+
(0, vitest_1.it)('compacta una cadena de 5 MPs en un único MP*', () => {
|
|
67
|
+
// A, A→B, B→C, C→D, D→E, E→F ⊢ F
|
|
68
|
+
const step1 = mp('B', ax('A'), ax('A → B'));
|
|
69
|
+
const step2 = mp('C', step1, ax('B → C'));
|
|
70
|
+
const step3 = mp('D', step2, ax('C → D'));
|
|
71
|
+
const step4 = mp('E', step3, ax('D → E'));
|
|
72
|
+
const step5 = mp('F', step4, ax('E → F'));
|
|
73
|
+
const result = (0, proof_minify_1.minifyProof)(step5, { rules: ['compact-mp'] });
|
|
74
|
+
(0, vitest_1.expect)(result.minified.rule).toBe('MP*');
|
|
75
|
+
(0, vitest_1.expect)(result.minified.conclusion).toBe('F');
|
|
76
|
+
(0, vitest_1.expect)(result.minified.metadata?.chain).toBeDefined();
|
|
77
|
+
(0, vitest_1.expect)(result.minified.metadata.chain.length).toBeGreaterThanOrEqual(5);
|
|
78
|
+
// Profundidad debe haberse reducido drásticamente.
|
|
79
|
+
(0, vitest_1.expect)(result.reduction.depthDelta).toBeGreaterThan(0);
|
|
80
|
+
});
|
|
81
|
+
(0, vitest_1.it)('no compacta cadenas ambiguas (sin → en las premisas)', () => {
|
|
82
|
+
const fake1 = mp('X', ax('Y'), ax('Z'));
|
|
83
|
+
const fake2 = mp('A', fake1, ax('W'));
|
|
84
|
+
const result = (0, proof_minify_1.compactModusPonensChain)(fake2);
|
|
85
|
+
// Como no detecta antecedente vs implicación, no compacta.
|
|
86
|
+
(0, vitest_1.expect)(result.rule).toBe('MP');
|
|
87
|
+
});
|
|
88
|
+
(0, vitest_1.it)('cadenas de exactamente 1 MP no se compactan', () => {
|
|
89
|
+
const proof = mp('B', ax('A'), ax('A → B'));
|
|
90
|
+
const result = (0, proof_minify_1.compactModusPonensChain)(proof);
|
|
91
|
+
(0, vitest_1.expect)(result.rule).toBe('MP');
|
|
92
|
+
});
|
|
93
|
+
});
|
|
94
|
+
(0, vitest_1.describe)('proof-minify: local cut elimination', () => {
|
|
95
|
+
(0, vitest_1.it)('elimina cut cuando una rama es hoja-identidad', () => {
|
|
96
|
+
// cut sobre conclusión A: una rama es la hipótesis A, la otra deriva A.
|
|
97
|
+
const derivacionA = andE1('A', andI(ax('A'), ax('B')));
|
|
98
|
+
const proofWithCut = cut('A', hyp('A'), derivacionA);
|
|
99
|
+
const result = (0, proof_minify_1.minifyProof)(proofWithCut, { rules: ['cut-elimination-local'] });
|
|
100
|
+
// El cut se reemplaza por la derivación que realmente concluyó A.
|
|
101
|
+
(0, vitest_1.expect)(result.minified.rule).not.toBe('cut');
|
|
102
|
+
});
|
|
103
|
+
(0, vitest_1.it)('mantiene cut cuando ninguna rama es hoja-identidad', () => {
|
|
104
|
+
const left = mp('A', ax('X'), ax('X → A'));
|
|
105
|
+
const right = mp('B', ax('A'), ax('A → B'));
|
|
106
|
+
const proof = cut('B', left, right);
|
|
107
|
+
const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['cut-elimination-local'] });
|
|
108
|
+
(0, vitest_1.expect)(result.minified.rule).toBe('cut');
|
|
109
|
+
});
|
|
110
|
+
});
|
|
111
|
+
(0, vitest_1.describe)('proof-minify: remove unused subproofs', () => {
|
|
112
|
+
(0, vitest_1.it)('recorta premisas irrelevantes en weakening', () => {
|
|
113
|
+
// Weakening: la conclusion es A. Sólo una premisa contiene A.
|
|
114
|
+
const irrelevante1 = ax('Z');
|
|
115
|
+
const irrelevante2 = ax('W');
|
|
116
|
+
const relevante = ax('A');
|
|
117
|
+
const proof = weaken('A', irrelevante1, irrelevante2, relevante);
|
|
118
|
+
const result = (0, proof_minify_1.removeUnusedSubproofs)(proof);
|
|
119
|
+
(0, vitest_1.expect)(result.premises.length).toBeLessThan(3);
|
|
120
|
+
// La premisa que sobrevive debe contener A.
|
|
121
|
+
(0, vitest_1.expect)(result.premises.some((p) => p.conclusion === 'A')).toBe(true);
|
|
122
|
+
});
|
|
123
|
+
(0, vitest_1.it)('no toca nodos con sólo 1 premisa', () => {
|
|
124
|
+
const proof = {
|
|
125
|
+
conclusion: 'A',
|
|
126
|
+
rule: '∧E1',
|
|
127
|
+
premises: [andI(ax('A'), ax('B'))],
|
|
128
|
+
};
|
|
129
|
+
const result = (0, proof_minify_1.removeUnusedSubproofs)(proof);
|
|
130
|
+
(0, vitest_1.expect)(result.premises).toHaveLength(1);
|
|
131
|
+
});
|
|
132
|
+
});
|
|
133
|
+
(0, vitest_1.describe)('proof-minify: estadística general', () => {
|
|
134
|
+
(0, vitest_1.it)('reduce un árbol con 10 nodos y 2 redundantes a ≤ 8 nodos', () => {
|
|
135
|
+
// Construimos un árbol con 2 ∧I/∧E1 redundantes.
|
|
136
|
+
// Layout:
|
|
137
|
+
// A_intro = (A ∧ B), elim1 = A
|
|
138
|
+
// B_intro = (B ∧ C), elim2 = B
|
|
139
|
+
// raíz = (elim1 ∧ elim2)
|
|
140
|
+
const aIntro = andI(ax('A'), ax('B')); // 3 nodos
|
|
141
|
+
const aElim = andE1('A', aIntro); // +1 = 4
|
|
142
|
+
const bIntro = andI(ax('B'), ax('C')); // +3 = 7
|
|
143
|
+
const bElim = andE1('B', bIntro); // +1 = 8
|
|
144
|
+
const root = andI(aElim, bElim); // +1 = 9
|
|
145
|
+
// Añadimos un dead-weight: el árbol original.
|
|
146
|
+
const proof = {
|
|
147
|
+
conclusion: root.conclusion,
|
|
148
|
+
rule: root.rule,
|
|
149
|
+
premises: [...root.premises, ax('Q')], // +1 hojas dead = 10
|
|
150
|
+
};
|
|
151
|
+
const result = (0, proof_minify_1.minifyProof)(proof);
|
|
152
|
+
(0, vitest_1.expect)(result.original.nodes).toBe(10);
|
|
153
|
+
// Tras detrivialize, aElim → ax('A'), bElim → ax('B'). Nodos: 10-4 = 6.
|
|
154
|
+
(0, vitest_1.expect)(result.minified.conclusion).toBe(proof.conclusion);
|
|
155
|
+
(0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThanOrEqual(2);
|
|
156
|
+
(0, vitest_1.expect)(result.minified.premises.length).toBeLessThanOrEqual(2);
|
|
157
|
+
});
|
|
158
|
+
});
|
|
159
|
+
(0, vitest_1.describe)('proof-minify: preservación de la raíz', () => {
|
|
160
|
+
(0, vitest_1.it)('la conclusion de la raíz nunca cambia', () => {
|
|
161
|
+
const proof = mp('Q', ax('P'), ax('P → Q'));
|
|
162
|
+
const result = (0, proof_minify_1.minifyProof)(proof);
|
|
163
|
+
(0, vitest_1.expect)(result.minified.conclusion).toBe('Q');
|
|
164
|
+
});
|
|
165
|
+
(0, vitest_1.it)('una hoja se devuelve sin cambios', () => {
|
|
166
|
+
const leaf = ax('Hello');
|
|
167
|
+
const result = (0, proof_minify_1.minifyProof)(leaf);
|
|
168
|
+
(0, vitest_1.expect)(result.minified).toEqual(leaf);
|
|
169
|
+
(0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
|
|
170
|
+
(0, vitest_1.expect)(result.reduction.percentage).toBe(0);
|
|
171
|
+
});
|
|
172
|
+
});
|
|
173
|
+
(0, vitest_1.describe)('proof-minify: idempotencia', () => {
|
|
174
|
+
(0, vitest_1.it)('minify(minify(p)) tiene la misma estructura que minify(p)', () => {
|
|
175
|
+
const aIntro = andI(ax('A'), ax('B'));
|
|
176
|
+
const aElim = andE1('A', aIntro);
|
|
177
|
+
const proof = andI(aElim, ax('C'));
|
|
178
|
+
const once = (0, proof_minify_1.minifyProof)(proof);
|
|
179
|
+
const twice = (0, proof_minify_1.minifyProof)(once.minified);
|
|
180
|
+
// Las claves canónicas deben coincidir.
|
|
181
|
+
const keyOnce = JSON.stringify(once.minified);
|
|
182
|
+
const keyTwice = JSON.stringify(twice.minified);
|
|
183
|
+
(0, vitest_1.expect)(keyOnce).toBe(keyTwice);
|
|
184
|
+
(0, vitest_1.expect)(twice.reduction.nodesRemoved).toBe(0);
|
|
185
|
+
});
|
|
186
|
+
(0, vitest_1.it)('idempotencia en cadena MP compactada', () => {
|
|
187
|
+
const s1 = mp('B', ax('A'), ax('A → B'));
|
|
188
|
+
const s2 = mp('C', s1, ax('B → C'));
|
|
189
|
+
const s3 = mp('D', s2, ax('C → D'));
|
|
190
|
+
const once = (0, proof_minify_1.minifyProof)(s3);
|
|
191
|
+
const twice = (0, proof_minify_1.minifyProof)(once.minified);
|
|
192
|
+
(0, vitest_1.expect)(JSON.stringify(once.minified)).toBe(JSON.stringify(twice.minified));
|
|
193
|
+
});
|
|
194
|
+
(0, vitest_1.it)('idempotencia sobre prueba ya minimal', () => {
|
|
195
|
+
const leaf = ax('A');
|
|
196
|
+
const r1 = (0, proof_minify_1.minifyProof)(leaf);
|
|
197
|
+
const r2 = (0, proof_minify_1.minifyProof)(r1.minified);
|
|
198
|
+
(0, vitest_1.expect)(r2.iterations).toBeLessThanOrEqual(2);
|
|
199
|
+
(0, vitest_1.expect)(r2.reduction.nodesRemoved).toBe(0);
|
|
200
|
+
});
|
|
201
|
+
});
|
|
202
|
+
(0, vitest_1.describe)('proof-minify: opciones', () => {
|
|
203
|
+
(0, vitest_1.it)('rules=[] no aplica ninguna reducción', () => {
|
|
204
|
+
const aElim = andE1('A', andI(ax('A'), ax('B')));
|
|
205
|
+
const result = (0, proof_minify_1.minifyProof)(aElim, { rules: [] });
|
|
206
|
+
(0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
|
|
207
|
+
(0, vitest_1.expect)(result.minified.rule).toBe('∧E1');
|
|
208
|
+
});
|
|
209
|
+
(0, vitest_1.it)('maxIterations=1 limita las pasadas globales', () => {
|
|
210
|
+
const aElim = andE1('A', andI(ax('A'), ax('B')));
|
|
211
|
+
const result = (0, proof_minify_1.minifyProof)(aElim, { maxIterations: 1 });
|
|
212
|
+
(0, vitest_1.expect)(result.iterations).toBe(1);
|
|
213
|
+
});
|
|
214
|
+
(0, vitest_1.it)('rules selectivo: sólo compact-mp no afecta árboles sin MP', () => {
|
|
215
|
+
const proof = andI(ax('A'), ax('B'));
|
|
216
|
+
const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['compact-mp'] });
|
|
217
|
+
(0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
|
|
218
|
+
});
|
|
219
|
+
(0, vitest_1.it)('rules selectivo: sólo detrivialize en árbol con ∧I/∧E', () => {
|
|
220
|
+
const proof = andE1('A', andI(ax('A'), ax('B')));
|
|
221
|
+
const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['detrivialize'] });
|
|
222
|
+
(0, vitest_1.expect)(result.minified.rule).toBe('axiom');
|
|
223
|
+
});
|
|
224
|
+
});
|
|
225
|
+
(0, vitest_1.describe)('proof-minify: dedup de premisas', () => {
|
|
226
|
+
(0, vitest_1.it)('elimina premisas duplicadas estructurales', () => {
|
|
227
|
+
// ∧I con dos premisas idénticas (caso degenerado pero válido).
|
|
228
|
+
const dup = {
|
|
229
|
+
conclusion: 'A ∧ A',
|
|
230
|
+
rule: '∧I',
|
|
231
|
+
premises: [ax('A'), ax('A')],
|
|
232
|
+
};
|
|
233
|
+
const result = (0, proof_minify_1.minifyProof)(dup, { rules: ['detrivialize'] });
|
|
234
|
+
(0, vitest_1.expect)(result.minified.premises).toHaveLength(1);
|
|
235
|
+
});
|
|
236
|
+
});
|
|
237
|
+
(0, vitest_1.describe)('proof-minify: input no se muta', () => {
|
|
238
|
+
(0, vitest_1.it)('el árbol original queda intacto', () => {
|
|
239
|
+
const original = andE1('A', andI(ax('A'), ax('B')));
|
|
240
|
+
const snapshot = JSON.stringify(original);
|
|
241
|
+
(0, proof_minify_1.minifyProof)(original);
|
|
242
|
+
(0, vitest_1.expect)(JSON.stringify(original)).toBe(snapshot);
|
|
243
|
+
});
|
|
244
|
+
});
|
|
245
|
+
(0, vitest_1.describe)('proof-minify: integración multi-regla', () => {
|
|
246
|
+
(0, vitest_1.it)('combina detrivialize + compact-mp + remove-unused', () => {
|
|
247
|
+
// Construye: weaken con premisas extras, cadena MP dentro, ∧E∘∧I.
|
|
248
|
+
const aElim = andE1('A', andI(ax('A'), ax('B')));
|
|
249
|
+
const s1 = mp('B', aElim, ax('A → B'));
|
|
250
|
+
const s2 = mp('C', s1, ax('B → C'));
|
|
251
|
+
const root = weaken('C', s2, ax('IRRELEVANTE_Z'));
|
|
252
|
+
const result = (0, proof_minify_1.minifyProof)(root);
|
|
253
|
+
(0, vitest_1.expect)(result.minified.conclusion).toBe('C');
|
|
254
|
+
// La premisa irrelevante debe haberse podado.
|
|
255
|
+
(0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThan(0);
|
|
256
|
+
});
|
|
257
|
+
(0, vitest_1.it)('punto fijo alcanzado antes de maxIterations', () => {
|
|
258
|
+
const proof = mp('B', ax('A'), ax('A → B'));
|
|
259
|
+
const result = (0, proof_minify_1.minifyProof)(proof, { maxIterations: 100 });
|
|
260
|
+
(0, vitest_1.expect)(result.iterations).toBeLessThanOrEqual(2);
|
|
261
|
+
});
|
|
262
|
+
});
|
|
263
|
+
(0, vitest_1.describe)('proof-minify: métricas', () => {
|
|
264
|
+
(0, vitest_1.it)('percentage es 0 para una hoja', () => {
|
|
265
|
+
const result = (0, proof_minify_1.minifyProof)(ax('X'));
|
|
266
|
+
(0, vitest_1.expect)(result.reduction.percentage).toBe(0);
|
|
267
|
+
});
|
|
268
|
+
(0, vitest_1.it)('percentage > 0 cuando hay reducción', () => {
|
|
269
|
+
const aElim = andE1('A', andI(ax('A'), ax('B')));
|
|
270
|
+
const result = (0, proof_minify_1.minifyProof)(aElim);
|
|
271
|
+
(0, vitest_1.expect)(result.reduction.percentage).toBeGreaterThan(0);
|
|
272
|
+
});
|
|
273
|
+
(0, vitest_1.it)('depthDelta > 0 al compactar cadena MP', () => {
|
|
274
|
+
const s1 = mp('B', ax('A'), ax('A → B'));
|
|
275
|
+
const s2 = mp('C', s1, ax('B → C'));
|
|
276
|
+
const s3 = mp('D', s2, ax('C → D'));
|
|
277
|
+
const result = (0, proof_minify_1.minifyProof)(s3);
|
|
278
|
+
(0, vitest_1.expect)(result.reduction.depthDelta).toBeGreaterThan(0);
|
|
279
|
+
});
|
|
280
|
+
});
|
|
281
|
+
//# sourceMappingURL=minify.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"minify.test.js","sourceRoot":"","sources":["../../../src/tests/proof-minify/minify.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gCAAgC;AAChC,+DAA+D;;AAE/D,mCAA8C;AAC9C,6DAKoC;AAEpC,gEAAgE;AAEhE,SAAS,EAAE,CAAC,UAAkB;IAC5B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;AACrD,CAAC;AACD,SAAS,GAAG,CAAC,UAAkB;IAC7B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;AAC1D,CAAC;AACD,SAAS,EAAE,CAAC,UAAkB,EAAE,GAAqB,EAAE,IAAsB;IAC3E,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;AAC3D,CAAC;AACD,SAAS,IAAI,CAAC,IAAsB,EAAE,KAAuB;IAC3D,OAAO;QACL,UAAU,EAAE,GAAG,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,UAAU,EAAE;QACtD,IAAI,EAAE,IAAI;QACV,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;KACxB,CAAC;AACJ,CAAC;AACD,SAAS,KAAK,CAAC,QAAgB,EAAE,IAAsB;IACrD,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;AACjE,CAAC;AACD,SAAS,GAAG,CACV,UAAkB,EAClB,IAAsB,EACtB,KAAuB;IAEvB,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;AAC9D,CAAC;AACD,SAAS,MAAM,CAAC,UAAkB,EAAE,GAAG,QAA4B;IACjE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;AACrD,CAAC;AAED,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB;QACtE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,6CAA6C;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,uEAAuE;QACvE,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACrC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,iCAAiC;QACjC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAE1C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QACtD,IAAA,eAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAS,CAAC,KAAkB,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACvF,mDAAmD;QACnD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAA,sCAAuB,EAAC,KAAK,CAAC,CAAC;QAC9C,2DAA2D;QAC3D,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,sCAAuB,EAAC,KAAK,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,wEAAwE;QACxE,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;QAC/E,kEAAkE;QAClE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,8DAA8D;QAC9D,MAAM,YAAY,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,YAAY,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,SAAS,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,IAAA,oCAAqB,EAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/C,4CAA4C;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,KAAK,GAAqB;YAC9B,UAAU,EAAE,GAAG;YACf,IAAI,EAAE,KAAK;YACX,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;SACnC,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,oCAAqB,EAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,iDAAiD;QACjD,UAAU;QACV,gCAAgC;QAChC,gCAAgC;QAChC,0BAA0B;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;QACjD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;QAChD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,SAAS;QAC1C,8CAA8C;QAC9C,MAAM,KAAK,GAAqB;YAC9B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,qBAAqB;SAC7D,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,wEAAwE;QACxE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,wCAAwC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,+DAA+D;QAC/D,MAAM,GAAG,GAAqB;YAC5B,UAAU,EAAE,OAAO;YACnB,IAAI,EAAE,IAAI;YACV,QAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;SAC7B,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAA,0BAAW,EAAC,QAAQ,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,kEAAkE;QAClE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,8CAA8C;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"refinement-types.test.d.ts","sourceRoot":"","sources":["../../../src/tests/refinement-types/refinement-types.test.ts"],"names":[],"mappings":""}
|
|
@@ -0,0 +1,174 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const vitest_1 = require("vitest");
|
|
4
|
+
const refinement_types_1 = require("../../refinement-types");
|
|
5
|
+
(0, vitest_1.describe)('refinement-types / predicates & solver', () => {
|
|
6
|
+
(0, vitest_1.it)('checkVC: predicado vacío es trivialmente satisfacible', () => {
|
|
7
|
+
const res = (0, refinement_types_1.checkVC)([]);
|
|
8
|
+
(0, vitest_1.expect)(res.satisfiable).toBe(true);
|
|
9
|
+
});
|
|
10
|
+
(0, vitest_1.it)('checkVC: encuentra testigo para x > 0 && x < 5', () => {
|
|
11
|
+
const res = (0, refinement_types_1.checkVC)(['x > 0 && x < 5']);
|
|
12
|
+
(0, vitest_1.expect)(res.satisfiable).toBe(true);
|
|
13
|
+
(0, vitest_1.expect)(res.counter).toBeDefined();
|
|
14
|
+
const x = res.counter['x'];
|
|
15
|
+
(0, vitest_1.expect)(typeof x).toBe('number');
|
|
16
|
+
(0, vitest_1.expect)(x).toBeGreaterThan(0);
|
|
17
|
+
(0, vitest_1.expect)(x).toBeLessThan(5);
|
|
18
|
+
});
|
|
19
|
+
(0, vitest_1.it)('checkVC: contradicción x > 5 && x < 0 no es satisfacible', () => {
|
|
20
|
+
const res = (0, refinement_types_1.checkVC)(['x > 5', 'x < 0']);
|
|
21
|
+
(0, vitest_1.expect)(res.satisfiable).toBe(false);
|
|
22
|
+
});
|
|
23
|
+
(0, vitest_1.it)('implies: x > 5 ⇒ x > 0 (válido)', () => {
|
|
24
|
+
(0, vitest_1.expect)((0, refinement_types_1.implies)(['x > 5'], 'x > 0')).toBe(true);
|
|
25
|
+
});
|
|
26
|
+
(0, vitest_1.it)('implies: x > 0 ⇒ x > 5 (NO válido, hay contraejemplo x=1)', () => {
|
|
27
|
+
(0, vitest_1.expect)((0, refinement_types_1.implies)(['x > 0'], 'x > 5')).toBe(false);
|
|
28
|
+
});
|
|
29
|
+
(0, vitest_1.it)('predicateRenameVar: reemplaza el binding correctamente', () => {
|
|
30
|
+
const renamed = (0, refinement_types_1.predicateRenameVar)('x > 0 && x < 10', 'x', 'y');
|
|
31
|
+
// El predicado renombrado debe ser equivalente al original al sustituir y por valores.
|
|
32
|
+
const ast = (0, refinement_types_1.parsePredicate)(renamed);
|
|
33
|
+
(0, vitest_1.expect)(JSON.stringify(ast).includes('"x"')).toBe(false);
|
|
34
|
+
(0, vitest_1.expect)(JSON.stringify(ast).includes('"y"')).toBe(true);
|
|
35
|
+
});
|
|
36
|
+
});
|
|
37
|
+
(0, vitest_1.describe)('refinement-types / subtipado', () => {
|
|
38
|
+
(0, vitest_1.it)('{ x | x > 5 } <: { x | x > 0 } (más restrictivo es subtipo)', () => {
|
|
39
|
+
const t1 = (0, refinement_types_1.refine)('Int', 'x', 'x > 5');
|
|
40
|
+
const t2 = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
41
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(t1, t2)).toBe(true);
|
|
42
|
+
});
|
|
43
|
+
(0, vitest_1.it)('{ x | x > 0 } NO es subtipo de { x | x > 5 }', () => {
|
|
44
|
+
const t1 = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
45
|
+
const t2 = (0, refinement_types_1.refine)('Int', 'x', 'x > 5');
|
|
46
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(t1, t2)).toBe(false);
|
|
47
|
+
});
|
|
48
|
+
(0, vitest_1.it)('subtipado con bindings distintos (rename)', () => {
|
|
49
|
+
const t1 = (0, refinement_types_1.refine)('Int', 'a', 'a >= 10');
|
|
50
|
+
const t2 = (0, refinement_types_1.refine)('Int', 'b', 'b > 0');
|
|
51
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(t1, t2)).toBe(true);
|
|
52
|
+
});
|
|
53
|
+
(0, vitest_1.it)('intersección de rangos: { x | x>0 && x<10 } <: { x | x<100 }', () => {
|
|
54
|
+
const t1 = (0, refinement_types_1.refine)('Int', 'x', 'x > 0 && x < 10');
|
|
55
|
+
const t2 = (0, refinement_types_1.refine)('Int', 'x', 'x < 100');
|
|
56
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(t1, t2)).toBe(true);
|
|
57
|
+
});
|
|
58
|
+
(0, vitest_1.it)('tipos base distintos no son subtipo', () => {
|
|
59
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)((0, refinement_types_1.tInt)(), (0, refinement_types_1.tBool)())).toBe(false);
|
|
60
|
+
});
|
|
61
|
+
(0, vitest_1.it)('subtipado de arrow: contravariante en parámetro', () => {
|
|
62
|
+
// (Int|x>0) -> Int <: (Int|x>5) -> Int (porque {x>5} <: {x>0})
|
|
63
|
+
const broader = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
64
|
+
const narrower = (0, refinement_types_1.refine)('Int', 'x', 'x > 5');
|
|
65
|
+
const arrA = {
|
|
66
|
+
base: { kind: 'arrow', from: broader, to: (0, refinement_types_1.tInt)() },
|
|
67
|
+
binding: '_f',
|
|
68
|
+
predicate: 'true',
|
|
69
|
+
};
|
|
70
|
+
const arrB = {
|
|
71
|
+
base: { kind: 'arrow', from: narrower, to: (0, refinement_types_1.tInt)() },
|
|
72
|
+
binding: '_f',
|
|
73
|
+
predicate: 'true',
|
|
74
|
+
};
|
|
75
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(arrA, arrB)).toBe(true);
|
|
76
|
+
(0, vitest_1.expect)((0, refinement_types_1.isSubtype)(arrB, arrA)).toBe(false);
|
|
77
|
+
});
|
|
78
|
+
});
|
|
79
|
+
(0, vitest_1.describe)('refinement-types / typeCheck (aplicación)', () => {
|
|
80
|
+
(0, vitest_1.it)('(λ x : {x:Int | x>0}. x+1) 5 type-checks', () => {
|
|
81
|
+
const positives = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
82
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', positives, (0, refinement_types_1.rBinop)('+', (0, refinement_types_1.rVar)('x'), (0, refinement_types_1.rLit)(1))), (0, refinement_types_1.rLit)(5));
|
|
83
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
84
|
+
if (!res.ok) {
|
|
85
|
+
console.warn('errors:', res.errors);
|
|
86
|
+
}
|
|
87
|
+
(0, vitest_1.expect)(res.ok).toBe(true);
|
|
88
|
+
});
|
|
89
|
+
(0, vitest_1.it)('(λ x : {x:Int | x>0}. x+1) 0 es RECHAZADO (precondición violada)', () => {
|
|
90
|
+
const positives = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
91
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', positives, (0, refinement_types_1.rBinop)('+', (0, refinement_types_1.rVar)('x'), (0, refinement_types_1.rLit)(1))), (0, refinement_types_1.rLit)(0));
|
|
92
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
93
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
94
|
+
(0, vitest_1.expect)(res.errors.length).toBeGreaterThan(0);
|
|
95
|
+
});
|
|
96
|
+
(0, vitest_1.it)('(λ x : {x:Int | x>0}. x+1) -3 es RECHAZADO', () => {
|
|
97
|
+
const positives = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
98
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', positives, (0, refinement_types_1.rBinop)('+', (0, refinement_types_1.rVar)('x'), (0, refinement_types_1.rLit)(1))), (0, refinement_types_1.rLit)(-3));
|
|
99
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
100
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
101
|
+
});
|
|
102
|
+
(0, vitest_1.it)('rango doble: argumento dentro de [1..99] es aceptado', () => {
|
|
103
|
+
const inRange = (0, refinement_types_1.refine)('Int', 'x', 'x > 0 && x < 100');
|
|
104
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', inRange, (0, refinement_types_1.rVar)('x')), (0, refinement_types_1.rLit)(42));
|
|
105
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
106
|
+
(0, vitest_1.expect)(res.ok).toBe(true);
|
|
107
|
+
});
|
|
108
|
+
(0, vitest_1.it)('rango doble: argumento fuera del rango es rechazado', () => {
|
|
109
|
+
const inRange = (0, refinement_types_1.refine)('Int', 'x', 'x > 0 && x < 100');
|
|
110
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', inRange, (0, refinement_types_1.rVar)('x')), (0, refinement_types_1.rLit)(150));
|
|
111
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
112
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
113
|
+
});
|
|
114
|
+
(0, vitest_1.it)('let con anotación: valor que satisface el predicado pasa', () => {
|
|
115
|
+
const term = (0, refinement_types_1.rLet)('y', (0, refinement_types_1.rLit)(10), (0, refinement_types_1.rVar)('y'), (0, refinement_types_1.refine)('Int', 'y', 'y > 0'));
|
|
116
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
117
|
+
(0, vitest_1.expect)(res.ok).toBe(true);
|
|
118
|
+
});
|
|
119
|
+
(0, vitest_1.it)('let con anotación: valor que NO satisface el predicado falla', () => {
|
|
120
|
+
const term = (0, refinement_types_1.rLet)('y', (0, refinement_types_1.rLit)(-1), (0, refinement_types_1.rVar)('y'), (0, refinement_types_1.refine)('Int', 'y', 'y > 0'));
|
|
121
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
122
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
123
|
+
});
|
|
124
|
+
(0, vitest_1.it)('binop suma sintetiza Int', () => {
|
|
125
|
+
const term = (0, refinement_types_1.rBinop)('+', (0, refinement_types_1.rLit)(2), (0, refinement_types_1.rLit)(3));
|
|
126
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
127
|
+
(0, vitest_1.expect)(res.ok).toBe(true);
|
|
128
|
+
(0, vitest_1.expect)(res.type?.base).toBe('Int');
|
|
129
|
+
});
|
|
130
|
+
(0, vitest_1.it)('binop comparación sintetiza Bool', () => {
|
|
131
|
+
const term = (0, refinement_types_1.rBinop)('<', (0, refinement_types_1.rLit)(2), (0, refinement_types_1.rLit)(3));
|
|
132
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
133
|
+
(0, vitest_1.expect)(res.ok).toBe(true);
|
|
134
|
+
(0, vitest_1.expect)(res.type?.base).toBe('Bool');
|
|
135
|
+
});
|
|
136
|
+
(0, vitest_1.it)('if con condición no booleana es rechazado', () => {
|
|
137
|
+
const term = { kind: 'if', cond: (0, refinement_types_1.rLit)(1), then: (0, refinement_types_1.rLit)(1), else: (0, refinement_types_1.rLit)(2) };
|
|
138
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
139
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
140
|
+
});
|
|
141
|
+
(0, vitest_1.it)('aplicar algo que no es función falla', () => {
|
|
142
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLit)(1), (0, refinement_types_1.rLit)(2));
|
|
143
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
144
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
145
|
+
});
|
|
146
|
+
(0, vitest_1.it)('variable libre da error', () => {
|
|
147
|
+
const term = (0, refinement_types_1.rVar)('z');
|
|
148
|
+
const res = (0, refinement_types_1.typeCheck)(term);
|
|
149
|
+
(0, vitest_1.expect)(res.ok).toBe(false);
|
|
150
|
+
});
|
|
151
|
+
});
|
|
152
|
+
(0, vitest_1.describe)('refinement-types / generateVC + utilidades', () => {
|
|
153
|
+
(0, vitest_1.it)('generateVC devuelve array (puede estar vacío en términos triviales)', () => {
|
|
154
|
+
const term = (0, refinement_types_1.rLit)(42);
|
|
155
|
+
(0, vitest_1.expect)(Array.isArray((0, refinement_types_1.generateVC)(term))).toBe(true);
|
|
156
|
+
});
|
|
157
|
+
(0, vitest_1.it)('generateVC: aplicación con precondición violada acumula al menos una VC', () => {
|
|
158
|
+
const positives = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
159
|
+
const term = (0, refinement_types_1.rApp)((0, refinement_types_1.rLam)('x', positives, (0, refinement_types_1.rVar)('x')), (0, refinement_types_1.rLit)(-1));
|
|
160
|
+
const vcs = (0, refinement_types_1.generateVC)(term);
|
|
161
|
+
(0, vitest_1.expect)(vcs.length).toBeGreaterThan(0);
|
|
162
|
+
});
|
|
163
|
+
(0, vitest_1.it)('refTypeToString incluye predicado cuando no es trivial', () => {
|
|
164
|
+
const t = (0, refinement_types_1.refine)('Int', 'x', 'x > 0');
|
|
165
|
+
const s = (0, refinement_types_1.refTypeToString)(t);
|
|
166
|
+
(0, vitest_1.expect)(s).toContain('Int');
|
|
167
|
+
(0, vitest_1.expect)(s).toContain('x > 0');
|
|
168
|
+
});
|
|
169
|
+
(0, vitest_1.it)('refTypeToString omite predicado trivial', () => {
|
|
170
|
+
const t = (0, refinement_types_1.tInt)('x', 'true');
|
|
171
|
+
(0, vitest_1.expect)((0, refinement_types_1.refTypeToString)(t)).not.toContain('|');
|
|
172
|
+
});
|
|
173
|
+
});
|
|
174
|
+
//# sourceMappingURL=refinement-types.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"refinement-types.test.js","sourceRoot":"","sources":["../../../src/tests/refinement-types/refinement-types.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,6DAkBgC;AAEhC,IAAA,iBAAQ,EAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,GAAG,GAAG,IAAA,0BAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,IAAA,0BAAO,EAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,GAAG,CAAC,OAAQ,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,CAAW,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,CAAW,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,GAAG,GAAG,IAAA,0BAAO,EAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,OAAO,GAAG,IAAA,qCAAkB,EAAC,iBAAiB,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChE,uFAAuF;QACvF,MAAM,GAAG,GAAG,IAAA,iCAAc,EAAC,OAAO,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,iBAAiB,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,uBAAI,GAAE,EAAE,IAAA,wBAAK,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,gEAAgE;QAChE,MAAM,OAAO,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG;YACX,IAAI,EAAE,EAAE,IAAI,EAAE,OAAgB,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,IAAA,uBAAI,GAAE,EAAE;YAC3D,OAAO,EAAE,IAAI;YACb,SAAS,EAAE,MAAM;SAClB,CAAC;QACF,MAAM,IAAI,GAAG;YACX,IAAI,EAAE,EAAE,IAAI,EAAE,OAAgB,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAA,uBAAI,GAAE,EAAE;YAC5D,OAAO,EAAE,IAAI;YACb,SAAS,EAAE,MAAM;SAClB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,SAAS,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,SAAS,EAAE,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,CAAC;QACD,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,SAAS,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,SAAS,EAAE,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,SAAS,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,SAAS,EAAE,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,OAAO,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,kBAAkB,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,OAAO,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,EAAE,CAAC,CAAC,CAAC;QAC3D,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,OAAO,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,kBAAkB,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,OAAO,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,EAAE,CAAC,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;QACzE,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;QACzE,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,IAAI,GAAG,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,IAAI,GAAG,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,IAAa,EAAE,IAAI,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,CAAC;QAClF,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAA,4BAAS,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,EAAE,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,KAAK,CAAC,OAAO,CAAC,IAAA,6BAAU,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yEAAyE,EAAE,GAAG,EAAE;QACjF,MAAM,SAAS,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,GAAG,EAAE,SAAS,EAAE,IAAA,uBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,GAAG,GAAG,IAAA,6BAAU,EAAC,IAAI,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,IAAA,yBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"prover.test.d.ts","sourceRoot":"","sources":["../../../src/tests/sequent-lk/prover.test.ts"],"names":[],"mappings":""}
|