@stevenvo780/st-lang 4.3.0 → 4.4.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.d.ts +4 -0
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +36 -2
- package/dist/index.js.map +1 -1
- package/dist/lambda-calc/church.d.ts.map +1 -1
- package/dist/lambda-calc/church.js.map +1 -1
- package/dist/lambda-calc/combinators.d.ts.map +1 -1
- package/dist/lambda-calc/combinators.js.map +1 -1
- package/dist/lambda-calc/index.d.ts +1 -1
- package/dist/lambda-calc/index.d.ts.map +1 -1
- package/dist/lambda-calc/index.js.map +1 -1
- package/dist/mltt/equality.d.ts +9 -0
- package/dist/mltt/equality.d.ts.map +1 -0
- package/dist/mltt/equality.js +79 -0
- package/dist/mltt/equality.js.map +1 -0
- package/dist/mltt/index.d.ts +8 -0
- package/dist/mltt/index.d.ts.map +1 -0
- package/dist/mltt/index.js +49 -0
- package/dist/mltt/index.js.map +1 -0
- package/dist/mltt/infer.d.ts +17 -0
- package/dist/mltt/infer.d.ts.map +1 -0
- package/dist/mltt/infer.js +269 -0
- package/dist/mltt/infer.js.map +1 -0
- package/dist/mltt/normalize.d.ts +7 -0
- package/dist/mltt/normalize.d.ts.map +1 -0
- package/dist/mltt/normalize.js +131 -0
- package/dist/mltt/normalize.js.map +1 -0
- package/dist/mltt/substitute.d.ts +4 -0
- package/dist/mltt/substitute.d.ts.map +1 -0
- package/dist/mltt/substitute.js +94 -0
- package/dist/mltt/substitute.js.map +1 -0
- package/dist/mltt/types.d.ts +72 -0
- package/dist/mltt/types.d.ts.map +1 -0
- package/dist/mltt/types.js +211 -0
- package/dist/mltt/types.js.map +1 -0
- package/dist/profiles/many-valued/index.d.ts.map +1 -1
- package/dist/profiles/many-valued/index.js.map +1 -1
- package/dist/profiles/mu-calculus/check.d.ts +15 -0
- package/dist/profiles/mu-calculus/check.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/check.js +172 -0
- package/dist/profiles/mu-calculus/check.js.map +1 -0
- package/dist/profiles/mu-calculus/ctl-translate.d.ts +61 -0
- package/dist/profiles/mu-calculus/ctl-translate.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/ctl-translate.js +181 -0
- package/dist/profiles/mu-calculus/ctl-translate.js.map +1 -0
- package/dist/profiles/mu-calculus/index.d.ts +7 -0
- package/dist/profiles/mu-calculus/index.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/index.js +33 -0
- package/dist/profiles/mu-calculus/index.js.map +1 -0
- package/dist/profiles/mu-calculus/types.d.ts +51 -0
- package/dist/profiles/mu-calculus/types.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/types.js +42 -0
- package/dist/profiles/mu-calculus/types.js.map +1 -0
- package/dist/profiles/mu-calculus/wellformed.d.ts +40 -0
- package/dist/profiles/mu-calculus/wellformed.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/wellformed.js +160 -0
- package/dist/profiles/mu-calculus/wellformed.js.map +1 -0
- package/dist/profiles/sequent-lk/cut-elimination.d.ts +11 -0
- package/dist/profiles/sequent-lk/cut-elimination.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/cut-elimination.js +216 -0
- package/dist/profiles/sequent-lk/cut-elimination.js.map +1 -0
- package/dist/profiles/sequent-lk/index.d.ts +5 -0
- package/dist/profiles/sequent-lk/index.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/index.js +24 -0
- package/dist/profiles/sequent-lk/index.js.map +1 -0
- package/dist/profiles/sequent-lk/prover.d.ts +25 -0
- package/dist/profiles/sequent-lk/prover.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/prover.js +532 -0
- package/dist/profiles/sequent-lk/prover.js.map +1 -0
- package/dist/profiles/sequent-lk/types.d.ts +55 -0
- package/dist/profiles/sequent-lk/types.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/types.js +18 -0
- package/dist/profiles/sequent-lk/types.js.map +1 -0
- package/dist/profiles/sequent-lk/util.d.ts +18 -0
- package/dist/profiles/sequent-lk/util.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/util.js +71 -0
- package/dist/profiles/sequent-lk/util.js.map +1 -0
- package/dist/refinement-types/checker.d.ts +19 -0
- package/dist/refinement-types/checker.d.ts.map +1 -0
- package/dist/refinement-types/checker.js +248 -0
- package/dist/refinement-types/checker.js.map +1 -0
- package/dist/refinement-types/index.d.ts +11 -0
- package/dist/refinement-types/index.d.ts.map +1 -0
- package/dist/refinement-types/index.js +51 -0
- package/dist/refinement-types/index.js.map +1 -0
- package/dist/refinement-types/predicate.d.ts +31 -0
- package/dist/refinement-types/predicate.d.ts.map +1 -0
- package/dist/refinement-types/predicate.js +369 -0
- package/dist/refinement-types/predicate.js.map +1 -0
- package/dist/refinement-types/solver.d.ts +24 -0
- package/dist/refinement-types/solver.d.ts.map +1 -0
- package/dist/refinement-types/solver.js +207 -0
- package/dist/refinement-types/solver.js.map +1 -0
- package/dist/refinement-types/subtype.d.ts +14 -0
- package/dist/refinement-types/subtype.d.ts.map +1 -0
- package/dist/refinement-types/subtype.js +39 -0
- package/dist/refinement-types/subtype.js.map +1 -0
- package/dist/refinement-types/types.d.ts +64 -0
- package/dist/refinement-types/types.d.ts.map +1 -0
- package/dist/refinement-types/types.js +130 -0
- package/dist/refinement-types/types.js.map +1 -0
- package/dist/runtime/anti-unification/anti-unify.d.ts +22 -0
- package/dist/runtime/anti-unification/anti-unify.d.ts.map +1 -0
- package/dist/runtime/anti-unification/anti-unify.js +154 -0
- package/dist/runtime/anti-unification/anti-unify.js.map +1 -0
- package/dist/runtime/anti-unification/index.d.ts +6 -0
- package/dist/runtime/anti-unification/index.d.ts.map +1 -0
- package/dist/runtime/anti-unification/index.js +23 -0
- package/dist/runtime/anti-unification/index.js.map +1 -0
- package/dist/runtime/anti-unification/many.d.ts +49 -0
- package/dist/runtime/anti-unification/many.d.ts.map +1 -0
- package/dist/runtime/anti-unification/many.js +185 -0
- package/dist/runtime/anti-unification/many.js.map +1 -0
- package/dist/runtime/anti-unification/term-utils.d.ts +40 -0
- package/dist/runtime/anti-unification/term-utils.d.ts.map +1 -0
- package/dist/runtime/anti-unification/term-utils.js +173 -0
- package/dist/runtime/anti-unification/term-utils.js.map +1 -0
- package/dist/runtime/anti-unification/types.d.ts +41 -0
- package/dist/runtime/anti-unification/types.d.ts.map +1 -0
- package/dist/runtime/anti-unification/types.js +26 -0
- package/dist/runtime/anti-unification/types.js.map +1 -0
- package/dist/runtime/csp/ac3.d.ts +20 -0
- package/dist/runtime/csp/ac3.d.ts.map +1 -0
- package/dist/runtime/csp/ac3.js +165 -0
- package/dist/runtime/csp/ac3.js.map +1 -0
- package/dist/runtime/csp/backtrack.d.ts +15 -0
- package/dist/runtime/csp/backtrack.d.ts.map +1 -0
- package/dist/runtime/csp/backtrack.js +233 -0
- package/dist/runtime/csp/backtrack.js.map +1 -0
- package/dist/runtime/csp/builtins.d.ts +27 -0
- package/dist/runtime/csp/builtins.d.ts.map +1 -0
- package/dist/runtime/csp/builtins.js +109 -0
- package/dist/runtime/csp/builtins.js.map +1 -0
- package/dist/runtime/csp/index.d.ts +5 -0
- package/dist/runtime/csp/index.d.ts.map +1 -0
- package/dist/runtime/csp/index.js +23 -0
- package/dist/runtime/csp/index.js.map +1 -0
- package/dist/runtime/csp/types.d.ts +54 -0
- package/dist/runtime/csp/types.d.ts.map +1 -0
- package/dist/runtime/csp/types.js +14 -0
- package/dist/runtime/csp/types.js.map +1 -0
- package/dist/runtime/markov-logic/grounding.d.ts +19 -0
- package/dist/runtime/markov-logic/grounding.d.ts.map +1 -0
- package/dist/runtime/markov-logic/grounding.js +252 -0
- package/dist/runtime/markov-logic/grounding.js.map +1 -0
- package/dist/runtime/markov-logic/index.d.ts +6 -0
- package/dist/runtime/markov-logic/index.d.ts.map +1 -0
- package/dist/runtime/markov-logic/index.js +47 -0
- package/dist/runtime/markov-logic/index.js.map +1 -0
- package/dist/runtime/markov-logic/inference.d.ts +77 -0
- package/dist/runtime/markov-logic/inference.d.ts.map +1 -0
- package/dist/runtime/markov-logic/inference.js +382 -0
- package/dist/runtime/markov-logic/inference.js.map +1 -0
- package/dist/runtime/markov-logic/parser.d.ts +25 -0
- package/dist/runtime/markov-logic/parser.d.ts.map +1 -0
- package/dist/runtime/markov-logic/parser.js +264 -0
- package/dist/runtime/markov-logic/parser.js.map +1 -0
- package/dist/runtime/markov-logic/types.d.ts +64 -0
- package/dist/runtime/markov-logic/types.d.ts.map +1 -0
- package/dist/runtime/markov-logic/types.js +17 -0
- package/dist/runtime/markov-logic/types.js.map +1 -0
- package/dist/runtime/pi-calculus/congruence.d.ts +15 -0
- package/dist/runtime/pi-calculus/congruence.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/congruence.js +271 -0
- package/dist/runtime/pi-calculus/congruence.js.map +1 -0
- package/dist/runtime/pi-calculus/index.d.ts +6 -0
- package/dist/runtime/pi-calculus/index.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/index.js +30 -0
- package/dist/runtime/pi-calculus/index.js.map +1 -0
- package/dist/runtime/pi-calculus/names.d.ts +28 -0
- package/dist/runtime/pi-calculus/names.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/names.js +182 -0
- package/dist/runtime/pi-calculus/names.js.map +1 -0
- package/dist/runtime/pi-calculus/reduction.d.ts +25 -0
- package/dist/runtime/pi-calculus/reduction.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/reduction.js +338 -0
- package/dist/runtime/pi-calculus/reduction.js.map +1 -0
- package/dist/runtime/pi-calculus/substitution.d.ts +11 -0
- package/dist/runtime/pi-calculus/substitution.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/substitution.js +109 -0
- package/dist/runtime/pi-calculus/substitution.js.map +1 -0
- package/dist/runtime/pi-calculus/types.d.ts +38 -0
- package/dist/runtime/pi-calculus/types.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/types.js +22 -0
- package/dist/runtime/pi-calculus/types.js.map +1 -0
- package/dist/runtime/planning/astar.d.ts +10 -0
- package/dist/runtime/planning/astar.d.ts.map +1 -0
- package/dist/runtime/planning/astar.js +155 -0
- package/dist/runtime/planning/astar.js.map +1 -0
- package/dist/runtime/planning/bfs.d.ts +17 -0
- package/dist/runtime/planning/bfs.d.ts.map +1 -0
- package/dist/runtime/planning/bfs.js +87 -0
- package/dist/runtime/planning/bfs.js.map +1 -0
- package/dist/runtime/planning/ground.d.ts +55 -0
- package/dist/runtime/planning/ground.d.ts.map +1 -0
- package/dist/runtime/planning/ground.js +154 -0
- package/dist/runtime/planning/ground.js.map +1 -0
- package/dist/runtime/planning/heuristic.d.ts +29 -0
- package/dist/runtime/planning/heuristic.d.ts.map +1 -0
- package/dist/runtime/planning/heuristic.js +172 -0
- package/dist/runtime/planning/heuristic.js.map +1 -0
- package/dist/runtime/planning/index.d.ts +6 -0
- package/dist/runtime/planning/index.d.ts.map +1 -0
- package/dist/runtime/planning/index.js +38 -0
- package/dist/runtime/planning/index.js.map +1 -0
- package/dist/runtime/planning/types.d.ts +100 -0
- package/dist/runtime/planning/types.d.ts.map +1 -0
- package/dist/runtime/planning/types.js +22 -0
- package/dist/runtime/planning/types.js.map +1 -0
- package/dist/runtime/symbolic-diff/differentiate.d.ts.map +1 -1
- package/dist/runtime/symbolic-diff/differentiate.js.map +1 -1
- package/dist/runtime/symbolic-diff/index.d.ts +1 -1
- package/dist/runtime/symbolic-diff/index.d.ts.map +1 -1
- package/dist/runtime/symbolic-diff/index.js.map +1 -1
- package/dist/runtime/symbolic-diff/parse.d.ts.map +1 -1
- package/dist/runtime/symbolic-diff/parse.js +7 -1
- package/dist/runtime/symbolic-diff/parse.js.map +1 -1
- package/dist/runtime/theorem-cache/cache.d.ts +100 -0
- package/dist/runtime/theorem-cache/cache.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/cache.js +213 -0
- package/dist/runtime/theorem-cache/cache.js.map +1 -0
- package/dist/runtime/theorem-cache/canonical.d.ts +59 -0
- package/dist/runtime/theorem-cache/canonical.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/canonical.js +105 -0
- package/dist/runtime/theorem-cache/canonical.js.map +1 -0
- package/dist/runtime/theorem-cache/index.d.ts +6 -0
- package/dist/runtime/theorem-cache/index.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/index.js +16 -0
- package/dist/runtime/theorem-cache/index.js.map +1 -0
- package/dist/runtime/theorem-cache/pattern.d.ts +24 -0
- package/dist/runtime/theorem-cache/pattern.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/pattern.js +80 -0
- package/dist/runtime/theorem-cache/pattern.js.map +1 -0
- package/dist/system-f/index.d.ts +7 -0
- package/dist/system-f/index.d.ts.map +1 -0
- package/dist/system-f/index.js +48 -0
- package/dist/system-f/index.js.map +1 -0
- package/dist/system-f/infer.d.ts +9 -0
- package/dist/system-f/infer.d.ts.map +1 -0
- package/dist/system-f/infer.js +94 -0
- package/dist/system-f/infer.js.map +1 -0
- package/dist/system-f/reduce.d.ts +15 -0
- package/dist/system-f/reduce.d.ts.map +1 -0
- package/dist/system-f/reduce.js +259 -0
- package/dist/system-f/reduce.js.map +1 -0
- package/dist/system-f/types.d.ts +53 -0
- package/dist/system-f/types.d.ts.map +1 -0
- package/dist/system-f/types.js +157 -0
- package/dist/system-f/types.js.map +1 -0
- package/dist/tests/anti-unification/anti-unify.test.d.ts +2 -0
- package/dist/tests/anti-unification/anti-unify.test.d.ts.map +1 -0
- package/dist/tests/anti-unification/anti-unify.test.js +219 -0
- package/dist/tests/anti-unification/anti-unify.test.js.map +1 -0
- package/dist/tests/coverage-fill-aristotelian.test.js +1 -1
- package/dist/tests/coverage-fill-aristotelian.test.js.map +1 -1
- package/dist/tests/coverage-fill-fallacies.test.js +1 -1
- package/dist/tests/coverage-fill-fallacies.test.js.map +1 -1
- package/dist/tests/coverage-fill-format.test.js +1 -1
- package/dist/tests/coverage-fill-format.test.js.map +1 -1
- package/dist/tests/coverage-fill-intuitionistic.test.js +1 -1
- package/dist/tests/coverage-fill-intuitionistic.test.js.map +1 -1
- package/dist/tests/coverage-fill-probabilistic.test.js +1 -1
- package/dist/tests/coverage-fill-probabilistic.test.js.map +1 -1
- package/dist/tests/csp/csp.test.d.ts +2 -0
- package/dist/tests/csp/csp.test.d.ts.map +1 -0
- package/dist/tests/csp/csp.test.js +292 -0
- package/dist/tests/csp/csp.test.js.map +1 -0
- package/dist/tests/lambda-calc/lambda-calc.test.js.map +1 -1
- package/dist/tests/many-valued/many-valued.test.js.map +1 -1
- package/dist/tests/markov-logic/markov-logic.test.d.ts +2 -0
- package/dist/tests/markov-logic/markov-logic.test.d.ts.map +1 -0
- package/dist/tests/markov-logic/markov-logic.test.js +349 -0
- package/dist/tests/markov-logic/markov-logic.test.js.map +1 -0
- package/dist/tests/mltt/mltt.test.d.ts +2 -0
- package/dist/tests/mltt/mltt.test.d.ts.map +1 -0
- package/dist/tests/mltt/mltt.test.js +181 -0
- package/dist/tests/mltt/mltt.test.js.map +1 -0
- package/dist/tests/mu-calculus/check.test.d.ts +2 -0
- package/dist/tests/mu-calculus/check.test.d.ts.map +1 -0
- package/dist/tests/mu-calculus/check.test.js +234 -0
- package/dist/tests/mu-calculus/check.test.js.map +1 -0
- package/dist/tests/pi-calculus/pi-calculus.test.d.ts +2 -0
- package/dist/tests/pi-calculus/pi-calculus.test.d.ts.map +1 -0
- package/dist/tests/pi-calculus/pi-calculus.test.js +273 -0
- package/dist/tests/pi-calculus/pi-calculus.test.js.map +1 -0
- package/dist/tests/planning/planning.test.d.ts +2 -0
- package/dist/tests/planning/planning.test.d.ts.map +1 -0
- package/dist/tests/planning/planning.test.js +397 -0
- package/dist/tests/planning/planning.test.js.map +1 -0
- package/dist/tests/refinement-types/refinement-types.test.d.ts +2 -0
- package/dist/tests/refinement-types/refinement-types.test.d.ts.map +1 -0
- package/dist/tests/refinement-types/refinement-types.test.js +174 -0
- package/dist/tests/refinement-types/refinement-types.test.js.map +1 -0
- package/dist/tests/sequent-lk/prover.test.d.ts +2 -0
- package/dist/tests/sequent-lk/prover.test.d.ts.map +1 -0
- package/dist/tests/sequent-lk/prover.test.js +317 -0
- package/dist/tests/sequent-lk/prover.test.js.map +1 -0
- package/dist/tests/symbolic-diff/symbolic-diff.test.js.map +1 -1
- package/dist/tests/system-f/system-f.test.d.ts +2 -0
- package/dist/tests/system-f/system-f.test.d.ts.map +1 -0
- package/dist/tests/system-f/system-f.test.js +217 -0
- package/dist/tests/system-f/system-f.test.js.map +1 -0
- package/dist/tests/theorem-cache/cache.test.d.ts +2 -0
- package/dist/tests/theorem-cache/cache.test.d.ts.map +1 -0
- package/dist/tests/theorem-cache/cache.test.js +510 -0
- package/dist/tests/theorem-cache/cache.test.js.map +1 -0
- package/package.json +1 -1
|
@@ -0,0 +1,269 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
// ============================================================
|
|
3
|
+
// MLTT — Inferencia / chequeo de tipos bidireccional simplificado
|
|
4
|
+
// ============================================================
|
|
5
|
+
//
|
|
6
|
+
// Reglas implementadas (informalmente):
|
|
7
|
+
//
|
|
8
|
+
// ── (Var)
|
|
9
|
+
// Γ, x : A ⊢ x : A
|
|
10
|
+
//
|
|
11
|
+
// ── (Universe) Type i : Type (i+1)
|
|
12
|
+
//
|
|
13
|
+
// Γ ⊢ A : Type i Γ, x : A ⊢ B : Type j
|
|
14
|
+
// ── (Π-form) Π (x : A). B : Type max(i,j)
|
|
15
|
+
//
|
|
16
|
+
// Γ, x : A ⊢ M : B
|
|
17
|
+
// ── (Π-intro) λ (x : A). M : Π (x : A). B
|
|
18
|
+
//
|
|
19
|
+
// Γ ⊢ f : Π (x : A). B Γ ⊢ a : A
|
|
20
|
+
// ── (Π-elim) f a : B[a/x]
|
|
21
|
+
//
|
|
22
|
+
// Γ ⊢ A : Type i Γ, x : A ⊢ B : Type j
|
|
23
|
+
// ── (Σ-form) Σ (x : A). B : Type max(i,j)
|
|
24
|
+
//
|
|
25
|
+
// Γ ⊢ a : A Γ ⊢ b : B[a/x] (Σ (x : A). B)
|
|
26
|
+
// ── (Σ-intro) ⟨a,b⟩ : Σ (x:A). B
|
|
27
|
+
// * Simplificación: como `pair` no lleva anotación del Σ esperado,
|
|
28
|
+
// en inferencia devolvemos `Σ (_ : A). B` con B independiente
|
|
29
|
+
// (igual al tipo inferido para `b`). Para Σ dependiente se debe
|
|
30
|
+
// usar `checkType` con el Σ esperado.
|
|
31
|
+
//
|
|
32
|
+
// Γ ⊢ p : Σ (x : A). B
|
|
33
|
+
// ── (Σ-elim-1) fst p : A
|
|
34
|
+
// ── (Σ-elim-2) snd p : B[fst p / x]
|
|
35
|
+
//
|
|
36
|
+
// Γ ⊢ A : Type i Γ ⊢ a : A Γ ⊢ b : A
|
|
37
|
+
// ── (Id-form) Id(A, a, b) : Type i
|
|
38
|
+
//
|
|
39
|
+
// Γ ⊢ a : A
|
|
40
|
+
// ── (Id-intro) refl(a) : Id(A, a, a)
|
|
41
|
+
//
|
|
42
|
+
// ── (Nat) Nat : Type 0
|
|
43
|
+
// ── (zero) zero : Nat
|
|
44
|
+
// Γ ⊢ n : Nat
|
|
45
|
+
// ── (succ) succ n : Nat
|
|
46
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
47
|
+
exports.isInferError = isInferError;
|
|
48
|
+
exports.inferType = inferType;
|
|
49
|
+
exports.checkType = checkType;
|
|
50
|
+
const types_1 = require("./types");
|
|
51
|
+
const substitute_1 = require("./substitute");
|
|
52
|
+
const normalize_1 = require("./normalize");
|
|
53
|
+
const equality_1 = require("./equality");
|
|
54
|
+
function isInferError(r) {
|
|
55
|
+
return typeof r === 'object' && r !== null && 'error' in r && typeof r.error === 'string';
|
|
56
|
+
}
|
|
57
|
+
const emptyCtx = () => new Map();
|
|
58
|
+
/** Infiere el tipo de `term` o devuelve un error legible. */
|
|
59
|
+
function inferType(term, ctx = emptyCtx()) {
|
|
60
|
+
switch (term.kind) {
|
|
61
|
+
case 'var': {
|
|
62
|
+
const t = ctx.get(term.name);
|
|
63
|
+
if (!t)
|
|
64
|
+
return { error: `variable libre sin tipo en contexto: '${term.name}'` };
|
|
65
|
+
return t;
|
|
66
|
+
}
|
|
67
|
+
case 'universe':
|
|
68
|
+
return (0, types_1.mUniverse)(term.level + 1);
|
|
69
|
+
case 'nat':
|
|
70
|
+
return (0, types_1.mUniverse)(0);
|
|
71
|
+
case 'zero':
|
|
72
|
+
return (0, types_1.mNat)();
|
|
73
|
+
case 'succ': {
|
|
74
|
+
const argT = inferType(term.arg, ctx);
|
|
75
|
+
if (isInferError(argT))
|
|
76
|
+
return argT;
|
|
77
|
+
if (!isNat(argT)) {
|
|
78
|
+
return { error: `succ espera Nat, recibí: ${(0, types_1.termToString)(argT)}` };
|
|
79
|
+
}
|
|
80
|
+
return (0, types_1.mNat)();
|
|
81
|
+
}
|
|
82
|
+
case 'pi': {
|
|
83
|
+
const domT = inferType(term.domain, ctx);
|
|
84
|
+
if (isInferError(domT))
|
|
85
|
+
return domT;
|
|
86
|
+
const i = universeLevel(domT);
|
|
87
|
+
if (i === null) {
|
|
88
|
+
return {
|
|
89
|
+
error: `dominio de Π no es un universo: ${(0, types_1.termToString)(term.domain)} : ${(0, types_1.termToString)(domT)}`,
|
|
90
|
+
};
|
|
91
|
+
}
|
|
92
|
+
const newCtx = extend(ctx, term.bind, term.domain);
|
|
93
|
+
const codT = inferType(term.codomain, newCtx);
|
|
94
|
+
if (isInferError(codT))
|
|
95
|
+
return codT;
|
|
96
|
+
const j = universeLevel(codT);
|
|
97
|
+
if (j === null) {
|
|
98
|
+
return {
|
|
99
|
+
error: `codominio de Π no es un universo: ${(0, types_1.termToString)(term.codomain)} : ${(0, types_1.termToString)(codT)}`,
|
|
100
|
+
};
|
|
101
|
+
}
|
|
102
|
+
return (0, types_1.mUniverse)(Math.max(i, j));
|
|
103
|
+
}
|
|
104
|
+
case 'sigma': {
|
|
105
|
+
const fT = inferType(term.first, ctx);
|
|
106
|
+
if (isInferError(fT))
|
|
107
|
+
return fT;
|
|
108
|
+
const i = universeLevel(fT);
|
|
109
|
+
if (i === null) {
|
|
110
|
+
return {
|
|
111
|
+
error: `primer componente de Σ no es un universo: ${(0, types_1.termToString)(term.first)} : ${(0, types_1.termToString)(fT)}`,
|
|
112
|
+
};
|
|
113
|
+
}
|
|
114
|
+
const newCtx = extend(ctx, term.bind, term.first);
|
|
115
|
+
const sT = inferType(term.second, newCtx);
|
|
116
|
+
if (isInferError(sT))
|
|
117
|
+
return sT;
|
|
118
|
+
const j = universeLevel(sT);
|
|
119
|
+
if (j === null) {
|
|
120
|
+
return {
|
|
121
|
+
error: `segundo componente de Σ no es un universo: ${(0, types_1.termToString)(term.second)} : ${(0, types_1.termToString)(sT)}`,
|
|
122
|
+
};
|
|
123
|
+
}
|
|
124
|
+
return (0, types_1.mUniverse)(Math.max(i, j));
|
|
125
|
+
}
|
|
126
|
+
case 'lam': {
|
|
127
|
+
// Chequeamos que `domain` sea un tipo (vive en algún universo).
|
|
128
|
+
const domT = inferType(term.domain, ctx);
|
|
129
|
+
if (isInferError(domT))
|
|
130
|
+
return domT;
|
|
131
|
+
if (universeLevel(domT) === null) {
|
|
132
|
+
return {
|
|
133
|
+
error: `anotación de λ no es un tipo: ${(0, types_1.termToString)(term.domain)} : ${(0, types_1.termToString)(domT)}`,
|
|
134
|
+
};
|
|
135
|
+
}
|
|
136
|
+
const newCtx = extend(ctx, term.bind, term.domain);
|
|
137
|
+
const bodyT = inferType(term.body, newCtx);
|
|
138
|
+
if (isInferError(bodyT))
|
|
139
|
+
return bodyT;
|
|
140
|
+
return { kind: 'pi', bind: term.bind, domain: term.domain, codomain: bodyT };
|
|
141
|
+
}
|
|
142
|
+
case 'app': {
|
|
143
|
+
const fnT = inferType(term.fn, ctx);
|
|
144
|
+
if (isInferError(fnT))
|
|
145
|
+
return fnT;
|
|
146
|
+
const fnTNorm = (0, normalize_1.normalize)(fnT);
|
|
147
|
+
if (fnTNorm.kind !== 'pi') {
|
|
148
|
+
return { error: `aplicación requiere Π, encontré: ${(0, types_1.termToString)(fnTNorm)}` };
|
|
149
|
+
}
|
|
150
|
+
const argT = inferType(term.arg, ctx);
|
|
151
|
+
if (isInferError(argT))
|
|
152
|
+
return argT;
|
|
153
|
+
if (!(0, equality_1.alphaBetaEq)(fnTNorm.domain, argT)) {
|
|
154
|
+
return {
|
|
155
|
+
error: `tipo de argumento no coincide: esperaba ${(0, types_1.termToString)(fnTNorm.domain)}, obtuve ${(0, types_1.termToString)(argT)}`,
|
|
156
|
+
};
|
|
157
|
+
}
|
|
158
|
+
return (0, substitute_1.substitute)(fnTNorm.codomain, fnTNorm.bind, term.arg);
|
|
159
|
+
}
|
|
160
|
+
case 'pair': {
|
|
161
|
+
const aT = inferType(term.fst, ctx);
|
|
162
|
+
if (isInferError(aT))
|
|
163
|
+
return aT;
|
|
164
|
+
const bT = inferType(term.snd, ctx);
|
|
165
|
+
if (isInferError(bT))
|
|
166
|
+
return bT;
|
|
167
|
+
// No-dependent Σ por defecto. Para Σ dependiente, usar checkType.
|
|
168
|
+
return { kind: 'sigma', bind: '_', first: aT, second: bT };
|
|
169
|
+
}
|
|
170
|
+
case 'fst': {
|
|
171
|
+
const pT = inferType(term.pair, ctx);
|
|
172
|
+
if (isInferError(pT))
|
|
173
|
+
return pT;
|
|
174
|
+
const pTNorm = (0, normalize_1.normalize)(pT);
|
|
175
|
+
if (pTNorm.kind !== 'sigma') {
|
|
176
|
+
return { error: `fst espera Σ, recibí: ${(0, types_1.termToString)(pTNorm)}` };
|
|
177
|
+
}
|
|
178
|
+
return pTNorm.first;
|
|
179
|
+
}
|
|
180
|
+
case 'snd': {
|
|
181
|
+
const pT = inferType(term.pair, ctx);
|
|
182
|
+
if (isInferError(pT))
|
|
183
|
+
return pT;
|
|
184
|
+
const pTNorm = (0, normalize_1.normalize)(pT);
|
|
185
|
+
if (pTNorm.kind !== 'sigma') {
|
|
186
|
+
return { error: `snd espera Σ, recibí: ${(0, types_1.termToString)(pTNorm)}` };
|
|
187
|
+
}
|
|
188
|
+
// B[fst p / x]
|
|
189
|
+
return (0, substitute_1.substitute)(pTNorm.second, pTNorm.bind, { kind: 'fst', pair: term.pair });
|
|
190
|
+
}
|
|
191
|
+
case 'identity': {
|
|
192
|
+
const typeT = inferType(term.type, ctx);
|
|
193
|
+
if (isInferError(typeT))
|
|
194
|
+
return typeT;
|
|
195
|
+
const i = universeLevel(typeT);
|
|
196
|
+
if (i === null) {
|
|
197
|
+
return { error: `argumento A de Id no es un tipo: ${(0, types_1.termToString)(term.type)}` };
|
|
198
|
+
}
|
|
199
|
+
const lT = inferType(term.left, ctx);
|
|
200
|
+
if (isInferError(lT))
|
|
201
|
+
return lT;
|
|
202
|
+
if (!(0, equality_1.alphaBetaEq)(lT, term.type)) {
|
|
203
|
+
return {
|
|
204
|
+
error: `lado izquierdo de Id tiene tipo ${(0, types_1.termToString)(lT)}, esperaba ${(0, types_1.termToString)(term.type)}`,
|
|
205
|
+
};
|
|
206
|
+
}
|
|
207
|
+
const rT = inferType(term.right, ctx);
|
|
208
|
+
if (isInferError(rT))
|
|
209
|
+
return rT;
|
|
210
|
+
if (!(0, equality_1.alphaBetaEq)(rT, term.type)) {
|
|
211
|
+
return {
|
|
212
|
+
error: `lado derecho de Id tiene tipo ${(0, types_1.termToString)(rT)}, esperaba ${(0, types_1.termToString)(term.type)}`,
|
|
213
|
+
};
|
|
214
|
+
}
|
|
215
|
+
return (0, types_1.mUniverse)(i);
|
|
216
|
+
}
|
|
217
|
+
case 'refl': {
|
|
218
|
+
const aT = inferType(term.term, ctx);
|
|
219
|
+
if (isInferError(aT))
|
|
220
|
+
return aT;
|
|
221
|
+
return { kind: 'identity', type: aT, left: term.term, right: term.term };
|
|
222
|
+
}
|
|
223
|
+
}
|
|
224
|
+
}
|
|
225
|
+
/**
|
|
226
|
+
* Chequea que `term` tenga el tipo `expected` (bajo αβ-equality).
|
|
227
|
+
* Implementa el modo "check" donde para `pair` se conoce el Σ esperado
|
|
228
|
+
* y se permite la dependencia del segundo componente.
|
|
229
|
+
*/
|
|
230
|
+
function checkType(term, expected, ctx = emptyCtx()) {
|
|
231
|
+
const expectedNorm = (0, normalize_1.normalize)(expected);
|
|
232
|
+
// Caso especial: `pair` contra un Σ dependiente.
|
|
233
|
+
if (term.kind === 'pair' && expectedNorm.kind === 'sigma') {
|
|
234
|
+
if (!checkType(term.fst, expectedNorm.first, ctx))
|
|
235
|
+
return false;
|
|
236
|
+
const expectedSnd = (0, substitute_1.substitute)(expectedNorm.second, expectedNorm.bind, term.fst);
|
|
237
|
+
return checkType(term.snd, expectedSnd, ctx);
|
|
238
|
+
}
|
|
239
|
+
// Caso especial: `lam` contra un Π — propaga el dominio esperado
|
|
240
|
+
// si la anotación del λ falta o coincide.
|
|
241
|
+
if (term.kind === 'lam' && expectedNorm.kind === 'pi') {
|
|
242
|
+
if (!(0, equality_1.alphaBetaEq)(term.domain, expectedNorm.domain))
|
|
243
|
+
return false;
|
|
244
|
+
const newCtx = extend(ctx, term.bind, term.domain);
|
|
245
|
+
// Renombrar binder esperado al del λ si difieren.
|
|
246
|
+
const expectedBody = expectedNorm.bind === term.bind
|
|
247
|
+
? expectedNorm.codomain
|
|
248
|
+
: (0, substitute_1.substitute)(expectedNorm.codomain, expectedNorm.bind, { kind: 'var', name: term.bind });
|
|
249
|
+
return checkType(term.body, expectedBody, newCtx);
|
|
250
|
+
}
|
|
251
|
+
const inferred = inferType(term, ctx);
|
|
252
|
+
if (isInferError(inferred))
|
|
253
|
+
return false;
|
|
254
|
+
return (0, equality_1.alphaBetaEq)(inferred, expected);
|
|
255
|
+
}
|
|
256
|
+
// ---------- Helpers internos ----------
|
|
257
|
+
function extend(ctx, name, type) {
|
|
258
|
+
const next = new Map(ctx);
|
|
259
|
+
next.set(name, type);
|
|
260
|
+
return next;
|
|
261
|
+
}
|
|
262
|
+
function isNat(t) {
|
|
263
|
+
return (0, normalize_1.normalize)(t).kind === 'nat';
|
|
264
|
+
}
|
|
265
|
+
function universeLevel(t) {
|
|
266
|
+
const n = (0, normalize_1.normalize)(t);
|
|
267
|
+
return n.kind === 'universe' ? n.level : null;
|
|
268
|
+
}
|
|
269
|
+
//# sourceMappingURL=infer.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"infer.js","sourceRoot":"","sources":["../../src/mltt/infer.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kEAAkE;AAClE,+DAA+D;AAC/D,EAAE;AACF,wCAAwC;AACxC,EAAE;AACF,aAAa;AACb,qBAAqB;AACrB,EAAE;AACF,6CAA6C;AAC7C,EAAE;AACF,4CAA4C;AAC5C,oDAAoD;AACpD,EAAE;AACF,qBAAqB;AACrB,qDAAqD;AACrD,EAAE;AACF,sCAAsC;AACtC,yCAAyC;AACzC,EAAE;AACF,2CAA2C;AAC3C,wDAAwD;AACxD,EAAE;AACF,gDAAgD;AAChD,iDAAiD;AACjD,qEAAqE;AACrE,kEAAkE;AAClE,oEAAoE;AACpE,0CAA0C;AAC1C,EAAE;AACF,yBAAyB;AACzB,wCAAwC;AACxC,mDAAmD;AACnD,EAAE;AACF,2CAA2C;AAC3C,mDAAmD;AACnD,EAAE;AACF,cAAc;AACd,oDAAoD;AACpD,EAAE;AACF,2CAA2C;AAC3C,yCAAyC;AACzC,gBAAgB;AAChB,2CAA2C;;AAW3C,oCAEC;AAKD,8BAmJC;AAOD,8BA8BC;AAvMD,mCAAwD;AACxD,6CAA0C;AAC1C,2CAAwC;AACxC,yCAAyC;AAKzC,SAAgB,YAAY,CAAC,CAAc;IACzC,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,IAAI,CAAC,IAAI,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC;AAC5F,CAAC;AAED,MAAM,QAAQ,GAAG,GAAiB,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;AAE/C,6DAA6D;AAC7D,SAAgB,SAAS,CAAC,IAAc,EAAE,MAAoB,QAAQ,EAAE;IACtE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,CAAC,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,yCAAyC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;YAChF,OAAO,CAAC,CAAC;QACX,CAAC;QACD,KAAK,UAAU;YACb,OAAO,IAAA,iBAAS,EAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACnC,KAAK,KAAK;YACR,OAAO,IAAA,iBAAS,EAAC,CAAC,CAAC,CAAC;QACtB,KAAK,MAAM;YACT,OAAO,IAAA,YAAI,GAAE,CAAC;QAChB,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACtC,IAAI,YAAY,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjB,OAAO,EAAE,KAAK,EAAE,4BAA4B,IAAA,oBAAY,EAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YACrE,CAAC;YACD,OAAO,IAAA,YAAI,GAAE,CAAC;QAChB,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACzC,IAAI,YAAY,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO;oBACL,KAAK,EAAE,mCAAmC,IAAA,oBAAY,EAAC,IAAI,CAAC,MAAM,CAAC,MAAM,IAAA,oBAAY,EAAC,IAAI,CAAC,EAAE;iBAC9F,CAAC;YACJ,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC9C,IAAI,YAAY,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,MAAM,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO;oBACL,KAAK,EAAE,qCAAqC,IAAA,oBAAY,EAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAA,oBAAY,EAAC,IAAI,CAAC,EAAE;iBAClG,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,iBAAS,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACtC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO;oBACL,KAAK,EAAE,6CAA6C,IAAA,oBAAY,EAAC,IAAI,CAAC,KAAK,CAAC,MAAM,IAAA,oBAAY,EAAC,EAAE,CAAC,EAAE;iBACrG,CAAC;YACJ,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAC1C,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO;oBACL,KAAK,EAAE,8CAA8C,IAAA,oBAAY,EAAC,IAAI,CAAC,MAAM,CAAC,MAAM,IAAA,oBAAY,EAAC,EAAE,CAAC,EAAE;iBACvG,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,iBAAS,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,gEAAgE;YAChE,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACzC,IAAI,YAAY,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACjC,OAAO;oBACL,KAAK,EAAE,iCAAiC,IAAA,oBAAY,EAAC,IAAI,CAAC,MAAM,CAAC,MAAM,IAAA,oBAAY,EAAC,IAAI,CAAC,EAAE;iBAC5F,CAAC;YACJ,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC3C,IAAI,YAAY,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACtC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC/E,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACpC,IAAI,YAAY,CAAC,GAAG,CAAC;gBAAE,OAAO,GAAG,CAAC;YAClC,MAAM,OAAO,GAAG,IAAA,qBAAS,EAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBAC1B,OAAO,EAAE,KAAK,EAAE,oCAAoC,IAAA,oBAAY,EAAC,OAAO,CAAC,EAAE,EAAE,CAAC;YAChF,CAAC;YACD,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACtC,IAAI,YAAY,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;YACpC,IAAI,CAAC,IAAA,sBAAW,EAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;gBACvC,OAAO;oBACL,KAAK,EAAE,2CAA2C,IAAA,oBAAY,EAAC,OAAO,CAAC,MAAM,CAAC,YAAY,IAAA,oBAAY,EAAC,IAAI,CAAC,EAAE;iBAC/G,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,uBAAU,EAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9D,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACpC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACpC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,kEAAkE;YAClE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QAC7D,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACrC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAA,qBAAS,EAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC5B,OAAO,EAAE,KAAK,EAAE,yBAAyB,IAAA,oBAAY,EAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACpE,CAAC;YACD,OAAO,MAAM,CAAC,KAAK,CAAC;QACtB,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACrC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAA,qBAAS,EAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC5B,OAAO,EAAE,KAAK,EAAE,yBAAyB,IAAA,oBAAY,EAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACpE,CAAC;YACD,eAAe;YACf,OAAO,IAAA,uBAAU,EAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAClF,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACxC,IAAI,YAAY,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACtC,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO,EAAE,KAAK,EAAE,oCAAoC,IAAA,oBAAY,EAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YAClF,CAAC;YACD,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACrC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,IAAI,CAAC,IAAA,sBAAW,EAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,OAAO;oBACL,KAAK,EAAE,mCAAmC,IAAA,oBAAY,EAAC,EAAE,CAAC,cAAc,IAAA,oBAAY,EAAC,IAAI,CAAC,IAAI,CAAC,EAAE;iBAClG,CAAC;YACJ,CAAC;YACD,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACtC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,IAAI,CAAC,IAAA,sBAAW,EAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,OAAO;oBACL,KAAK,EAAE,iCAAiC,IAAA,oBAAY,EAAC,EAAE,CAAC,cAAc,IAAA,oBAAY,EAAC,IAAI,CAAC,IAAI,CAAC,EAAE;iBAChG,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,iBAAS,EAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACrC,IAAI,YAAY,CAAC,EAAE,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;QAC3E,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAgB,SAAS,CACvB,IAAc,EACd,QAAkB,EAClB,MAAoB,QAAQ,EAAE;IAE9B,MAAM,YAAY,GAAG,IAAA,qBAAS,EAAC,QAAQ,CAAC,CAAC;IAEzC,iDAAiD;IACjD,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,YAAY,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC1D,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,KAAK,EAAE,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAChE,MAAM,WAAW,GAAG,IAAA,uBAAU,EAAC,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QACjF,OAAO,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;IAC/C,CAAC;IAED,iEAAiE;IACjE,0CAA0C;IAC1C,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,YAAY,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QACtD,IAAI,CAAC,IAAA,sBAAW,EAAC,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;QACjE,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,kDAAkD;QAClD,MAAM,YAAY,GAChB,YAAY,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;YAC7B,CAAC,CAAC,YAAY,CAAC,QAAQ;YACvB,CAAC,CAAC,IAAA,uBAAU,EAAC,YAAY,CAAC,QAAQ,EAAE,YAAY,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC7F,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACtC,IAAI,YAAY,CAAC,QAAQ,CAAC;QAAE,OAAO,KAAK,CAAC;IACzC,OAAO,IAAA,sBAAW,EAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;AACzC,CAAC;AAED,yCAAyC;AAEzC,SAAS,MAAM,CAAC,GAAiB,EAAE,IAAY,EAAE,IAAc;IAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,KAAK,CAAC,CAAW;IACxB,OAAO,IAAA,qBAAS,EAAC,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC;AACrC,CAAC;AAED,SAAS,aAAa,CAAC,CAAW;IAChC,MAAM,CAAC,GAAG,IAAA,qBAAS,EAAC,CAAC,CAAC,CAAC;IACvB,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAChD,CAAC"}
|
|
@@ -0,0 +1,7 @@
|
|
|
1
|
+
import type { MLTTTerm } from './types';
|
|
2
|
+
/** Aplica un único paso de reducción (leftmost-outermost) si hay redex. */
|
|
3
|
+
export declare function reduceStep(term: MLTTTerm): MLTTTerm;
|
|
4
|
+
/** Normaliza hasta forma normal (o agota `maxSteps`). */
|
|
5
|
+
export declare function normalize(term: MLTTTerm, maxSteps?: number): MLTTTerm;
|
|
6
|
+
export declare function isNormal(term: MLTTTerm): boolean;
|
|
7
|
+
//# sourceMappingURL=normalize.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"normalize.d.ts","sourceRoot":"","sources":["../../src/mltt/normalize.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGxC,2EAA2E;AAC3E,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,CA6EnD;AAED,yDAAyD;AACzD,wBAAgB,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,SAAO,GAAG,QAAQ,CAQnE;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,CAEhD"}
|
|
@@ -0,0 +1,131 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
// ============================================================
|
|
3
|
+
// MLTT — β-reducción + reducciones ι (proyecciones, recursión Nat trivial)
|
|
4
|
+
// ============================================================
|
|
5
|
+
//
|
|
6
|
+
// Reglas:
|
|
7
|
+
// β: (λ (x : A). M) N ↦ M[N/x]
|
|
8
|
+
// π1: fst ⟨a, b⟩ ↦ a
|
|
9
|
+
// π2: snd ⟨a, b⟩ ↦ b
|
|
10
|
+
//
|
|
11
|
+
// La normalización es congruente: reduce dentro de Π/Σ/λ/Id/refl/succ
|
|
12
|
+
// para alcanzar formas normales completas (necesario para igualdad
|
|
13
|
+
// definicional de tipos).
|
|
14
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
15
|
+
exports.reduceStep = reduceStep;
|
|
16
|
+
exports.normalize = normalize;
|
|
17
|
+
exports.isNormal = isNormal;
|
|
18
|
+
const substitute_1 = require("./substitute");
|
|
19
|
+
/** Aplica un único paso de reducción (leftmost-outermost) si hay redex. */
|
|
20
|
+
function reduceStep(term) {
|
|
21
|
+
switch (term.kind) {
|
|
22
|
+
case 'var':
|
|
23
|
+
case 'universe':
|
|
24
|
+
case 'nat':
|
|
25
|
+
case 'zero':
|
|
26
|
+
return term;
|
|
27
|
+
case 'app': {
|
|
28
|
+
if (term.fn.kind === 'lam') {
|
|
29
|
+
return (0, substitute_1.substitute)(term.fn.body, term.fn.bind, term.arg);
|
|
30
|
+
}
|
|
31
|
+
const fn2 = reduceStep(term.fn);
|
|
32
|
+
if (fn2 !== term.fn)
|
|
33
|
+
return { kind: 'app', fn: fn2, arg: term.arg };
|
|
34
|
+
const arg2 = reduceStep(term.arg);
|
|
35
|
+
if (arg2 !== term.arg)
|
|
36
|
+
return { kind: 'app', fn: term.fn, arg: arg2 };
|
|
37
|
+
return term;
|
|
38
|
+
}
|
|
39
|
+
case 'lam': {
|
|
40
|
+
const d2 = reduceStep(term.domain);
|
|
41
|
+
if (d2 !== term.domain)
|
|
42
|
+
return { ...term, domain: d2 };
|
|
43
|
+
const b2 = reduceStep(term.body);
|
|
44
|
+
if (b2 !== term.body)
|
|
45
|
+
return { ...term, body: b2 };
|
|
46
|
+
return term;
|
|
47
|
+
}
|
|
48
|
+
case 'pi': {
|
|
49
|
+
const d2 = reduceStep(term.domain);
|
|
50
|
+
if (d2 !== term.domain)
|
|
51
|
+
return { ...term, domain: d2 };
|
|
52
|
+
const c2 = reduceStep(term.codomain);
|
|
53
|
+
if (c2 !== term.codomain)
|
|
54
|
+
return { ...term, codomain: c2 };
|
|
55
|
+
return term;
|
|
56
|
+
}
|
|
57
|
+
case 'sigma': {
|
|
58
|
+
const f2 = reduceStep(term.first);
|
|
59
|
+
if (f2 !== term.first)
|
|
60
|
+
return { ...term, first: f2 };
|
|
61
|
+
const s2 = reduceStep(term.second);
|
|
62
|
+
if (s2 !== term.second)
|
|
63
|
+
return { ...term, second: s2 };
|
|
64
|
+
return term;
|
|
65
|
+
}
|
|
66
|
+
case 'pair': {
|
|
67
|
+
const f2 = reduceStep(term.fst);
|
|
68
|
+
if (f2 !== term.fst)
|
|
69
|
+
return { ...term, fst: f2 };
|
|
70
|
+
const s2 = reduceStep(term.snd);
|
|
71
|
+
if (s2 !== term.snd)
|
|
72
|
+
return { ...term, snd: s2 };
|
|
73
|
+
return term;
|
|
74
|
+
}
|
|
75
|
+
case 'fst': {
|
|
76
|
+
if (term.pair.kind === 'pair')
|
|
77
|
+
return term.pair.fst;
|
|
78
|
+
const p2 = reduceStep(term.pair);
|
|
79
|
+
if (p2 !== term.pair)
|
|
80
|
+
return { kind: 'fst', pair: p2 };
|
|
81
|
+
return term;
|
|
82
|
+
}
|
|
83
|
+
case 'snd': {
|
|
84
|
+
if (term.pair.kind === 'pair')
|
|
85
|
+
return term.pair.snd;
|
|
86
|
+
const p2 = reduceStep(term.pair);
|
|
87
|
+
if (p2 !== term.pair)
|
|
88
|
+
return { kind: 'snd', pair: p2 };
|
|
89
|
+
return term;
|
|
90
|
+
}
|
|
91
|
+
case 'identity': {
|
|
92
|
+
const t2 = reduceStep(term.type);
|
|
93
|
+
if (t2 !== term.type)
|
|
94
|
+
return { ...term, type: t2 };
|
|
95
|
+
const l2 = reduceStep(term.left);
|
|
96
|
+
if (l2 !== term.left)
|
|
97
|
+
return { ...term, left: l2 };
|
|
98
|
+
const r2 = reduceStep(term.right);
|
|
99
|
+
if (r2 !== term.right)
|
|
100
|
+
return { ...term, right: r2 };
|
|
101
|
+
return term;
|
|
102
|
+
}
|
|
103
|
+
case 'refl': {
|
|
104
|
+
const t2 = reduceStep(term.term);
|
|
105
|
+
if (t2 !== term.term)
|
|
106
|
+
return { kind: 'refl', term: t2 };
|
|
107
|
+
return term;
|
|
108
|
+
}
|
|
109
|
+
case 'succ': {
|
|
110
|
+
const a2 = reduceStep(term.arg);
|
|
111
|
+
if (a2 !== term.arg)
|
|
112
|
+
return { kind: 'succ', arg: a2 };
|
|
113
|
+
return term;
|
|
114
|
+
}
|
|
115
|
+
}
|
|
116
|
+
}
|
|
117
|
+
/** Normaliza hasta forma normal (o agota `maxSteps`). */
|
|
118
|
+
function normalize(term, maxSteps = 1000) {
|
|
119
|
+
let current = term;
|
|
120
|
+
for (let i = 0; i < maxSteps; i++) {
|
|
121
|
+
const next = reduceStep(current);
|
|
122
|
+
if (next === current)
|
|
123
|
+
return current;
|
|
124
|
+
current = next;
|
|
125
|
+
}
|
|
126
|
+
return current;
|
|
127
|
+
}
|
|
128
|
+
function isNormal(term) {
|
|
129
|
+
return reduceStep(term) === term;
|
|
130
|
+
}
|
|
131
|
+
//# sourceMappingURL=normalize.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"normalize.js","sourceRoot":"","sources":["../../src/mltt/normalize.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2EAA2E;AAC3E,+DAA+D;AAC/D,EAAE;AACF,UAAU;AACV,4CAA4C;AAC5C,wCAAwC;AACxC,wCAAwC;AACxC,EAAE;AACF,sEAAsE;AACtE,mEAAmE;AACnE,0BAA0B;;AAM1B,gCA6EC;AAGD,8BAQC;AAED,4BAEC;AA/FD,6CAA0C;AAE1C,2EAA2E;AAC3E,SAAgB,UAAU,CAAC,IAAc;IACvC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK,CAAC;QACX,KAAK,UAAU,CAAC;QAChB,KAAK,KAAK,CAAC;QACX,KAAK,MAAM;YACT,OAAO,IAAI,CAAC;QACd,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBAC3B,OAAO,IAAA,uBAAU,EAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC1D,CAAC;YACD,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,GAAG,KAAK,IAAI,CAAC,EAAE;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;YACpE,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,IAAI,KAAK,IAAI,CAAC,GAAG;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;YACtE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,EAAE,KAAK,IAAI,CAAC,MAAM;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YACvD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACnD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACV,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,EAAE,KAAK,IAAI,CAAC,MAAM;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YACvD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrC,IAAI,EAAE,KAAK,IAAI,CAAC,QAAQ;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;YAC3D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,EAAE,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YACrD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,EAAE,KAAK,IAAI,CAAC,MAAM;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;YACvD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YACjD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;YACpD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACvD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;YACpD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACvD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACnD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACnD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,EAAE,KAAK,IAAI,CAAC,KAAK;gBAAE,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACxD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG;gBAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YACtD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED,yDAAyD;AACzD,SAAgB,SAAS,CAAC,IAAc,EAAE,QAAQ,GAAG,IAAI;IACvD,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,IAAI,KAAK,OAAO;YAAE,OAAO,OAAO,CAAC;QACrC,OAAO,GAAG,IAAI,CAAC;IACjB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAgB,QAAQ,CAAC,IAAc;IACrC,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC;AACnC,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"substitute.d.ts","sourceRoot":"","sources":["../../src/mltt/substitute.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAWxC,sDAAsD;AACtD,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,QAAQ,CAyDlF"}
|
|
@@ -0,0 +1,94 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
// ============================================================
|
|
3
|
+
// MLTT — Sustitución capture-avoiding y α-renombrado
|
|
4
|
+
// ============================================================
|
|
5
|
+
//
|
|
6
|
+
// La sustitución dependiente debe entrar también en `domain` /
|
|
7
|
+
// `first` / `second` / `codomain` / `type` porque los tipos son
|
|
8
|
+
// términos y pueden mencionar variables libres.
|
|
9
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
10
|
+
exports.substitute = substitute;
|
|
11
|
+
const types_1 = require("./types");
|
|
12
|
+
let freshCounter = 0;
|
|
13
|
+
function fresh(base, avoid) {
|
|
14
|
+
let candidate = `${base}#${freshCounter++}`;
|
|
15
|
+
while (avoid.has(candidate))
|
|
16
|
+
candidate = `${base}#${freshCounter++}`;
|
|
17
|
+
return candidate;
|
|
18
|
+
}
|
|
19
|
+
/** Sustitución capture-avoiding: term[value/name]. */
|
|
20
|
+
function substitute(term, name, value) {
|
|
21
|
+
switch (term.kind) {
|
|
22
|
+
case 'var':
|
|
23
|
+
return term.name === name ? value : term;
|
|
24
|
+
case 'universe':
|
|
25
|
+
case 'nat':
|
|
26
|
+
case 'zero':
|
|
27
|
+
return term;
|
|
28
|
+
case 'pi':
|
|
29
|
+
return substBinder(term, name, value, term.domain, term.codomain, (bind, dom, cod) => ({
|
|
30
|
+
kind: 'pi',
|
|
31
|
+
bind,
|
|
32
|
+
domain: dom,
|
|
33
|
+
codomain: cod,
|
|
34
|
+
}));
|
|
35
|
+
case 'sigma':
|
|
36
|
+
return substBinder(term, name, value, term.first, term.second, (bind, dom, cod) => ({
|
|
37
|
+
kind: 'sigma',
|
|
38
|
+
bind,
|
|
39
|
+
first: dom,
|
|
40
|
+
second: cod,
|
|
41
|
+
}));
|
|
42
|
+
case 'lam':
|
|
43
|
+
return substBinder(term, name, value, term.domain, term.body, (bind, dom, body) => ({
|
|
44
|
+
kind: 'lam',
|
|
45
|
+
bind,
|
|
46
|
+
domain: dom,
|
|
47
|
+
body,
|
|
48
|
+
}));
|
|
49
|
+
case 'app':
|
|
50
|
+
return {
|
|
51
|
+
kind: 'app',
|
|
52
|
+
fn: substitute(term.fn, name, value),
|
|
53
|
+
arg: substitute(term.arg, name, value),
|
|
54
|
+
};
|
|
55
|
+
case 'pair':
|
|
56
|
+
return {
|
|
57
|
+
kind: 'pair',
|
|
58
|
+
fst: substitute(term.fst, name, value),
|
|
59
|
+
snd: substitute(term.snd, name, value),
|
|
60
|
+
};
|
|
61
|
+
case 'fst':
|
|
62
|
+
return { kind: 'fst', pair: substitute(term.pair, name, value) };
|
|
63
|
+
case 'snd':
|
|
64
|
+
return { kind: 'snd', pair: substitute(term.pair, name, value) };
|
|
65
|
+
case 'identity':
|
|
66
|
+
return {
|
|
67
|
+
kind: 'identity',
|
|
68
|
+
type: substitute(term.type, name, value),
|
|
69
|
+
left: substitute(term.left, name, value),
|
|
70
|
+
right: substitute(term.right, name, value),
|
|
71
|
+
};
|
|
72
|
+
case 'refl':
|
|
73
|
+
return { kind: 'refl', term: substitute(term.term, name, value) };
|
|
74
|
+
case 'succ':
|
|
75
|
+
return { kind: 'succ', arg: substitute(term.arg, name, value) };
|
|
76
|
+
}
|
|
77
|
+
}
|
|
78
|
+
// Helper común para Π / Σ / λ: maneja captura y reusa la estructura.
|
|
79
|
+
function substBinder(source, name, value, dom, cod, build) {
|
|
80
|
+
// El `domain` / `first` está fuera del binder → siempre se sustituye.
|
|
81
|
+
const newDom = substitute(dom, name, value);
|
|
82
|
+
// Si el binder coincide con `name`, el `cod` no contiene `name` libre.
|
|
83
|
+
if (source.bind === name) {
|
|
84
|
+
return build(source.bind, newDom, cod);
|
|
85
|
+
}
|
|
86
|
+
const fv = (0, types_1.freeVars)(value);
|
|
87
|
+
if (fv.has(source.bind)) {
|
|
88
|
+
const newBind = fresh(source.bind, new Set([...fv, ...(0, types_1.freeVars)(cod), name]));
|
|
89
|
+
const renamedCod = substitute(cod, source.bind, { kind: 'var', name: newBind });
|
|
90
|
+
return build(newBind, newDom, substitute(renamedCod, name, value));
|
|
91
|
+
}
|
|
92
|
+
return build(source.bind, newDom, substitute(cod, name, value));
|
|
93
|
+
}
|
|
94
|
+
//# sourceMappingURL=substitute.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"substitute.js","sourceRoot":"","sources":["../../src/mltt/substitute.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qDAAqD;AACrD,+DAA+D;AAC/D,EAAE;AACF,+DAA+D;AAC/D,gEAAgE;AAChE,gDAAgD;;AAchD,gCAyDC;AApED,mCAAmC;AAEnC,IAAI,YAAY,GAAG,CAAC,CAAC;AAErB,SAAS,KAAK,CAAC,IAAY,EAAE,KAAkB;IAC7C,IAAI,SAAS,GAAG,GAAG,IAAI,IAAI,YAAY,EAAE,EAAE,CAAC;IAC5C,OAAO,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC;QAAE,SAAS,GAAG,GAAG,IAAI,IAAI,YAAY,EAAE,EAAE,CAAC;IACrE,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,sDAAsD;AACtD,SAAgB,UAAU,CAAC,IAAc,EAAE,IAAY,EAAE,KAAe;IACtE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3C,KAAK,UAAU,CAAC;QAChB,KAAK,KAAK,CAAC;QACX,KAAK,MAAM;YACT,OAAO,IAAI,CAAC;QACd,KAAK,IAAI;YACP,OAAO,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;gBACrF,IAAI,EAAE,IAAI;gBACV,IAAI;gBACJ,MAAM,EAAE,GAAG;gBACX,QAAQ,EAAE,GAAG;aACd,CAAC,CAAC,CAAC;QACN,KAAK,OAAO;YACV,OAAO,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;gBAClF,IAAI,EAAE,OAAO;gBACb,IAAI;gBACJ,KAAK,EAAE,GAAG;gBACV,MAAM,EAAE,GAAG;aACZ,CAAC,CAAC,CAAC;QACN,KAAK,KAAK;YACR,OAAO,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;gBAClF,IAAI,EAAE,KAAK;gBACX,IAAI;gBACJ,MAAM,EAAE,GAAG;gBACX,IAAI;aACL,CAAC,CAAC,CAAC;QACN,KAAK,KAAK;YACR,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,EAAE,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC;gBACpC,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC;aACvC,CAAC;QACJ,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC;gBACtC,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC;aACvC,CAAC;QACJ,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACnE,KAAK,KAAK;YACR,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACnE,KAAK,UAAU;YACb,OAAO;gBACL,IAAI,EAAE,UAAU;gBAChB,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC;gBACxC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC;gBACxC,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC;aAC3C,CAAC;QACJ,KAAK,MAAM;YACT,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACpE,KAAK,MAAM;YACT,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;IACpE,CAAC;AACH,CAAC;AAED,qEAAqE;AACrE,SAAS,WAAW,CAClB,MAAwB,EACxB,IAAY,EACZ,KAAe,EACf,GAAa,EACb,GAAa,EACb,KAA+D;IAE/D,sEAAsE;IACtE,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC5C,uEAAuE;IACvE,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;IACD,MAAM,EAAE,GAAG,IAAA,gBAAQ,EAAC,KAAK,CAAC,CAAC;IAC3B,IAAI,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,GAAG,IAAA,gBAAQ,EAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7E,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QAChF,OAAO,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;AAClE,CAAC"}
|
|
@@ -0,0 +1,72 @@
|
|
|
1
|
+
export type MLTTTerm = {
|
|
2
|
+
kind: 'var';
|
|
3
|
+
name: string;
|
|
4
|
+
} | {
|
|
5
|
+
kind: 'universe';
|
|
6
|
+
level: number;
|
|
7
|
+
} | {
|
|
8
|
+
kind: 'pi';
|
|
9
|
+
bind: string;
|
|
10
|
+
domain: MLTTTerm;
|
|
11
|
+
codomain: MLTTTerm;
|
|
12
|
+
} | {
|
|
13
|
+
kind: 'lam';
|
|
14
|
+
bind: string;
|
|
15
|
+
domain: MLTTTerm;
|
|
16
|
+
body: MLTTTerm;
|
|
17
|
+
} | {
|
|
18
|
+
kind: 'app';
|
|
19
|
+
fn: MLTTTerm;
|
|
20
|
+
arg: MLTTTerm;
|
|
21
|
+
} | {
|
|
22
|
+
kind: 'sigma';
|
|
23
|
+
bind: string;
|
|
24
|
+
first: MLTTTerm;
|
|
25
|
+
second: MLTTTerm;
|
|
26
|
+
} | {
|
|
27
|
+
kind: 'pair';
|
|
28
|
+
fst: MLTTTerm;
|
|
29
|
+
snd: MLTTTerm;
|
|
30
|
+
} | {
|
|
31
|
+
kind: 'fst';
|
|
32
|
+
pair: MLTTTerm;
|
|
33
|
+
} | {
|
|
34
|
+
kind: 'snd';
|
|
35
|
+
pair: MLTTTerm;
|
|
36
|
+
} | {
|
|
37
|
+
kind: 'identity';
|
|
38
|
+
type: MLTTTerm;
|
|
39
|
+
left: MLTTTerm;
|
|
40
|
+
right: MLTTTerm;
|
|
41
|
+
} | {
|
|
42
|
+
kind: 'refl';
|
|
43
|
+
term: MLTTTerm;
|
|
44
|
+
} | {
|
|
45
|
+
kind: 'nat';
|
|
46
|
+
} | {
|
|
47
|
+
kind: 'zero';
|
|
48
|
+
} | {
|
|
49
|
+
kind: 'succ';
|
|
50
|
+
arg: MLTTTerm;
|
|
51
|
+
};
|
|
52
|
+
export declare const mVar: (name: string) => MLTTTerm;
|
|
53
|
+
export declare const mUniverse: (level?: number) => MLTTTerm;
|
|
54
|
+
export declare const mPi: (bind: string, domain: MLTTTerm, codomain: MLTTTerm) => MLTTTerm;
|
|
55
|
+
export declare const mLam: (bind: string, domain: MLTTTerm, body: MLTTTerm) => MLTTTerm;
|
|
56
|
+
export declare const mApp: (fn: MLTTTerm, arg: MLTTTerm) => MLTTTerm;
|
|
57
|
+
export declare const mSigma: (bind: string, first: MLTTTerm, second: MLTTTerm) => MLTTTerm;
|
|
58
|
+
export declare const mPair: (fst: MLTTTerm, snd: MLTTTerm) => MLTTTerm;
|
|
59
|
+
export declare const mFst: (pair: MLTTTerm) => MLTTTerm;
|
|
60
|
+
export declare const mSnd: (pair: MLTTTerm) => MLTTTerm;
|
|
61
|
+
export declare const mId: (type: MLTTTerm, left: MLTTTerm, right: MLTTTerm) => MLTTTerm;
|
|
62
|
+
export declare const mRefl: (term: MLTTTerm) => MLTTTerm;
|
|
63
|
+
export declare const mNat: () => MLTTTerm;
|
|
64
|
+
export declare const mZero: () => MLTTTerm;
|
|
65
|
+
export declare const mSucc: (arg: MLTTTerm) => MLTTTerm;
|
|
66
|
+
export declare const mArrow: (from: MLTTTerm, to: MLTTTerm) => MLTTTerm;
|
|
67
|
+
/** ¿`name` aparece libre en `term`? */
|
|
68
|
+
export declare function occursFree(name: string, term: MLTTTerm): boolean;
|
|
69
|
+
/** Conjunto de variables libres. */
|
|
70
|
+
export declare function freeVars(term: MLTTTerm, acc?: Set<string>): Set<string>;
|
|
71
|
+
export declare function termToString(t: MLTTTerm): string;
|
|
72
|
+
//# sourceMappingURL=types.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/mltt/types.ts"],"names":[],"mappings":"AAqBA,MAAM,MAAM,QAAQ,GAChB;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC7B;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GACnC;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAA;CAAE,GAClE;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,GAC/D;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,EAAE,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAA;CAAE,GAC5C;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,QAAQ,CAAA;CAAE,GAClE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAA;CAAE,GAC9C;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,KAAK,EAAE,QAAQ,CAAA;CAAE,GACrE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,GAChC;IAAE,IAAI,EAAE,KAAK,CAAA;CAAE,GACf;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAChB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAA;CAAE,CAAC;AAIpC,eAAO,MAAM,IAAI,GAAI,MAAM,MAAM,KAAG,QAAmC,CAAC;AACxE,eAAO,MAAM,SAAS,GAAI,cAAS,KAAG,QAAyC,CAAC;AAChF,eAAO,MAAM,GAAG,GAAI,MAAM,MAAM,EAAE,QAAQ,QAAQ,EAAE,UAAU,QAAQ,KAAG,QAKvE,CAAC;AACH,eAAO,MAAM,IAAI,GAAI,MAAM,MAAM,EAAE,QAAQ,QAAQ,EAAE,MAAM,QAAQ,KAAG,QAKpE,CAAC;AACH,eAAO,MAAM,IAAI,GAAI,IAAI,QAAQ,EAAE,KAAK,QAAQ,KAAG,QAAsC,CAAC;AAC1F,eAAO,MAAM,MAAM,GAAI,MAAM,MAAM,EAAE,OAAO,QAAQ,EAAE,QAAQ,QAAQ,KAAG,QAKvE,CAAC;AACH,eAAO,MAAM,KAAK,GAAI,KAAK,QAAQ,EAAE,KAAK,QAAQ,KAAG,QAAwC,CAAC;AAC9F,eAAO,MAAM,IAAI,GAAI,MAAM,QAAQ,KAAG,QAAmC,CAAC;AAC1E,eAAO,MAAM,IAAI,GAAI,MAAM,QAAQ,KAAG,QAAmC,CAAC;AAC1E,eAAO,MAAM,GAAG,GAAI,MAAM,QAAQ,EAAE,MAAM,QAAQ,EAAE,OAAO,QAAQ,KAAG,QAKpE,CAAC;AACH,eAAO,MAAM,KAAK,GAAI,MAAM,QAAQ,KAAG,QAAoC,CAAC;AAC5E,eAAO,MAAM,IAAI,QAAO,QAA6B,CAAC;AACtD,eAAO,MAAM,KAAK,QAAO,QAA8B,CAAC;AACxD,eAAO,MAAM,KAAK,GAAI,KAAK,QAAQ,KAAG,QAAmC,CAAC;AAG1E,eAAO,MAAM,MAAM,GAAI,MAAM,QAAQ,EAAE,IAAI,QAAQ,KAAG,QAA8B,CAAC;AAIrF,uCAAuC;AACvC,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,OAAO,CAoChE;AAED,oCAAoC;AACpC,wBAAgB,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,GAAE,GAAG,CAAC,MAAM,CAAa,GAAG,GAAG,CAAC,MAAM,CAAC,CAmDlF;AAID,wBAAgB,YAAY,CAAC,CAAC,EAAE,QAAQ,GAAG,MAAM,CAkChD"}
|