@stevenvo780/st-lang 4.14.1 → 4.15.1

package/dist/logic/profiles/dl-hybrid/parser.js

@@ -0,0 +1,410 @@
+"use strict";
+// ============================================================
+// ST dL-Hybrid — Parser de sintaxis textual dL
+// ============================================================
+// Sintaxis aceptada (subset KeYmaera-like):
+//
+//   formula  ::= impliesFormula
+//   impliesFormula ::= orFormula ('->' impliesFormula)?
+//                   |  orFormula '<->' orFormula
+//   orFormula  ::= andFormula ('|' andFormula)*
+//   andFormula ::= notFormula ('&' notFormula)*
+//   notFormula ::= '!' notFormula | atomFormula
+//   atomFormula::= 'true' | 'false'
+//                | '[' program ']' formula
+//                | '<' program '>' formula
+//                | '(' formula ')'
+//                | comparison
+//   comparison ::= term op term       where op ∈ {=, !=, <, <=, >, >=}
+//
+//   program  ::= seqProgram
+//   seqProgram ::= choiceProgram (';' seqProgram)?
+//   choiceProgram::= unaryProgram ('++' unaryProgram)*    (++ = ∪)
+//   unaryProgram ::= atomProgram '*' ?
+//   atomProgram::= var ':=' term
+//                | var ':=' '*'
+//                | '?' '(' formula ')' | '?' formula
+//                | '{' odeEquations ('&' formula)? '}'
+//                | '(' program ')'
+//
+//   term     ::= addTerm
+//   addTerm  ::= mulTerm (('+' | '-') mulTerm)*
+//   mulTerm  ::= powTerm (('*' | '/') powTerm)*
+//   powTerm  ::= unaryTerm ('^' integer)?
+//   unaryTerm::= '-' unaryTerm | number | ident | '(' term ')'
+//
+// Comentarios `//...\n` se ignoran.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.parseFormula = parseFormula;
+exports.parseProgram = parseProgram;
+exports.parseTerm = parseTerm;
+class Tokenizer {
+    pos = 0;
+    src;
+    constructor(src) {
+        this.src = src;
+    }
+    skipWs() {
+        while (this.pos < this.src.length) {
+            const c = this.src[this.pos];
+            if (c === ' ' || c === '\t' || c === '\n' || c === '\r') {
+                this.pos++;
+            }
+            else if (c === '/' && this.src[this.pos + 1] === '/') {
+                while (this.pos < this.src.length && this.src[this.pos] !== '\n')
+                    this.pos++;
+            }
+            else
+                break;
+        }
+    }
+    peek() {
+        this.skipWs();
+        return this.src.slice(this.pos);
+    }
+    eof() {
+        this.skipWs();
+        return this.pos >= this.src.length;
+    }
+    /** Intenta consumir un literal; retorna true si lo consumió. */
+    match(literal) {
+        this.skipWs();
+        if (this.src.startsWith(literal, this.pos)) {
+            this.pos += literal.length;
+            return true;
+        }
+        return false;
+    }
+    /** Consume un literal o lanza error. */
+    expect(literal) {
+        if (!this.match(literal)) {
+            throw new Error(`Esperaba '${literal}' en pos ${this.pos}: '${this.src.slice(this.pos, this.pos + 20)}'`);
+        }
+    }
+    /** Identificador: [a-zA-Z_][a-zA-Z0-9_]* */
+    matchIdent() {
+        this.skipWs();
+        const start = this.pos;
+        const c = this.src[start];
+        if (!c || !/[a-zA-Z_]/.test(c))
+            return null;
+        let end = start + 1;
+        while (end < this.src.length && /[a-zA-Z0-9_]/.test(this.src[end] ?? ''))
+            end++;
+        this.pos = end;
+        return this.src.slice(start, end);
+    }
+    /** Número (puede ser real con punto y signo unario gestionado en el parser). */
+    matchNumber() {
+        this.skipWs();
+        const start = this.pos;
+        let end = start;
+        while (end < this.src.length && /[0-9]/.test(this.src[end] ?? ''))
+            end++;
+        if (end < this.src.length && this.src[end] === '.') {
+            end++;
+            while (end < this.src.length && /[0-9]/.test(this.src[end] ?? ''))
+                end++;
+        }
+        if (end === start)
+            return null;
+        this.pos = end;
+        return parseFloat(this.src.slice(start, end));
+    }
+    /** Mira si el siguiente token (sin consumir) coincide con un literal. */
+    lookahead(literal) {
+        this.skipWs();
+        return this.src.startsWith(literal, this.pos);
+    }
+    /** Mira si el siguiente token (sin consumir) coincide con un identificador exacto. */
+    lookaheadKeyword(kw) {
+        this.skipWs();
+        if (!this.src.startsWith(kw, this.pos))
+            return false;
+        const after = this.src[this.pos + kw.length];
+        return !after || !/[a-zA-Z0-9_]/.test(after);
+    }
+    /** Consume un keyword (identificador exacto). */
+    matchKeyword(kw) {
+        if (this.lookaheadKeyword(kw)) {
+            this.pos += kw.length;
+            return true;
+        }
+        return false;
+    }
+}
+class Parser {
+    tk;
+    constructor(src) {
+        this.tk = new Tokenizer(src);
+    }
+    // --- Programa híbrido ---
+    parseProgram() {
+        return this.parseSeq();
+    }
+    parseSeq() {
+        let left = this.parseChoice();
+        while (this.tk.match(';')) {
+            const right = this.parseChoice();
+            left = { kind: 'seq', left, right };
+        }
+        return left;
+    }
+    parseChoice() {
+        let left = this.parseUnary();
+        // Usamos `++` como ∪ porque `|` colisiona con `or` en fórmulas.
+        while (this.tk.match('++')) {
+            const right = this.parseUnary();
+            left = { kind: 'choice', left, right };
+        }
+        return left;
+    }
+    parseUnary() {
+        const atom = this.parseAtomProgram();
+        if (this.tk.match('*')) {
+            return { kind: 'loop', body: atom };
+        }
+        return atom;
+    }
+    parseAtomProgram() {
+        if (this.tk.match('(')) {
+            const inner = this.parseSeq();
+            this.tk.expect(')');
+            return inner;
+        }
+        if (this.tk.match('{')) {
+            // ODE: x' = e (, y' = e)* (& Q)?
+            const equations = [];
+            do {
+                const v = this.tk.matchIdent();
+                if (!v)
+                    throw new Error('Esperaba variable en ODE');
+                this.tk.expect("'");
+                this.tk.expect('=');
+                const rhs = this.parseTerm();
+                equations.push({ varName: v, rhs });
+            } while (this.tk.match(','));
+            let domain;
+            if (this.tk.match('&')) {
+                domain = this.parseFormula();
+            }
+            this.tk.expect('}');
+            return { kind: 'ode', system: domain ? { equations, domain } : { equations } };
+        }
+        if (this.tk.match('?')) {
+            let cond;
+            if (this.tk.match('(')) {
+                cond = this.parseFormula();
+                this.tk.expect(')');
+            }
+            else {
+                cond = this.parseComparison();
+            }
+            return { kind: 'test', cond };
+        }
+        const id = this.tk.matchIdent();
+        if (!id)
+            throw new Error(`Esperaba programa, encontré '${this.tk.peek().slice(0, 20)}'`);
+        this.tk.expect(':=');
+        if (this.tk.match('*')) {
+            return { kind: 'nondet', varName: id };
+        }
+        const rhs = this.parseTerm();
+        return { kind: 'assign', varName: id, rhs };
+    }
+    // --- Fórmula ---
+    parseFormula() {
+        return this.parseImplies();
+    }
+    parseImplies() {
+        const left = this.parseOr();
+        if (this.tk.match('<->')) {
+            const right = this.parseOr();
+            return { kind: 'iff', left, right };
+        }
+        if (this.tk.match('->')) {
+            const right = this.parseImplies();
+            return { kind: 'implies', left, right };
+        }
+        return left;
+    }
+    parseOr() {
+        let left = this.parseAnd();
+        while (this.tk.match('|')) {
+            const right = this.parseAnd();
+            left = { kind: 'or', left, right };
+        }
+        return left;
+    }
+    parseAnd() {
+        let left = this.parseNot();
+        while (this.tk.match('&')) {
+            const right = this.parseNot();
+            left = { kind: 'and', left, right };
+        }
+        return left;
+    }
+    parseNot() {
+        if (this.tk.match('!')) {
+            const arg = this.parseNot();
+            return { kind: 'not', arg };
+        }
+        return this.parseAtomFormula();
+    }
+    parseAtomFormula() {
+        if (this.tk.matchKeyword('true'))
+            return { kind: 'true' };
+        if (this.tk.matchKeyword('false'))
+            return { kind: 'false' };
+        if (this.tk.match('[')) {
+            const program = this.parseProgram();
+            this.tk.expect(']');
+            const post = this.parseAtomFormula();
+            return { kind: 'box', program, post };
+        }
+        if (this.tk.match('<')) {
+            // Podría ser una comparación `<` si lo que sigue es un término;
+            // ya consumimos `<` aquí. Heurística: una modalidad ⟨α⟩ siempre
+            // contiene en algún punto `:=`, `'`, `?`, `{` o `++` antes del `>`.
+            // Si el remainder hasta el siguiente `>` contiene esos marcadores,
+            // tratamos como modalidad. Si no, retrocedemos a comparison.
+            const rest = this.tk.peek();
+            const closeIdx = rest.indexOf('>');
+            const inside = closeIdx >= 0 ? rest.slice(0, closeIdx) : rest;
+            const isModality = /:=|'|\?|\{|\+\+|\*/.test(inside);
+            if (isModality) {
+                const program = this.parseProgram();
+                this.tk.expect('>');
+                const post = this.parseAtomFormula();
+                return { kind: 'diamond', program, post };
+            }
+            // No es modalidad — pero ya consumimos `<`. Re-parseamos:
+            // armamos un atom de comparación con el lado izquierdo asumido NaN.
+            // Para evitar este caso, exigimos que la modalidad no se intente con
+            // términos puros; en este punto lanzamos error claro.
+            throw new Error(`'<' suelto no parece modalidad ni comparación de la forma 't1 < t2' (use paréntesis)`);
+        }
+        if (this.tk.match('(')) {
+            const inner = this.parseFormula();
+            this.tk.expect(')');
+            return inner;
+        }
+        return this.parseComparison();
+    }
+    parseComparison() {
+        const left = this.parseTerm();
+        const ops = [
+            { tok: '<=', op: '<=' },
+            { tok: '>=', op: '>=' },
+            { tok: '!=', op: '!=' },
+            { tok: '=', op: '=' },
+            { tok: '<', op: '<' },
+            { tok: '>', op: '>' },
+        ];
+        for (const { tok, op } of ops) {
+            if (this.tk.match(tok)) {
+                const right = this.parseTerm();
+                return { kind: 'comp', op, left, right };
+            }
+        }
+        throw new Error(`Esperaba operador de comparación tras término en pos ${this.tk.peek().slice(0, 20)}`);
+    }
+    // --- Términos ---
+    parseTerm() {
+        return this.parseAdd();
+    }
+    parseAdd() {
+        let left = this.parseMul();
+        while (true) {
+            if (this.tk.lookahead('+') && !this.tk.lookahead('++')) {
+                // Consumimos `+` sólo si NO es el inicio de `++` (choice).
+                this.tk.match('+');
+                const right = this.parseMul();
+                left = { kind: 'plus', left, right };
+            }
+            else if (this.tk.lookahead('-') &&
+                !this.tk.lookahead('->')) {
+                // Consumimos `-` sólo si NO es el inicio de `->` (implicación).
+                this.tk.match('-');
+                const right = this.parseMul();
+                left = { kind: 'minus', left, right };
+            }
+            else
+                break;
+        }
+        return left;
+    }
+    parseMul() {
+        let left = this.parsePow();
+        while (true) {
+            if (this.tk.match('*')) {
+                const right = this.parsePow();
+                left = { kind: 'times', left, right };
+            }
+            else if (this.tk.match('/')) {
+                const right = this.parsePow();
+                left = { kind: 'div', left, right };
+            }
+            else
+                break;
+        }
+        return left;
+    }
+    parsePow() {
+        const base = this.parseUnaryTerm();
+        if (this.tk.match('^')) {
+            const n = this.tk.matchNumber();
+            if (n === null || !Number.isInteger(n)) {
+                throw new Error('Exponente debe ser entero literal');
+            }
+            return { kind: 'pow', base, exp: n };
+        }
+        return base;
+    }
+    parseUnaryTerm() {
+        if (this.tk.match('-')) {
+            const arg = this.parseUnaryTerm();
+            return { kind: 'neg', arg };
+        }
+        const n = this.tk.matchNumber();
+        if (n !== null)
+            return { kind: 'num', value: n };
+        if (this.tk.match('(')) {
+            const inner = this.parseTerm();
+            this.tk.expect(')');
+            return inner;
+        }
+        const id = this.tk.matchIdent();
+        if (id)
+            return { kind: 'var', name: id };
+        throw new Error(`Esperaba término en '${this.tk.peek().slice(0, 20)}'`);
+    }
+    endOrThrow() {
+        if (!this.tk.eof()) {
+            throw new Error(`Tokens sobrantes: '${this.tk.peek().slice(0, 30)}'`);
+        }
+    }
+}
+/** Parsea una fórmula dL desde una cadena. Lanza Error en sintaxis inválida. */
+function parseFormula(src) {
+    const p = new Parser(src);
+    const f = p.parseFormula();
+    p.endOrThrow();
+    return f;
+}
+/** Parsea un programa híbrido desde una cadena. */
+function parseProgram(src) {
+    const p = new Parser(src);
+    const prog = p.parseProgram();
+    p.endOrThrow();
+    return prog;
+}
+/** Parsea un término aritmético dL. */
+function parseTerm(src) {
+    const p = new Parser(src);
+    const t = p.parseTerm();
+    p.endOrThrow();
+    return t;
+}
+//# sourceMappingURL=parser.js.map

package/dist/logic/profiles/dl-hybrid/parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.js","sourceRoot":"","sources":["../../../../src/logic/profiles/dl-hybrid/parser.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+CAA+C;AAC/C,+DAA+D;AAC/D,4CAA4C;AAC5C,EAAE;AACF,gCAAgC;AAChC,wDAAwD;AACxD,iDAAiD;AACjD,gDAAgD;AAChD,gDAAgD;AAChD,gDAAgD;AAChD,oCAAoC;AACpC,2CAA2C;AAC3C,2CAA2C;AAC3C,mCAAmC;AACnC,8BAA8B;AAC9B,uEAAuE;AACvE,EAAE;AACF,4BAA4B;AAC5B,mDAAmD;AACnD,mEAAmE;AACnE,uCAAuC;AACvC,iCAAiC;AACjC,gCAAgC;AAChC,qDAAqD;AACrD,uDAAuD;AACvD,mCAAmC;AACnC,EAAE;AACF,yBAAyB;AACzB,gDAAgD;AAChD,gDAAgD;AAChD,0CAA0C;AAC1C,+DAA+D;AAC/D,EAAE;AACF,oCAAoC;AACpC,+DAA+D;;AAgX/D,oCAKC;AAGD,oCAKC;AAGD,8BAKC;AAjYD,MAAM,SAAS;IACL,GAAG,GAAG,CAAC,CAAC;IACC,GAAG,CAAS;IAE7B,YAAY,GAAW;QACrB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;IAEO,MAAM;QACZ,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACxD,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,CAAC;iBAAM,IAAI,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;gBACvD,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI;oBAAE,IAAI,CAAC,GAAG,EAAE,CAAC;YAC/E,CAAC;;gBAAM,MAAM;QACf,CAAC;IACH,CAAC;IAED,IAAI;QACF,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,GAAG;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;IACrC,CAAC;IAED,gEAAgE;IAChE,KAAK,CAAC,OAAe;QACnB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3C,IAAI,CAAC,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC;YAC3B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,wCAAwC;IACxC,MAAM,CAAC,OAAe;QACpB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,aAAa,OAAO,YAAY,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC5G,CAAC;IACH,CAAC;IAED,4CAA4C;IAC5C,UAAU;QACR,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC;QACvB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5C,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;QACpB,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YAAE,GAAG,EAAE,CAAC;QAChF,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACpC,CAAC;IAED,gFAAgF;IAChF,WAAW;QACT,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC;QACvB,IAAI,GAAG,GAAG,KAAK,CAAC;QAChB,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YAAE,GAAG,EAAE,CAAC;QACzE,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YACnD,GAAG,EAAE,CAAC;YACN,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBAAE,GAAG,EAAE,CAAC;QAC3E,CAAC;QACD,IAAI,GAAG,KAAK,KAAK;YAAE,OAAO,IAAI,CAAC;QAC/B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,yEAAyE;IACzE,SAAS,CAAC,OAAe;QACvB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC;IAED,sFAAsF;IACtF,gBAAgB,CAAC,EAAU;QACzB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;QAC7C,OAAO,CAAC,KAAK,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,iDAAiD;IACjD,YAAY,CAAC,EAAU;QACrB,IAAI,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,MAAM,CAAC;YACtB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED,MAAM,MAAM;IACF,EAAE,CAAY;IAEtB,YAAY,GAAW;QACrB,IAAI,CAAC,EAAE,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,2BAA2B;IAE3B,YAAY;QACV,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IACzB,CAAC;IAEO,QAAQ;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACjC,IAAI,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACtC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,WAAW;QACjB,IAAI,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC7B,gEAAgE;QAChE,OAAO,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAChC,IAAI,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACzC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,UAAU;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACtC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,gBAAgB;QACtB,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,iCAAiC;YACjC,MAAM,SAAS,GAA2B,EAAE,CAAC;YAC7C,GAAG,CAAC;gBACF,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,UAAU,EAAE,CAAC;gBAC/B,IAAI,CAAC,CAAC;oBAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;gBACpD,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpB,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC7B,SAAS,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACtC,CAAC,QAAQ,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;YAC7B,IAAI,MAA6B,CAAC;YAClC,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YAC/B,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;QACjF,CAAC;QACD,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,IAAe,CAAC;YACpB,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvB,IAAI,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;gBAC3B,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACN,IAAI,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YAChC,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QAChC,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,UAAU,EAAE,CAAC;QAChC,IAAI,CAAC,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACzF,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QACzC,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC7B,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;IAC9C,CAAC;IAED,kBAAkB;IAElB,YAAY;QACV,OAAO,IAAI,CAAC,YAAY,EAAE,CAAC;IAC7B,CAAC;IAEO,YAAY;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACtC,CAAC;QACD,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YAClC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QAC1C,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,OAAO;QACb,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAI,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,QAAQ;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAI,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACtC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,QAAQ;QACd,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;QAC9B,CAAC;QACD,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC;IACjC,CAAC;IAEO,gBAAgB;QACtB,IAAI,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAC5D,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACrC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QACxC,CAAC;QACD,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,gEAAgE;YAChE,gEAAgE;YAChE,oEAAoE;YACpE,mEAAmE;YACnE,6DAA6D;YAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACnC,MAAM,MAAM,GAAG,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC9D,MAAM,UAAU,GAAG,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,UAAU,EAAE,CAAC;gBACf,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;gBACpC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpB,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACrC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;YAC5C,CAAC;YACD,0DAA0D;YAC1D,oEAAoE;YACpE,qEAAqE;YACrE,sDAAsD;YACtD,MAAM,IAAI,KAAK,CACb,sFAAsF,CACvF,CAAC;QACJ,CAAC;QACD,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YAClC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC;IAChC,CAAC;IAEO,eAAe;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAuC;YAC9C,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE;YACvB,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE;YACvB,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE;YACvB,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE;YACrB,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE;YACrB,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE;SACtB,CAAC;QACF,KAAK,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC/B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,wDAAwD,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IACzG,CAAC;IAED,mBAAmB;IAEnB,SAAS;QACP,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IACzB,CAAC;IAEO,QAAQ;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC3B,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvD,2DAA2D;gBAC3D,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACnB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC9B,IAAI,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;YACvC,CAAC;iBAAM,IACL,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC;gBACtB,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,EACxB,CAAC;gBACD,gEAAgE;gBAChE,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACnB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC9B,IAAI,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;YACxC,CAAC;;gBAAM,MAAM;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,QAAQ;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC3B,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC9B,IAAI,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;YACxC,CAAC;iBAAM,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC9B,IAAI,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;YACtC,CAAC;;gBAAM,MAAM;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,QAAQ;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;YAChC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvC,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;YACvD,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;QACvC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,cAAc;QACpB,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YAClC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;QAC9B,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACpB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,UAAU,EAAE,CAAC;QAChC,IAAI,EAAE;YAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,wBAAwB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;IAC1E,CAAC;IAED,UAAU;QACR,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;CACF;AAED,gFAAgF;AAChF,SAAgB,YAAY,CAAC,GAAW;IACtC,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC;IAC3B,CAAC,CAAC,UAAU,EAAE,CAAC;IACf,OAAO,CAAC,CAAC;AACX,CAAC;AAED,mDAAmD;AACnD,SAAgB,YAAY,CAAC,GAAW;IACtC,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,MAAM,IAAI,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC;IAC9B,CAAC,CAAC,UAAU,EAAE,CAAC;IACf,OAAO,IAAI,CAAC;AACd,CAAC;AAED,uCAAuC;AACvC,SAAgB,SAAS,CAAC,GAAW;IACnC,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;IACxB,CAAC,CAAC,UAAU,EAAE,CAAC;IACf,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/logic/profiles/dl-hybrid/profile.d.ts

@@ -0,0 +1,23 @@
+import type { LogicProfile, Formula, RunResult, Theory, Diagnostic } from '../../../types';
+import type { DLFormula } from './ast';
+export declare class DLHybridProfile implements LogicProfile {
+    name: string;
+    description: string;
+    checkWellFormed(_formula: Formula): Diagnostic[];
+    checkValid(formula: Formula): RunResult;
+    checkSatisfiable(formula: Formula): RunResult;
+    prove(goal: Formula, _theory: Theory, _premises?: string[]): RunResult;
+    derive(goal: Formula, _premises: string[], _theory: Theory): RunResult;
+    countermodel(formula: Formula): RunResult;
+    explain(formula: Formula): RunResult;
+    private notApplicable;
+    explainSystem(): string;
+}
+/**
+ * Adaptador: ejecuta `checkValid` sobre una DLFormula nativa y devuelve
+ * un `RunResult` ST-compatible (con witness en `output`).
+ */
+export declare function runValidity(formula: DLFormula): RunResult;
+/** Versión satisfacibilidad. */
+export declare function runSatisfiability(formula: DLFormula): RunResult;
+//# sourceMappingURL=profile.d.ts.map

package/dist/logic/profiles/dl-hybrid/profile.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"profile.d.ts","sourceRoot":"","sources":["../../../../src/logic/profiles/dl-hybrid/profile.ts"],"names":[],"mappings":"AAWA,OAAO,KAAK,EACV,YAAY,EACZ,OAAO,EACP,SAAS,EACT,MAAM,EACN,UAAU,EACX,MAAM,gBAAgB,CAAC;AAExB,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAevC,qBAAa,eAAgB,YAAW,YAAY;IAClD,IAAI,SAAe;IACnB,WAAW,SACsJ;IAEjK,eAAe,CAAC,QAAQ,EAAE,OAAO,GAAG,UAAU,EAAE;IAIhD,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAGvC,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAG7C,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS;IAGtE,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,SAAS;IAGtE,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAGzC,OAAO,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IASpC,OAAO,CAAC,aAAa;IAUrB,aAAa,IAAI,MAAM;CAsBxB;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,SAAS,GAAG,SAAS,CAUzD;AAED,gCAAgC;AAChC,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,SAAS,GAAG,SAAS,CAU/D"}

package/dist/logic/profiles/dl-hybrid/profile.js

@@ -0,0 +1,122 @@
+"use strict";
+// ============================================================
+// ST dL-Hybrid — Profile descriptor para registro en ST
+// ============================================================
+// Adaptador entre el AST nativo de dL (DLFormula) y la `LogicProfile`
+// del runtime ST (basada en `Formula` clásica). Por defecto, este perfil
+// se usa programáticamente con el AST nativo (parseFormula + checkValid);
+// el adaptador `LogicProfile` lo expone por el registry global pero
+// degrada graciosamente para fórmulas no-dL (no usa la forma estándar
+// de tableau modal, sino el motor dedicado de dl-hybrid).
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DLHybridProfile = void 0;
+exports.runValidity = runValidity;
+exports.runSatisfiability = runSatisfiability;
+const tableau_1 = require("./tableau");
+const ast_1 = require("./ast");
+/**
+ * Indicador para que ST sepa que este perfil usa AST nativo paralelo.
+ * Si el caller pasa una `Formula` clásica, devolvemos `unknown` con un
+ * mensaje informativo. El uso recomendado es vía las funciones exportadas
+ * en el index del perfil.
+ */
+const UNSUPPORTED_FORMULA = {
+    severity: 'info',
+    message: 'dl-hybrid usa un AST nativo (DLFormula). Para usar este perfil, parsea con `parseFormula(src)` y usa `checkValid` directamente.',
+};
+class DLHybridProfile {
+    name = 'dl-hybrid';
+    description = 'Differential Dynamic Logic (Platzer) — verificación de sistemas híbridos (estados continuos + discretos) con ODEs polinomiales lineales en subset decidible.';
+    checkWellFormed(_formula) {
+        return [UNSUPPORTED_FORMULA];
+    }
+    checkValid(formula) {
+        return this.notApplicable(formula);
+    }
+    checkSatisfiable(formula) {
+        return this.notApplicable(formula);
+    }
+    prove(goal, _theory, _premises) {
+        return this.notApplicable(goal);
+    }
+    derive(goal, _premises, _theory) {
+        return this.notApplicable(goal);
+    }
+    countermodel(formula) {
+        return this.notApplicable(formula);
+    }
+    explain(formula) {
+        return {
+            status: 'unknown',
+            output: this.explainSystem(),
+            diagnostics: [UNSUPPORTED_FORMULA],
+            formula,
+        };
+    }
+    notApplicable(formula) {
+        return {
+            status: 'unknown',
+            output: 'dl-hybrid no acepta `Formula` clásica directamente. Use el API nativo: `parseFormula`, `checkValid`, etc.',
+            diagnostics: [UNSUPPORTED_FORMULA],
+            formula,
+        };
+    }
+    explainSystem() {
+        return [
+            'Sistema: dL (Differential Dynamic Logic, Platzer 2008/2010)',
+            '  Programas híbridos:',
+            '    x := e          asignación discreta',
+            '    x := *          asignación no determinista',
+            '    ?ψ              test',
+            '    α ; β           secuencia',
+            '    α ++ β          choice no determinista (∪)',
+            '    α*              loop (acotado en la implementación)',
+            "    {x' = f(x) & Q} evolución continua bajo dominio Q",
+            '  Modalidades:',
+            '    [α] φ           todo trace de α termina en φ',
+            '    ⟨α⟩ φ           existe un trace de α que termina en φ',
+            '  Subset decidible implementado:',
+            "    - ODE x' = c (constante) → x(t) = x₀ + c·t",
+            "    - ODE x' = a·x + b lineal desacoplada → cerrada exponencial",
+            '    - Loops acotados a N iteraciones',
+            '    - Derivada de Lie disponible para invariantes diferenciales',
+            '  Aplicaciones: control, robótica, sistemas embebidos.',
+        ].join('\n');
+    }
+}
+exports.DLHybridProfile = DLHybridProfile;
+/**
+ * Adaptador: ejecuta `checkValid` sobre una DLFormula nativa y devuelve
+ * un `RunResult` ST-compatible (con witness en `output`).
+ */
+function runValidity(formula) {
+    const res = (0, tableau_1.checkValid)(formula);
+    return {
+        status: res.status === 'valid' ? 'valid' : 'invalid',
+        output: res.status === 'valid'
+            ? `${(0, ast_1.formulaToString)(formula)} es VÁLIDA en dl-hybrid (${res.statesChecked} estados muestreados)`
+            : `${(0, ast_1.formulaToString)(formula)} NO es válida (contramodelo en estado ${describeState(res.witness)})`,
+        diagnostics: [],
+    };
+}
+/** Versión satisfacibilidad. */
+function runSatisfiability(formula) {
+    const res = (0, tableau_1.checkSatisfiable)(formula);
+    return {
+        status: res.status === 'satisfiable' ? 'satisfiable' : 'unsatisfiable',
+        output: res.status === 'satisfiable'
+            ? `${(0, ast_1.formulaToString)(formula)} es SATISFACIBLE (${res.statesChecked} estados muestreados, testigo: ${describeState(res.witness)})`
+            : `${(0, ast_1.formulaToString)(formula)} es INSATISFACIBLE en la malla muestreada (${res.statesChecked} estados)`,
+        diagnostics: [],
+    };
+}
+function describeState(s) {
+    if (!s)
+        return '∅';
+    const pairs = [];
+    for (const [k, v] of s.entries())
+        pairs.push(`${k}=${v}`);
+    return `{${pairs.join(', ')}}`;
+}
+//# sourceMappingURL=profile.js.map

package/dist/logic/profiles/dl-hybrid/profile.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"profile.js","sourceRoot":"","sources":["../../../../src/logic/profiles/dl-hybrid/profile.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wDAAwD;AACxD,+DAA+D;AAC/D,sEAAsE;AACtE,yEAAyE;AACzE,0EAA0E;AAC1E,oEAAoE;AACpE,sEAAsE;AACtE,0DAA0D;AAC1D,+DAA+D;;;AAgG/D,kCAUC;AAGD,8CAUC;AA9GD,uCAAuF;AAEvF,+BAAwC;AAExC;;;;;GAKG;AACH,MAAM,mBAAmB,GAAe;IACtC,QAAQ,EAAE,MAAM;IAChB,OAAO,EACL,iIAAiI;CACpI,CAAC;AAEF,MAAa,eAAe;IAC1B,IAAI,GAAG,WAAW,CAAC;IACnB,WAAW,GACT,8JAA8J,CAAC;IAEjK,eAAe,CAAC,QAAiB;QAC/B,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAC/B,CAAC;IAED,UAAU,CAAC,OAAgB;QACzB,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;IACD,gBAAgB,CAAC,OAAgB;QAC/B,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;IACD,KAAK,CAAC,IAAa,EAAE,OAAe,EAAE,SAAoB;QACxD,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,MAAM,CAAC,IAAa,EAAE,SAAmB,EAAE,OAAe;QACxD,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,YAAY,CAAC,OAAgB;QAC3B,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,CAAC,OAAgB;QACtB,OAAO;YACL,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,IAAI,CAAC,aAAa,EAAE;YAC5B,WAAW,EAAE,CAAC,mBAAmB,CAAC;YAClC,OAAO;SACR,CAAC;IACJ,CAAC;IAEO,aAAa,CAAC,OAAgB;QACpC,OAAO;YACL,MAAM,EAAE,SAAS;YACjB,MAAM,EACJ,2GAA2G;YAC7G,WAAW,EAAE,CAAC,mBAAmB,CAAC;YAClC,OAAO;SACR,CAAC;IACJ,CAAC;IAED,aAAa;QACX,OAAO;YACL,6DAA6D;YAC7D,uBAAuB;YACvB,yCAAyC;YACzC,gDAAgD;YAChD,0BAA0B;YAC1B,+BAA+B;YAC/B,gDAAgD;YAChD,yDAAyD;YACzD,uDAAuD;YACvD,gBAAgB;YAChB,kDAAkD;YAClD,2DAA2D;YAC3D,kCAAkC;YAClC,gDAAgD;YAChD,iEAAiE;YACjE,sCAAsC;YACtC,iEAAiE;YACjE,wDAAwD;SACzD,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;CACF;AAjED,0CAiEC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAAC,OAAkB;IAC5C,MAAM,GAAG,GAAG,IAAA,oBAAY,EAAC,OAAO,CAAC,CAAC;IAClC,OAAO;QACL,MAAM,EAAE,GAAG,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;QACpD,MAAM,EACJ,GAAG,CAAC,MAAM,KAAK,OAAO;YACpB,CAAC,CAAC,GAAG,IAAA,qBAAe,EAAC,OAAO,CAAC,4BAA4B,GAAG,CAAC,aAAa,uBAAuB;YACjG,CAAC,CAAC,GAAG,IAAA,qBAAe,EAAC,OAAO,CAAC,yCAAyC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG;QACvG,WAAW,EAAE,EAAE;KAChB,CAAC;AACJ,CAAC;AAED,gCAAgC;AAChC,SAAgB,iBAAiB,CAAC,OAAkB;IAClD,MAAM,GAAG,GAAG,IAAA,0BAAU,EAAC,OAAO,CAAC,CAAC;IAChC,OAAO;QACL,MAAM,EAAE,GAAG,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,eAAe;QACtE,MAAM,EACJ,GAAG,CAAC,MAAM,KAAK,aAAa;YAC1B,CAAC,CAAC,GAAG,IAAA,qBAAe,EAAC,OAAO,CAAC,qBAAqB,GAAG,CAAC,aAAa,kCAAkC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG;YAClI,CAAC,CAAC,GAAG,IAAA,qBAAe,EAAC,OAAO,CAAC,8CAA8C,GAAG,CAAC,aAAa,WAAW;QAC3G,WAAW,EAAE,EAAE;KAChB,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,CAAgE;IACrF,IAAI,CAAC,CAAC;QAAE,OAAO,GAAG,CAAC;IACnB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1D,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;AACjC,CAAC"}

package/dist/logic/profiles/dl-hybrid/semantics.d.ts

@@ -0,0 +1,16 @@
+import type { DLTerm, DLFormula, State, CompOp } from './ast';
+/** Evalúa un término sobre un estado concreto. */
+export declare function evalTerm(t: DLTerm, s: State): number;
+/** Evalúa una comparación con tolerancia. */
+export declare function evalComp(op: CompOp, a: number, b: number): boolean;
+/**
+ * Evalúa una fórmula proposicional / aritmética (sin modalidades) sobre
+ * un estado concreto. Para fórmulas con [α]/⟨α⟩ se requiere el motor de
+ * tableau (`tableau.ts`).
+ */
+export declare function evalQuantifierFree(f: DLFormula, s: State): boolean;
+/** Substitución de un término por otro dentro de un término. */
+export declare function substTerm(t: DLTerm, varName: string, replacement: DLTerm): DLTerm;
+/** Substitución dentro de una fórmula (sólo a través de comparaciones). */
+export declare function substFormula(f: DLFormula, varName: string, replacement: DLTerm): DLFormula;
+//# sourceMappingURL=semantics.d.ts.map

package/dist/logic/profiles/dl-hybrid/semantics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantics.d.ts","sourceRoot":"","sources":["../../../../src/logic/profiles/dl-hybrid/semantics.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,OAAO,CAAC;AAI9D,kDAAkD;AAClD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAwBpD;AAED,6CAA6C;AAC7C,wBAAgB,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAgBlE;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,GAAG,OAAO,CAsBlE;AAED,gEAAgE;AAChE,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAmCjF;AAED,2EAA2E;AAC3E,wBAAgB,YAAY,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,SAAS,CA6C1F"}