@stevenvo780/st-lang 4.5.1 → 4.6.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/bdd/index.d.ts +4 -0
- package/dist/bdd/index.d.ts.map +1 -0
- package/dist/bdd/index.js +29 -0
- package/dist/bdd/index.js.map +1 -0
- package/dist/bdd/manager.d.ts +122 -0
- package/dist/bdd/manager.d.ts.map +1 -0
- package/dist/bdd/manager.js +524 -0
- package/dist/bdd/manager.js.map +1 -0
- package/dist/bdd/types.d.ts +20 -0
- package/dist/bdd/types.d.ts.map +1 -0
- package/dist/bdd/types.js +28 -0
- package/dist/bdd/types.js.map +1 -0
- package/dist/categorical/fin-set.d.ts +39 -0
- package/dist/categorical/fin-set.d.ts.map +1 -0
- package/dist/categorical/fin-set.js +217 -0
- package/dist/categorical/fin-set.js.map +1 -0
- package/dist/categorical/free.d.ts +23 -0
- package/dist/categorical/free.d.ts.map +1 -0
- package/dist/categorical/free.js +168 -0
- package/dist/categorical/free.js.map +1 -0
- package/dist/categorical/functor.d.ts +40 -0
- package/dist/categorical/functor.d.ts.map +1 -0
- package/dist/categorical/functor.js +139 -0
- package/dist/categorical/functor.js.map +1 -0
- package/dist/categorical/index.d.ts +11 -0
- package/dist/categorical/index.d.ts.map +1 -0
- package/dist/categorical/index.js +33 -0
- package/dist/categorical/index.js.map +1 -0
- package/dist/categorical/limits.d.ts +64 -0
- package/dist/categorical/limits.d.ts.map +1 -0
- package/dist/categorical/limits.js +248 -0
- package/dist/categorical/limits.js.map +1 -0
- package/dist/categorical/monoidal.d.ts +14 -0
- package/dist/categorical/monoidal.d.ts.map +1 -0
- package/dist/categorical/monoidal.js +148 -0
- package/dist/categorical/monoidal.js.map +1 -0
- package/dist/categorical/poset.d.ts +14 -0
- package/dist/categorical/poset.d.ts.map +1 -0
- package/dist/categorical/poset.js +115 -0
- package/dist/categorical/poset.js.map +1 -0
- package/dist/categorical/types.d.ts +111 -0
- package/dist/categorical/types.d.ts.map +1 -0
- package/dist/categorical/types.js +15 -0
- package/dist/categorical/types.js.map +1 -0
- package/dist/csp-hoare/analysis.d.ts +51 -0
- package/dist/csp-hoare/analysis.d.ts.map +1 -0
- package/dist/csp-hoare/analysis.js +317 -0
- package/dist/csp-hoare/analysis.js.map +1 -0
- package/dist/csp-hoare/examples.d.ts +33 -0
- package/dist/csp-hoare/examples.d.ts.map +1 -0
- package/dist/csp-hoare/examples.js +108 -0
- package/dist/csp-hoare/examples.js.map +1 -0
- package/dist/csp-hoare/index.d.ts +6 -0
- package/dist/csp-hoare/index.d.ts.map +1 -0
- package/dist/csp-hoare/index.js +50 -0
- package/dist/csp-hoare/index.js.map +1 -0
- package/dist/csp-hoare/semantics.d.ts +49 -0
- package/dist/csp-hoare/semantics.d.ts.map +1 -0
- package/dist/csp-hoare/semantics.js +494 -0
- package/dist/csp-hoare/semantics.js.map +1 -0
- package/dist/csp-hoare/types.d.ts +60 -0
- package/dist/csp-hoare/types.d.ts.map +1 -0
- package/dist/csp-hoare/types.js +31 -0
- package/dist/csp-hoare/types.js.map +1 -0
- package/dist/game-theory/common-games.d.ts +50 -0
- package/dist/game-theory/common-games.d.ts.map +1 -0
- package/dist/game-theory/common-games.js +112 -0
- package/dist/game-theory/common-games.js.map +1 -0
- package/dist/game-theory/dominance.d.ts +26 -0
- package/dist/game-theory/dominance.d.ts.map +1 -0
- package/dist/game-theory/dominance.js +203 -0
- package/dist/game-theory/dominance.js.map +1 -0
- package/dist/game-theory/index.d.ts +8 -0
- package/dist/game-theory/index.d.ts.map +1 -0
- package/dist/game-theory/index.js +47 -0
- package/dist/game-theory/index.js.map +1 -0
- package/dist/game-theory/lemke-howson.d.ts +3 -0
- package/dist/game-theory/lemke-howson.d.ts.map +1 -0
- package/dist/game-theory/lemke-howson.js +269 -0
- package/dist/game-theory/lemke-howson.js.map +1 -0
- package/dist/game-theory/linalg.d.ts +7 -0
- package/dist/game-theory/linalg.d.ts.map +1 -0
- package/dist/game-theory/linalg.js +69 -0
- package/dist/game-theory/linalg.js.map +1 -0
- package/dist/game-theory/pure-nash.d.ts +3 -0
- package/dist/game-theory/pure-nash.d.ts.map +1 -0
- package/dist/game-theory/pure-nash.js +86 -0
- package/dist/game-theory/pure-nash.js.map +1 -0
- package/dist/game-theory/support-enumeration.d.ts +3 -0
- package/dist/game-theory/support-enumeration.d.ts.map +1 -0
- package/dist/game-theory/support-enumeration.js +214 -0
- package/dist/game-theory/support-enumeration.js.map +1 -0
- package/dist/game-theory/types.d.ts +57 -0
- package/dist/game-theory/types.d.ts.map +1 -0
- package/dist/game-theory/types.js +191 -0
- package/dist/game-theory/types.js.map +1 -0
- package/dist/hindley-milner/index.d.ts +7 -0
- package/dist/hindley-milner/index.d.ts.map +1 -0
- package/dist/hindley-milner/index.js +60 -0
- package/dist/hindley-milner/index.js.map +1 -0
- package/dist/hindley-milner/infer.d.ts +26 -0
- package/dist/hindley-milner/infer.d.ts.map +1 -0
- package/dist/hindley-milner/infer.js +278 -0
- package/dist/hindley-milner/infer.js.map +1 -0
- package/dist/hindley-milner/substitution.d.ts +21 -0
- package/dist/hindley-milner/substitution.d.ts.map +1 -0
- package/dist/hindley-milner/substitution.js +215 -0
- package/dist/hindley-milner/substitution.js.map +1 -0
- package/dist/hindley-milner/types.d.ts +84 -0
- package/dist/hindley-milner/types.d.ts.map +1 -0
- package/dist/hindley-milner/types.js +166 -0
- package/dist/hindley-milner/types.js.map +1 -0
- package/dist/hott/equality.d.ts +4 -0
- package/dist/hott/equality.d.ts.map +1 -0
- package/dist/hott/equality.js +108 -0
- package/dist/hott/equality.js.map +1 -0
- package/dist/hott/index.d.ts +13 -0
- package/dist/hott/index.d.ts.map +1 -0
- package/dist/hott/index.js +77 -0
- package/dist/hott/index.js.map +1 -0
- package/dist/hott/infer.d.ts +11 -0
- package/dist/hott/infer.d.ts.map +1 -0
- package/dist/hott/infer.js +465 -0
- package/dist/hott/infer.js.map +1 -0
- package/dist/hott/normalize.d.ts +5 -0
- package/dist/hott/normalize.d.ts.map +1 -0
- package/dist/hott/normalize.js +240 -0
- package/dist/hott/normalize.js.map +1 -0
- package/dist/hott/path-algebra.d.ts +25 -0
- package/dist/hott/path-algebra.d.ts.map +1 -0
- package/dist/hott/path-algebra.js +67 -0
- package/dist/hott/path-algebra.js.map +1 -0
- package/dist/hott/substitute.d.ts +3 -0
- package/dist/hott/substitute.d.ts.map +1 -0
- package/dist/hott/substitute.js +131 -0
- package/dist/hott/substitute.js.map +1 -0
- package/dist/hott/types.d.ts +126 -0
- package/dist/hott/types.d.ts.map +1 -0
- package/dist/hott/types.js +346 -0
- package/dist/hott/types.js.map +1 -0
- package/dist/index.d.ts +16 -1
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +83 -3
- package/dist/index.js.map +1 -1
- package/dist/information-theory/index.d.ts +29 -0
- package/dist/information-theory/index.d.ts.map +1 -0
- package/dist/information-theory/index.js +323 -0
- package/dist/information-theory/index.js.map +1 -0
- package/dist/lemma-synthesis/index.d.ts +124 -0
- package/dist/lemma-synthesis/index.d.ts.map +1 -0
- package/dist/lemma-synthesis/index.js +640 -0
- package/dist/lemma-synthesis/index.js.map +1 -0
- package/dist/namespaces/logic.d.ts +42 -0
- package/dist/namespaces/logic.d.ts.map +1 -0
- package/dist/namespaces/logic.js +112 -0
- package/dist/namespaces/logic.js.map +1 -0
- package/dist/namespaces/proof-systems.d.ts +18 -0
- package/dist/namespaces/proof-systems.d.ts.map +1 -0
- package/dist/namespaces/proof-systems.js +59 -0
- package/dist/namespaces/proof-systems.js.map +1 -0
- package/dist/namespaces/reasoning.d.ts +26 -0
- package/dist/namespaces/reasoning.d.ts.map +1 -0
- package/dist/namespaces/reasoning.js +72 -0
- package/dist/namespaces/reasoning.js.map +1 -0
- package/dist/namespaces/semantics.d.ts +21 -0
- package/dist/namespaces/semantics.d.ts.map +1 -0
- package/dist/namespaces/semantics.js +64 -0
- package/dist/namespaces/semantics.js.map +1 -0
- package/dist/namespaces/solvers.d.ts +22 -0
- package/dist/namespaces/solvers.d.ts.map +1 -0
- package/dist/namespaces/solvers.js +66 -0
- package/dist/namespaces/solvers.js.map +1 -0
- package/dist/namespaces/type-theory.d.ts +22 -0
- package/dist/namespaces/type-theory.d.ts.map +1 -0
- package/dist/namespaces/type-theory.js +65 -0
- package/dist/namespaces/type-theory.js.map +1 -0
- package/dist/optimization/branch-and-bound.d.ts +11 -0
- package/dist/optimization/branch-and-bound.d.ts.map +1 -0
- package/dist/optimization/branch-and-bound.js +311 -0
- package/dist/optimization/branch-and-bound.js.map +1 -0
- package/dist/optimization/index.d.ts +5 -0
- package/dist/optimization/index.d.ts.map +1 -0
- package/dist/optimization/index.js +20 -0
- package/dist/optimization/index.js.map +1 -0
- package/dist/optimization/simplex.d.ts +8 -0
- package/dist/optimization/simplex.d.ts.map +1 -0
- package/dist/optimization/simplex.js +408 -0
- package/dist/optimization/simplex.js.map +1 -0
- package/dist/optimization/standard-form.d.ts +11 -0
- package/dist/optimization/standard-form.d.ts.map +1 -0
- package/dist/optimization/standard-form.js +112 -0
- package/dist/optimization/standard-form.js.map +1 -0
- package/dist/optimization/types.d.ts +44 -0
- package/dist/optimization/types.d.ts.map +1 -0
- package/dist/optimization/types.js +15 -0
- package/dist/optimization/types.js.map +1 -0
- package/dist/profiles/hol/connectives.d.ts +46 -0
- package/dist/profiles/hol/connectives.d.ts.map +1 -0
- package/dist/profiles/hol/connectives.js +104 -0
- package/dist/profiles/hol/connectives.js.map +1 -0
- package/dist/profiles/hol/index.d.ts +7 -0
- package/dist/profiles/hol/index.d.ts.map +1 -0
- package/dist/profiles/hol/index.js +77 -0
- package/dist/profiles/hol/index.js.map +1 -0
- package/dist/profiles/hol/rules.d.ts +31 -0
- package/dist/profiles/hol/rules.d.ts.map +1 -0
- package/dist/profiles/hol/rules.js +258 -0
- package/dist/profiles/hol/rules.js.map +1 -0
- package/dist/profiles/hol/term.d.ts +52 -0
- package/dist/profiles/hol/term.d.ts.map +1 -0
- package/dist/profiles/hol/term.js +345 -0
- package/dist/profiles/hol/term.js.map +1 -0
- package/dist/profiles/hol/type-system.d.ts +38 -0
- package/dist/profiles/hol/type-system.d.ts.map +1 -0
- package/dist/profiles/hol/type-system.js +133 -0
- package/dist/profiles/hol/type-system.js.map +1 -0
- package/dist/profiles/hol/types.d.ts +59 -0
- package/dist/profiles/hol/types.d.ts.map +1 -0
- package/dist/profiles/hol/types.js +26 -0
- package/dist/profiles/hol/types.js.map +1 -0
- package/dist/smt-lib/ast.d.ts +138 -0
- package/dist/smt-lib/ast.d.ts.map +1 -0
- package/dist/smt-lib/ast.js +73 -0
- package/dist/smt-lib/ast.js.map +1 -0
- package/dist/smt-lib/emitter.d.ts +12 -0
- package/dist/smt-lib/emitter.d.ts.map +1 -0
- package/dist/smt-lib/emitter.js +174 -0
- package/dist/smt-lib/emitter.js.map +1 -0
- package/dist/smt-lib/index.d.ts +6 -0
- package/dist/smt-lib/index.d.ts.map +1 -0
- package/dist/smt-lib/index.js +31 -0
- package/dist/smt-lib/index.js.map +1 -0
- package/dist/smt-lib/parser.d.ts +13 -0
- package/dist/smt-lib/parser.d.ts.map +1 -0
- package/dist/smt-lib/parser.js +614 -0
- package/dist/smt-lib/parser.js.map +1 -0
- package/dist/smt-lib/tokenizer.d.ts +16 -0
- package/dist/smt-lib/tokenizer.d.ts.map +1 -0
- package/dist/smt-lib/tokenizer.js +234 -0
- package/dist/smt-lib/tokenizer.js.map +1 -0
- package/dist/tactic-dsl/combinators.d.ts +6 -0
- package/dist/tactic-dsl/combinators.d.ts.map +1 -0
- package/dist/tactic-dsl/combinators.js +98 -0
- package/dist/tactic-dsl/combinators.js.map +1 -0
- package/dist/tactic-dsl/index.d.ts +39 -0
- package/dist/tactic-dsl/index.d.ts.map +1 -0
- package/dist/tactic-dsl/index.js +162 -0
- package/dist/tactic-dsl/index.js.map +1 -0
- package/dist/tactic-dsl/tactics.d.ts +21 -0
- package/dist/tactic-dsl/tactics.d.ts.map +1 -0
- package/dist/tactic-dsl/tactics.js +536 -0
- package/dist/tactic-dsl/tactics.js.map +1 -0
- package/dist/tactic-dsl/types.d.ts +54 -0
- package/dist/tactic-dsl/types.d.ts.map +1 -0
- package/dist/tactic-dsl/types.js +226 -0
- package/dist/tactic-dsl/types.js.map +1 -0
- package/dist/tests/api/namespaces.test.d.ts +9 -0
- package/dist/tests/api/namespaces.test.d.ts.map +1 -0
- package/dist/tests/api/namespaces.test.js +218 -0
- package/dist/tests/api/namespaces.test.js.map +1 -0
- package/dist/tests/bdd/manager.test.d.ts +2 -0
- package/dist/tests/bdd/manager.test.d.ts.map +1 -0
- package/dist/tests/bdd/manager.test.js +472 -0
- package/dist/tests/bdd/manager.test.js.map +1 -0
- package/dist/tests/categorical/categorical.test.d.ts +2 -0
- package/dist/tests/categorical/categorical.test.d.ts.map +1 -0
- package/dist/tests/categorical/categorical.test.js +300 -0
- package/dist/tests/categorical/categorical.test.js.map +1 -0
- package/dist/tests/csp-hoare/csp-hoare.test.d.ts +2 -0
- package/dist/tests/csp-hoare/csp-hoare.test.d.ts.map +1 -0
- package/dist/tests/csp-hoare/csp-hoare.test.js +313 -0
- package/dist/tests/csp-hoare/csp-hoare.test.js.map +1 -0
- package/dist/tests/game-theory/game-theory.test.d.ts +2 -0
- package/dist/tests/game-theory/game-theory.test.d.ts.map +1 -0
- package/dist/tests/game-theory/game-theory.test.js +252 -0
- package/dist/tests/game-theory/game-theory.test.js.map +1 -0
- package/dist/tests/hindley-milner/hindley-milner.test.d.ts +2 -0
- package/dist/tests/hindley-milner/hindley-milner.test.d.ts.map +1 -0
- package/dist/tests/hindley-milner/hindley-milner.test.js +327 -0
- package/dist/tests/hindley-milner/hindley-milner.test.js.map +1 -0
- package/dist/tests/hol/hol.test.d.ts +2 -0
- package/dist/tests/hol/hol.test.d.ts.map +1 -0
- package/dist/tests/hol/hol.test.js +340 -0
- package/dist/tests/hol/hol.test.js.map +1 -0
- package/dist/tests/hott/hott.test.d.ts +2 -0
- package/dist/tests/hott/hott.test.d.ts.map +1 -0
- package/dist/tests/hott/hott.test.js +271 -0
- package/dist/tests/hott/hott.test.js.map +1 -0
- package/dist/tests/information-theory/information-theory.test.d.ts +2 -0
- package/dist/tests/information-theory/information-theory.test.d.ts.map +1 -0
- package/dist/tests/information-theory/information-theory.test.js +291 -0
- package/dist/tests/information-theory/information-theory.test.js.map +1 -0
- package/dist/tests/lemma-synthesis/lemma-synthesis.test.d.ts +2 -0
- package/dist/tests/lemma-synthesis/lemma-synthesis.test.d.ts.map +1 -0
- package/dist/tests/lemma-synthesis/lemma-synthesis.test.js +460 -0
- package/dist/tests/lemma-synthesis/lemma-synthesis.test.js.map +1 -0
- package/dist/tests/optimization/ilp.test.d.ts +2 -0
- package/dist/tests/optimization/ilp.test.d.ts.map +1 -0
- package/dist/tests/optimization/ilp.test.js +204 -0
- package/dist/tests/optimization/ilp.test.js.map +1 -0
- package/dist/tests/optimization/lp.test.d.ts +2 -0
- package/dist/tests/optimization/lp.test.d.ts.map +1 -0
- package/dist/tests/optimization/lp.test.js +224 -0
- package/dist/tests/optimization/lp.test.js.map +1 -0
- package/dist/tests/properties/agm.property.test.d.ts +2 -0
- package/dist/tests/properties/agm.property.test.d.ts.map +1 -0
- package/dist/tests/properties/agm.property.test.js +75 -0
- package/dist/tests/properties/agm.property.test.js.map +1 -0
- package/dist/tests/properties/anti-unification.property.test.d.ts +2 -0
- package/dist/tests/properties/anti-unification.property.test.d.ts.map +1 -0
- package/dist/tests/properties/anti-unification.property.test.js +43 -0
- package/dist/tests/properties/anti-unification.property.test.js.map +1 -0
- package/dist/tests/properties/argumentation.property.test.d.ts +2 -0
- package/dist/tests/properties/argumentation.property.test.d.ts.map +1 -0
- package/dist/tests/properties/argumentation.property.test.js +51 -0
- package/dist/tests/properties/argumentation.property.test.js.map +1 -0
- package/dist/tests/properties/bayesian.property.test.d.ts +2 -0
- package/dist/tests/properties/bayesian.property.test.d.ts.map +1 -0
- package/dist/tests/properties/bayesian.property.test.js +32 -0
- package/dist/tests/properties/bayesian.property.test.js.map +1 -0
- package/dist/tests/properties/bisimulation.property.test.d.ts +2 -0
- package/dist/tests/properties/bisimulation.property.test.d.ts.map +1 -0
- package/dist/tests/properties/bisimulation.property.test.js +50 -0
- package/dist/tests/properties/bisimulation.property.test.js.map +1 -0
- package/dist/tests/properties/cdcl.property.test.d.ts +2 -0
- package/dist/tests/properties/cdcl.property.test.d.ts.map +1 -0
- package/dist/tests/properties/cdcl.property.test.js +70 -0
- package/dist/tests/properties/cdcl.property.test.js.map +1 -0
- package/dist/tests/properties/coinduction.property.test.d.ts +2 -0
- package/dist/tests/properties/coinduction.property.test.d.ts.map +1 -0
- package/dist/tests/properties/coinduction.property.test.js +34 -0
- package/dist/tests/properties/coinduction.property.test.js.map +1 -0
- package/dist/tests/properties/constructive-reals.property.test.d.ts +2 -0
- package/dist/tests/properties/constructive-reals.property.test.d.ts.map +1 -0
- package/dist/tests/properties/constructive-reals.property.test.js +59 -0
- package/dist/tests/properties/constructive-reals.property.test.js.map +1 -0
- package/dist/tests/properties/csp.property.test.d.ts +2 -0
- package/dist/tests/properties/csp.property.test.d.ts.map +1 -0
- package/dist/tests/properties/csp.property.test.js +58 -0
- package/dist/tests/properties/csp.property.test.js.map +1 -0
- package/dist/tests/properties/generators.d.ts +78 -0
- package/dist/tests/properties/generators.d.ts.map +1 -0
- package/dist/tests/properties/generators.js +348 -0
- package/dist/tests/properties/generators.js.map +1 -0
- package/dist/tests/properties/ho-unify.property.test.d.ts +2 -0
- package/dist/tests/properties/ho-unify.property.test.d.ts.map +1 -0
- package/dist/tests/properties/ho-unify.property.test.js +46 -0
- package/dist/tests/properties/ho-unify.property.test.js.map +1 -0
- package/dist/tests/properties/hyperreal.property.test.d.ts +2 -0
- package/dist/tests/properties/hyperreal.property.test.d.ts.map +1 -0
- package/dist/tests/properties/hyperreal.property.test.js +33 -0
- package/dist/tests/properties/hyperreal.property.test.js.map +1 -0
- package/dist/tests/properties/intuit-nj.property.test.d.ts +2 -0
- package/dist/tests/properties/intuit-nj.property.test.d.ts.map +1 -0
- package/dist/tests/properties/intuit-nj.property.test.js +57 -0
- package/dist/tests/properties/intuit-nj.property.test.js.map +1 -0
- package/dist/tests/properties/lambda-calc.property.test.d.ts +2 -0
- package/dist/tests/properties/lambda-calc.property.test.d.ts.map +1 -0
- package/dist/tests/properties/lambda-calc.property.test.js +35 -0
- package/dist/tests/properties/lambda-calc.property.test.js.map +1 -0
- package/dist/tests/properties/mln.property.test.d.ts +2 -0
- package/dist/tests/properties/mln.property.test.d.ts.map +1 -0
- package/dist/tests/properties/mln.property.test.js +41 -0
- package/dist/tests/properties/mln.property.test.js.map +1 -0
- package/dist/tests/properties/mltt.property.test.d.ts +2 -0
- package/dist/tests/properties/mltt.property.test.d.ts.map +1 -0
- package/dist/tests/properties/mltt.property.test.js +33 -0
- package/dist/tests/properties/mltt.property.test.js.map +1 -0
- package/dist/tests/properties/nbe.property.test.d.ts +2 -0
- package/dist/tests/properties/nbe.property.test.d.ts.map +1 -0
- package/dist/tests/properties/nbe.property.test.js +44 -0
- package/dist/tests/properties/nbe.property.test.js.map +1 -0
- package/dist/tests/properties/planning.property.test.d.ts +2 -0
- package/dist/tests/properties/planning.property.test.d.ts.map +1 -0
- package/dist/tests/properties/planning.property.test.js +51 -0
- package/dist/tests/properties/planning.property.test.js.map +1 -0
- package/dist/tests/properties/profile-bridge.property.test.d.ts +2 -0
- package/dist/tests/properties/profile-bridge.property.test.d.ts.map +1 -0
- package/dist/tests/properties/profile-bridge.property.test.js +71 -0
- package/dist/tests/properties/profile-bridge.property.test.js.map +1 -0
- package/dist/tests/properties/refinement-types.property.test.d.ts +2 -0
- package/dist/tests/properties/refinement-types.property.test.d.ts.map +1 -0
- package/dist/tests/properties/refinement-types.property.test.js +37 -0
- package/dist/tests/properties/refinement-types.property.test.js.map +1 -0
- package/dist/tests/properties/sequent-g3.property.test.d.ts +2 -0
- package/dist/tests/properties/sequent-g3.property.test.d.ts.map +1 -0
- package/dist/tests/properties/sequent-g3.property.test.js +34 -0
- package/dist/tests/properties/sequent-g3.property.test.js.map +1 -0
- package/dist/tests/properties/symbolic-diff.property.test.d.ts +2 -0
- package/dist/tests/properties/symbolic-diff.property.test.d.ts.map +1 -0
- package/dist/tests/properties/symbolic-diff.property.test.js +49 -0
- package/dist/tests/properties/symbolic-diff.property.test.js.map +1 -0
- package/dist/tests/properties/system-f.property.test.d.ts +2 -0
- package/dist/tests/properties/system-f.property.test.d.ts.map +1 -0
- package/dist/tests/properties/system-f.property.test.js +37 -0
- package/dist/tests/properties/system-f.property.test.js.map +1 -0
- package/dist/tests/properties/theorem-cache.property.test.d.ts +2 -0
- package/dist/tests/properties/theorem-cache.property.test.d.ts.map +1 -0
- package/dist/tests/properties/theorem-cache.property.test.js +38 -0
- package/dist/tests/properties/theorem-cache.property.test.js.map +1 -0
- package/dist/tests/properties/trs.property.test.d.ts +2 -0
- package/dist/tests/properties/trs.property.test.d.ts.map +1 -0
- package/dist/tests/properties/trs.property.test.js +34 -0
- package/dist/tests/properties/trs.property.test.js.map +1 -0
- package/dist/tests/properties/unification.property.test.d.ts +2 -0
- package/dist/tests/properties/unification.property.test.d.ts.map +1 -0
- package/dist/tests/properties/unification.property.test.js +42 -0
- package/dist/tests/properties/unification.property.test.js.map +1 -0
- package/dist/tests/smt-lib/emitter.test.d.ts +2 -0
- package/dist/tests/smt-lib/emitter.test.d.ts.map +1 -0
- package/dist/tests/smt-lib/emitter.test.js +155 -0
- package/dist/tests/smt-lib/emitter.test.js.map +1 -0
- package/dist/tests/smt-lib/parser.test.d.ts +2 -0
- package/dist/tests/smt-lib/parser.test.d.ts.map +1 -0
- package/dist/tests/smt-lib/parser.test.js +164 -0
- package/dist/tests/smt-lib/parser.test.js.map +1 -0
- package/dist/tests/smt-lib/tokenizer.test.d.ts +2 -0
- package/dist/tests/smt-lib/tokenizer.test.d.ts.map +1 -0
- package/dist/tests/smt-lib/tokenizer.test.js +59 -0
- package/dist/tests/smt-lib/tokenizer.test.js.map +1 -0
- package/dist/tests/tactic-dsl/tactic-dsl.test.d.ts +2 -0
- package/dist/tests/tactic-dsl/tactic-dsl.test.d.ts.map +1 -0
- package/dist/tests/tactic-dsl/tactic-dsl.test.js +259 -0
- package/dist/tests/tactic-dsl/tactic-dsl.test.js.map +1 -0
- package/dist/tests/tptp/bridge.test.d.ts +2 -0
- package/dist/tests/tptp/bridge.test.d.ts.map +1 -0
- package/dist/tests/tptp/bridge.test.js +154 -0
- package/dist/tests/tptp/bridge.test.js.map +1 -0
- package/dist/tests/tptp/emitter.test.d.ts +2 -0
- package/dist/tests/tptp/emitter.test.d.ts.map +1 -0
- package/dist/tests/tptp/emitter.test.js +128 -0
- package/dist/tests/tptp/emitter.test.js.map +1 -0
- package/dist/tests/tptp/parser.test.d.ts +2 -0
- package/dist/tests/tptp/parser.test.d.ts.map +1 -0
- package/dist/tests/tptp/parser.test.js +192 -0
- package/dist/tests/tptp/parser.test.js.map +1 -0
- package/dist/tests/tptp/tokenizer.test.d.ts +2 -0
- package/dist/tests/tptp/tokenizer.test.d.ts.map +1 -0
- package/dist/tests/tptp/tokenizer.test.js +60 -0
- package/dist/tests/tptp/tokenizer.test.js.map +1 -0
- package/dist/tptp/ast.d.ts +73 -0
- package/dist/tptp/ast.d.ts.map +1 -0
- package/dist/tptp/ast.js +35 -0
- package/dist/tptp/ast.js.map +1 -0
- package/dist/tptp/bridge.d.ts +14 -0
- package/dist/tptp/bridge.d.ts.map +1 -0
- package/dist/tptp/bridge.js +146 -0
- package/dist/tptp/bridge.js.map +1 -0
- package/dist/tptp/emitter.d.ts +5 -0
- package/dist/tptp/emitter.d.ts.map +1 -0
- package/dist/tptp/emitter.js +103 -0
- package/dist/tptp/emitter.js.map +1 -0
- package/dist/tptp/index.d.ts +7 -0
- package/dist/tptp/index.d.ts.map +1 -0
- package/dist/tptp/index.js +31 -0
- package/dist/tptp/index.js.map +1 -0
- package/dist/tptp/parser.d.ts +23 -0
- package/dist/tptp/parser.d.ts.map +1 -0
- package/dist/tptp/parser.js +440 -0
- package/dist/tptp/parser.js.map +1 -0
- package/dist/tptp/tokenizer.d.ts +14 -0
- package/dist/tptp/tokenizer.d.ts.map +1 -0
- package/dist/tptp/tokenizer.js +264 -0
- package/dist/tptp/tokenizer.js.map +1 -0
- package/package.json +5 -1
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"hindley-milner.test.d.ts","sourceRoot":"","sources":["../../../src/tests/hindley-milner/hindley-milner.test.ts"],"names":[],"mappings":""}
|
|
@@ -0,0 +1,327 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const vitest_1 = require("vitest");
|
|
4
|
+
const hindley_milner_1 = require("../../hindley-milner");
|
|
5
|
+
(0, vitest_1.beforeEach)(() => {
|
|
6
|
+
(0, hindley_milner_1.resetFreshSupply)();
|
|
7
|
+
});
|
|
8
|
+
function unwrap(r) {
|
|
9
|
+
if ((0, hindley_milner_1.isInferError)(r))
|
|
10
|
+
throw new Error(`unexpected inference error: ${r.error}`);
|
|
11
|
+
return r;
|
|
12
|
+
}
|
|
13
|
+
function principalTypeStr(expr) {
|
|
14
|
+
const r = (0, hindley_milner_1.inferScheme)(expr);
|
|
15
|
+
if ('error' in r)
|
|
16
|
+
throw new Error(`inference failed: ${r.error}`);
|
|
17
|
+
return (0, hindley_milner_1.schemeToString)((0, hindley_milner_1.normalizeScheme)(r.scheme));
|
|
18
|
+
}
|
|
19
|
+
// =============================================================
|
|
20
|
+
// 1. Unificación
|
|
21
|
+
// =============================================================
|
|
22
|
+
(0, vitest_1.describe)('Hindley-Milner / unify', () => {
|
|
23
|
+
(0, vitest_1.it)('unifica una tvar con cualquier tipo (binding directo)', () => {
|
|
24
|
+
const r = (0, hindley_milner_1.unify)((0, hindley_milner_1.tVar)('a'), hindley_milner_1.TInt);
|
|
25
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isUnifyError)(r)).toBe(false);
|
|
26
|
+
if ((0, hindley_milner_1.isUnifyError)(r))
|
|
27
|
+
return;
|
|
28
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)((0, hindley_milner_1.tVar)('a'), r)).toEqual(hindley_milner_1.TInt);
|
|
29
|
+
});
|
|
30
|
+
(0, vitest_1.it)('unifica dos tvars distintas creando un alias', () => {
|
|
31
|
+
const r = (0, hindley_milner_1.unify)((0, hindley_milner_1.tVar)('a'), (0, hindley_milner_1.tVar)('b'));
|
|
32
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isUnifyError)(r)).toBe(false);
|
|
33
|
+
if ((0, hindley_milner_1.isUnifyError)(r))
|
|
34
|
+
return;
|
|
35
|
+
// tras la unif, a y b son el mismo (uno apunta al otro).
|
|
36
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)((0, hindley_milner_1.tVar)('a'), r)).toEqual((0, hindley_milner_1.applySubst)((0, hindley_milner_1.tVar)('b'), r));
|
|
37
|
+
});
|
|
38
|
+
(0, vitest_1.it)('unifica dos type-constructors iguales con args compatibles', () => {
|
|
39
|
+
const r = (0, hindley_milner_1.unify)((0, hindley_milner_1.tApp)('List', (0, hindley_milner_1.tVar)('a')), (0, hindley_milner_1.tApp)('List', hindley_milner_1.TInt));
|
|
40
|
+
if ((0, hindley_milner_1.isUnifyError)(r))
|
|
41
|
+
throw new Error(r.error);
|
|
42
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)((0, hindley_milner_1.tVar)('a'), r)).toEqual(hindley_milner_1.TInt);
|
|
43
|
+
});
|
|
44
|
+
(0, vitest_1.it)('falla al unificar constructores distintos', () => {
|
|
45
|
+
const r = (0, hindley_milner_1.unify)((0, hindley_milner_1.tConst)('Int'), (0, hindley_milner_1.tConst)('Bool'));
|
|
46
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isUnifyError)(r)).toBe(true);
|
|
47
|
+
if (!(0, hindley_milner_1.isUnifyError)(r))
|
|
48
|
+
return;
|
|
49
|
+
(0, vitest_1.expect)(r.error).toMatch(/Int.*Bool|Bool.*Int/);
|
|
50
|
+
});
|
|
51
|
+
(0, vitest_1.it)('falla con arity mismatch en tapp', () => {
|
|
52
|
+
const r = (0, hindley_milner_1.unify)((0, hindley_milner_1.tApp)('Pair', (0, hindley_milner_1.tVar)('a'), (0, hindley_milner_1.tVar)('b')), (0, hindley_milner_1.tApp)('Pair', hindley_milner_1.TInt));
|
|
53
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isUnifyError)(r)).toBe(true);
|
|
54
|
+
});
|
|
55
|
+
(0, vitest_1.it)('detecta occurs check (tipo infinito) en α = α → α', () => {
|
|
56
|
+
const r = (0, hindley_milner_1.unify)((0, hindley_milner_1.tVar)('a'), (0, hindley_milner_1.tArrow)((0, hindley_milner_1.tVar)('a'), (0, hindley_milner_1.tVar)('a')));
|
|
57
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isUnifyError)(r)).toBe(true);
|
|
58
|
+
if (!(0, hindley_milner_1.isUnifyError)(r))
|
|
59
|
+
return;
|
|
60
|
+
(0, vitest_1.expect)(r.error.toLowerCase()).toContain('occurs');
|
|
61
|
+
});
|
|
62
|
+
(0, vitest_1.it)('unifica arrows recursivamente y propaga sustituciones', () => {
|
|
63
|
+
// (a -> Int) ≡ (Bool -> b) ⇒ a := Bool, b := Int
|
|
64
|
+
const r = (0, hindley_milner_1.unify)((0, hindley_milner_1.tArrow)((0, hindley_milner_1.tVar)('a'), hindley_milner_1.TInt), (0, hindley_milner_1.tArrow)(hindley_milner_1.TBool, (0, hindley_milner_1.tVar)('b')));
|
|
65
|
+
if ((0, hindley_milner_1.isUnifyError)(r))
|
|
66
|
+
throw new Error(r.error);
|
|
67
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)((0, hindley_milner_1.tVar)('a'), r)).toEqual(hindley_milner_1.TBool);
|
|
68
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)((0, hindley_milner_1.tVar)('b'), r)).toEqual(hindley_milner_1.TInt);
|
|
69
|
+
});
|
|
70
|
+
(0, vitest_1.it)('composeSubsts mantiene transitividad: {a→b} ∘ {b→Int} ⇒ a→Int', () => {
|
|
71
|
+
const s1 = new Map([['a', (0, hindley_milner_1.tVar)('b')]]);
|
|
72
|
+
const s2 = new Map([['b', hindley_milner_1.TInt]]);
|
|
73
|
+
// composeSubsts(s, t) = primero t, luego s. Queremos primero s1 (a→b)
|
|
74
|
+
// luego s2 (b→Int): composeSubsts(s2, s1).
|
|
75
|
+
const c = (0, hindley_milner_1.composeSubsts)(s2, s1);
|
|
76
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)((0, hindley_milner_1.tVar)('a'), c)).toEqual(hindley_milner_1.TInt);
|
|
77
|
+
});
|
|
78
|
+
(0, vitest_1.it)('occursIn detecta variable dentro de un tapp', () => {
|
|
79
|
+
(0, vitest_1.expect)((0, hindley_milner_1.occursIn)('a', (0, hindley_milner_1.tApp)('List', (0, hindley_milner_1.tArrow)((0, hindley_milner_1.tVar)('a'), hindley_milner_1.TInt)))).toBe(true);
|
|
80
|
+
(0, vitest_1.expect)((0, hindley_milner_1.occursIn)('a', (0, hindley_milner_1.tApp)('List', hindley_milner_1.TInt))).toBe(false);
|
|
81
|
+
});
|
|
82
|
+
});
|
|
83
|
+
// =============================================================
|
|
84
|
+
// 2. Algoritmo W — casos canónicos
|
|
85
|
+
// =============================================================
|
|
86
|
+
(0, vitest_1.describe)('Hindley-Milner / inferencia', () => {
|
|
87
|
+
(0, vitest_1.it)('identidad: λx. x infiere ∀a. a -> a', () => {
|
|
88
|
+
const expr = (0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eVar)('x'));
|
|
89
|
+
(0, vitest_1.expect)(principalTypeStr(expr)).toBe('forall a. a -> a');
|
|
90
|
+
});
|
|
91
|
+
(0, vitest_1.it)('K combinator: λx. λy. x infiere ∀a b. a -> b -> a', () => {
|
|
92
|
+
const expr = (0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eLam)('y', (0, hindley_milner_1.eVar)('x')));
|
|
93
|
+
(0, vitest_1.expect)(principalTypeStr(expr)).toBe('forall a b. a -> b -> a');
|
|
94
|
+
});
|
|
95
|
+
(0, vitest_1.it)('S combinator: λf. λg. λx. f x (g x) infiere correctamente', () => {
|
|
96
|
+
// tipo principal: (a -> b -> c) -> (a -> b) -> a -> c
|
|
97
|
+
const expr = (0, hindley_milner_1.eLam)('f', (0, hindley_milner_1.eLam)('g', (0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eApp)((0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('f'), (0, hindley_milner_1.eVar)('x')), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('g'), (0, hindley_milner_1.eVar)('x'))))));
|
|
98
|
+
(0, vitest_1.expect)(principalTypeStr(expr)).toBe('forall a b c. (a -> b -> c) -> (a -> b) -> a -> c');
|
|
99
|
+
});
|
|
100
|
+
(0, vitest_1.it)('let-poly: let id = λx. x in id 5 infiere Int', () => {
|
|
101
|
+
const expr = (0, hindley_milner_1.eLet)('id', (0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eVar)('x')), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('id'), (0, hindley_milner_1.eLit)(5)));
|
|
102
|
+
const r = unwrap((0, hindley_milner_1.infer)(expr));
|
|
103
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)(r.type, r.subst)).toEqual(hindley_milner_1.TInt);
|
|
104
|
+
});
|
|
105
|
+
(0, vitest_1.it)('let-poly: id usado en dos tipos en el mismo cuerpo', () => {
|
|
106
|
+
// let id = λx.x in pair (id 5) (id true) ⇒ Pair Int Bool
|
|
107
|
+
const expr = (0, hindley_milner_1.eLet)('id', (0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eVar)('x')), (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('pair'), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('id'), (0, hindley_milner_1.eLit)(5)), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('id'), (0, hindley_milner_1.eVar)('true'))));
|
|
108
|
+
(0, vitest_1.expect)(principalTypeStr(expr)).toBe('Pair Int Bool');
|
|
109
|
+
});
|
|
110
|
+
(0, vitest_1.it)('SIN let-poly el mismo programa NO tipa con λ: (λid. ...) (λx.x)', () => {
|
|
111
|
+
// Esto NO funcionaría con let-poly desactivado:
|
|
112
|
+
// (λid. pair (id 5) (id true)) (λx.x)
|
|
113
|
+
// porque el parámetro id es monomórfico (un λ no generaliza).
|
|
114
|
+
// Comprueba que efectivamente falla.
|
|
115
|
+
const expr = (0, hindley_milner_1.eApp)((0, hindley_milner_1.eLam)('id', (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('pair'), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('id'), (0, hindley_milner_1.eLit)(5)), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('id'), (0, hindley_milner_1.eVar)('true')))), (0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eVar)('x')));
|
|
116
|
+
const r = (0, hindley_milner_1.infer)(expr);
|
|
117
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isInferError)(r)).toBe(true);
|
|
118
|
+
});
|
|
119
|
+
(0, vitest_1.it)('aritmética: 5 + 3 infiere Int', () => {
|
|
120
|
+
const expr = (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('+'), (0, hindley_milner_1.eLit)(5), (0, hindley_milner_1.eLit)(3));
|
|
121
|
+
const r = unwrap((0, hindley_milner_1.infer)(expr));
|
|
122
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)(r.type, r.subst)).toEqual(hindley_milner_1.TInt);
|
|
123
|
+
});
|
|
124
|
+
(0, vitest_1.it)('aritmética sobre booleano falla: true + 1', () => {
|
|
125
|
+
const expr = (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('+'), (0, hindley_milner_1.eVar)('true'), (0, hindley_milner_1.eLit)(1));
|
|
126
|
+
const r = (0, hindley_milner_1.infer)(expr);
|
|
127
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isInferError)(r)).toBe(true);
|
|
128
|
+
});
|
|
129
|
+
(0, vitest_1.it)('comparador polimórfico: λa. a == a infiere ∀α. α -> Bool', () => {
|
|
130
|
+
const expr = (0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('=='), (0, hindley_milner_1.eVar)('x'), (0, hindley_milner_1.eVar)('x')));
|
|
131
|
+
(0, vitest_1.expect)(principalTypeStr(expr)).toBe('forall a. a -> Bool');
|
|
132
|
+
});
|
|
133
|
+
(0, vitest_1.it)('if booleano: if true then 1 else 2 infiere Int', () => {
|
|
134
|
+
const expr = (0, hindley_milner_1.eIf)((0, hindley_milner_1.eVar)('true'), (0, hindley_milner_1.eLit)(1), (0, hindley_milner_1.eLit)(2));
|
|
135
|
+
const r = unwrap((0, hindley_milner_1.infer)(expr));
|
|
136
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)(r.type, r.subst)).toEqual(hindley_milner_1.TInt);
|
|
137
|
+
});
|
|
138
|
+
(0, vitest_1.it)('if con condición no-booleana falla', () => {
|
|
139
|
+
const expr = (0, hindley_milner_1.eIf)((0, hindley_milner_1.eLit)(1), (0, hindley_milner_1.eLit)(1), (0, hindley_milner_1.eLit)(2));
|
|
140
|
+
const r = (0, hindley_milner_1.infer)(expr);
|
|
141
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isInferError)(r)).toBe(true);
|
|
142
|
+
if (!(0, hindley_milner_1.isInferError)(r))
|
|
143
|
+
return;
|
|
144
|
+
(0, vitest_1.expect)(r.error.toLowerCase()).toContain('bool');
|
|
145
|
+
});
|
|
146
|
+
(0, vitest_1.it)('if con ramas de tipos distintos falla', () => {
|
|
147
|
+
const expr = (0, hindley_milner_1.eIf)((0, hindley_milner_1.eVar)('true'), (0, hindley_milner_1.eLit)(1), (0, hindley_milner_1.eVar)('true'));
|
|
148
|
+
const r = (0, hindley_milner_1.infer)(expr);
|
|
149
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isInferError)(r)).toBe(true);
|
|
150
|
+
if (!(0, hindley_milner_1.isInferError)(r))
|
|
151
|
+
return;
|
|
152
|
+
(0, vitest_1.expect)(r.error.toLowerCase()).toMatch(/branches|cannot unify/);
|
|
153
|
+
});
|
|
154
|
+
(0, vitest_1.it)('aplicación parcial: (+) 5 infiere Int -> Int', () => {
|
|
155
|
+
const expr = (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('+'), (0, hindley_milner_1.eLit)(5));
|
|
156
|
+
const r = unwrap((0, hindley_milner_1.infer)(expr));
|
|
157
|
+
(0, vitest_1.expect)((0, hindley_milner_1.typeToString)((0, hindley_milner_1.applySubst)(r.type, r.subst))).toBe('Int -> Int');
|
|
158
|
+
});
|
|
159
|
+
});
|
|
160
|
+
// =============================================================
|
|
161
|
+
// 3. Errores: variable libre, ocurrencia, etc.
|
|
162
|
+
// =============================================================
|
|
163
|
+
(0, vitest_1.describe)('Hindley-Milner / errores', () => {
|
|
164
|
+
(0, vitest_1.it)('variable no ligada falla con mensaje claro', () => {
|
|
165
|
+
const expr = (0, hindley_milner_1.eVar)('xyz');
|
|
166
|
+
const r = (0, hindley_milner_1.infer)(expr);
|
|
167
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isInferError)(r)).toBe(true);
|
|
168
|
+
if (!(0, hindley_milner_1.isInferError)(r))
|
|
169
|
+
return;
|
|
170
|
+
(0, vitest_1.expect)(r.error).toContain('xyz');
|
|
171
|
+
});
|
|
172
|
+
(0, vitest_1.it)('occurs-check vía λx. x x rechaza el término', () => {
|
|
173
|
+
const expr = (0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('x'), (0, hindley_milner_1.eVar)('x')));
|
|
174
|
+
const r = (0, hindley_milner_1.infer)(expr);
|
|
175
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isInferError)(r)).toBe(true);
|
|
176
|
+
if (!(0, hindley_milner_1.isInferError)(r))
|
|
177
|
+
return;
|
|
178
|
+
(0, vitest_1.expect)(r.error.toLowerCase()).toMatch(/occurs|infinite|cannot unify/);
|
|
179
|
+
});
|
|
180
|
+
(0, vitest_1.it)('omega = (λx. x x) (λx. x x) rechaza por occurs', () => {
|
|
181
|
+
const omega = (0, hindley_milner_1.eApp)((0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('x'), (0, hindley_milner_1.eVar)('x'))), (0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('x'), (0, hindley_milner_1.eVar)('x'))));
|
|
182
|
+
const r = (0, hindley_milner_1.infer)(omega);
|
|
183
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isInferError)(r)).toBe(true);
|
|
184
|
+
});
|
|
185
|
+
(0, vitest_1.it)('aplicación a no-función falla', () => {
|
|
186
|
+
const expr = (0, hindley_milner_1.eApp)((0, hindley_milner_1.eLit)(5), (0, hindley_milner_1.eLit)(3));
|
|
187
|
+
const r = (0, hindley_milner_1.infer)(expr);
|
|
188
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isInferError)(r)).toBe(true);
|
|
189
|
+
});
|
|
190
|
+
});
|
|
191
|
+
// =============================================================
|
|
192
|
+
// 4. letRec — definiciones recursivas y mutuamente recursivas
|
|
193
|
+
// =============================================================
|
|
194
|
+
(0, vitest_1.describe)('Hindley-Milner / letRec', () => {
|
|
195
|
+
(0, vitest_1.it)('factorial recursivo via letRec: fact 5 tipea como Int', () => {
|
|
196
|
+
// letRec fact = λn. if n == 0 then 1 else n * (fact (n - 1)) in fact 5
|
|
197
|
+
const fact = (0, hindley_milner_1.eLam)('n', (0, hindley_milner_1.eIf)((0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('=='), (0, hindley_milner_1.eVar)('n'), (0, hindley_milner_1.eLit)(0)), (0, hindley_milner_1.eLit)(1), (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('*'), (0, hindley_milner_1.eVar)('n'), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('fact'), (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('-'), (0, hindley_milner_1.eVar)('n'), (0, hindley_milner_1.eLit)(1))))));
|
|
198
|
+
const program = (0, hindley_milner_1.eLetRec)([{ name: 'fact', body: fact }], (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('fact'), (0, hindley_milner_1.eLit)(5)));
|
|
199
|
+
const r = unwrap((0, hindley_milner_1.infer)(program));
|
|
200
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)(r.type, r.subst)).toEqual(hindley_milner_1.TInt);
|
|
201
|
+
});
|
|
202
|
+
(0, vitest_1.it)('letRec con función genérica de listas: length tipea ∀a. List a -> Int', () => {
|
|
203
|
+
// letRec length = λxs. if isEmpty xs then 0 else 1 + length (tail xs)
|
|
204
|
+
const length = (0, hindley_milner_1.eLam)('xs', (0, hindley_milner_1.eIf)((0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('isEmpty'), (0, hindley_milner_1.eVar)('xs')), (0, hindley_milner_1.eLit)(0), (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('+'), (0, hindley_milner_1.eLit)(1), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('length'), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('tail'), (0, hindley_milner_1.eVar)('xs'))))));
|
|
205
|
+
const program = (0, hindley_milner_1.eLetRec)([{ name: 'length', body: length }], (0, hindley_milner_1.eVar)('length'));
|
|
206
|
+
(0, vitest_1.expect)(principalTypeStr(program)).toBe('forall a. List a -> Int');
|
|
207
|
+
});
|
|
208
|
+
(0, vitest_1.it)('letRec mutuamente recursivo: even/odd tipean Int -> Bool', () => {
|
|
209
|
+
const even = (0, hindley_milner_1.eLam)('n', (0, hindley_milner_1.eIf)((0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('=='), (0, hindley_milner_1.eVar)('n'), (0, hindley_milner_1.eLit)(0)), (0, hindley_milner_1.eVar)('true'), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('odd'), (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('-'), (0, hindley_milner_1.eVar)('n'), (0, hindley_milner_1.eLit)(1)))));
|
|
210
|
+
const odd = (0, hindley_milner_1.eLam)('n', (0, hindley_milner_1.eIf)((0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('=='), (0, hindley_milner_1.eVar)('n'), (0, hindley_milner_1.eLit)(0)), (0, hindley_milner_1.eVar)('false'), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('even'), (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('-'), (0, hindley_milner_1.eVar)('n'), (0, hindley_milner_1.eLit)(1)))));
|
|
211
|
+
const program = (0, hindley_milner_1.eLetRec)([
|
|
212
|
+
{ name: 'even', body: even },
|
|
213
|
+
{ name: 'odd', body: odd },
|
|
214
|
+
], (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('even'), (0, hindley_milner_1.eLit)(10)));
|
|
215
|
+
const r = unwrap((0, hindley_milner_1.infer)(program));
|
|
216
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)(r.type, r.subst)).toEqual(hindley_milner_1.TBool);
|
|
217
|
+
});
|
|
218
|
+
});
|
|
219
|
+
// =============================================================
|
|
220
|
+
// 5. generalize / instantiate — semánticamente correctos
|
|
221
|
+
// =============================================================
|
|
222
|
+
(0, vitest_1.describe)('Hindley-Milner / generalize & instantiate', () => {
|
|
223
|
+
(0, vitest_1.it)('generalize cuantifica solo lo que no está en el entorno', () => {
|
|
224
|
+
// Entorno: { x : a } (a aparece libre).
|
|
225
|
+
// Tipo a generalizar: a -> b.
|
|
226
|
+
// Esperamos: ∀b. a -> b (la `a` queda libre).
|
|
227
|
+
const env = new hindley_milner_1.TypeEnv(new Map([['x', (0, hindley_milner_1.mono)((0, hindley_milner_1.tVar)('a'))]]));
|
|
228
|
+
const sc = (0, hindley_milner_1.generalize)(env.freeVars(), (0, hindley_milner_1.tArrow)((0, hindley_milner_1.tVar)('a'), (0, hindley_milner_1.tVar)('b')));
|
|
229
|
+
(0, vitest_1.expect)(sc.forall).toEqual(['b']);
|
|
230
|
+
});
|
|
231
|
+
(0, vitest_1.it)('instantiate produce variables frescas distintas a las del esquema', () => {
|
|
232
|
+
(0, hindley_milner_1.resetFreshSupply)();
|
|
233
|
+
const sc = (0, hindley_milner_1.scheme)(['a'], (0, hindley_milner_1.tArrow)((0, hindley_milner_1.tVar)('a'), (0, hindley_milner_1.tVar)('a')));
|
|
234
|
+
const t1 = (0, hindley_milner_1.instantiate)(sc);
|
|
235
|
+
const t2 = (0, hindley_milner_1.instantiate)(sc);
|
|
236
|
+
// Dos instanciaciones distintas → tvars distintas.
|
|
237
|
+
(0, vitest_1.expect)(t1).not.toEqual(t2);
|
|
238
|
+
// Pero ambas siguen siendo "α → α" para alguna α.
|
|
239
|
+
if (t1.kind !== 'arrow' || t1.from.kind !== 'tvar')
|
|
240
|
+
throw new Error('shape');
|
|
241
|
+
(0, vitest_1.expect)(t1.from).toEqual(t1.to);
|
|
242
|
+
});
|
|
243
|
+
(0, vitest_1.it)('preserva principalidad: id usado dos veces produce el mismo esquema interno', () => {
|
|
244
|
+
// Damas-Milner: si el tipo principal de `λx.x` es ∀a. a→a, instanciar dos
|
|
245
|
+
// veces y unificar con Int y Bool no debe contaminar la otra instancia.
|
|
246
|
+
const expr = (0, hindley_milner_1.eLet)('id', (0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eVar)('x')), (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('pair'), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('id'), (0, hindley_milner_1.eLit)(5)), (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('id'), (0, hindley_milner_1.eVar)('true'))));
|
|
247
|
+
(0, vitest_1.expect)(principalTypeStr(expr)).toBe('Pair Int Bool');
|
|
248
|
+
});
|
|
249
|
+
});
|
|
250
|
+
// =============================================================
|
|
251
|
+
// 6. Tipos compuestos: pair, listas
|
|
252
|
+
// =============================================================
|
|
253
|
+
(0, vitest_1.describe)('Hindley-Milner / tipos compuestos', () => {
|
|
254
|
+
(0, vitest_1.it)('pair 1 true infiere Pair Int Bool', () => {
|
|
255
|
+
const expr = (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('pair'), (0, hindley_milner_1.eLit)(1), (0, hindley_milner_1.eVar)('true'));
|
|
256
|
+
(0, vitest_1.expect)(principalTypeStr(expr)).toBe('Pair Int Bool');
|
|
257
|
+
});
|
|
258
|
+
(0, vitest_1.it)('cons 1 nil infiere List Int', () => {
|
|
259
|
+
const expr = (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('cons'), (0, hindley_milner_1.eLit)(1), (0, hindley_milner_1.eVar)('nil'));
|
|
260
|
+
(0, vitest_1.expect)(principalTypeStr(expr)).toBe('List Int');
|
|
261
|
+
});
|
|
262
|
+
(0, vitest_1.it)('mezclar tipos de lista falla: cons 1 (cons true nil)', () => {
|
|
263
|
+
const expr = (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('cons'), (0, hindley_milner_1.eLit)(1), (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('cons'), (0, hindley_milner_1.eVar)('true'), (0, hindley_milner_1.eVar)('nil')));
|
|
264
|
+
const r = (0, hindley_milner_1.infer)(expr);
|
|
265
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isInferError)(r)).toBe(true);
|
|
266
|
+
});
|
|
267
|
+
(0, vitest_1.it)('fst (pair 1 true) infiere Int', () => {
|
|
268
|
+
const expr = (0, hindley_milner_1.eApp)((0, hindley_milner_1.eVar)('fst'), (0, hindley_milner_1.eAppN)((0, hindley_milner_1.eVar)('pair'), (0, hindley_milner_1.eLit)(1), (0, hindley_milner_1.eVar)('true')));
|
|
269
|
+
const r = unwrap((0, hindley_milner_1.infer)(expr));
|
|
270
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)(r.type, r.subst)).toEqual(hindley_milner_1.TInt);
|
|
271
|
+
});
|
|
272
|
+
(0, vitest_1.it)('literales producen sus tipos primitivos', () => {
|
|
273
|
+
(0, vitest_1.expect)(unwrap((0, hindley_milner_1.infer)((0, hindley_milner_1.eLit)(1))).type).toEqual(hindley_milner_1.TInt);
|
|
274
|
+
(0, vitest_1.expect)(unwrap((0, hindley_milner_1.infer)((0, hindley_milner_1.eLit)(true))).type).toEqual(hindley_milner_1.TBool);
|
|
275
|
+
(0, vitest_1.expect)(unwrap((0, hindley_milner_1.infer)((0, hindley_milner_1.eLit)('hello'))).type).toEqual(hindley_milner_1.TStr);
|
|
276
|
+
});
|
|
277
|
+
});
|
|
278
|
+
// =============================================================
|
|
279
|
+
// 7. Sustituciones — propiedades
|
|
280
|
+
// =============================================================
|
|
281
|
+
(0, vitest_1.describe)('Hindley-Milner / sustituciones', () => {
|
|
282
|
+
(0, vitest_1.it)('applySubst es identidad sobre tipos cerrados', () => {
|
|
283
|
+
const s = new Map([['unused', hindley_milner_1.TInt]]);
|
|
284
|
+
const t = (0, hindley_milner_1.tArrow)(hindley_milner_1.TBool, (0, hindley_milner_1.tApp)('List', hindley_milner_1.TInt));
|
|
285
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)(t, s)).toEqual(t);
|
|
286
|
+
});
|
|
287
|
+
(0, vitest_1.it)('composeSubsts no permite que s2 sobrescriba claves de s1', () => {
|
|
288
|
+
const s1 = new Map([['a', hindley_milner_1.TInt]]);
|
|
289
|
+
const s2 = new Map([['a', hindley_milner_1.TBool]]);
|
|
290
|
+
// composeSubsts(s1, s2): primero s2 (a→Bool), luego s1 (a→Int aplicado a Bool).
|
|
291
|
+
// Bool no contiene `a`, así que queda Bool. La entrada de s1 que NO sobrescribe.
|
|
292
|
+
const c = (0, hindley_milner_1.composeSubsts)(s1, s2);
|
|
293
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)((0, hindley_milner_1.tVar)('a'), c)).toEqual(hindley_milner_1.TBool);
|
|
294
|
+
});
|
|
295
|
+
(0, vitest_1.it)('freshTypeVar produce nombres únicos consecutivos', () => {
|
|
296
|
+
(0, hindley_milner_1.resetFreshSupply)();
|
|
297
|
+
const a = (0, hindley_milner_1.freshTypeVar)('t');
|
|
298
|
+
const b = (0, hindley_milner_1.freshTypeVar)('t');
|
|
299
|
+
(0, vitest_1.expect)(a).not.toEqual(b);
|
|
300
|
+
if (a.kind !== 'tvar' || b.kind !== 'tvar')
|
|
301
|
+
throw new Error('shape');
|
|
302
|
+
(0, vitest_1.expect)(a.name).toBe('t0');
|
|
303
|
+
(0, vitest_1.expect)(b.name).toBe('t1');
|
|
304
|
+
});
|
|
305
|
+
});
|
|
306
|
+
// =============================================================
|
|
307
|
+
// 8. Algoritmo W — propiedades a bajo nivel
|
|
308
|
+
// =============================================================
|
|
309
|
+
(0, vitest_1.describe)('Hindley-Milner / algorithmW directo', () => {
|
|
310
|
+
(0, vitest_1.it)('produce sustitución vacía para literales', () => {
|
|
311
|
+
const r = (0, hindley_milner_1.algorithmW)((0, hindley_milner_1.eLit)(42), (0, hindley_milner_1.initialEnv)());
|
|
312
|
+
(0, vitest_1.expect)((0, hindley_milner_1.isInferError)(r)).toBe(false);
|
|
313
|
+
if ((0, hindley_milner_1.isInferError)(r))
|
|
314
|
+
return;
|
|
315
|
+
(0, vitest_1.expect)(r.subst.size).toBe(0);
|
|
316
|
+
(0, vitest_1.expect)(r.type).toEqual(hindley_milner_1.TInt);
|
|
317
|
+
});
|
|
318
|
+
(0, vitest_1.it)('aplicar la sustitución al tipo de salida no cambia el resultado', () => {
|
|
319
|
+
// Algoritmo W: el `type` devuelto ya está bajo `subst`. Aplicar
|
|
320
|
+
// subst otra vez debería ser idempotente.
|
|
321
|
+
(0, hindley_milner_1.resetFreshSupply)();
|
|
322
|
+
const expr = (0, hindley_milner_1.eApp)((0, hindley_milner_1.eLam)('x', (0, hindley_milner_1.eVar)('x')), (0, hindley_milner_1.eLit)(5));
|
|
323
|
+
const r = unwrap((0, hindley_milner_1.infer)(expr));
|
|
324
|
+
(0, vitest_1.expect)((0, hindley_milner_1.applySubst)((0, hindley_milner_1.applySubst)(r.type, r.subst), r.subst)).toEqual((0, hindley_milner_1.applySubst)(r.type, r.subst));
|
|
325
|
+
});
|
|
326
|
+
});
|
|
327
|
+
//# sourceMappingURL=hindley-milner.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"hindley-milner.test.js","sourceRoot":"","sources":["../../../src/tests/hindley-milner/hindley-milner.test.ts"],"names":[],"mappings":";;AAAA,mCAA0D;AAC1D,yDAsC8B;AAE9B,IAAA,mBAAU,EAAC,GAAG,EAAE;IACd,IAAA,iCAAgB,GAAE,CAAC;AACrB,CAAC,CAAC,CAAC;AAEH,SAAS,MAAM,CAAC,CAAe;IAC7B,IAAI,IAAA,6BAAY,EAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IAC/E,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAiC;IACzD,MAAM,CAAC,GAAG,IAAA,4BAAW,EAAC,IAAI,CAAC,CAAC;IAC5B,IAAI,OAAO,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IAClE,OAAO,IAAA,+BAAc,EAAC,IAAA,gCAAe,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,gEAAgE;AAChE,iBAAiB;AACjB,gEAAgE;AAChE,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,qBAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,OAAO;QAC5B,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,OAAO;QAC5B,yDAAyD;QACzD,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,2BAAU,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,MAAM,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,MAAM,EAAE,qBAAI,CAAC,CAAC,CAAC;QAC7D,IAAI,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAA,uBAAM,EAAC,KAAK,CAAC,EAAE,IAAA,uBAAM,EAAC,MAAM,CAAC,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,OAAO;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,MAAM,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,MAAM,EAAE,qBAAI,CAAC,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAM,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,OAAO;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,qDAAqD;QACrD,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAA,uBAAM,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,qBAAI,CAAC,EAAE,IAAA,uBAAM,EAAC,sBAAK,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,sBAAK,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,EAAE,GAAiB,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,EAAE,GAAiB,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,qBAAI,CAAC,CAAC,CAAC,CAAC;QAChD,sEAAsE;QACtE,2CAA2C;QAC3C,MAAM,CAAC,GAAG,IAAA,8BAAa,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,IAAA,eAAM,EAAC,IAAA,yBAAQ,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,MAAM,EAAE,IAAA,uBAAM,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,qBAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,yBAAQ,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,MAAM,EAAE,qBAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,mCAAmC;AACnC,gEAAgE;AAChE,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,IAAI,GAAG,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,IAAI,GAAG,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,sDAAsD;QACtD,MAAM,IAAI,GAAG,IAAA,qBAAI,EACf,GAAG,EACH,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CACnF,CAAC;QACF,IAAA,eAAM,EAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,mDAAmD,CAAC,CAAC;IAC3F,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,IAAI,GAAG,IAAA,qBAAI,EAAC,IAAI,EAAE,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,CAAC,GAAG,MAAM,CAAC,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,2DAA2D;QAC3D,MAAM,IAAI,GAAG,IAAA,qBAAI,EACf,IAAI,EACJ,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,EACpB,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,MAAM,CAAC,CAAC,CAAC,CAC/E,CAAC;QACF,IAAA,eAAM,EAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,gDAAgD;QAChD,wCAAwC;QACxC,8DAA8D;QAC9D,qCAAqC;QACrC,MAAM,IAAI,GAAG,IAAA,qBAAI,EACf,IAAA,qBAAI,EAAC,IAAI,EAAE,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAC1F,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CACrB,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,IAAI,GAAG,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,IAAI,GAAG,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,IAAI,GAAG,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,IAAI,GAAG,IAAA,oBAAG,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,IAAI,GAAG,IAAA,oBAAG,EAAC,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,OAAO;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,IAAI,GAAG,IAAA,oBAAG,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,MAAM,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,OAAO;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,OAAO,CAAC,uBAAuB,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,IAAI,GAAG,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,IAAA,2BAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,+CAA+C;AAC/C,gEAAgE;AAChE,IAAA,iBAAQ,EAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,IAAI,GAAG,IAAA,qBAAI,EAAC,KAAK,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,OAAO;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,IAAI,GAAG,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,OAAO;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,OAAO,CAAC,8BAA8B,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG,IAAA,qBAAI,EAChB,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,EACrC,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CACtC,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,KAAK,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,IAAI,GAAG,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,8DAA8D;AAC9D,gEAAgE;AAChE,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,uEAAuE;QACvE,MAAM,IAAI,GAAG,IAAA,qBAAI,EACf,GAAG,EACH,IAAA,oBAAG,EACD,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,EACrC,IAAA,qBAAI,EAAC,CAAC,CAAC,EACP,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACtF,CACF,CAAC;QACF,MAAM,OAAO,GAAG,IAAA,wBAAO,EAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrF,MAAM,CAAC,GAAG,MAAM,CAAC,IAAA,sBAAK,EAAC,OAAO,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,sEAAsE;QACtE,MAAM,MAAM,GAAG,IAAA,qBAAI,EACjB,IAAI,EACJ,IAAA,oBAAG,EACD,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,SAAS,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAI,CAAC,CAAC,EACjC,IAAA,qBAAI,EAAC,CAAC,CAAC,EACP,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,QAAQ,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAChF,CACF,CAAC;QACF,MAAM,OAAO,GAAG,IAAA,wBAAO,EAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,IAAA,qBAAI,EAAC,QAAQ,CAAC,CAAC,CAAC;QAC5E,IAAA,eAAM,EAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,IAAI,GAAG,IAAA,qBAAI,EACf,GAAG,EACH,IAAA,oBAAG,EACD,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,EACrC,IAAA,qBAAI,EAAC,MAAM,CAAC,EACZ,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,KAAK,CAAC,EAAE,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CACxD,CACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,qBAAI,EACd,GAAG,EACH,IAAA,oBAAG,EACD,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,EACrC,IAAA,qBAAI,EAAC,OAAO,CAAC,EACb,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CACzD,CACF,CAAC;QACF,MAAM,OAAO,GAAG,IAAA,wBAAO,EACrB;YACE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE;YAC5B,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE;SAC3B,EACD,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,EAAE,CAAC,CAAC,CAC7B,CAAC;QACF,MAAM,CAAC,GAAG,MAAM,CAAC,IAAA,sBAAK,EAAC,OAAO,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,sBAAK,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,yDAAyD;AACzD,gEAAgE;AAChE,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,0CAA0C;QAC1C,8BAA8B;QAC9B,8CAA8C;QAC9C,MAAM,GAAG,GAAG,IAAI,wBAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,IAAA,2BAAU,EAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,IAAA,uBAAM,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,IAAA,iCAAgB,GAAE,CAAC;QACnB,MAAM,EAAE,GAAG,IAAA,uBAAM,EAAC,CAAC,GAAG,CAAC,EAAE,IAAA,uBAAM,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,EAAE,GAAG,IAAA,4BAAW,EAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,IAAA,4BAAW,EAAC,EAAE,CAAC,CAAC;QAC3B,mDAAmD;QACnD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC3B,kDAAkD;QAClD,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6EAA6E,EAAE,GAAG,EAAE;QACrF,0EAA0E;QAC1E,wEAAwE;QACxE,MAAM,IAAI,GAAG,IAAA,qBAAI,EACf,IAAI,EACJ,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,EACpB,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,EAAE,IAAA,qBAAI,EAAC,MAAM,CAAC,CAAC,CAAC,CAC/E,CAAC;QACF,IAAA,eAAM,EAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,oCAAoC;AACpC,gEAAgE;AAChE,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,IAAI,GAAG,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,MAAM,CAAC,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,IAAI,GAAG,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,KAAK,CAAC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,IAAI,GAAG,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1F,MAAM,CAAC,GAAG,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,IAAI,GAAG,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,KAAK,CAAC,EAAE,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,MAAM,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3E,MAAM,CAAC,GAAG,MAAM,CAAC,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,MAAM,CAAC,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,sBAAK,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,MAAM,CAAC,IAAA,sBAAK,EAAC,IAAA,qBAAI,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,iCAAiC;AACjC,gEAAgE;AAChE,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAiB,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,qBAAI,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,GAAG,IAAA,uBAAM,EAAC,sBAAK,EAAE,IAAA,qBAAI,EAAC,MAAM,EAAE,qBAAI,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,EAAE,GAAiB,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,qBAAI,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,EAAE,GAAiB,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,sBAAK,CAAC,CAAC,CAAC,CAAC;QACjD,gFAAgF;QAChF,iFAAiF;QACjF,MAAM,CAAC,GAAG,IAAA,8BAAa,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,IAAA,qBAAI,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,sBAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,IAAA,iCAAgB,GAAE,CAAC;QACnB,MAAM,CAAC,GAAG,IAAA,6BAAY,EAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAA,6BAAY,EAAC,GAAG,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,4CAA4C;AAC5C,gEAAgE;AAChE,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,IAAA,2BAAU,EAAC,IAAA,qBAAI,EAAC,EAAE,CAAC,EAAE,IAAA,2BAAU,GAAE,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAA,6BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,IAAA,6BAAY,EAAC,CAAC,CAAC;YAAE,OAAO;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,qBAAI,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,gEAAgE;QAChE,0CAA0C;QAC1C,IAAA,iCAAgB,GAAE,CAAC;QACnB,MAAM,IAAI,GAAG,IAAA,qBAAI,EAAC,IAAA,qBAAI,EAAC,GAAG,EAAE,IAAA,qBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAA,sBAAK,EAAC,IAAI,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,2BAAU,EAAC,IAAA,2BAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,2BAAU,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAChG,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"hol.test.d.ts","sourceRoot":"","sources":["../../../src/tests/hol/hol.test.ts"],"names":[],"mappings":""}
|