@stevenvo780/st-lang 4.5.0 → 4.5.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +78 -37
- 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/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/index.d.ts +19 -1
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +75 -1
- 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/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/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/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/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/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/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/package.json +3 -1
package/dist/index.js
CHANGED
|
@@ -13,14 +13,36 @@ var __createBinding = (this && this.__createBinding) || (Object.create ? (functi
|
|
|
13
13
|
if (k2 === undefined) k2 = k;
|
|
14
14
|
o[k2] = m[k];
|
|
15
15
|
}));
|
|
16
|
+
var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
|
|
17
|
+
Object.defineProperty(o, "default", { enumerable: true, value: v });
|
|
18
|
+
}) : function(o, v) {
|
|
19
|
+
o["default"] = v;
|
|
20
|
+
});
|
|
16
21
|
var __exportStar = (this && this.__exportStar) || function(m, exports) {
|
|
17
22
|
for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
|
|
18
23
|
};
|
|
24
|
+
var __importStar = (this && this.__importStar) || (function () {
|
|
25
|
+
var ownKeys = function(o) {
|
|
26
|
+
ownKeys = Object.getOwnPropertyNames || function (o) {
|
|
27
|
+
var ar = [];
|
|
28
|
+
for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
|
|
29
|
+
return ar;
|
|
30
|
+
};
|
|
31
|
+
return ownKeys(o);
|
|
32
|
+
};
|
|
33
|
+
return function (mod) {
|
|
34
|
+
if (mod && mod.__esModule) return mod;
|
|
35
|
+
var result = {};
|
|
36
|
+
if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
|
|
37
|
+
__setModuleDefault(result, mod);
|
|
38
|
+
return result;
|
|
39
|
+
};
|
|
40
|
+
})();
|
|
19
41
|
Object.defineProperty(exports, "__esModule", { value: true });
|
|
20
42
|
exports.TypeChecker = exports.typeCheck = exports.REPL = exports.ProtocolHandler = exports.Interpreter = exports.CycleError = exports.ClaimGraph = exports.registerInterpretation = exports.registerSource = exports.registerDefinition = exports.compileClaimsToTheory = exports.registerContext = exports.registerConfidence = exports.registerSupport = exports.registerClaim = exports.registerFormalization = exports.registerPassage = exports.parseAnchorPath = exports.createTextLayerState = exports.detectFallacies = exports.formulaToLaTeX = exports.formulaToUnicode = exports.PARALLEL_THRESHOLD = exports.workersAvailable = exports.dpllAsync = exports.dpll = exports.cdclAsync = exports.cdcl = exports.ParaconsistentBelnap = exports.ModalK = exports.ClassicalFirstOrder = exports.formulaToString = exports.ClassicalPropositional = exports.registry = exports.ProfileRegistry = exports.Parser = exports.KEYWORDS = exports.TokenType = exports.Lexer = exports.render = exports.completion = exports.gotoDefinition = exports.symbols = exports.hover = exports.listProfiles = exports.createInterpreter = exports.quickEval = exports.check = exports.parse = exports.evaluate = void 0;
|
|
21
43
|
exports.proofIsConsistent = exports.proofToTerm = exports.termToProof = exports.isNormal = exports.normalize = exports.reduceBeta = exports.isInferError = exports.inferType = exports.explainProof = exports.deriveWithCitations = exports.detectAvailableSMT = exports.SubprocessSMTBackend = exports.MockSMTBackend = exports.toSMTLIB = exports.generateLessonPath = exports.checkAnswer = exports.generateExercise = exports.SnapshotStore = exports.captureSnapshot = exports.generateKeyPair = exports.verifyProof = exports.signProof = exports.hashProof = exports.canonicalize = exports.toCNF = exports.skolemize = exports.unify = exports.proveFOL = exports.dotExport = exports.defends = exports.isConflictFree = exports.isAdmissible = exports.computeExtensions = exports.exportProofToCoq = exports.exportToCoq = exports.removeUnusedSubproofs = exports.compactModusPonensChain = exports.minifyProof = exports.minimizeCountermodel = exports.streamEval = exports.tryReuseProof = exports.TheoremCache = exports.hashFormula = exports.DerivationCache = exports.shutdownPool = exports.evalParallel = exports.solveCDCLv2 = exports.BaseASTVisitor = exports.visitProgram = exports.visit = void 0;
|
|
22
44
|
exports.lcY = exports.lcS = exports.lcK = exports.lcI = exports.lcIsWHNF = exports.lcIsNormalForm = exports.lcNormalize = exports.lcEtaStep = exports.lcBetaStep = exports.lcMakeFreshSupply = exports.lcAlphaRename = exports.lcSubstitute = exports.lcFreeVars = exports.lcTermToString = exports.lcAlphaEq = exports.lcApN = exports.lcAp = exports.lcLam = exports.lcVar = exports.mlttTermToString = exports.mlttOccursFree = exports.mlttFreeVars = exports.mlttSubstitute = exports.mlttAlphaBetaEq = exports.mlttAlphaEq = exports.mlttIsNormal = exports.mlttReduceStep = exports.mlttNormalize = exports.mlttIsInferError = exports.mlttCheckType = exports.mlttInferType = exports.mArrow = exports.mSucc = exports.mZero = exports.mNat = exports.mRefl = exports.mId = exports.mSnd = exports.mFst = exports.mPair = exports.mSigma = exports.mApp = exports.mLam = exports.mPi = exports.mUniverse = exports.mVar = exports.chEqType = exports.chTermToString = exports.chTypeToString = exports.ProofConversionError = void 0;
|
|
23
|
-
exports.lcChurchMul = exports.lcChurchAdd = exports.lcChurchSucc = exports.lcEvalChurch = exports.lcDecodeChurch = exports.lcChurchNumeral = exports.lcOmegaSmall = exports.lcOmega = void 0;
|
|
45
|
+
exports.Semantics = exports.Reasoning = exports.Solvers = exports.TypeTheory = exports.ProofSystems = exports.Logic = exports.applyHOSubst = exports.hoUnifyPattern = exports.isHigherOrderPattern = exports.hoIsPattern = exports.isBisimilar = exports.fibonacci = exports.naturals = exports.streamZipWith = exports.streamMap = exports.streamIterate = exports.streamRepeat = exports.streamTake = exports.ipcBottom = exports.ipcNot = exports.ipcImplies = exports.ipcOr = exports.ipcAnd = exports.ipcAtom = exports.play = exports.winningStrategy = exports.createPropositionalProver = exports.TableauProver = exports.TRANSLATIONS = exports.translateFormula = exports.findTranslationPath = exports.ctlToLTL = exports.ltlToCTL = exports.godelTranslation = exports.glivenkoTranslation = exports.lcChurchMul = exports.lcChurchAdd = exports.lcChurchSucc = exports.lcEvalChurch = exports.lcDecodeChurch = exports.lcChurchNumeral = exports.lcOmegaSmall = exports.lcOmega = void 0;
|
|
24
46
|
// API programática (uso recomendado para integración)
|
|
25
47
|
var api_1 = require("./api");
|
|
26
48
|
Object.defineProperty(exports, "evaluate", { enumerable: true, get: function () { return api_1.evaluate; } });
|
|
@@ -254,4 +276,56 @@ Object.defineProperty(exports, "lcEvalChurch", { enumerable: true, get: function
|
|
|
254
276
|
Object.defineProperty(exports, "lcChurchSucc", { enumerable: true, get: function () { return lambda_calc_1.churchSucc; } });
|
|
255
277
|
Object.defineProperty(exports, "lcChurchAdd", { enumerable: true, get: function () { return lambda_calc_1.churchAdd; } });
|
|
256
278
|
Object.defineProperty(exports, "lcChurchMul", { enumerable: true, get: function () { return lambda_calc_1.churchMul; } });
|
|
279
|
+
// profile-bridge — traducciones entre perfiles lógicos
|
|
280
|
+
var profile_bridge_1 = require("./profile-bridge");
|
|
281
|
+
Object.defineProperty(exports, "glivenkoTranslation", { enumerable: true, get: function () { return profile_bridge_1.glivenkoTranslation; } });
|
|
282
|
+
Object.defineProperty(exports, "godelTranslation", { enumerable: true, get: function () { return profile_bridge_1.godelTranslation; } });
|
|
283
|
+
Object.defineProperty(exports, "ltlToCTL", { enumerable: true, get: function () { return profile_bridge_1.ltlToCTL; } });
|
|
284
|
+
Object.defineProperty(exports, "ctlToLTL", { enumerable: true, get: function () { return profile_bridge_1.ctlToLTL; } });
|
|
285
|
+
Object.defineProperty(exports, "findTranslationPath", { enumerable: true, get: function () { return profile_bridge_1.findTranslationPath; } });
|
|
286
|
+
Object.defineProperty(exports, "translateFormula", { enumerable: true, get: function () { return profile_bridge_1.translateFormula; } });
|
|
287
|
+
Object.defineProperty(exports, "TRANSLATIONS", { enumerable: true, get: function () { return profile_bridge_1.TRANSLATIONS; } });
|
|
288
|
+
// tableau-framework — probador semántico por tableau
|
|
289
|
+
var tableau_framework_1 = require("./tableau-framework");
|
|
290
|
+
Object.defineProperty(exports, "TableauProver", { enumerable: true, get: function () { return tableau_framework_1.TableauProver; } });
|
|
291
|
+
Object.defineProperty(exports, "createPropositionalProver", { enumerable: true, get: function () { return tableau_framework_1.createPropositionalProver; } });
|
|
292
|
+
// game-semantics — juegos dialógicos IPC (Lorenzen-Felscher)
|
|
293
|
+
var game_semantics_1 = require("./game-semantics");
|
|
294
|
+
Object.defineProperty(exports, "winningStrategy", { enumerable: true, get: function () { return game_semantics_1.winningStrategy; } });
|
|
295
|
+
Object.defineProperty(exports, "play", { enumerable: true, get: function () { return game_semantics_1.play; } });
|
|
296
|
+
Object.defineProperty(exports, "ipcAtom", { enumerable: true, get: function () { return game_semantics_1.ipcAtom; } });
|
|
297
|
+
Object.defineProperty(exports, "ipcAnd", { enumerable: true, get: function () { return game_semantics_1.ipcAnd; } });
|
|
298
|
+
Object.defineProperty(exports, "ipcOr", { enumerable: true, get: function () { return game_semantics_1.ipcOr; } });
|
|
299
|
+
Object.defineProperty(exports, "ipcImplies", { enumerable: true, get: function () { return game_semantics_1.ipcImplies; } });
|
|
300
|
+
Object.defineProperty(exports, "ipcNot", { enumerable: true, get: function () { return game_semantics_1.ipcNot; } });
|
|
301
|
+
Object.defineProperty(exports, "ipcBottom", { enumerable: true, get: function () { return game_semantics_1.ipcBottom; } });
|
|
302
|
+
// coinduction — streams coinductivos y bisimulación
|
|
303
|
+
var coinduction_1 = require("./coinduction");
|
|
304
|
+
Object.defineProperty(exports, "streamTake", { enumerable: true, get: function () { return coinduction_1.take; } });
|
|
305
|
+
Object.defineProperty(exports, "streamRepeat", { enumerable: true, get: function () { return coinduction_1.repeat; } });
|
|
306
|
+
Object.defineProperty(exports, "streamIterate", { enumerable: true, get: function () { return coinduction_1.iterate; } });
|
|
307
|
+
Object.defineProperty(exports, "streamMap", { enumerable: true, get: function () { return coinduction_1.map; } });
|
|
308
|
+
Object.defineProperty(exports, "streamZipWith", { enumerable: true, get: function () { return coinduction_1.zipWith; } });
|
|
309
|
+
Object.defineProperty(exports, "naturals", { enumerable: true, get: function () { return coinduction_1.naturals; } });
|
|
310
|
+
Object.defineProperty(exports, "fibonacci", { enumerable: true, get: function () { return coinduction_1.fibonacci; } });
|
|
311
|
+
Object.defineProperty(exports, "isBisimilar", { enumerable: true, get: function () { return coinduction_1.isBisimilar; } });
|
|
312
|
+
// higher-order-unify — unificación de orden superior
|
|
313
|
+
var higher_order_unify_1 = require("./higher-order-unify");
|
|
314
|
+
Object.defineProperty(exports, "hoIsPattern", { enumerable: true, get: function () { return higher_order_unify_1.isPattern; } });
|
|
315
|
+
Object.defineProperty(exports, "isHigherOrderPattern", { enumerable: true, get: function () { return higher_order_unify_1.isHigherOrderPattern; } });
|
|
316
|
+
Object.defineProperty(exports, "hoUnifyPattern", { enumerable: true, get: function () { return higher_order_unify_1.unifyPattern; } });
|
|
317
|
+
Object.defineProperty(exports, "applyHOSubst", { enumerable: true, get: function () { return higher_order_unify_1.applyHOSubst; } });
|
|
318
|
+
// ── Namespaces semánticos (aditivo, no breaking) ─────────────────────────────
|
|
319
|
+
// Re-organiza los símbolos públicos por dominio sin remover los flat exports.
|
|
320
|
+
// Uso: `import { Logic, TypeTheory } from '@stevenvo780/st-lang'`.
|
|
321
|
+
//
|
|
322
|
+
// Nota: el namespace `Semantics` (valor) convive con `type Semantics` ya
|
|
323
|
+
// exportado por argumentation usando `export * as` (re-export wildcard), que
|
|
324
|
+
// crea un namespace de valor compatible con la fusión de declaraciones de TS.
|
|
325
|
+
exports.Logic = __importStar(require("./namespaces/logic"));
|
|
326
|
+
exports.ProofSystems = __importStar(require("./namespaces/proof-systems"));
|
|
327
|
+
exports.TypeTheory = __importStar(require("./namespaces/type-theory"));
|
|
328
|
+
exports.Solvers = __importStar(require("./namespaces/solvers"));
|
|
329
|
+
exports.Reasoning = __importStar(require("./namespaces/reasoning"));
|
|
330
|
+
exports.Semantics = __importStar(require("./namespaces/semantics"));
|
|
257
331
|
//# sourceMappingURL=index.js.map
|
package/dist/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAAA;;GAEG
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAAA;;GAEG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,sDAAsD;AACtD,6BAmBe;AAlBb,+FAAA,QAAQ,OAAA;AACR,4FAAA,KAAK,OAAA;AACL,4FAAA,KAAK,OAAA;AACL,gGAAA,SAAS,OAAA;AACT,wGAAA,iBAAiB,OAAA;AACjB,mGAAA,YAAY,OAAA;AACZ,4FAAA,KAAK,OAAA;AACL,8FAAA,OAAO,OAAA;AACP,qGAAA,cAAc,OAAA;AACd,iGAAA,UAAU,OAAA;AACV,6FAAA,MAAM,OAAA;AAUR,QAAQ;AACR,0CAAwB;AAExB,QAAQ;AACR,uCAAsC;AAA7B,8FAAA,KAAK,OAAA;AACd,yCAA4D;AAAnD,mGAAA,SAAS,OAAA;AAAS,kGAAA,QAAQ,OAAA;AAEnC,MAAM;AACN,8CAA4B;AAE5B,SAAS;AACT,0CAAyC;AAAhC,gGAAA,MAAM,OAAA;AAEf,WAAW;AACX,kDAA+E;AAAxD,4GAAA,eAAe,OAAA;AAAE,qGAAA,QAAQ,OAAA;AAChD,oEAA6F;AAApF,uHAAA,sBAAsB,OAAA;AAAE,gHAAA,eAAe,OAAA;AAChD,gEAAuE;AAA9D,kHAAA,mBAAmB,OAAA;AAC5B,wCAA4C;AAAnC,2FAAA,MAAM,OAAA;AACf,2DAAwE;AAA/D,8GAAA,oBAAoB,OAAA;AAE7B,oCAAoC;AACpC,kDAA4D;AAAnD,4FAAA,IAAI,OAAA;AAAE,iGAAA,SAAS,OAAA;AAExB,kDAA4D;AAAnD,4FAAA,IAAI,OAAA;AAAE,iGAAA,SAAS,OAAA;AACxB,kEAAyF;AAAhF,gHAAA,gBAAgB,OAAA;AAAE,kHAAA,kBAAkB,OAAA;AAE7C,4BAA4B;AAC5B,2CAAoE;AAA3D,0GAAA,gBAAgB,OAAA;AAAE,wGAAA,cAAc,OAAA;AAEzC,uBAAuB;AACvB,iDAAsD;AAA7C,4GAAA,eAAe,OAAA;AAGxB,aAAa;AACb,kDAc+B;AAZ7B,gHAAA,oBAAoB,OAAA;AACpB,2GAAA,eAAe,OAAA;AACf,2GAAA,eAAe,OAAA;AACf,iHAAA,qBAAqB,OAAA;AACrB,yGAAA,aAAa,OAAA;AACb,2GAAA,eAAe,OAAA;AACf,8GAAA,kBAAkB,OAAA;AAClB,2GAAA,eAAe,OAAA;AACf,iHAAA,qBAAqB,OAAA;AACrB,8GAAA,kBAAkB,OAAA;AAClB,0GAAA,cAAc,OAAA;AACd,kHAAA,sBAAsB,OAAA;AAGxB,6EAA6E;AAC7E,sCAAyD;AAAhD,gGAAA,UAAU,OAAA;AAAE,gGAAA,UAAU,OAAA;AAG/B,UAAU;AACV,qDAAoD;AAA3C,0GAAA,WAAW,OAAA;AAEpB,WAAW;AACX,8CAAqD;AAA5C,0GAAA,eAAe,OAAA;AAExB,OAAO;AACP,oCAAmC;AAA1B,4FAAA,IAAI,OAAA;AAEb,4DAA4D;AAC5D,iDAA6D;AAApD,sGAAA,SAAS,OAAA;AAAE,wGAAA,WAAW,OAAA;AAG/B,4BAA4B;AAC5B,yCAAoE;AAA3D,gGAAA,KAAK,OAAA;AAAE,uGAAA,YAAY,OAAA;AAAE,yGAAA,cAAc,OAAA;AAG5C,UAAU;AACV,4CAA+C;AAAtC,sGAAA,WAAW,OAAA;AAEpB,gBAAgB;AAChB,+CAAgE;AAAvD,wGAAA,YAAY,OAAA;AAAE,wGAAA,YAAY,OAAA;AAGnC,cAAc;AACd,uCAA8D;AAArD,uGAAA,eAAe,OAAA;AAAE,mGAAA,WAAW,OAAA;AAErC,0CAA0C;AAC1C,yDAAsE;AAA7D,6GAAA,YAAY,OAAA;AAAE,8GAAA,aAAa,OAAA;AAQpC,YAAY;AACZ,iDAAiD;AAAxC,uGAAA,UAAU,OAAA;AAGnB,4BAA4B;AAC5B,+DAAkE;AAAzD,wHAAA,oBAAoB,OAAA;AAO7B,qBAAqB;AACrB,uDAIgC;AAH9B,2GAAA,WAAW,OAAA;AACX,uHAAA,uBAAuB,OAAA;AACvB,qHAAA,qBAAqB,OAAA;AASvB,eAAe;AACf,uCAAgE;AAAvD,kGAAA,WAAW,OAAA;AAAE,uGAAA,gBAAgB,OAAA;AAEtC,iCAAiC;AACjC,iDAMyB;AALvB,kHAAA,iBAAiB,OAAA;AACjB,6GAAA,YAAY,OAAA;AACZ,+GAAA,cAAc,OAAA;AACd,wGAAA,OAAO,OAAA;AACP,0GAAA,SAAS,OAAA;AASX,aAAa;AACb,2CAAiE;AAAxD,sGAAA,QAAQ,OAAA;AAAE,mGAAA,KAAK,OAAA;AAAE,uGAAA,SAAS,OAAA;AAAE,mGAAA,KAAK,OAAA;AAE1C,iBAAiB;AACjB,mDAAoG;AAA3F,8GAAA,YAAY,OAAA;AAAE,2GAAA,SAAS,OAAA;AAAE,2GAAA,SAAS,OAAA;AAAE,6GAAA,WAAW,OAAA;AAAE,iHAAA,eAAe,OAAA;AAGzE,cAAc;AACd,6CAA+D;AAAtD,8GAAA,eAAe,OAAA;AAAE,4GAAA,aAAa,OAAA;AAGvC,cAAc;AACd,6CAAkF;AAAzE,+GAAA,gBAAgB,OAAA;AAAE,0GAAA,WAAW,OAAA;AAAE,iHAAA,kBAAkB,OAAA;AAG1D,aAAa;AACb,qCAAmG;AAA1F,+FAAA,QAAQ,OAAA;AAAE,qGAAA,cAAc,OAAA;AAAE,2GAAA,oBAAoB,OAAA;AAAE,yGAAA,kBAAkB,OAAA;AAG3E,0BAA0B;AAC1B,2DAAyE;AAAhE,yHAAA,mBAAmB,OAAA;AAAE,kHAAA,YAAY,OAAA;AAS1C,8CAA8C;AAC9C,+CAawB;AAZtB,yGAAA,SAAS,OAAA;AACT,4GAAA,YAAY,OAAA;AACZ,0GAAA,UAAU,OAAA;AACV,yGAAA,SAAS,OAAA;AACT,wGAAA,QAAQ,OAAA;AACR,2GAAA,WAAW,OAAA;AACX,2GAAA,WAAW,OAAA;AACX,iHAAA,iBAAiB,OAAA;AACjB,oHAAA,oBAAoB,OAAA;AACpB,8GAAA,YAAY,OAAkB;AAC9B,8GAAA,YAAY,OAAkB;AAC9B,wGAAA,MAAM,OAAY;AAWpB,yDAAyD;AACzD,+BA4BgB;AA3Bd,4FAAA,IAAI,OAAA;AACJ,iGAAA,SAAS,OAAA;AACT,2FAAA,GAAG,OAAA;AACH,4FAAA,IAAI,OAAA;AACJ,4FAAA,IAAI,OAAA;AACJ,8FAAA,MAAM,OAAA;AACN,6FAAA,KAAK,OAAA;AACL,4FAAA,IAAI,OAAA;AACJ,4FAAA,IAAI,OAAA;AACJ,2FAAA,GAAG,OAAA;AACH,6FAAA,KAAK,OAAA;AACL,4FAAA,IAAI,OAAA;AACJ,6FAAA,KAAK,OAAA;AACL,6FAAA,KAAK,OAAA;AACL,8FAAA,MAAM,OAAA;AACN,qGAAA,SAAS,OAAiB;AAC1B,qGAAA,SAAS,OAAiB;AAC1B,wGAAA,YAAY,OAAoB;AAChC,qGAAA,SAAS,OAAiB;AAC1B,sGAAA,UAAU,OAAkB;AAC5B,oGAAA,QAAQ,OAAgB;AACxB,mGAAA,OAAO,OAAe;AACtB,uGAAA,WAAW,OAAmB;AAC9B,sGAAA,UAAU,OAAkB;AAC5B,oGAAA,QAAQ,OAAgB;AACxB,sGAAA,UAAU,OAAkB;AAC5B,wGAAA,YAAY,OAAoB;AAQlC,2EAA2E;AAC3E,6CA4BuB;AA3BrB,oGAAA,CAAC,OAAS;AACV,oGAAA,GAAG,OAAS;AACZ,mGAAA,EAAE,OAAQ;AACV,oGAAA,GAAG,OAAS;AACZ,wGAAA,OAAO,OAAa;AACpB,6GAAA,YAAY,OAAkB;AAC9B,yGAAA,QAAQ,OAAc;AACtB,2GAAA,UAAU,OAAgB;AAC1B,4GAAA,WAAW,OAAiB;AAC5B,gHAAA,eAAe,OAAqB;AACpC,yGAAA,QAAQ,OAAc;AACtB,wGAAA,OAAO,OAAa;AACpB,0GAAA,SAAS,OAAe;AACxB,6GAAA,YAAY,OAAkB;AAC9B,uGAAA,oBAAoB,OAAY;AAChC,kGAAA,CAAC,OAAO;AACR,kGAAA,CAAC,OAAO;AACR,kGAAA,CAAC,OAAO;AACR,kGAAA,CAAC,OAAO;AACR,sGAAA,KAAK,OAAW;AAChB,2GAAA,UAAU,OAAgB;AAC1B,8GAAA,aAAa,OAAmB;AAChC,6GAAA,YAAY,OAAkB;AAC9B,2GAAA,UAAU,OAAgB;AAC1B,2GAAA,UAAU,OAAgB;AAC1B,0GAAA,SAAS,OAAe;AACxB,0GAAA,SAAS,OAAe;AAU1B,uDAAuD;AACvD,mDAQ0B;AAPxB,qHAAA,mBAAmB,OAAA;AACnB,kHAAA,gBAAgB,OAAA;AAChB,0GAAA,QAAQ,OAAA;AACR,0GAAA,QAAQ,OAAA;AACR,qHAAA,mBAAmB,OAAA;AACnB,kHAAA,gBAAgB,OAAA;AAChB,8GAAA,YAAY,OAAA;AAId,qDAAqD;AACrD,yDAA+E;AAAtE,kHAAA,aAAa,OAAA;AAAE,8HAAA,yBAAyB,OAAA;AASjD,6DAA6D;AAC7D,mDAS0B;AARxB,iHAAA,eAAe,OAAA;AACf,sGAAA,IAAI,OAAA;AACJ,yGAAA,OAAO,OAAA;AACP,wGAAA,MAAM,OAAA;AACN,uGAAA,KAAK,OAAA;AACL,4GAAA,UAAU,OAAA;AACV,wGAAA,MAAM,OAAA;AACN,2GAAA,SAAS,OAAA;AAIX,oDAAoD;AACpD,6CASuB;AARrB,yGAAA,IAAI,OAAc;AAClB,2GAAA,MAAM,OAAgB;AACtB,4GAAA,OAAO,OAAiB;AACxB,wGAAA,GAAG,OAAa;AAChB,4GAAA,OAAO,OAAiB;AACxB,uGAAA,QAAQ,OAAA;AACR,wGAAA,SAAS,OAAA;AACT,0GAAA,WAAW,OAAA;AAIb,qDAAqD;AACrD,2DAK8B;AAJ5B,iHAAA,SAAS,OAAe;AACxB,0HAAA,oBAAoB,OAAA;AACpB,oHAAA,YAAY,OAAkB;AAC9B,kHAAA,YAAY,OAAA;AAId,gFAAgF;AAChF,8EAA8E;AAC9E,mEAAmE;AACnE,EAAE;AACF,yEAAyE;AACzE,6EAA6E;AAC7E,8EAA8E;AAC9E,4DAA4C;AAC5C,2EAA2D;AAC3D,uEAAuD;AACvD,gEAAgD;AAChD,oEAAoD;AACpD,oEAAoD"}
|
|
@@ -0,0 +1,29 @@
|
|
|
1
|
+
export type Distribution<T> = Map<T, number>;
|
|
2
|
+
export type Joint<X, Y> = Map<[X, Y], number>;
|
|
3
|
+
export declare function support<T>(p: Distribution<T>): T[];
|
|
4
|
+
export declare function isValidDistribution<T>(p: Distribution<T>, eps?: number): boolean;
|
|
5
|
+
export declare function normalize<T>(p: Distribution<T>): Distribution<T>;
|
|
6
|
+
export type LogBase = 'log' | 'e' | 2 | 10;
|
|
7
|
+
export declare function shannonEntropy<T>(p: Distribution<T>, base?: LogBase): number;
|
|
8
|
+
export declare function renyiEntropy<T>(p: Distribution<T>, alpha: number, base?: LogBase): number;
|
|
9
|
+
export declare function minEntropy<T>(p: Distribution<T>, base?: LogBase): number;
|
|
10
|
+
export declare function maxEntropy<T>(p: Distribution<T>, base?: LogBase): number;
|
|
11
|
+
export declare function collisionEntropy<T>(p: Distribution<T>, base?: LogBase): number;
|
|
12
|
+
export declare function klDivergence<T>(p: Distribution<T>, q: Distribution<T>, base?: LogBase): number;
|
|
13
|
+
export declare function jsDivergence<T>(p: Distribution<T>, q: Distribution<T>, base?: LogBase): number;
|
|
14
|
+
export declare function tvDistance<T>(p: Distribution<T>, q: Distribution<T>): number;
|
|
15
|
+
export declare function hellingerDistance<T>(p: Distribution<T>, q: Distribution<T>): number;
|
|
16
|
+
export declare function crossEntropy<T>(p: Distribution<T>, q: Distribution<T>, base?: LogBase): number;
|
|
17
|
+
export declare function jointToMarginals<X, Y>(j: Joint<X, Y>): {
|
|
18
|
+
X: Distribution<X>;
|
|
19
|
+
Y: Distribution<Y>;
|
|
20
|
+
};
|
|
21
|
+
export declare function mutualInformation<X, Y>(j: Joint<X, Y>, base?: LogBase): number;
|
|
22
|
+
export declare function conditionalEntropy<X, Y>(j: Joint<X, Y>, condOn: 'X' | 'Y', base?: LogBase): number;
|
|
23
|
+
export declare function chainRule<X, Y>(j: Joint<X, Y>, base?: LogBase): {
|
|
24
|
+
hX: number;
|
|
25
|
+
hY: number;
|
|
26
|
+
hXY: number;
|
|
27
|
+
iXY: number;
|
|
28
|
+
};
|
|
29
|
+
//# sourceMappingURL=index.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/information-theory/index.ts"],"names":[],"mappings":"AAsBA,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAM7C,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAW9C,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAMlD;AAID,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,GAAE,MAAoB,GAAG,OAAO,CAO7F;AAID,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAgBhE;AAOD,MAAM,MAAM,OAAO,GAAG,KAAK,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;AAqB3C,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAS/E;AAaD,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAc5F;AAGD,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAQ3E;AAGD,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAK3E;AAGD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAQjF;AASD,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAUjG;AAID,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAQjG;AAGD,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,CAS5E;AAID,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,CAYnF;AAQD,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAUjG;AAUD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG;IAAE,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAA;CAAE,CAUjG;AAgBD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,GAAE,OAAW,GAAG,MAAM,CAcjF;AAID,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,CAAC,EACrC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,MAAM,EAAE,GAAG,GAAG,GAAG,EACjB,IAAI,GAAE,OAAW,GAChB,MAAM,CAOR;AAID,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAC5B,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EACd,IAAI,GAAE,OAAW,GAChB;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAQtD"}
|
|
@@ -0,0 +1,323 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
// ============================================================
|
|
3
|
+
// ST Information Theory — Toolkit de entropías y divergencias
|
|
4
|
+
// ============================================================
|
|
5
|
+
//
|
|
6
|
+
// Sobre distribuciones simbólicas discretas (`Map<T, number>` con masa
|
|
7
|
+
// total ≈ 1) provee:
|
|
8
|
+
//
|
|
9
|
+
// • Entropías: Shannon, Rényi(α), min, max, colisión.
|
|
10
|
+
// • Divergencias: KL, JS, total-variation, Hellinger.
|
|
11
|
+
// • Información mutua a partir de distribución conjunta.
|
|
12
|
+
// • Cross-entropy y la relación H(p,q) = H(p) + KL(p ‖ q).
|
|
13
|
+
//
|
|
14
|
+
// Convenciones de borde:
|
|
15
|
+
// • La probabilidad 0 contribuye 0 a la entropía (lim x·log x = 0).
|
|
16
|
+
// • KL(p ‖ q) es +∞ si existe x con p(x) > 0 y q(x) = 0.
|
|
17
|
+
// • La base por defecto del logaritmo es 2 (bits). También se aceptan
|
|
18
|
+
// 'e' (nats), 10 (hartleys/dits) y el alias 'log' = 2.
|
|
19
|
+
// • Validamos con tolerancia EPS_DEFAULT antes de cualquier cómputo
|
|
20
|
+
// que asuma normalización. `normalize` no se llama implícitamente
|
|
21
|
+
// porque queremos que el usuario decida cuándo reescalar.
|
|
22
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
23
|
+
exports.support = support;
|
|
24
|
+
exports.isValidDistribution = isValidDistribution;
|
|
25
|
+
exports.normalize = normalize;
|
|
26
|
+
exports.shannonEntropy = shannonEntropy;
|
|
27
|
+
exports.renyiEntropy = renyiEntropy;
|
|
28
|
+
exports.minEntropy = minEntropy;
|
|
29
|
+
exports.maxEntropy = maxEntropy;
|
|
30
|
+
exports.collisionEntropy = collisionEntropy;
|
|
31
|
+
exports.klDivergence = klDivergence;
|
|
32
|
+
exports.jsDivergence = jsDivergence;
|
|
33
|
+
exports.tvDistance = tvDistance;
|
|
34
|
+
exports.hellingerDistance = hellingerDistance;
|
|
35
|
+
exports.crossEntropy = crossEntropy;
|
|
36
|
+
exports.jointToMarginals = jointToMarginals;
|
|
37
|
+
exports.mutualInformation = mutualInformation;
|
|
38
|
+
exports.conditionalEntropy = conditionalEntropy;
|
|
39
|
+
exports.chainRule = chainRule;
|
|
40
|
+
// Tolerancia por defecto para "suma ≈ 1" y comparaciones simétricas.
|
|
41
|
+
const EPS_DEFAULT = 1e-9;
|
|
42
|
+
// ------------------------------------------------------------
|
|
43
|
+
// Soporte y validación
|
|
44
|
+
// ------------------------------------------------------------
|
|
45
|
+
// Devuelve los símbolos con probabilidad estrictamente positiva, en el
|
|
46
|
+
// orden en que aparecen en el Map (orden de inserción, estable).
|
|
47
|
+
function support(p) {
|
|
48
|
+
const out = [];
|
|
49
|
+
for (const [k, v] of p) {
|
|
50
|
+
if (v > 0)
|
|
51
|
+
out.push(k);
|
|
52
|
+
}
|
|
53
|
+
return out;
|
|
54
|
+
}
|
|
55
|
+
// True si todas las probabilidades son finitas y ≥ 0, y la suma está a
|
|
56
|
+
// menos de `eps` de 1. Probabilidades negativas o NaN ⇒ false.
|
|
57
|
+
function isValidDistribution(p, eps = EPS_DEFAULT) {
|
|
58
|
+
let sum = 0;
|
|
59
|
+
for (const v of p.values()) {
|
|
60
|
+
if (!Number.isFinite(v) || v < 0)
|
|
61
|
+
return false;
|
|
62
|
+
sum += v;
|
|
63
|
+
}
|
|
64
|
+
return Math.abs(sum - 1) <= eps;
|
|
65
|
+
}
|
|
66
|
+
// Reescala la distribución a masa 1. Si la suma actual es 0, lanza:
|
|
67
|
+
// no hay forma canónica de "normalizar" la distribución nula.
|
|
68
|
+
function normalize(p) {
|
|
69
|
+
let sum = 0;
|
|
70
|
+
for (const v of p.values()) {
|
|
71
|
+
if (!Number.isFinite(v) || v < 0) {
|
|
72
|
+
throw new Error('normalize: probabilidad inválida (negativa, NaN o infinita)');
|
|
73
|
+
}
|
|
74
|
+
sum += v;
|
|
75
|
+
}
|
|
76
|
+
if (sum === 0) {
|
|
77
|
+
throw new Error('normalize: distribución con masa total 0');
|
|
78
|
+
}
|
|
79
|
+
const out = new Map();
|
|
80
|
+
for (const [k, v] of p) {
|
|
81
|
+
out.set(k, v / sum);
|
|
82
|
+
}
|
|
83
|
+
return out;
|
|
84
|
+
}
|
|
85
|
+
function logIn(base) {
|
|
86
|
+
switch (base) {
|
|
87
|
+
case 'e':
|
|
88
|
+
return Math.log;
|
|
89
|
+
case 10:
|
|
90
|
+
return Math.log10;
|
|
91
|
+
case 2:
|
|
92
|
+
case 'log':
|
|
93
|
+
default:
|
|
94
|
+
return Math.log2;
|
|
95
|
+
}
|
|
96
|
+
}
|
|
97
|
+
// ------------------------------------------------------------
|
|
98
|
+
// Entropías
|
|
99
|
+
// ------------------------------------------------------------
|
|
100
|
+
// Shannon: H(p) = -Σ p(x) · log p(x).
|
|
101
|
+
// Convención lim_{x→0} x·log x = 0 ⇒ los símbolos con masa 0 no aportan.
|
|
102
|
+
function shannonEntropy(p, base = 2) {
|
|
103
|
+
const log = logIn(base);
|
|
104
|
+
let h = 0;
|
|
105
|
+
for (const v of p.values()) {
|
|
106
|
+
if (v > 0) {
|
|
107
|
+
h -= v * log(v);
|
|
108
|
+
}
|
|
109
|
+
}
|
|
110
|
+
return h;
|
|
111
|
+
}
|
|
112
|
+
// Rényi de orden α (α ≥ 0, α ≠ 1):
|
|
113
|
+
// H_α(p) = 1/(1-α) · log Σ p(x)^α
|
|
114
|
+
//
|
|
115
|
+
// Casos especiales:
|
|
116
|
+
// α = 0 → log |sop(p)| (Hartley / max-entropy del soporte)
|
|
117
|
+
// α = 1 → Shannon (límite L'Hôpital — devolvemos Shannon)
|
|
118
|
+
// α = 2 → -log Σ p(x)^2 (entropía de colisión)
|
|
119
|
+
// α → ∞ → -log max p(x) (min-entropy)
|
|
120
|
+
//
|
|
121
|
+
// `alpha` debe ser un número real finito y ≥ 0. α negativos no son
|
|
122
|
+
// entropías de Rényi estándar y no se aceptan.
|
|
123
|
+
function renyiEntropy(p, alpha, base = 2) {
|
|
124
|
+
if (!Number.isFinite(alpha) || alpha < 0) {
|
|
125
|
+
throw new Error('renyiEntropy: α debe ser finito y ≥ 0');
|
|
126
|
+
}
|
|
127
|
+
if (alpha === 1)
|
|
128
|
+
return shannonEntropy(p, base);
|
|
129
|
+
if (alpha === 0)
|
|
130
|
+
return maxEntropy(p, base);
|
|
131
|
+
const log = logIn(base);
|
|
132
|
+
let s = 0;
|
|
133
|
+
for (const v of p.values()) {
|
|
134
|
+
if (v > 0)
|
|
135
|
+
s += Math.pow(v, alpha);
|
|
136
|
+
}
|
|
137
|
+
if (s === 0)
|
|
138
|
+
return 0;
|
|
139
|
+
return log(s) / (1 - alpha);
|
|
140
|
+
}
|
|
141
|
+
// Min-entropy: -log max_x p(x). Mide la peor predictibilidad single-guess.
|
|
142
|
+
function minEntropy(p, base = 2) {
|
|
143
|
+
const log = logIn(base);
|
|
144
|
+
let max = 0;
|
|
145
|
+
for (const v of p.values()) {
|
|
146
|
+
if (v > max)
|
|
147
|
+
max = v;
|
|
148
|
+
}
|
|
149
|
+
if (max === 0)
|
|
150
|
+
return 0;
|
|
151
|
+
return -log(max);
|
|
152
|
+
}
|
|
153
|
+
// Max-entropy: log|soporte(p)|. Hartley sobre el soporte estricto.
|
|
154
|
+
function maxEntropy(p, base = 2) {
|
|
155
|
+
const log = logIn(base);
|
|
156
|
+
const n = support(p).length;
|
|
157
|
+
if (n === 0)
|
|
158
|
+
return 0;
|
|
159
|
+
return log(n);
|
|
160
|
+
}
|
|
161
|
+
// Entropía de colisión: Rényi α=2 = -log Σ p(x)^2.
|
|
162
|
+
function collisionEntropy(p, base = 2) {
|
|
163
|
+
const log = logIn(base);
|
|
164
|
+
let s = 0;
|
|
165
|
+
for (const v of p.values()) {
|
|
166
|
+
if (v > 0)
|
|
167
|
+
s += v * v;
|
|
168
|
+
}
|
|
169
|
+
if (s === 0)
|
|
170
|
+
return 0;
|
|
171
|
+
return -log(s);
|
|
172
|
+
}
|
|
173
|
+
// ------------------------------------------------------------
|
|
174
|
+
// Divergencias y distancias
|
|
175
|
+
// ------------------------------------------------------------
|
|
176
|
+
// KL(p ‖ q) = Σ p(x) · log(p(x)/q(x)).
|
|
177
|
+
// Convención: p(x)=0 aporta 0; p(x)>0 y q(x)=0 ⇒ +Infinity.
|
|
178
|
+
// Soporte sobre la unión de claves de p y q.
|
|
179
|
+
function klDivergence(p, q, base = 2) {
|
|
180
|
+
const log = logIn(base);
|
|
181
|
+
let d = 0;
|
|
182
|
+
for (const [k, px] of p) {
|
|
183
|
+
if (px === 0)
|
|
184
|
+
continue;
|
|
185
|
+
const qx = q.get(k) ?? 0;
|
|
186
|
+
if (qx === 0)
|
|
187
|
+
return Number.POSITIVE_INFINITY;
|
|
188
|
+
d += px * log(px / qx);
|
|
189
|
+
}
|
|
190
|
+
return d;
|
|
191
|
+
}
|
|
192
|
+
// Jensen-Shannon: JS(p,q) = ½ KL(p ‖ m) + ½ KL(q ‖ m), m = ½(p+q).
|
|
193
|
+
// Simétrica y siempre finita en [0, log 2] (base 2 ⇒ [0, 1]).
|
|
194
|
+
function jsDivergence(p, q, base = 2) {
|
|
195
|
+
const m = new Map();
|
|
196
|
+
for (const [k, v] of p)
|
|
197
|
+
m.set(k, (m.get(k) ?? 0) + v);
|
|
198
|
+
for (const [k, v] of q)
|
|
199
|
+
m.set(k, (m.get(k) ?? 0) + v);
|
|
200
|
+
// m = p + q; dividimos por 2 para obtener la mezcla.
|
|
201
|
+
for (const [k, v] of m)
|
|
202
|
+
m.set(k, v / 2);
|
|
203
|
+
return 0.5 * klDivergence(p, m, base) + 0.5 * klDivergence(q, m, base);
|
|
204
|
+
}
|
|
205
|
+
// Distancia de variación total: TV(p,q) = ½ Σ |p(x) - q(x)|. ∈ [0, 1].
|
|
206
|
+
function tvDistance(p, q) {
|
|
207
|
+
const keys = new Set();
|
|
208
|
+
for (const k of p.keys())
|
|
209
|
+
keys.add(k);
|
|
210
|
+
for (const k of q.keys())
|
|
211
|
+
keys.add(k);
|
|
212
|
+
let s = 0;
|
|
213
|
+
for (const k of keys) {
|
|
214
|
+
s += Math.abs((p.get(k) ?? 0) - (q.get(k) ?? 0));
|
|
215
|
+
}
|
|
216
|
+
return s / 2;
|
|
217
|
+
}
|
|
218
|
+
// Distancia de Hellinger: H(p,q) = (1/√2) · sqrt(Σ (√p(x) - √q(x))²).
|
|
219
|
+
// ∈ [0, 1]; 0 sii p=q; 1 sii soportes disjuntos.
|
|
220
|
+
function hellingerDistance(p, q) {
|
|
221
|
+
const keys = new Set();
|
|
222
|
+
for (const k of p.keys())
|
|
223
|
+
keys.add(k);
|
|
224
|
+
for (const k of q.keys())
|
|
225
|
+
keys.add(k);
|
|
226
|
+
let s = 0;
|
|
227
|
+
for (const k of keys) {
|
|
228
|
+
const a = Math.sqrt(p.get(k) ?? 0);
|
|
229
|
+
const b = Math.sqrt(q.get(k) ?? 0);
|
|
230
|
+
const d = a - b;
|
|
231
|
+
s += d * d;
|
|
232
|
+
}
|
|
233
|
+
return Math.sqrt(s) / Math.SQRT2;
|
|
234
|
+
}
|
|
235
|
+
// ------------------------------------------------------------
|
|
236
|
+
// Cross-entropy
|
|
237
|
+
// ------------------------------------------------------------
|
|
238
|
+
// H(p, q) = -Σ p(x) · log q(x) = H(p) + KL(p ‖ q).
|
|
239
|
+
// Devuelve +∞ si existe x con p(x) > 0 y q(x) = 0.
|
|
240
|
+
function crossEntropy(p, q, base = 2) {
|
|
241
|
+
const log = logIn(base);
|
|
242
|
+
let h = 0;
|
|
243
|
+
for (const [k, px] of p) {
|
|
244
|
+
if (px === 0)
|
|
245
|
+
continue;
|
|
246
|
+
const qx = q.get(k) ?? 0;
|
|
247
|
+
if (qx === 0)
|
|
248
|
+
return Number.POSITIVE_INFINITY;
|
|
249
|
+
h -= px * log(qx);
|
|
250
|
+
}
|
|
251
|
+
return h;
|
|
252
|
+
}
|
|
253
|
+
// ------------------------------------------------------------
|
|
254
|
+
// Distribuciones conjuntas e información mutua
|
|
255
|
+
// ------------------------------------------------------------
|
|
256
|
+
// Proyecta la conjunta sobre cada eje. Devuelve dos distribuciones
|
|
257
|
+
// (marginales) tal que Σ joint(x,y) = X(x) = Σ_y joint(x,y), etc.
|
|
258
|
+
// Si dos claves de la conjunta tienen el mismo par lógico (mismas X y
|
|
259
|
+
// Y por referencia/valor), sus masas se suman en las marginales.
|
|
260
|
+
function jointToMarginals(j) {
|
|
261
|
+
const mX = new Map();
|
|
262
|
+
const mY = new Map();
|
|
263
|
+
for (const [pair, v] of j) {
|
|
264
|
+
const x = pair[0];
|
|
265
|
+
const y = pair[1];
|
|
266
|
+
mX.set(x, (mX.get(x) ?? 0) + v);
|
|
267
|
+
mY.set(y, (mY.get(y) ?? 0) + v);
|
|
268
|
+
}
|
|
269
|
+
return { X: mX, Y: mY };
|
|
270
|
+
}
|
|
271
|
+
// H(X, Y): entropía conjunta directa sobre la distribución del par.
|
|
272
|
+
function jointEntropy(j, base) {
|
|
273
|
+
const log = logIn(base);
|
|
274
|
+
let h = 0;
|
|
275
|
+
for (const v of j.values()) {
|
|
276
|
+
if (v > 0)
|
|
277
|
+
h -= v * log(v);
|
|
278
|
+
}
|
|
279
|
+
return h;
|
|
280
|
+
}
|
|
281
|
+
// I(X; Y) = Σ_xy p(x,y) · log( p(x,y) / (p(x)·p(y)) ).
|
|
282
|
+
// Equivalentemente: I(X;Y) = H(X) + H(Y) − H(X,Y).
|
|
283
|
+
// Usamos la forma sumatoria directa para mantener invariancia ante
|
|
284
|
+
// reordenamiento numérico de los marginales y evitar restas catastróficas.
|
|
285
|
+
function mutualInformation(j, base = 2) {
|
|
286
|
+
const log = logIn(base);
|
|
287
|
+
const { X: mX, Y: mY } = jointToMarginals(j);
|
|
288
|
+
let mi = 0;
|
|
289
|
+
for (const [pair, pxy] of j) {
|
|
290
|
+
if (pxy <= 0)
|
|
291
|
+
continue;
|
|
292
|
+
const px = mX.get(pair[0]) ?? 0;
|
|
293
|
+
const py = mY.get(pair[1]) ?? 0;
|
|
294
|
+
if (px === 0 || py === 0)
|
|
295
|
+
continue;
|
|
296
|
+
mi += pxy * log(pxy / (px * py));
|
|
297
|
+
}
|
|
298
|
+
// Por estabilidad numérica forzamos no-negatividad estricta (puede
|
|
299
|
+
// dar -1e-16 por redondeo en distribuciones independientes).
|
|
300
|
+
return mi < 0 && mi > -1e-12 ? 0 : mi;
|
|
301
|
+
}
|
|
302
|
+
// H(X|Y) o H(Y|X) según `condOn`.
|
|
303
|
+
// H(X|Y) = H(X,Y) − H(Y); H(Y|X) = H(X,Y) − H(X). Ambas ≥ 0.
|
|
304
|
+
function conditionalEntropy(j, condOn, base = 2) {
|
|
305
|
+
const hXY = jointEntropy(j, base);
|
|
306
|
+
const { X: mX, Y: mY } = jointToMarginals(j);
|
|
307
|
+
const hX = shannonEntropy(mX, base);
|
|
308
|
+
const hY = shannonEntropy(mY, base);
|
|
309
|
+
const out = condOn === 'X' ? hXY - hY : hXY - hX;
|
|
310
|
+
return out < 0 && out > -1e-12 ? 0 : out;
|
|
311
|
+
}
|
|
312
|
+
// Cuatro escalares clásicos: H(X), H(Y), H(X,Y), I(X;Y). Útil para
|
|
313
|
+
// verificar la regla de la cadena: H(X,Y) = H(X) + H(Y) − I(X;Y).
|
|
314
|
+
function chainRule(j, base = 2) {
|
|
315
|
+
const { X: mX, Y: mY } = jointToMarginals(j);
|
|
316
|
+
return {
|
|
317
|
+
hX: shannonEntropy(mX, base),
|
|
318
|
+
hY: shannonEntropy(mY, base),
|
|
319
|
+
hXY: jointEntropy(j, base),
|
|
320
|
+
iXY: mutualInformation(j, base),
|
|
321
|
+
};
|
|
322
|
+
}
|
|
323
|
+
//# sourceMappingURL=index.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/information-theory/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,8DAA8D;AAC9D,+DAA+D;AAC/D,EAAE;AACF,uEAAuE;AACvE,qBAAqB;AACrB,EAAE;AACF,wDAAwD;AACxD,wDAAwD;AACxD,2DAA2D;AAC3D,6DAA6D;AAC7D,EAAE;AACF,yBAAyB;AACzB,sEAAsE;AACtE,2DAA2D;AAC3D,wEAAwE;AACxE,2DAA2D;AAC3D,sEAAsE;AACtE,sEAAsE;AACtE,8DAA8D;;AAoB9D,0BAMC;AAID,kDAOC;AAID,8BAgBC;AA4BD,wCASC;AAaD,oCAcC;AAGD,gCAQC;AAGD,gCAKC;AAGD,4CAQC;AASD,oCAUC;AAID,oCAQC;AAGD,gCASC;AAID,8CAYC;AAQD,oCAUC;AAUD,4CAUC;AAgBD,8CAcC;AAID,gDAWC;AAID,8BAWC;AAzSD,qEAAqE;AACrE,MAAM,WAAW,GAAG,IAAI,CAAC;AAEzB,+DAA+D;AAC/D,uBAAuB;AACvB,+DAA+D;AAE/D,uEAAuE;AACvE,iEAAiE;AACjE,SAAgB,OAAO,CAAI,CAAkB;IAC3C,MAAM,GAAG,GAAQ,EAAE,CAAC;IACpB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,uEAAuE;AACvE,+DAA+D;AAC/D,SAAgB,mBAAmB,CAAI,CAAkB,EAAE,MAAc,WAAW;IAClF,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/C,GAAG,IAAI,CAAC,CAAC;IACX,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC;AAClC,CAAC;AAED,oEAAoE;AACpE,8DAA8D;AAC9D,SAAgB,SAAS,CAAI,CAAkB;IAC7C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;QACjF,CAAC;QACD,GAAG,IAAI,CAAC,CAAC;IACX,CAAC;IACD,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAa,CAAC;IACjC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACvB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AASD,SAAS,KAAK,CAAC,IAAa;IAC1B,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,GAAG;YACN,OAAO,IAAI,CAAC,GAAG,CAAC;QAClB,KAAK,EAAE;YACL,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,KAAK,CAAC,CAAC;QACP,KAAK,KAAK,CAAC;QACX;YACE,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,YAAY;AACZ,+DAA+D;AAE/D,sCAAsC;AACtC,yEAAyE;AACzE,SAAgB,cAAc,CAAI,CAAkB,EAAE,OAAgB,CAAC;IACrE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,mCAAmC;AACnC,oCAAoC;AACpC,EAAE;AACF,oBAAoB;AACpB,mEAAmE;AACnE,uEAAuE;AACvE,sDAAsD;AACtD,6CAA6C;AAC7C,EAAE;AACF,mEAAmE;AACnE,+CAA+C;AAC/C,SAAgB,YAAY,CAAI,CAAkB,EAAE,KAAa,EAAE,OAAgB,CAAC;IAClF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IAC3D,CAAC;IACD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAChD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAE5C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED,2EAA2E;AAC3E,SAAgB,UAAU,CAAI,CAAkB,EAAE,OAAgB,CAAC;IACjE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACxB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACnB,CAAC;AAED,mEAAmE;AACnE,SAAgB,UAAU,CAAI,CAAkB,EAAE,OAAgB,CAAC;IACjE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC5B,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;AAChB,CAAC;AAED,mDAAmD;AACnD,SAAgB,gBAAgB,CAAI,CAAkB,EAAE,OAAgB,CAAC;IACvE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,+DAA+D;AAC/D,4BAA4B;AAC5B,+DAA+D;AAE/D,uCAAuC;AACvC,4DAA4D;AAC5D,6CAA6C;AAC7C,SAAgB,YAAY,CAAI,CAAkB,EAAE,CAAkB,EAAE,OAAgB,CAAC;IACvF,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;QACvB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,iBAAiB,CAAC;QAC9C,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,mEAAmE;AACnE,8DAA8D;AAC9D,SAAgB,YAAY,CAAI,CAAkB,EAAE,CAAkB,EAAE,OAAgB,CAAC;IACvF,MAAM,CAAC,GAAG,IAAI,GAAG,EAAa,CAAC;IAC/B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,qDAAqD;IACrD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAExC,OAAO,GAAG,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,GAAG,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACzE,CAAC;AAED,uEAAuE;AACvE,SAAgB,UAAU,CAAI,CAAkB,EAAE,CAAkB;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,CAAC;AACf,CAAC;AAED,sEAAsE;AACtE,iDAAiD;AACjD,SAAgB,iBAAiB,CAAI,CAAkB,EAAE,CAAkB;IACzE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;AACnC,CAAC;AAED,+DAA+D;AAC/D,gBAAgB;AAChB,+DAA+D;AAE/D,mDAAmD;AACnD,mDAAmD;AACnD,SAAgB,YAAY,CAAI,CAAkB,EAAE,CAAkB,EAAE,OAAgB,CAAC;IACvF,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;QACvB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,iBAAiB,CAAC;QAC9C,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,+DAA+D;AAC/D,+CAA+C;AAC/C,+DAA+D;AAE/D,mEAAmE;AACnE,kEAAkE;AAClE,sEAAsE;AACtE,iEAAiE;AACjE,SAAgB,gBAAgB,CAAO,CAAc;IACnD,MAAM,EAAE,GAAG,IAAI,GAAG,EAAa,CAAC;IAChC,MAAM,EAAE,GAAG,IAAI,GAAG,EAAa,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;AAC1B,CAAC;AAED,oEAAoE;AACpE,SAAS,YAAY,CAAO,CAAc,EAAE,IAAa;IACvD,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,uDAAuD;AACvD,mDAAmD;AACnD,mEAAmE;AACnE,2EAA2E;AAC3E,SAAgB,iBAAiB,CAAO,CAAc,EAAE,OAAgB,CAAC;IACvE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC7C,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5B,IAAI,GAAG,IAAI,CAAC;YAAE,SAAS;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;YAAE,SAAS;QACnC,EAAE,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,mEAAmE;IACnE,6DAA6D;IAC7D,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACxC,CAAC;AAED,kCAAkC;AAClC,6DAA6D;AAC7D,SAAgB,kBAAkB,CAChC,CAAc,EACd,MAAiB,EACjB,OAAgB,CAAC;IAEjB,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAClC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC7C,MAAM,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,GAAG,GAAG,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;IACjD,OAAO,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAC3C,CAAC;AAED,mEAAmE;AACnE,kEAAkE;AAClE,SAAgB,SAAS,CACvB,CAAc,EACd,OAAgB,CAAC;IAEjB,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC7C,OAAO;QACL,EAAE,EAAE,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC;QAC5B,EAAE,EAAE,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC;QAC5B,GAAG,EAAE,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC;QAC1B,GAAG,EAAE,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC;KAChC,CAAC;AACJ,CAAC"}
|
|
@@ -0,0 +1,42 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Namespace: Logic
|
|
3
|
+
*
|
|
4
|
+
* Agrupa los perfiles lógicos disponibles en ST. Cada sub-namespace expone
|
|
5
|
+
* los símbolos del módulo correspondiente sin colisiones de nombres entre
|
|
6
|
+
* lógicas (CTL.Formula vs LTL.Formula, etc).
|
|
7
|
+
*
|
|
8
|
+
* Importa así:
|
|
9
|
+
* import { Logic } from '@stevenvo780/st-lang';
|
|
10
|
+
* Logic.modal.s5.isValid(formula);
|
|
11
|
+
* Logic.ctl.modelCheckCTL(kripke, formula);
|
|
12
|
+
*/
|
|
13
|
+
export { LogicProfile, ProfileRegistry, registry } from '../profiles/interface';
|
|
14
|
+
export { ClassicalPropositional, formulaToString } from '../profiles/classical/propositional';
|
|
15
|
+
export { ClassicalFirstOrder } from '../profiles/classical/first-order';
|
|
16
|
+
export { ModalK } from '../profiles/modal/k';
|
|
17
|
+
export { ParaconsistentBelnap } from '../profiles/paraconsistent/belnap';
|
|
18
|
+
export { IntuitionisticPropositional } from '../profiles/intuitionistic/propositional';
|
|
19
|
+
export { TemporalLTL } from '../profiles/temporal/ltl';
|
|
20
|
+
export { EpistemicS5 } from '../profiles/epistemic/s5';
|
|
21
|
+
export { DeonticStandard } from '../profiles/deontic/standard';
|
|
22
|
+
export { AristotelianSyllogistic } from '../profiles/aristotelian/syllogistic';
|
|
23
|
+
export { ProbabilisticBasic } from '../profiles/probabilistic/basic';
|
|
24
|
+
import * as ctl from '../profiles/ctl';
|
|
25
|
+
import * as ltl from '../profiles/ltl-sat';
|
|
26
|
+
import * as muCalculus from '../profiles/mu-calculus';
|
|
27
|
+
import * as hybrid from '../profiles/hybrid-logic';
|
|
28
|
+
import * as descriptionLogic from '../profiles/description-logic';
|
|
29
|
+
import * as modalAxioms from '../profiles/modal-frame-axioms';
|
|
30
|
+
import * as sequentG3 from '../profiles/sequent-g3';
|
|
31
|
+
import * as sequentLK from '../profiles/sequent-lk';
|
|
32
|
+
import * as intuitNJ from '../profiles/intuitionistic-nj';
|
|
33
|
+
import * as defaultLogic from '../profiles/default-logic';
|
|
34
|
+
import * as manyValued from '../profiles/many-valued';
|
|
35
|
+
import * as substructural from '../profiles/substructural';
|
|
36
|
+
import * as arithmetic from '../profiles/arithmetic';
|
|
37
|
+
export { ctl, ltl, muCalculus, hybrid, descriptionLogic, modalAxioms, sequentG3, sequentLK, intuitNJ, defaultLogic, manyValued, substructural, arithmetic, };
|
|
38
|
+
export { cdcl, cdclAsync } from '../profiles/classical/cdcl';
|
|
39
|
+
export type { CDCLResult } from '../profiles/classical/cdcl';
|
|
40
|
+
export { dpll, dpllAsync } from '../profiles/classical/dpll';
|
|
41
|
+
export { workersAvailable, PARALLEL_THRESHOLD } from '../profiles/classical/parallel-sat';
|
|
42
|
+
//# sourceMappingURL=logic.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"logic.d.ts","sourceRoot":"","sources":["../../src/namespaces/logic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAE,YAAY,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAGhF,OAAO,EAAE,sBAAsB,EAAE,eAAe,EAAE,MAAM,qCAAqC,CAAC;AAC9F,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,oBAAoB,EAAE,MAAM,mCAAmC,CAAC;AACzE,OAAO,EAAE,2BAA2B,EAAE,MAAM,0CAA0C,CAAC;AACvF,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAC/D,OAAO,EAAE,uBAAuB,EAAE,MAAM,sCAAsC,CAAC;AAC/E,OAAO,EAAE,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AAGrE,OAAO,KAAK,GAAG,MAAM,iBAAiB,CAAC;AACvC,OAAO,KAAK,GAAG,MAAM,qBAAqB,CAAC;AAC3C,OAAO,KAAK,UAAU,MAAM,yBAAyB,CAAC;AACtD,OAAO,KAAK,MAAM,MAAM,0BAA0B,CAAC;AACnD,OAAO,KAAK,gBAAgB,MAAM,+BAA+B,CAAC;AAClE,OAAO,KAAK,WAAW,MAAM,gCAAgC,CAAC;AAC9D,OAAO,KAAK,SAAS,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,SAAS,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,QAAQ,MAAM,+BAA+B,CAAC;AAC1D,OAAO,KAAK,YAAY,MAAM,2BAA2B,CAAC;AAC1D,OAAO,KAAK,UAAU,MAAM,yBAAyB,CAAC;AACtD,OAAO,KAAK,aAAa,MAAM,2BAA2B,CAAC;AAC3D,OAAO,KAAK,UAAU,MAAM,wBAAwB,CAAC;AAErD,OAAO,EACL,GAAG,EACH,GAAG,EACH,UAAU,EACV,MAAM,EACN,gBAAgB,EAChB,WAAW,EACX,SAAS,EACT,SAAS,EACT,QAAQ,EACR,YAAY,EACZ,UAAU,EACV,aAAa,EACb,UAAU,GACX,CAAC;AAGF,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAC7D,YAAY,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,oCAAoC,CAAC"}
|