@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,164 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const vitest_1 = require("vitest");
|
|
4
|
+
const lambda_calc_1 = require("../../lambda-calc");
|
|
5
|
+
(0, vitest_1.describe)('lambda-calc / sustitución y α', () => {
|
|
6
|
+
(0, vitest_1.it)('freeVars enumera variables libres respetando binders', () => {
|
|
7
|
+
// λx. x y → libres = {y}
|
|
8
|
+
const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('y')));
|
|
9
|
+
(0, vitest_1.expect)(Array.from((0, lambda_calc_1.freeVars)(t))).toEqual(['y']);
|
|
10
|
+
});
|
|
11
|
+
(0, vitest_1.it)('substitute capture-avoiding: (λy. x)[x := y] → λy#0. y', () => {
|
|
12
|
+
// El binder `y` choca con la `y` libre del valor sustituido; se debe renombrar.
|
|
13
|
+
const t = (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('x'));
|
|
14
|
+
const r = (0, lambda_calc_1.substitute)(t, 'x', (0, lambda_calc_1.v)('y'));
|
|
15
|
+
(0, vitest_1.expect)(r.kind).toBe('abs');
|
|
16
|
+
if (r.kind === 'abs') {
|
|
17
|
+
(0, vitest_1.expect)(r.param).not.toBe('y');
|
|
18
|
+
// El cuerpo es exactamente la `y` libre original.
|
|
19
|
+
(0, vitest_1.expect)(r.body).toEqual((0, lambda_calc_1.v)('y'));
|
|
20
|
+
}
|
|
21
|
+
});
|
|
22
|
+
(0, vitest_1.it)('betaStep: (λx.x) y → y', () => {
|
|
23
|
+
const t = (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y'));
|
|
24
|
+
const r = (0, lambda_calc_1.betaStep)(t);
|
|
25
|
+
(0, vitest_1.expect)(r).toEqual((0, lambda_calc_1.v)('y'));
|
|
26
|
+
});
|
|
27
|
+
(0, vitest_1.it)('betaStep capture avoidance: (λx.λy.x) y → λz.y (z fresh)', () => {
|
|
28
|
+
// (λx.λy.x) y debe renombrar el binder interno para no capturar.
|
|
29
|
+
const t = (0, lambda_calc_1.ap)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('x'))), (0, lambda_calc_1.v)('y'));
|
|
30
|
+
const r = (0, lambda_calc_1.betaStep)(t);
|
|
31
|
+
(0, vitest_1.expect)(r).not.toBeNull();
|
|
32
|
+
if (r === null)
|
|
33
|
+
return;
|
|
34
|
+
(0, vitest_1.expect)(r.kind).toBe('abs');
|
|
35
|
+
if (r.kind === 'abs') {
|
|
36
|
+
// El binder fue renombrado → ya no se llama 'y'.
|
|
37
|
+
(0, vitest_1.expect)(r.param).not.toBe('y');
|
|
38
|
+
// Y el cuerpo es la `y` libre, no la antigua ligada.
|
|
39
|
+
(0, vitest_1.expect)(r.body).toEqual((0, lambda_calc_1.v)('y'));
|
|
40
|
+
}
|
|
41
|
+
// α-equivalente a λz.y.
|
|
42
|
+
(0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(r, (0, lambda_calc_1.lam)('z', (0, lambda_calc_1.v)('y')))).toBe(true);
|
|
43
|
+
});
|
|
44
|
+
});
|
|
45
|
+
(0, vitest_1.describe)('lambda-calc / β-reducción y estrategias', () => {
|
|
46
|
+
(0, vitest_1.it)('normalize(SKK) →* I (módulo α)', () => {
|
|
47
|
+
const term = (0, lambda_calc_1.apN)(lambda_calc_1.S, lambda_calc_1.K, lambda_calc_1.K);
|
|
48
|
+
const { result, terminated } = (0, lambda_calc_1.normalize)(term);
|
|
49
|
+
(0, vitest_1.expect)(terminated).toBe(true);
|
|
50
|
+
// SKK es la implementación clásica de I.
|
|
51
|
+
(0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(result, lambda_calc_1.I)).toBe(true);
|
|
52
|
+
});
|
|
53
|
+
(0, vitest_1.it)('normalize(omega) no termina: maxSteps agotado y terminated=false', () => {
|
|
54
|
+
const { steps, terminated } = (0, lambda_calc_1.normalize)(lambda_calc_1.omega, { maxSteps: 100 });
|
|
55
|
+
(0, vitest_1.expect)(terminated).toBe(false);
|
|
56
|
+
(0, vitest_1.expect)(steps).toBe(100);
|
|
57
|
+
});
|
|
58
|
+
(0, vitest_1.it)('cbn termina en weak-head normal form, no entra bajo λ', () => {
|
|
59
|
+
// λz. (λx.x) z — bajo cbn es ya WHNF (no reduce bajo lambda).
|
|
60
|
+
const t = (0, lambda_calc_1.lam)('z', (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('z')));
|
|
61
|
+
const { result, terminated } = (0, lambda_calc_1.normalize)(t, { strategy: 'cbn', maxSteps: 50 });
|
|
62
|
+
(0, vitest_1.expect)(terminated).toBe(true);
|
|
63
|
+
(0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)(result)).toBe(true);
|
|
64
|
+
// No se reduce: el redex interno queda intacto.
|
|
65
|
+
(0, vitest_1.expect)(result.kind).toBe('abs');
|
|
66
|
+
if (result.kind === 'abs') {
|
|
67
|
+
(0, vitest_1.expect)(result.body.kind).toBe('app');
|
|
68
|
+
}
|
|
69
|
+
});
|
|
70
|
+
(0, vitest_1.it)('cbv reduce argumentos antes de aplicar — (λx.y) ((λw.w) z) →* y', () => {
|
|
71
|
+
// El argumento se reduce primero pero al final el lambda lo descarta.
|
|
72
|
+
const t = (0, lambda_calc_1.ap)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('y')), (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('z')));
|
|
73
|
+
const { result, terminated } = (0, lambda_calc_1.normalize)(t, { strategy: 'cbv', maxSteps: 50 });
|
|
74
|
+
(0, vitest_1.expect)(terminated).toBe(true);
|
|
75
|
+
(0, vitest_1.expect)(result).toEqual((0, lambda_calc_1.v)('y'));
|
|
76
|
+
});
|
|
77
|
+
(0, vitest_1.it)('leftmost-innermost vs outermost: ambos preservan ((λx.x) y) → y en este caso', () => {
|
|
78
|
+
const t = (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y'));
|
|
79
|
+
(0, vitest_1.expect)((0, lambda_calc_1.betaStep)(t, 'leftmost-outermost')).toEqual((0, lambda_calc_1.v)('y'));
|
|
80
|
+
(0, vitest_1.expect)((0, lambda_calc_1.betaStep)(t, 'leftmost-innermost')).toEqual((0, lambda_calc_1.v)('y'));
|
|
81
|
+
});
|
|
82
|
+
(0, vitest_1.it)('isNormalForm distingue normal de redex', () => {
|
|
83
|
+
(0, vitest_1.expect)((0, lambda_calc_1.isNormalForm)((0, lambda_calc_1.v)('x'))).toBe(true);
|
|
84
|
+
(0, vitest_1.expect)((0, lambda_calc_1.isNormalForm)(lambda_calc_1.I)).toBe(true);
|
|
85
|
+
(0, vitest_1.expect)((0, lambda_calc_1.isNormalForm)((0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y')))).toBe(false);
|
|
86
|
+
});
|
|
87
|
+
(0, vitest_1.it)('isWeakHeadNormalForm: λ y aplicación var-headed son WHNF; redex no', () => {
|
|
88
|
+
(0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)(lambda_calc_1.I)).toBe(true);
|
|
89
|
+
(0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)((0, lambda_calc_1.ap)((0, lambda_calc_1.v)('f'), (0, lambda_calc_1.v)('y')))).toBe(true);
|
|
90
|
+
(0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)((0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y')))).toBe(false);
|
|
91
|
+
});
|
|
92
|
+
});
|
|
93
|
+
(0, vitest_1.describe)('lambda-calc / η-reducción', () => {
|
|
94
|
+
(0, vitest_1.it)('etaStep: (λx. f x) → f cuando x ∉ FV(f)', () => {
|
|
95
|
+
const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('f'), (0, lambda_calc_1.v)('x')));
|
|
96
|
+
(0, vitest_1.expect)((0, lambda_calc_1.etaStep)(t)).toEqual((0, lambda_calc_1.v)('f'));
|
|
97
|
+
});
|
|
98
|
+
(0, vitest_1.it)('etaStep NO aplica cuando x ∈ FV(f): (λx. x x) se queda igual', () => {
|
|
99
|
+
const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('x')));
|
|
100
|
+
(0, vitest_1.expect)((0, lambda_calc_1.etaStep)(t)).toBeNull();
|
|
101
|
+
});
|
|
102
|
+
});
|
|
103
|
+
(0, vitest_1.describe)('lambda-calc / Church numerals', () => {
|
|
104
|
+
(0, vitest_1.it)('churchNumeral(0..3) son normalmente decodificables', () => {
|
|
105
|
+
for (let n = 0; n <= 3; n += 1) {
|
|
106
|
+
(0, vitest_1.expect)((0, lambda_calc_1.decodeChurch)((0, lambda_calc_1.churchNumeral)(n))).toBe(n);
|
|
107
|
+
}
|
|
108
|
+
});
|
|
109
|
+
(0, vitest_1.it)('SUCC: succ(2̄) →* 3̄', () => {
|
|
110
|
+
const term = (0, lambda_calc_1.ap)(lambda_calc_1.churchSucc, (0, lambda_calc_1.churchNumeral)(2));
|
|
111
|
+
(0, vitest_1.expect)((0, lambda_calc_1.evalChurch)(term)).toBe(3);
|
|
112
|
+
});
|
|
113
|
+
(0, vitest_1.it)('ADD: 2 + 3 →* 5', () => {
|
|
114
|
+
const term = (0, lambda_calc_1.apN)(lambda_calc_1.churchAdd, (0, lambda_calc_1.churchNumeral)(2), (0, lambda_calc_1.churchNumeral)(3));
|
|
115
|
+
(0, vitest_1.expect)((0, lambda_calc_1.evalChurch)(term)).toBe(5);
|
|
116
|
+
});
|
|
117
|
+
(0, vitest_1.it)('MUL: 3 * 4 →* 12', () => {
|
|
118
|
+
const term = (0, lambda_calc_1.apN)(lambda_calc_1.churchMul, (0, lambda_calc_1.churchNumeral)(3), (0, lambda_calc_1.churchNumeral)(4));
|
|
119
|
+
(0, vitest_1.expect)((0, lambda_calc_1.evalChurch)(term)).toBe(12);
|
|
120
|
+
});
|
|
121
|
+
(0, vitest_1.it)('decodeChurch devuelve null para términos que no son numerales', () => {
|
|
122
|
+
// y libre, no es Church numeral.
|
|
123
|
+
(0, vitest_1.expect)((0, lambda_calc_1.decodeChurch)((0, lambda_calc_1.v)('y'))).toBeNull();
|
|
124
|
+
// Función pero no tiene la forma λf.λx. f^n x.
|
|
125
|
+
(0, vitest_1.expect)((0, lambda_calc_1.decodeChurch)((0, lambda_calc_1.lam)('f', (0, lambda_calc_1.v)('x')))).toBeNull();
|
|
126
|
+
});
|
|
127
|
+
});
|
|
128
|
+
(0, vitest_1.describe)('lambda-calc / utilidades', () => {
|
|
129
|
+
(0, vitest_1.it)('alphaEq detecta equivalencia y rechaza diferencias estructurales', () => {
|
|
130
|
+
(0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('x')), (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('y')))).toBe(true);
|
|
131
|
+
(0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('x')), (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('y')))).toBe(false);
|
|
132
|
+
// Variables libres con nombres distintos NO son α-equivalentes.
|
|
133
|
+
(0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('y'))).toBe(false);
|
|
134
|
+
});
|
|
135
|
+
(0, vitest_1.it)('alphaRename produce términos α-equivalentes al original', () => {
|
|
136
|
+
const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('y'))));
|
|
137
|
+
const supply = (0, lambda_calc_1.makeFreshSupply)();
|
|
138
|
+
const renamed = (0, lambda_calc_1.alphaRename)(t, supply);
|
|
139
|
+
(0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(t, renamed)).toBe(true);
|
|
140
|
+
// Y los binders quedaron con los nombres frescos.
|
|
141
|
+
if (renamed.kind === 'abs') {
|
|
142
|
+
(0, vitest_1.expect)(renamed.param).toMatch(/^_x\d+$/);
|
|
143
|
+
}
|
|
144
|
+
});
|
|
145
|
+
(0, vitest_1.it)('termToString produce algo legible para combinadores', () => {
|
|
146
|
+
(0, vitest_1.expect)((0, lambda_calc_1.termToString)(lambda_calc_1.I)).toBe('(λx.x)');
|
|
147
|
+
(0, vitest_1.expect)((0, lambda_calc_1.termToString)((0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y')))).toBe('((λx.x) y)');
|
|
148
|
+
});
|
|
149
|
+
(0, vitest_1.it)('Y-combinator es un punto fijo: Y f →* f (Y f) (1 paso de unfolding bajo cbn)', () => {
|
|
150
|
+
// Bajo cbn, Y f hace UN paso β y revela la forma f ((λx.f(xx))(λx.f(xx))).
|
|
151
|
+
const term = (0, lambda_calc_1.ap)(lambda_calc_1.Y, (0, lambda_calc_1.v)('f'));
|
|
152
|
+
const next = (0, lambda_calc_1.betaStep)(term);
|
|
153
|
+
(0, vitest_1.expect)(next).not.toBeNull();
|
|
154
|
+
if (next === null)
|
|
155
|
+
return;
|
|
156
|
+
// El primer paso debe producir (λx. f (x x)) (λx. f (x x)).
|
|
157
|
+
(0, vitest_1.expect)(next.kind).toBe('app');
|
|
158
|
+
if (next.kind === 'app') {
|
|
159
|
+
// La cabeza es λx. f (x x).
|
|
160
|
+
(0, vitest_1.expect)(next.fn.kind).toBe('abs');
|
|
161
|
+
}
|
|
162
|
+
});
|
|
163
|
+
});
|
|
164
|
+
//# sourceMappingURL=lambda-calc.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"lambda-calc.test.js","sourceRoot":"","sources":["../../../src/tests/lambda-calc/lambda-calc.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,mDA2B2B;AAE3B,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,2BAA2B;QAC3B,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,IAAI,CAAC,IAAA,sBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,gFAAgF;QAChF,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAA,wBAAU,EAAC,CAAC,EAAE,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,kDAAkD;YAClD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAA,sBAAQ,EAAC,CAAC,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,iEAAiE;QACjE,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,IAAA,sBAAQ,EAAC,CAAC,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO;QACvB,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,iDAAiD;YACjD,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,qDAAqD;YACrD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,wBAAwB;QACxB,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,eAAC,EAAE,eAAC,EAAE,eAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,yCAAyC;QACzC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,MAAM,EAAE,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,mBAAK,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,+DAA+D;QAC/D,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/E,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,gDAAgD;QAChD,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC1B,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,sEAAsE;QACtE,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/E,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAChC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,IAAI,GAAG,IAAA,gBAAE,EAAC,wBAAU,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,wBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iBAAiB,EAAE,GAAG,EAAE;QACzB,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,uBAAS,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,IAAA,wBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kBAAkB,EAAE,GAAG,EAAE;QAC1B,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,uBAAS,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,IAAA,wBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,iCAAiC;QACjC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACxC,+CAA+C;QAC/C,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChE,gEAAgE;QAChE,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,6BAAe,GAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAA,yBAAW,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,kDAAkD;QAClD,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+EAA+E,EAAE,GAAG,EAAE;QACvF,2EAA2E;QAC3E,MAAM,IAAI,GAAG,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,4DAA4D;QAC5D,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACxB,4BAA4B;YAC5B,IAAA,eAAM,EAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"many-valued.test.d.ts","sourceRoot":"","sources":["../../../src/tests/many-valued/many-valued.test.ts"],"names":[],"mappings":""}
|
|
@@ -0,0 +1,150 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const vitest_1 = require("vitest");
|
|
4
|
+
const many_valued_1 = require("../../profiles/many-valued");
|
|
5
|
+
const P = (0, many_valued_1.atom)('P');
|
|
6
|
+
const Q = (0, many_valued_1.atom)('Q');
|
|
7
|
+
(0, vitest_1.describe)('many-valued logics — núcleo de evaluación', () => {
|
|
8
|
+
(0, vitest_1.it)('Łukasiewicz: P → P es tautología', () => {
|
|
9
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)(P, P), 'lukasiewicz')).toBe(true);
|
|
10
|
+
});
|
|
11
|
+
(0, vitest_1.it)('Łukasiewicz (strong OR): P ∨ ¬P SÍ es tautología vía s-norm min(1, p+(1-p))=1', () => {
|
|
12
|
+
// Con la disyunción fuerte (s-norm), P ∨ ¬P se colapsa a 1 siempre.
|
|
13
|
+
// Es Gödel/Producto quienes rompen el tercero excluido — ver tests abajo.
|
|
14
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), 'lukasiewicz')).toBe(true);
|
|
15
|
+
const v = (0, many_valued_1.evaluate)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), { P: 0.5 }, 'lukasiewicz');
|
|
16
|
+
(0, vitest_1.expect)(v).toBeCloseTo(1, 9); // min(1, 0.5+0.5)=1
|
|
17
|
+
});
|
|
18
|
+
(0, vitest_1.it)('Łukasiewicz: P ∧ ¬P NO siempre 0 — pero ¬(P ∧ ¬P) sí es tautología', () => {
|
|
19
|
+
// En Łukasiewicz, P ∧ ¬P = max(0, P + (1-P) - 1) = max(0, 0) = 0
|
|
20
|
+
// Así que ¬(P ∧ ¬P) sí es tautología (es la "no-contradicción").
|
|
21
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.not)((0, many_valued_1.and)(P, (0, many_valued_1.not)(P))), 'lukasiewicz')).toBe(true);
|
|
22
|
+
(0, vitest_1.expect)((0, many_valued_1.isContradiction)((0, many_valued_1.and)(P, (0, many_valued_1.not)(P)), 'lukasiewicz')).toBe(true);
|
|
23
|
+
});
|
|
24
|
+
(0, vitest_1.it)('Gödel: P ∨ ¬P NO es tautología', () => {
|
|
25
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), 'godel')).toBe(false);
|
|
26
|
+
// Cuando P=0.5: ¬P=0 (porque P≠0), entonces max(0.5, 0)=0.5
|
|
27
|
+
const v = (0, many_valued_1.evaluate)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), { P: 0.5 }, 'godel');
|
|
28
|
+
(0, vitest_1.expect)(v).toBeCloseTo(0.5, 9);
|
|
29
|
+
});
|
|
30
|
+
(0, vitest_1.it)('Gödel: P → P es tautología', () => {
|
|
31
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)(P, P), 'godel')).toBe(true);
|
|
32
|
+
});
|
|
33
|
+
(0, vitest_1.it)('Gödel: P ∧ P = P (t-norm idempotente)', () => {
|
|
34
|
+
for (const p of [0, 0.25, 0.5, 0.75, 1]) {
|
|
35
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.and)(P, P), { P: p }, 'godel')).toBeCloseTo(p, 9);
|
|
36
|
+
}
|
|
37
|
+
});
|
|
38
|
+
(0, vitest_1.it)('Producto: P ∧ P puede ser strictly menor que P (P=0.5 → 0.25)', () => {
|
|
39
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.and)(P, P), { P: 0.5 }, 'product')).toBeCloseTo(0.25, 9);
|
|
40
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.and)(P, P), { P: 0.3 }, 'product')).toBeCloseTo(0.09, 9);
|
|
41
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.and)(P, P), { P: 1 }, 'product')).toBeCloseTo(1, 9);
|
|
42
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.and)(P, P), { P: 0 }, 'product')).toBeCloseTo(0, 9);
|
|
43
|
+
});
|
|
44
|
+
(0, vitest_1.it)('Producto: P → P es tautología y P → Q vale q/p cuando p>q', () => {
|
|
45
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)(P, P), 'product')).toBe(true);
|
|
46
|
+
// P=0.8, Q=0.2 → q/p = 0.25
|
|
47
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), { P: 0.8, Q: 0.2 }, 'product')).toBeCloseTo(0.25, 9);
|
|
48
|
+
// P=0.2, Q=0.8 → 1 (porque p<=q)
|
|
49
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), { P: 0.2, Q: 0.8 }, 'product')).toBeCloseTo(1, 9);
|
|
50
|
+
});
|
|
51
|
+
(0, vitest_1.it)('Comparación: P ∧ Q con P=0.6, Q=0.4 da distinto en cada sistema', () => {
|
|
52
|
+
const env = { P: 0.6, Q: 0.4 };
|
|
53
|
+
const luka = (0, many_valued_1.evaluate)((0, many_valued_1.and)(P, Q), env, 'lukasiewicz');
|
|
54
|
+
const godel = (0, many_valued_1.evaluate)((0, many_valued_1.and)(P, Q), env, 'godel');
|
|
55
|
+
const prod = (0, many_valued_1.evaluate)((0, many_valued_1.and)(P, Q), env, 'product');
|
|
56
|
+
// Łukasiewicz: max(0, 0.6+0.4-1)=0
|
|
57
|
+
(0, vitest_1.expect)(luka).toBeCloseTo(0, 9);
|
|
58
|
+
// Gödel: min(0.6, 0.4)=0.4
|
|
59
|
+
(0, vitest_1.expect)(godel).toBeCloseTo(0.4, 9);
|
|
60
|
+
// Product: 0.6*0.4=0.24
|
|
61
|
+
(0, vitest_1.expect)(prod).toBeCloseTo(0.24, 9);
|
|
62
|
+
(0, vitest_1.expect)(luka).not.toBeCloseTo(godel, 2);
|
|
63
|
+
(0, vitest_1.expect)(godel).not.toBeCloseTo(prod, 2);
|
|
64
|
+
});
|
|
65
|
+
(0, vitest_1.it)('Comparación de implicación: P=0.6, Q=0.4 (p>q)', () => {
|
|
66
|
+
const env = { P: 0.6, Q: 0.4 };
|
|
67
|
+
// Łukasiewicz: min(1, 1-0.6+0.4)=0.8
|
|
68
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'lukasiewicz')).toBeCloseTo(0.8, 9);
|
|
69
|
+
// Gödel: p>q → 0.4
|
|
70
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'godel')).toBeCloseTo(0.4, 9);
|
|
71
|
+
// Product: q/p = 0.4/0.6 ≈ 0.6667
|
|
72
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'product')).toBeCloseTo(2 / 3, 9);
|
|
73
|
+
});
|
|
74
|
+
(0, vitest_1.it)('Łukasiewicz: negación involutiva ¬¬P = P es tautología modal', () => {
|
|
75
|
+
// En la rejilla, ¬¬P debe coincidir con P; expresado como
|
|
76
|
+
// (¬¬P → P) ∧ (P → ¬¬P) ambas deben ser tautologías.
|
|
77
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)((0, many_valued_1.not)((0, many_valued_1.not)(P)), P), 'lukasiewicz')).toBe(true);
|
|
78
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)(P, (0, many_valued_1.not)((0, many_valued_1.not)(P))), 'lukasiewicz')).toBe(true);
|
|
79
|
+
});
|
|
80
|
+
(0, vitest_1.it)('Gödel/Product: ¬¬P ≠ P (negación no involutiva)', () => {
|
|
81
|
+
// En Gödel/Product, ¬0.5 = 0 → ¬¬0.5 = 1, distinto de 0.5.
|
|
82
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.not)((0, many_valued_1.not)(P)), { P: 0.5 }, 'godel')).toBeCloseTo(1, 9);
|
|
83
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)((0, many_valued_1.not)((0, many_valued_1.not)(P)), { P: 0.5 }, 'product')).toBeCloseTo(1, 9);
|
|
84
|
+
// por tanto (¬¬P → P) NO es tautología
|
|
85
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)((0, many_valued_1.not)((0, many_valued_1.not)(P)), P), 'godel')).toBe(false);
|
|
86
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)((0, many_valued_1.implies)((0, many_valued_1.not)((0, many_valued_1.not)(P)), P), 'product')).toBe(false);
|
|
87
|
+
});
|
|
88
|
+
(0, vitest_1.it)('Modus ponens (P ∧ (P → Q)) → Q es tautología en los 3 sistemas', () => {
|
|
89
|
+
const mp = (0, many_valued_1.implies)((0, many_valued_1.and)(P, (0, many_valued_1.implies)(P, Q)), Q);
|
|
90
|
+
for (const sys of ['lukasiewicz', 'godel', 'product']) {
|
|
91
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)(mp, sys)).toBe(true);
|
|
92
|
+
}
|
|
93
|
+
});
|
|
94
|
+
(0, vitest_1.it)('findValuation: P ∨ ¬P en Łukasiewicz no tiene contraejemplo (s-norm fuerte)', () => {
|
|
95
|
+
// En Łukasiewicz strong, P∨¬P = min(1, P+1-P)=1 siempre.
|
|
96
|
+
const v = (0, many_valued_1.findValuation)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), 'lukasiewicz', 0.5);
|
|
97
|
+
(0, vitest_1.expect)(v).toBeNull();
|
|
98
|
+
});
|
|
99
|
+
(0, vitest_1.it)('findValuation encuentra contraejemplo de P ∨ ¬P en Gödel', () => {
|
|
100
|
+
const v = (0, many_valued_1.findValuation)((0, many_valued_1.or)(P, (0, many_valued_1.not)(P)), 'godel', 0.5);
|
|
101
|
+
// P=0.5 → ¬P=0 → max=0.5
|
|
102
|
+
(0, vitest_1.expect)(v).not.toBeNull();
|
|
103
|
+
if (v) {
|
|
104
|
+
(0, vitest_1.expect)(v.P).toBeCloseTo(0.5, 6);
|
|
105
|
+
}
|
|
106
|
+
});
|
|
107
|
+
(0, vitest_1.it)('isContradiction: 0 sólo es 0 — P ∧ ¬P es contradicción en Łukasiewicz', () => {
|
|
108
|
+
(0, vitest_1.expect)((0, many_valued_1.isContradiction)((0, many_valued_1.and)(P, (0, many_valued_1.not)(P)), 'lukasiewicz')).toBe(true);
|
|
109
|
+
});
|
|
110
|
+
(0, vitest_1.it)('collectFuzzyAtoms recoge átomos únicos y ordenados', () => {
|
|
111
|
+
const f = (0, many_valued_1.and)(P, (0, many_valued_1.or)(Q, (0, many_valued_1.not)((0, many_valued_1.atom)('R'))));
|
|
112
|
+
(0, vitest_1.expect)((0, many_valued_1.collectFuzzyAtoms)(f)).toEqual(['P', 'Q', 'R']);
|
|
113
|
+
});
|
|
114
|
+
(0, vitest_1.it)('evaluate clamp01: entradas fuera de [0,1] se clampean', () => {
|
|
115
|
+
// env con valor 2 — el evaluator clampea a 1.
|
|
116
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)(P, { P: 2 }, 'lukasiewicz')).toBeCloseTo(1, 9);
|
|
117
|
+
(0, vitest_1.expect)((0, many_valued_1.evaluate)(P, { P: -0.5 }, 'product')).toBeCloseTo(0, 9);
|
|
118
|
+
});
|
|
119
|
+
(0, vitest_1.it)('Casos extremos 0/1: comportamiento clásico recuperado', () => {
|
|
120
|
+
// Cuando P,Q ∈ {0,1}, las 3 lógicas degeneran a clásica.
|
|
121
|
+
for (const p of [0, 1]) {
|
|
122
|
+
for (const q of [0, 1]) {
|
|
123
|
+
const env = { P: p, Q: q };
|
|
124
|
+
const luka = (0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'lukasiewicz');
|
|
125
|
+
const god = (0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'godel');
|
|
126
|
+
const prod = (0, many_valued_1.evaluate)((0, many_valued_1.implies)(P, Q), env, 'product');
|
|
127
|
+
const classical = p === 1 && q === 0 ? 0 : 1;
|
|
128
|
+
(0, vitest_1.expect)(luka).toBeCloseTo(classical, 9);
|
|
129
|
+
(0, vitest_1.expect)(god).toBeCloseTo(classical, 9);
|
|
130
|
+
(0, vitest_1.expect)(prod).toBeCloseTo(classical, 9);
|
|
131
|
+
}
|
|
132
|
+
}
|
|
133
|
+
});
|
|
134
|
+
(0, vitest_1.it)('Łukasiewicz: (P → Q) ∨ (Q → P) — prelinearity / Dummett', () => {
|
|
135
|
+
// Es tautología en los 3 sistemas (axioma común de las lógicas de Hájek).
|
|
136
|
+
const dum = (0, many_valued_1.or)((0, many_valued_1.implies)(P, Q), (0, many_valued_1.implies)(Q, P));
|
|
137
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)(dum, 'lukasiewicz')).toBe(true);
|
|
138
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)(dum, 'godel')).toBe(true);
|
|
139
|
+
(0, vitest_1.expect)((0, many_valued_1.isTautology)(dum, 'product')).toBe(true);
|
|
140
|
+
});
|
|
141
|
+
(0, vitest_1.it)('Producto: P ∧ Q = P*Q (t-norm conmutativo y asociativo)', () => {
|
|
142
|
+
const env1 = { P: 0.5, Q: 0.4 };
|
|
143
|
+
const env2 = { P: 0.4, Q: 0.5 };
|
|
144
|
+
const v1 = (0, many_valued_1.evaluate)((0, many_valued_1.and)(P, Q), env1, 'product');
|
|
145
|
+
const v2 = (0, many_valued_1.evaluate)((0, many_valued_1.and)(P, Q), env2, 'product');
|
|
146
|
+
(0, vitest_1.expect)(v1).toBeCloseTo(v2, 9);
|
|
147
|
+
(0, vitest_1.expect)(v1).toBeCloseTo(0.2, 9);
|
|
148
|
+
});
|
|
149
|
+
});
|
|
150
|
+
//# sourceMappingURL=many-valued.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"many-valued.test.js","sourceRoot":"","sources":["../../../src/tests/many-valued/many-valued.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,4DAYoC;AAEpC,MAAM,CAAC,GAAG,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC;AAEpB,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+EAA+E,EAAE,GAAG,EAAE;QACvF,oEAAoE;QACpE,0EAA0E;QAC1E,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,IAAA,sBAAQ,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,aAAa,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,oBAAoB;IACnD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,iEAAiE;QACjE,iEAAiE;QACjE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,IAAA,6BAAe,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,4DAA4D;QAC5D,MAAM,CAAC,GAAG,IAAA,sBAAQ,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,OAAO,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YACxC,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnE,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzD,4BAA4B;QAC5B,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACpF,iCAAiC;QACjC,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnF,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;QAEjD,mCAAmC;QACnC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/B,2BAA2B;QAC3B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClC,wBAAwB;QACxB,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAElC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;QAC/B,qCAAqC;QACrC,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACxE,mBAAmB;QACnB,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClE,kCAAkC;QAClC,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,0DAA0D;QAC1D,qDAAqD;QACrD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,2DAA2D;QAC3D,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvE,uCAAuC;QACvC,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,EAAE,GAAG,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,KAAK,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAoB,EAAE,CAAC;YACzE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6EAA6E,EAAE,GAAG,EAAE;QACrF,yDAAyD;QACzD,MAAM,CAAC,GAAG,IAAA,2BAAa,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,CAAC,GAAG,IAAA,2BAAa,EAAC,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;QACrD,yBAAyB;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,EAAE,CAAC;YACN,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,IAAA,eAAM,EAAC,IAAA,6BAAe,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,CAAC,EAAE,IAAA,gBAAE,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,+BAAiB,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,8CAA8C;QAC9C,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,yDAAyD;QACzD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACvB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACvB,MAAM,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC;gBACzD,MAAM,GAAG,GAAG,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;gBAClD,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;gBACrD,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7C,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;gBACvC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;gBACtC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,0EAA0E;QAC1E,MAAM,GAAG,GAAG,IAAA,gBAAE,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,qBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC;QAChC,MAAM,EAAE,GAAG,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QAChD,MAAM,EAAE,GAAG,IAAA,sBAAQ,EAAC,IAAA,iBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"markov-logic.test.d.ts","sourceRoot":"","sources":["../../../src/tests/markov-logic/markov-logic.test.ts"],"names":[],"mappings":""}
|