@stevenvo780/st-lang 4.12.0 → 4.13.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/reasoning/datalog/index.d.ts +131 -0
- package/dist/reasoning/datalog/index.d.ts.map +1 -0
- package/dist/reasoning/datalog/index.js +706 -0
- package/dist/reasoning/datalog/index.js.map +1 -0
- package/dist/reasoning/galois-fields/index.d.ts +29 -0
- package/dist/reasoning/galois-fields/index.d.ts.map +1 -0
- package/dist/reasoning/galois-fields/index.js +522 -0
- package/dist/reasoning/galois-fields/index.js.map +1 -0
- package/dist/reasoning/lattice/index.d.ts +165 -0
- package/dist/reasoning/lattice/index.d.ts.map +1 -0
- package/dist/reasoning/lattice/index.js +587 -0
- package/dist/reasoning/lattice/index.js.map +1 -0
- package/dist/reasoning/polynomial-ring/index.d.ts +30 -0
- package/dist/reasoning/polynomial-ring/index.d.ts.map +1 -0
- package/dist/reasoning/polynomial-ring/index.js +797 -0
- package/dist/reasoning/polynomial-ring/index.js.map +1 -0
- package/dist/tests/reasoning/datalog/datalog.test.d.ts +2 -0
- package/dist/tests/reasoning/datalog/datalog.test.d.ts.map +1 -0
- package/dist/tests/reasoning/datalog/datalog.test.js +333 -0
- package/dist/tests/reasoning/datalog/datalog.test.js.map +1 -0
- package/dist/tests/reasoning/galois-fields/galois-fields.test.d.ts +2 -0
- package/dist/tests/reasoning/galois-fields/galois-fields.test.d.ts.map +1 -0
- package/dist/tests/reasoning/galois-fields/galois-fields.test.js +226 -0
- package/dist/tests/reasoning/galois-fields/galois-fields.test.js.map +1 -0
- package/dist/tests/reasoning/lattice/lattice.test.d.ts +2 -0
- package/dist/tests/reasoning/lattice/lattice.test.d.ts.map +1 -0
- package/dist/tests/reasoning/lattice/lattice.test.js +238 -0
- package/dist/tests/reasoning/lattice/lattice.test.js.map +1 -0
- package/dist/tests/reasoning/polynomial-ring/polynomial-ring.test.d.ts +2 -0
- package/dist/tests/reasoning/polynomial-ring/polynomial-ring.test.d.ts.map +1 -0
- package/dist/tests/reasoning/polynomial-ring/polynomial-ring.test.js +230 -0
- package/dist/tests/reasoning/polynomial-ring/polynomial-ring.test.js.map +1 -0
- package/dist/tests/type-theory/lambda-cube/lambda-cube.test.d.ts +2 -0
- package/dist/tests/type-theory/lambda-cube/lambda-cube.test.d.ts.map +1 -0
- package/dist/tests/type-theory/lambda-cube/lambda-cube.test.js +266 -0
- package/dist/tests/type-theory/lambda-cube/lambda-cube.test.js.map +1 -0
- package/dist/type-theory/lambda-cube/erase.d.ts +26 -0
- package/dist/type-theory/lambda-cube/erase.d.ts.map +1 -0
- package/dist/type-theory/lambda-cube/erase.js +68 -0
- package/dist/type-theory/lambda-cube/erase.js.map +1 -0
- package/dist/type-theory/lambda-cube/examples.d.ts +59 -0
- package/dist/type-theory/lambda-cube/examples.d.ts.map +1 -0
- package/dist/type-theory/lambda-cube/examples.js +110 -0
- package/dist/type-theory/lambda-cube/examples.js.map +1 -0
- package/dist/type-theory/lambda-cube/index.d.ts +11 -0
- package/dist/type-theory/lambda-cube/index.d.ts.map +1 -0
- package/dist/type-theory/lambda-cube/index.js +64 -0
- package/dist/type-theory/lambda-cube/index.js.map +1 -0
- package/dist/type-theory/lambda-cube/normalize.d.ts +17 -0
- package/dist/type-theory/lambda-cube/normalize.d.ts.map +1 -0
- package/dist/type-theory/lambda-cube/normalize.js +134 -0
- package/dist/type-theory/lambda-cube/normalize.js.map +1 -0
- package/dist/type-theory/lambda-cube/rules.d.ts +26 -0
- package/dist/type-theory/lambda-cube/rules.d.ts.map +1 -0
- package/dist/type-theory/lambda-cube/rules.js +67 -0
- package/dist/type-theory/lambda-cube/rules.js.map +1 -0
- package/dist/type-theory/lambda-cube/typecheck.d.ts +20 -0
- package/dist/type-theory/lambda-cube/typecheck.d.ts.map +1 -0
- package/dist/type-theory/lambda-cube/typecheck.js +168 -0
- package/dist/type-theory/lambda-cube/typecheck.js.map +1 -0
- package/dist/type-theory/lambda-cube/types.d.ts +40 -0
- package/dist/type-theory/lambda-cube/types.d.ts.map +1 -0
- package/dist/type-theory/lambda-cube/types.js +192 -0
- package/dist/type-theory/lambda-cube/types.js.map +1 -0
- package/package.json +1 -1
|
@@ -0,0 +1,230 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const vitest_1 = require("vitest");
|
|
4
|
+
const polynomial_ring_1 = require("../../../reasoning/polynomial-ring");
|
|
5
|
+
function coeffs(p) {
|
|
6
|
+
return p.coefficients;
|
|
7
|
+
}
|
|
8
|
+
(0, vitest_1.describe)('Polynomial Ring — construcción y básicos', () => {
|
|
9
|
+
(0, vitest_1.it)('poly([1,2,3]) representa 3x² + 2x + 1 con grado 2 y líder 3', () => {
|
|
10
|
+
const p = (0, polynomial_ring_1.poly)([1, 2, 3]);
|
|
11
|
+
(0, vitest_1.expect)(coeffs(p)).toEqual([1n, 2n, 3n]);
|
|
12
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.degree)(p)).toBe(2);
|
|
13
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.leadingCoefficient)(p)).toBe(3n);
|
|
14
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.isZero)(p)).toBe(false);
|
|
15
|
+
});
|
|
16
|
+
(0, vitest_1.it)('poly([0]) es cero y poly([0,0,0]) se normaliza a cero', () => {
|
|
17
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.isZero)((0, polynomial_ring_1.poly)([0]))).toBe(true);
|
|
18
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.isZero)((0, polynomial_ring_1.poly)([0, 0, 0]))).toBe(true);
|
|
19
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.degree)((0, polynomial_ring_1.poly)([0]))).toBe(-1);
|
|
20
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.leadingCoefficient)((0, polynomial_ring_1.poly)([0]))).toBe(0n);
|
|
21
|
+
});
|
|
22
|
+
(0, vitest_1.it)('normaliza ceros finales: [1, 2, 0, 0] → grado 1', () => {
|
|
23
|
+
const p = (0, polynomial_ring_1.poly)([1, 2, 0, 0]);
|
|
24
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.degree)(p)).toBe(1);
|
|
25
|
+
(0, vitest_1.expect)(coeffs(p)).toEqual([1n, 2n]);
|
|
26
|
+
});
|
|
27
|
+
});
|
|
28
|
+
(0, vitest_1.describe)('Polynomial Ring — aritmética', () => {
|
|
29
|
+
(0, vitest_1.it)('add: (x² + 2x + 1) + (x² - 1) = 2x² + 2x', () => {
|
|
30
|
+
const a = (0, polynomial_ring_1.poly)([1, 2, 1]);
|
|
31
|
+
const b = (0, polynomial_ring_1.poly)([-1, 0, 1]);
|
|
32
|
+
const r = (0, polynomial_ring_1.add)(a, b);
|
|
33
|
+
(0, vitest_1.expect)(coeffs(r)).toEqual([0n, 2n, 2n]);
|
|
34
|
+
});
|
|
35
|
+
(0, vitest_1.it)('sub: (x² + 2x + 1) - (x² + 1) = 2x', () => {
|
|
36
|
+
const a = (0, polynomial_ring_1.poly)([1, 2, 1]);
|
|
37
|
+
const b = (0, polynomial_ring_1.poly)([1, 0, 1]);
|
|
38
|
+
const r = (0, polynomial_ring_1.sub)(a, b);
|
|
39
|
+
(0, vitest_1.expect)(coeffs(r)).toEqual([0n, 2n]);
|
|
40
|
+
});
|
|
41
|
+
(0, vitest_1.it)('multiply: (x + 1)(x - 1) = x² - 1', () => {
|
|
42
|
+
const a = (0, polynomial_ring_1.poly)([1, 1]);
|
|
43
|
+
const b = (0, polynomial_ring_1.poly)([-1, 1]);
|
|
44
|
+
const r = (0, polynomial_ring_1.multiply)(a, b);
|
|
45
|
+
(0, vitest_1.expect)(coeffs(r)).toEqual([-1n, 0n, 1n]);
|
|
46
|
+
});
|
|
47
|
+
(0, vitest_1.it)('multiply distributivo: (2x + 3)(x² + x + 4) = 2x³ + 5x² + 11x + 12', () => {
|
|
48
|
+
const r = (0, polynomial_ring_1.multiply)((0, polynomial_ring_1.poly)([3, 2]), (0, polynomial_ring_1.poly)([4, 1, 1]));
|
|
49
|
+
(0, vitest_1.expect)(coeffs(r)).toEqual([12n, 11n, 5n, 2n]);
|
|
50
|
+
});
|
|
51
|
+
});
|
|
52
|
+
(0, vitest_1.describe)('Polynomial Ring — división euclidiana', () => {
|
|
53
|
+
(0, vitest_1.it)('divmod: (x³ - 1) / (x - 1) = x² + x + 1 con resto 0', () => {
|
|
54
|
+
const a = (0, polynomial_ring_1.poly)([-1, 0, 0, 1]);
|
|
55
|
+
const b = (0, polynomial_ring_1.poly)([-1, 1]);
|
|
56
|
+
const { quotient, remainder } = (0, polynomial_ring_1.divmod)(a, b);
|
|
57
|
+
(0, vitest_1.expect)(coeffs(quotient)).toEqual([1n, 1n, 1n]);
|
|
58
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.isZero)(remainder)).toBe(true);
|
|
59
|
+
});
|
|
60
|
+
(0, vitest_1.it)('divmod en Z/5: (x² + 1) / (x + 2) = x + 3 con resto 0', () => {
|
|
61
|
+
// x² + 1 = (x + 2)(x + 3) en Z/5 (porque (x+2)(x+3) = x² + 5x + 6 = x² + 1 (mod 5)).
|
|
62
|
+
const a = (0, polynomial_ring_1.poly)([1, 0, 1], 5n);
|
|
63
|
+
const b = (0, polynomial_ring_1.poly)([2, 1], 5n);
|
|
64
|
+
const { quotient, remainder } = (0, polynomial_ring_1.divmod)(a, b);
|
|
65
|
+
(0, vitest_1.expect)(coeffs(quotient)).toEqual([3n, 1n]);
|
|
66
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.isZero)(remainder)).toBe(true);
|
|
67
|
+
});
|
|
68
|
+
(0, vitest_1.it)('divmod monic: (x² + 3x + 2) / (x + 1) = x + 2 r 0', () => {
|
|
69
|
+
const { quotient, remainder } = (0, polynomial_ring_1.divmod)((0, polynomial_ring_1.poly)([2, 3, 1]), (0, polynomial_ring_1.poly)([1, 1]));
|
|
70
|
+
(0, vitest_1.expect)(coeffs(quotient)).toEqual([2n, 1n]);
|
|
71
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.isZero)(remainder)).toBe(true);
|
|
72
|
+
});
|
|
73
|
+
});
|
|
74
|
+
(0, vitest_1.describe)('Polynomial Ring — gcd', () => {
|
|
75
|
+
(0, vitest_1.it)('gcd(x² - 1, x - 1) = x - 1', () => {
|
|
76
|
+
const g = (0, polynomial_ring_1.gcd)((0, polynomial_ring_1.poly)([-1, 0, 1]), (0, polynomial_ring_1.poly)([-1, 1]));
|
|
77
|
+
(0, vitest_1.expect)(coeffs(g)).toEqual([-1n, 1n]);
|
|
78
|
+
});
|
|
79
|
+
(0, vitest_1.it)('gcd coprimos: gcd(x² + 1, x - 1) = 1', () => {
|
|
80
|
+
const g = (0, polynomial_ring_1.gcd)((0, polynomial_ring_1.poly)([1, 0, 1]), (0, polynomial_ring_1.poly)([-1, 1]));
|
|
81
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.degree)(g)).toBe(0);
|
|
82
|
+
});
|
|
83
|
+
(0, vitest_1.it)('gcd en Z/2: gcd(x³ + x² + x + 1, x² + 1) = x² + 1 (monic)', () => {
|
|
84
|
+
// En Z/2: x³ + x² + x + 1 = (x+1)(x²+1), gcd con (x²+1) = (x²+1).
|
|
85
|
+
const g = (0, polynomial_ring_1.gcd)((0, polynomial_ring_1.poly)([1, 1, 1, 1], 2n), (0, polynomial_ring_1.poly)([1, 0, 1], 2n));
|
|
86
|
+
(0, vitest_1.expect)(g.modulus).toBe(2n);
|
|
87
|
+
(0, vitest_1.expect)(coeffs(g)).toEqual([1n, 0n, 1n]);
|
|
88
|
+
});
|
|
89
|
+
});
|
|
90
|
+
(0, vitest_1.describe)('Polynomial Ring — derivada, evaluación, composición', () => {
|
|
91
|
+
(0, vitest_1.it)('derivative: d/dx(x³) = 3x²', () => {
|
|
92
|
+
const d = (0, polynomial_ring_1.derivative)((0, polynomial_ring_1.poly)([0, 0, 0, 1]));
|
|
93
|
+
(0, vitest_1.expect)(coeffs(d)).toEqual([0n, 0n, 3n]);
|
|
94
|
+
});
|
|
95
|
+
(0, vitest_1.it)('derivative: d/dx(5) = 0', () => {
|
|
96
|
+
const d = (0, polynomial_ring_1.derivative)((0, polynomial_ring_1.poly)([5]));
|
|
97
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.isZero)(d)).toBe(true);
|
|
98
|
+
});
|
|
99
|
+
(0, vitest_1.it)('evaluate(2x + 3, 5) = 13', () => {
|
|
100
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.evaluate)((0, polynomial_ring_1.poly)([3, 2]), 5n)).toBe(13n);
|
|
101
|
+
});
|
|
102
|
+
(0, vitest_1.it)('evaluate en Z/7: (2x + 3)(5) = 13 mod 7 = 6', () => {
|
|
103
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.evaluate)((0, polynomial_ring_1.poly)([3, 2], 7n), 5n)).toBe(6n);
|
|
104
|
+
});
|
|
105
|
+
(0, vitest_1.it)('compose: (x²)(x + 1) = (x+1)² = x² + 2x + 1', () => {
|
|
106
|
+
const r = (0, polynomial_ring_1.compose)((0, polynomial_ring_1.poly)([0, 0, 1]), (0, polynomial_ring_1.poly)([1, 1]));
|
|
107
|
+
(0, vitest_1.expect)(coeffs(r)).toEqual([1n, 2n, 1n]);
|
|
108
|
+
});
|
|
109
|
+
});
|
|
110
|
+
(0, vitest_1.describe)('Polynomial Ring — raíces racionales y factorización Q[x]', () => {
|
|
111
|
+
(0, vitest_1.it)('rationalRoots de x² - 5x + 6 = (x-2)(x-3) → {2/1, 3/1}', () => {
|
|
112
|
+
const roots = (0, polynomial_ring_1.rationalRoots)((0, polynomial_ring_1.poly)([6, -5, 1]));
|
|
113
|
+
(0, vitest_1.expect)(roots).toEqual([
|
|
114
|
+
{ num: 2n, den: 1n },
|
|
115
|
+
{ num: 3n, den: 1n },
|
|
116
|
+
]);
|
|
117
|
+
});
|
|
118
|
+
(0, vitest_1.it)('rationalRoots de 2x² - 3x + 1 → {1/1, 1/2}', () => {
|
|
119
|
+
const roots = (0, polynomial_ring_1.rationalRoots)((0, polynomial_ring_1.poly)([1, -3, 2]));
|
|
120
|
+
(0, vitest_1.expect)(roots).toEqual([
|
|
121
|
+
{ num: 1n, den: 1n },
|
|
122
|
+
{ num: 1n, den: 2n },
|
|
123
|
+
]);
|
|
124
|
+
});
|
|
125
|
+
(0, vitest_1.it)('rationalRoots de x² + 1 → [] (sin raíces racionales)', () => {
|
|
126
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.rationalRoots)((0, polynomial_ring_1.poly)([1, 0, 1]))).toEqual([]);
|
|
127
|
+
});
|
|
128
|
+
(0, vitest_1.it)('factor de x² - 1 produce factores lineales que multiplican al original', () => {
|
|
129
|
+
const fs = (0, polynomial_ring_1.factor)((0, polynomial_ring_1.poly)([-1, 0, 1]));
|
|
130
|
+
// Producto de todos los factores reconstruye x² - 1.
|
|
131
|
+
let product = (0, polynomial_ring_1.poly)([1]);
|
|
132
|
+
for (const f of fs)
|
|
133
|
+
product = (0, polynomial_ring_1.multiply)(product, f);
|
|
134
|
+
(0, vitest_1.expect)(coeffs(product)).toEqual([-1n, 0n, 1n]);
|
|
135
|
+
// Y contiene factores lineales (x - 1) y (x + 1) (en algún orden / signo).
|
|
136
|
+
const linearFactors = fs.filter((f) => (0, polynomial_ring_1.degree)(f) === 1);
|
|
137
|
+
(0, vitest_1.expect)(linearFactors.length).toBeGreaterThanOrEqual(2);
|
|
138
|
+
});
|
|
139
|
+
(0, vitest_1.it)('factor reconstruye 2x³ - 2x = 2x(x-1)(x+1)', () => {
|
|
140
|
+
const original = (0, polynomial_ring_1.poly)([0, -2, 0, 2]);
|
|
141
|
+
const fs = (0, polynomial_ring_1.factor)(original);
|
|
142
|
+
let product = (0, polynomial_ring_1.poly)([1]);
|
|
143
|
+
for (const f of fs)
|
|
144
|
+
product = (0, polynomial_ring_1.multiply)(product, f);
|
|
145
|
+
(0, vitest_1.expect)(coeffs(product)).toEqual(coeffs(original));
|
|
146
|
+
});
|
|
147
|
+
(0, vitest_1.it)('isIrreducible(x² + 1) = true en Q[x]', () => {
|
|
148
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.isIrreducible)((0, polynomial_ring_1.poly)([1, 0, 1]))).toBe(true);
|
|
149
|
+
});
|
|
150
|
+
(0, vitest_1.it)('isIrreducible(x² - 1) = false en Q[x] (factoriza)', () => {
|
|
151
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.isIrreducible)((0, polynomial_ring_1.poly)([-1, 0, 1]))).toBe(false);
|
|
152
|
+
});
|
|
153
|
+
(0, vitest_1.it)('isIrreducible(x³ - 2) = true (Eisenstein-friendly, sin raíz racional)', () => {
|
|
154
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.isIrreducible)((0, polynomial_ring_1.poly)([-2, 0, 0, 1]))).toBe(true);
|
|
155
|
+
});
|
|
156
|
+
(0, vitest_1.it)('squareFree de (x-1)²(x+1) divide x², extrae parte sin repetición', () => {
|
|
157
|
+
// p = (x-1)²(x+1) = (x² - 2x + 1)(x+1) = x³ - x² - x + 1.
|
|
158
|
+
const p = (0, polynomial_ring_1.poly)([1, -1, -1, 1]);
|
|
159
|
+
const sf = (0, polynomial_ring_1.squareFree)(p);
|
|
160
|
+
// squareFree debe tener grado ≤ grado(p) y dividir a p.
|
|
161
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.degree)(sf)).toBeLessThanOrEqual((0, polynomial_ring_1.degree)(p));
|
|
162
|
+
// Las raíces 1 y -1 siguen siendo raíces.
|
|
163
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.evaluate)(sf, 1n)).toBe(0n);
|
|
164
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.evaluate)(sf, -1n)).toBe(0n);
|
|
165
|
+
});
|
|
166
|
+
});
|
|
167
|
+
(0, vitest_1.describe)('Polynomial Ring — Berlekamp en Z/p[x]', () => {
|
|
168
|
+
(0, vitest_1.it)('factorInZp(x² - 1, 5) produce factores lineales que reconstruyen el original', () => {
|
|
169
|
+
// En Z/5: x² - 1 ≡ x² + 4 (mod 5) = (x - 1)(x + 1) = (x + 4)(x + 1).
|
|
170
|
+
const fs = (0, polynomial_ring_1.factorInZp)((0, polynomial_ring_1.poly)([-1, 0, 1]), 5n);
|
|
171
|
+
let product = (0, polynomial_ring_1.poly)([1n], 5n);
|
|
172
|
+
for (const f of fs)
|
|
173
|
+
product = (0, polynomial_ring_1.multiply)(product, f);
|
|
174
|
+
// Reducir a Z/5: el polinomio original mod 5 es x² + 4.
|
|
175
|
+
(0, vitest_1.expect)(product.coefficients).toEqual([4n, 0n, 1n]);
|
|
176
|
+
// Debe haber 2 factores lineales monic (lead 1).
|
|
177
|
+
const lineales = fs.filter((f) => (0, polynomial_ring_1.degree)(f) === 1);
|
|
178
|
+
(0, vitest_1.expect)(lineales.length).toBe(2);
|
|
179
|
+
});
|
|
180
|
+
(0, vitest_1.it)('factorInZp(x³ - x, 3) produce factores que reconstruyen el polinomio mod 3', () => {
|
|
181
|
+
// En Z/3: x³ - x = x(x-1)(x+1) = x(x+2)(x+1).
|
|
182
|
+
const fs = (0, polynomial_ring_1.factorInZp)((0, polynomial_ring_1.poly)([0, -1, 0, 1]), 3n);
|
|
183
|
+
let product = (0, polynomial_ring_1.poly)([1n], 3n);
|
|
184
|
+
for (const f of fs)
|
|
185
|
+
product = (0, polynomial_ring_1.multiply)(product, f);
|
|
186
|
+
// x³ - x ≡ x³ + 2x (mod 3).
|
|
187
|
+
(0, vitest_1.expect)(product.coefficients).toEqual([0n, 2n, 0n, 1n]);
|
|
188
|
+
const lineales = fs.filter((f) => (0, polynomial_ring_1.degree)(f) === 1);
|
|
189
|
+
(0, vitest_1.expect)(lineales.length).toBe(3);
|
|
190
|
+
});
|
|
191
|
+
(0, vitest_1.it)('factorInZp(x² + 1, 5) tiene factores lineales (porque 2² = -1 mod 5)', () => {
|
|
192
|
+
// 2² = 4 = -1 mod 5, así que x²+1 = (x-2)(x+2) en Z/5.
|
|
193
|
+
const fs = (0, polynomial_ring_1.factorInZp)((0, polynomial_ring_1.poly)([1, 0, 1]), 5n);
|
|
194
|
+
let product = (0, polynomial_ring_1.poly)([1n], 5n);
|
|
195
|
+
for (const f of fs)
|
|
196
|
+
product = (0, polynomial_ring_1.multiply)(product, f);
|
|
197
|
+
(0, vitest_1.expect)(product.coefficients).toEqual([1n, 0n, 1n]);
|
|
198
|
+
const lineales = fs.filter((f) => (0, polynomial_ring_1.degree)(f) === 1);
|
|
199
|
+
(0, vitest_1.expect)(lineales.length).toBe(2);
|
|
200
|
+
});
|
|
201
|
+
(0, vitest_1.it)('factorInZp(x² + 1, 3) es irreducible (no hay raíz mod 3)', () => {
|
|
202
|
+
// En Z/3: 0²+1=1, 1²+1=2, 2²+1=5≡2 → ninguna raíz.
|
|
203
|
+
const fs = (0, polynomial_ring_1.factorInZp)((0, polynomial_ring_1.poly)([1, 0, 1]), 3n);
|
|
204
|
+
// Debe haber un único factor no-constante de grado 2.
|
|
205
|
+
const nonConst = fs.filter((f) => (0, polynomial_ring_1.degree)(f) >= 1);
|
|
206
|
+
(0, vitest_1.expect)(nonConst.length).toBe(1);
|
|
207
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.degree)(nonConst[0])).toBe(2);
|
|
208
|
+
});
|
|
209
|
+
});
|
|
210
|
+
(0, vitest_1.describe)('Polynomial Ring — resultante y discriminante', () => {
|
|
211
|
+
(0, vitest_1.it)('resultant(x² - 1, x - 1) = 0 (comparten raíz)', () => {
|
|
212
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.resultant)((0, polynomial_ring_1.poly)([-1, 0, 1]), (0, polynomial_ring_1.poly)([-1, 1]))).toBe(0n);
|
|
213
|
+
});
|
|
214
|
+
(0, vitest_1.it)('resultant(x + 1, x - 1) = -2 (Sylvester 2×2 |1,1;1,-1| signo)', () => {
|
|
215
|
+
// res(a,b) para deg(a)=deg(b)=1 es a0*b1 - a1*b0 hasta signo.
|
|
216
|
+
const r = (0, polynomial_ring_1.resultant)((0, polynomial_ring_1.poly)([1, 1]), (0, polynomial_ring_1.poly)([-1, 1]));
|
|
217
|
+
// (x+1) y (x-1) son coprimos, resultante distinto de 0.
|
|
218
|
+
(0, vitest_1.expect)(r).not.toBe(0n);
|
|
219
|
+
});
|
|
220
|
+
(0, vitest_1.it)('discriminant(x² + bx + c) = b² - 4c — caso x² - 5x + 6 = 25 - 24 = 1', () => {
|
|
221
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.discriminant)((0, polynomial_ring_1.poly)([6, -5, 1]))).toBe(1n);
|
|
222
|
+
});
|
|
223
|
+
(0, vitest_1.it)('discriminant(x² - 4) = 16 (b=0, c=-4 → 0 - 4*(-4) = 16)', () => {
|
|
224
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.discriminant)((0, polynomial_ring_1.poly)([-4, 0, 1]))).toBe(16n);
|
|
225
|
+
});
|
|
226
|
+
(0, vitest_1.it)('discriminant(x² + 1) = -4', () => {
|
|
227
|
+
(0, vitest_1.expect)((0, polynomial_ring_1.discriminant)((0, polynomial_ring_1.poly)([1, 0, 1]))).toBe(-4n);
|
|
228
|
+
});
|
|
229
|
+
});
|
|
230
|
+
//# sourceMappingURL=polynomial-ring.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"polynomial-ring.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/polynomial-ring/polynomial-ring.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,wEAqB4C;AAE5C,SAAS,MAAM,CAAC,CAAa;IAC3B,OAAO,CAAC,CAAC,YAAY,CAAC;AACxB,CAAC;AAED,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,IAAA,oCAAkB,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,oCAAkB,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAA,0BAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,CAAC,GAAG,IAAA,0BAAQ,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,IAAA,wBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,qFAAqF;QACrF,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3B,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,IAAA,wBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,IAAA,wBAAM,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,kEAAkE;QAClE,MAAM,CAAC,GAAG,IAAA,qBAAG,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qDAAqD,EAAE,GAAG,EAAE;IACnE,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAA,4BAAU,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,MAAM,CAAC,GAAG,IAAA,4BAAU,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,IAAA,eAAM,EAAC,IAAA,0BAAQ,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,IAAA,eAAM,EAAC,IAAA,0BAAQ,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAG,IAAA,yBAAO,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0DAA0D,EAAE,GAAG,EAAE;IACxE,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,KAAK,GAAG,IAAA,+BAAa,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC;YACpB,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;YACpB,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;SACrB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,IAAA,+BAAa,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC;YACpB,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;YACpB,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;SACrB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,IAAA,eAAM,EAAC,IAAA,+BAAa,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,MAAM,EAAE,GAAG,IAAA,wBAAM,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,qDAAqD;QACrD,IAAI,OAAO,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,OAAO,GAAG,IAAA,0BAAQ,EAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/C,2EAA2E;QAC3E,MAAM,aAAa,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,aAAa,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,QAAQ,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAA,wBAAM,EAAC,QAAQ,CAAC,CAAC;QAC5B,IAAI,OAAO,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,OAAO,GAAG,IAAA,0BAAQ,EAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,IAAA,eAAM,EAAC,IAAA,+BAAa,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,IAAA,eAAM,EAAC,IAAA,+BAAa,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,IAAA,eAAM,EAAC,IAAA,+BAAa,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,0DAA0D;QAC1D,MAAM,CAAC,GAAG,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAA,4BAAU,EAAC,CAAC,CAAC,CAAC;QACzB,wDAAwD;QACxD,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,CAAC,CAAC;QAClD,0CAA0C;QAC1C,IAAA,eAAM,EAAC,IAAA,0BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,0BAAQ,EAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,qEAAqE;QACrE,MAAM,EAAE,GAAG,IAAA,4BAAU,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5C,IAAI,OAAO,GAAG,IAAA,sBAAI,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,OAAO,GAAG,IAAA,0BAAQ,EAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACnD,wDAAwD;QACxD,IAAA,eAAM,EAAC,OAAO,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACnD,iDAAiD;QACjD,MAAM,QAAQ,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4EAA4E,EAAE,GAAG,EAAE;QACpF,8CAA8C;QAC9C,MAAM,EAAE,GAAG,IAAA,4BAAU,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/C,IAAI,OAAO,GAAG,IAAA,sBAAI,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,OAAO,GAAG,IAAA,0BAAQ,EAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACnD,4BAA4B;QAC5B,IAAA,eAAM,EAAC,OAAO,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,uDAAuD;QACvD,MAAM,EAAE,GAAG,IAAA,4BAAU,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3C,IAAI,OAAO,GAAG,IAAA,sBAAI,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,OAAO,GAAG,IAAA,0BAAQ,EAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,OAAO,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,mDAAmD;QACnD,MAAM,EAAE,GAAG,IAAA,4BAAU,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3C,sDAAsD;QACtD,MAAM,QAAQ,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,wBAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,wBAAM,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,IAAA,eAAM,EAAC,IAAA,2BAAS,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,8DAA8D;QAC9D,MAAM,CAAC,GAAG,IAAA,2BAAS,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,wDAAwD;QACxD,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,IAAA,eAAM,EAAC,IAAA,8BAAY,EAAC,IAAA,sBAAI,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"lambda-cube.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/type-theory/lambda-cube/lambda-cube.test.ts"],"names":[],"mappings":""}
|
|
@@ -0,0 +1,266 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const vitest_1 = require("vitest");
|
|
4
|
+
const lambda_cube_1 = require("../../../type-theory/lambda-cube");
|
|
5
|
+
// ---------- Helpers ----------
|
|
6
|
+
function unwrap(r) {
|
|
7
|
+
if ((0, lambda_cube_1.isInferError)(r))
|
|
8
|
+
throw new Error(`unexpected type error: ${r.error}`);
|
|
9
|
+
return r;
|
|
10
|
+
}
|
|
11
|
+
function ruleSet(system) {
|
|
12
|
+
return new Set((0, lambda_cube_1.rulesOf)(system).map((r) => `${r.from},${r.to}`));
|
|
13
|
+
}
|
|
14
|
+
// =============================================================
|
|
15
|
+
// 1. Formation rules — geometría del cubo
|
|
16
|
+
// =============================================================
|
|
17
|
+
(0, vitest_1.describe)('Lambda Cube / formation rules', () => {
|
|
18
|
+
(0, vitest_1.it)('λ→ tiene solo la regla (*,*)', () => {
|
|
19
|
+
const rules = ruleSet('lambda');
|
|
20
|
+
(0, vitest_1.expect)(rules).toEqual(new Set(['*,*']));
|
|
21
|
+
});
|
|
22
|
+
(0, vitest_1.it)('λ2 (System F) tiene (*,*) y (◻,*)', () => {
|
|
23
|
+
const rules = ruleSet('lambda2');
|
|
24
|
+
(0, vitest_1.expect)(rules).toEqual(new Set(['*,*', '◻,*']));
|
|
25
|
+
});
|
|
26
|
+
(0, vitest_1.it)('λω (System Fω) tiene (*,*), (◻,*) y (◻,◻)', () => {
|
|
27
|
+
const rules = ruleSet('lambda-omega');
|
|
28
|
+
(0, vitest_1.expect)(rules).toEqual(new Set(['*,*', '◻,*', '◻,◻']));
|
|
29
|
+
});
|
|
30
|
+
(0, vitest_1.it)('λP (LF) tiene (*,*) y (*,◻)', () => {
|
|
31
|
+
const rules = ruleSet('lambda-P');
|
|
32
|
+
(0, vitest_1.expect)(rules).toEqual(new Set(['*,*', '*,◻']));
|
|
33
|
+
});
|
|
34
|
+
(0, vitest_1.it)('λC (CoC) contiene las 4 reglas de formación', () => {
|
|
35
|
+
const rules = ruleSet('lambda-C');
|
|
36
|
+
(0, vitest_1.expect)(rules).toEqual(new Set(['*,*', '◻,*', '*,◻', '◻,◻']));
|
|
37
|
+
});
|
|
38
|
+
(0, vitest_1.it)('los 8 sistemas son distinguibles por sus reglas', () => {
|
|
39
|
+
const seen = new Set();
|
|
40
|
+
for (const sys of Object.keys(lambda_cube_1.SYSTEMS)) {
|
|
41
|
+
const key = [...ruleSet(sys)].sort().join('|');
|
|
42
|
+
(0, vitest_1.expect)(seen.has(key)).toBe(false);
|
|
43
|
+
seen.add(key);
|
|
44
|
+
}
|
|
45
|
+
(0, vitest_1.expect)(seen.size).toBe(8);
|
|
46
|
+
});
|
|
47
|
+
});
|
|
48
|
+
// =============================================================
|
|
49
|
+
// 2. λ→ — STLC
|
|
50
|
+
// =============================================================
|
|
51
|
+
(0, vitest_1.describe)('Lambda Cube / λ→ (STLC)', () => {
|
|
52
|
+
(0, vitest_1.it)('λ x:P. x tipa como P → P, dado P : *', () => {
|
|
53
|
+
// P es una constante de tipo: la declaramos como variable de tipo *.
|
|
54
|
+
const ctx = (0, lambda_cube_1.extendContext)(new Map(), 'P', lambda_cube_1.cStar);
|
|
55
|
+
const term = (0, lambda_cube_1.cLam)('x', (0, lambda_cube_1.cVar)('P'), (0, lambda_cube_1.cVar)('x'));
|
|
56
|
+
const ty = unwrap((0, lambda_cube_1.inferType)(term, ctx, 'lambda'));
|
|
57
|
+
(0, vitest_1.expect)((0, lambda_cube_1.termToString)(ty)).toBe('P → P');
|
|
58
|
+
});
|
|
59
|
+
(0, vitest_1.it)('λ→ rechaza polimorfismo: λ X:*. λ x:X. x', () => {
|
|
60
|
+
// El binder X:* exige formar Π X:*. ... → regla (◻,*) ∉ λ→.
|
|
61
|
+
const term = (0, lambda_cube_1.polymorphicIdentity)();
|
|
62
|
+
const r = (0, lambda_cube_1.inferType)(term, new Map(), 'lambda');
|
|
63
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)(r)).toBe(true);
|
|
64
|
+
});
|
|
65
|
+
});
|
|
66
|
+
// =============================================================
|
|
67
|
+
// 3. λ2 — System F
|
|
68
|
+
// =============================================================
|
|
69
|
+
(0, vitest_1.describe)('Lambda Cube / λ2 (System F)', () => {
|
|
70
|
+
(0, vitest_1.it)('identidad polimórfica tiene tipo ∀X:*. X → X', () => {
|
|
71
|
+
const term = (0, lambda_cube_1.polymorphicIdentity)();
|
|
72
|
+
const ty = unwrap((0, lambda_cube_1.inferType)(term, new Map(), 'lambda2'));
|
|
73
|
+
(0, vitest_1.expect)((0, lambda_cube_1.alphaBetaEq)(ty, (0, lambda_cube_1.polymorphicIdentityType)(), 'lambda2')).toBe(true);
|
|
74
|
+
});
|
|
75
|
+
(0, vitest_1.it)('aplicación de tipo: (λ X:*. λ x:X. x) P : P → P', () => {
|
|
76
|
+
const ctx = (0, lambda_cube_1.extendContext)(new Map(), 'P', lambda_cube_1.cStar);
|
|
77
|
+
const term = (0, lambda_cube_1.cApp)((0, lambda_cube_1.polymorphicIdentity)(), (0, lambda_cube_1.cVar)('P'));
|
|
78
|
+
const ty = unwrap((0, lambda_cube_1.inferType)(term, ctx, 'lambda2'));
|
|
79
|
+
(0, vitest_1.expect)((0, lambda_cube_1.termToString)((0, lambda_cube_1.normalize)(ty, 'lambda2'))).toBe('P → P');
|
|
80
|
+
});
|
|
81
|
+
(0, vitest_1.it)('Church 3 tipa como Π X:*. (X → X) → X → X', () => {
|
|
82
|
+
const ty = unwrap((0, lambda_cube_1.inferType)((0, lambda_cube_1.churchNumeral)(3), new Map(), 'lambda2'));
|
|
83
|
+
(0, vitest_1.expect)((0, lambda_cube_1.alphaBetaEq)(ty, (0, lambda_cube_1.churchNumeralType)(), 'lambda2')).toBe(true);
|
|
84
|
+
});
|
|
85
|
+
(0, vitest_1.it)('Church 0 también tipa con el mismo esquema', () => {
|
|
86
|
+
const ty = unwrap((0, lambda_cube_1.inferType)((0, lambda_cube_1.churchNumeral)(0), new Map(), 'lambda2'));
|
|
87
|
+
(0, vitest_1.expect)((0, lambda_cube_1.alphaBetaEq)(ty, (0, lambda_cube_1.churchNumeralType)(), 'lambda2')).toBe(true);
|
|
88
|
+
});
|
|
89
|
+
});
|
|
90
|
+
// =============================================================
|
|
91
|
+
// 4. λω — operadores de tipo
|
|
92
|
+
// =============================================================
|
|
93
|
+
(0, vitest_1.describe)('Lambda Cube / λω', () => {
|
|
94
|
+
(0, vitest_1.it)('id-type λ A:*. A → A vive en λω con tipo * → *', () => {
|
|
95
|
+
const ty = unwrap((0, lambda_cube_1.inferType)((0, lambda_cube_1.typeLevelIdentity)(), new Map(), 'lambda-omega'));
|
|
96
|
+
(0, vitest_1.expect)((0, lambda_cube_1.alphaBetaEq)(ty, (0, lambda_cube_1.typeLevelIdentityKind)(), 'lambda-omega')).toBe(true);
|
|
97
|
+
});
|
|
98
|
+
(0, vitest_1.it)('λ→ rechaza el operador de tipo (regla (◻,◻) ausente)', () => {
|
|
99
|
+
const r = (0, lambda_cube_1.inferType)((0, lambda_cube_1.typeLevelIdentity)(), new Map(), 'lambda');
|
|
100
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)(r)).toBe(true);
|
|
101
|
+
});
|
|
102
|
+
});
|
|
103
|
+
// =============================================================
|
|
104
|
+
// 5. λP — tipos dependientes
|
|
105
|
+
// =============================================================
|
|
106
|
+
(0, vitest_1.describe)('Lambda Cube / λP', () => {
|
|
107
|
+
(0, vitest_1.it)('Π n:Nat. Vector n tipa en λP (codominio en *, regla (*,*))', () => {
|
|
108
|
+
// Contexto: Nat : *, Vector : Nat → *.
|
|
109
|
+
let ctx = new Map();
|
|
110
|
+
ctx = (0, lambda_cube_1.extendContext)(ctx, 'Nat', lambda_cube_1.cStar);
|
|
111
|
+
ctx = (0, lambda_cube_1.extendContext)(ctx, 'Vector', (0, lambda_cube_1.cArrow)((0, lambda_cube_1.cVar)('Nat'), lambda_cube_1.cStar));
|
|
112
|
+
const ty = unwrap((0, lambda_cube_1.inferType)((0, lambda_cube_1.dependentList)(), ctx, 'lambda-P'));
|
|
113
|
+
(0, vitest_1.expect)((0, lambda_cube_1.termToString)(ty)).toBe('*');
|
|
114
|
+
});
|
|
115
|
+
(0, vitest_1.it)('predicado Π n:Nat. * necesita regla (*,◻) — vive en ◻ en λP', () => {
|
|
116
|
+
const ctx = (0, lambda_cube_1.extendContext)(new Map(), 'Nat', lambda_cube_1.cStar);
|
|
117
|
+
const ty = unwrap((0, lambda_cube_1.inferType)((0, lambda_cube_1.predicateOverNat)(), ctx, 'lambda-P'));
|
|
118
|
+
(0, vitest_1.expect)((0, lambda_cube_1.termToString)(ty)).toBe('◻');
|
|
119
|
+
});
|
|
120
|
+
(0, vitest_1.it)('λ2 rechaza el predicado Π n:Nat. * (regla (*,◻) ausente)', () => {
|
|
121
|
+
const ctx = (0, lambda_cube_1.extendContext)(new Map(), 'Nat', lambda_cube_1.cStar);
|
|
122
|
+
const r = (0, lambda_cube_1.inferType)((0, lambda_cube_1.predicateOverNat)(), ctx, 'lambda2');
|
|
123
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)(r)).toBe(true);
|
|
124
|
+
});
|
|
125
|
+
(0, vitest_1.it)('λ→ rechaza el predicado Π n:Nat. * (regla (*,◻) ausente)', () => {
|
|
126
|
+
const ctx = (0, lambda_cube_1.extendContext)(new Map(), 'Nat', lambda_cube_1.cStar);
|
|
127
|
+
const r = (0, lambda_cube_1.inferType)((0, lambda_cube_1.predicateOverNat)(), ctx, 'lambda');
|
|
128
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)(r)).toBe(true);
|
|
129
|
+
});
|
|
130
|
+
});
|
|
131
|
+
// =============================================================
|
|
132
|
+
// 6. λC — Calculus of Constructions
|
|
133
|
+
// =============================================================
|
|
134
|
+
(0, vitest_1.describe)('Lambda Cube / λC (Calculus of Constructions)', () => {
|
|
135
|
+
(0, vitest_1.it)('Π A:*. A → A tipa como * en λC', () => {
|
|
136
|
+
const term = (0, lambda_cube_1.cPi)('A', lambda_cube_1.cStar, (0, lambda_cube_1.cArrow)((0, lambda_cube_1.cVar)('A'), (0, lambda_cube_1.cVar)('A')));
|
|
137
|
+
const ty = unwrap((0, lambda_cube_1.inferType)(term, new Map(), 'lambda-C'));
|
|
138
|
+
(0, vitest_1.expect)((0, lambda_cube_1.termToString)(ty)).toBe('*');
|
|
139
|
+
});
|
|
140
|
+
(0, vitest_1.it)('λC habilita construcciones que λ→ rechaza (poly / type-op / dep-type)', () => {
|
|
141
|
+
// (◻,*): identidad polimórfica
|
|
142
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)((0, lambda_cube_1.inferType)((0, lambda_cube_1.polymorphicIdentity)(), new Map(), 'lambda'))).toBe(true);
|
|
143
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)((0, lambda_cube_1.inferType)((0, lambda_cube_1.polymorphicIdentity)(), new Map(), 'lambda-C'))).toBe(false);
|
|
144
|
+
// (◻,◻): operador de tipo
|
|
145
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)((0, lambda_cube_1.inferType)((0, lambda_cube_1.typeLevelIdentity)(), new Map(), 'lambda'))).toBe(true);
|
|
146
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)((0, lambda_cube_1.inferType)((0, lambda_cube_1.typeLevelIdentity)(), new Map(), 'lambda-C'))).toBe(false);
|
|
147
|
+
// (*,◻): predicado Π n:Nat. *
|
|
148
|
+
const ctx = (0, lambda_cube_1.extendContext)(new Map(), 'Nat', lambda_cube_1.cStar);
|
|
149
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)((0, lambda_cube_1.inferType)((0, lambda_cube_1.predicateOverNat)(), ctx, 'lambda'))).toBe(true);
|
|
150
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)((0, lambda_cube_1.inferType)((0, lambda_cube_1.predicateOverNat)(), ctx, 'lambda-C'))).toBe(false);
|
|
151
|
+
});
|
|
152
|
+
});
|
|
153
|
+
// =============================================================
|
|
154
|
+
// 7. Sorts y axioma * : ◻
|
|
155
|
+
// =============================================================
|
|
156
|
+
(0, vitest_1.describe)('Lambda Cube / sorts', () => {
|
|
157
|
+
(0, vitest_1.it)('* tiene tipo ◻', () => {
|
|
158
|
+
const ty = unwrap((0, lambda_cube_1.inferType)(lambda_cube_1.cStar));
|
|
159
|
+
(0, vitest_1.expect)((0, lambda_cube_1.termToString)(ty)).toBe('◻');
|
|
160
|
+
});
|
|
161
|
+
(0, vitest_1.it)('◻ no es tipable (sin axioma)', () => {
|
|
162
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)((0, lambda_cube_1.inferType)(lambda_cube_1.cBox))).toBe(true);
|
|
163
|
+
});
|
|
164
|
+
});
|
|
165
|
+
// =============================================================
|
|
166
|
+
// 8. β-normalización
|
|
167
|
+
// =============================================================
|
|
168
|
+
(0, vitest_1.describe)('Lambda Cube / normalize', () => {
|
|
169
|
+
(0, vitest_1.it)('β-reduce en λ2: (λ X:*. λ x:X. x) [P] (a:P) ⇒ a', () => {
|
|
170
|
+
const ctx = (0, lambda_cube_1.extendContext)((0, lambda_cube_1.extendContext)(new Map(), 'P', lambda_cube_1.cStar), 'a', (0, lambda_cube_1.cVar)('P'));
|
|
171
|
+
// (Λ X. λ x:X. x) P a se codifica como ((id-poly) P) a.
|
|
172
|
+
const idP = (0, lambda_cube_1.cApp)((0, lambda_cube_1.polymorphicIdentity)(), (0, lambda_cube_1.cVar)('P'));
|
|
173
|
+
const idApplied = (0, lambda_cube_1.cApp)(idP, (0, lambda_cube_1.cVar)('a'));
|
|
174
|
+
// El término tipa en λ2 con tipo P (resultado de aplicar la id polimórfica).
|
|
175
|
+
const ty = unwrap((0, lambda_cube_1.inferType)(idApplied, ctx, 'lambda2'));
|
|
176
|
+
(0, vitest_1.expect)((0, lambda_cube_1.termToString)(ty)).toBe('P');
|
|
177
|
+
// Antes de normalizar no está en NF (hay redex).
|
|
178
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isNormal)(idApplied)).toBe(false);
|
|
179
|
+
const nf = (0, lambda_cube_1.normalize)(idApplied, 'lambda2');
|
|
180
|
+
(0, vitest_1.expect)((0, lambda_cube_1.termToString)(nf)).toBe('a');
|
|
181
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isNormal)(nf)).toBe(true);
|
|
182
|
+
});
|
|
183
|
+
(0, vitest_1.it)('checkType usa igualdad β: (id P) ≡ P → P en λ2', () => {
|
|
184
|
+
const ctx = (0, lambda_cube_1.extendContext)(new Map(), 'P', lambda_cube_1.cStar);
|
|
185
|
+
const idType = (0, lambda_cube_1.cApp)((0, lambda_cube_1.typeLevelIdentity)(), (0, lambda_cube_1.cVar)('P'));
|
|
186
|
+
// El tipo computado es (λ A:*. A → A) P, que β-reduce a P → P.
|
|
187
|
+
const reduced = (0, lambda_cube_1.cArrow)((0, lambda_cube_1.cVar)('P'), (0, lambda_cube_1.cVar)('P'));
|
|
188
|
+
(0, vitest_1.expect)((0, lambda_cube_1.alphaBetaEq)(idType, reduced, 'lambda-omega')).toBe(true);
|
|
189
|
+
(0, vitest_1.expect)((0, lambda_cube_1.checkType)(reduced, lambda_cube_1.cStar, ctx, 'lambda-omega')).toBe(true);
|
|
190
|
+
});
|
|
191
|
+
});
|
|
192
|
+
// =============================================================
|
|
193
|
+
// 9. Erasure
|
|
194
|
+
// =============================================================
|
|
195
|
+
(0, vitest_1.describe)('Lambda Cube / erase', () => {
|
|
196
|
+
(0, vitest_1.it)('erase de id polimórfica produce λX. λx. x en λ-untyped', () => {
|
|
197
|
+
const e = (0, lambda_cube_1.erase)((0, lambda_cube_1.polymorphicIdentity)());
|
|
198
|
+
if ((0, lambda_cube_1.isEraseError)(e))
|
|
199
|
+
throw new Error(e.error);
|
|
200
|
+
(0, vitest_1.expect)(e.kind).toBe('abs');
|
|
201
|
+
if (e.kind !== 'abs')
|
|
202
|
+
return;
|
|
203
|
+
(0, vitest_1.expect)(e.body.kind).toBe('abs');
|
|
204
|
+
});
|
|
205
|
+
(0, vitest_1.it)('erase de Church-3 produce λX. λs. λz. s(s(s z))', () => {
|
|
206
|
+
const e = (0, lambda_cube_1.erase)((0, lambda_cube_1.churchNumeral)(3));
|
|
207
|
+
if ((0, lambda_cube_1.isEraseError)(e))
|
|
208
|
+
throw new Error(e.error);
|
|
209
|
+
// Esperamos 3 abstracciones anidadas y 3 aplicaciones de s sobre z.
|
|
210
|
+
let depth = 0;
|
|
211
|
+
let cur = e;
|
|
212
|
+
while (cur.kind === 'abs') {
|
|
213
|
+
depth++;
|
|
214
|
+
cur = cur.body;
|
|
215
|
+
}
|
|
216
|
+
(0, vitest_1.expect)(depth).toBe(3);
|
|
217
|
+
});
|
|
218
|
+
(0, vitest_1.it)('erase falla sobre un sort solitario', () => {
|
|
219
|
+
const r = (0, lambda_cube_1.erase)(lambda_cube_1.cStar);
|
|
220
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isEraseError)(r)).toBe(true);
|
|
221
|
+
});
|
|
222
|
+
});
|
|
223
|
+
// =============================================================
|
|
224
|
+
// 10. Errores de tipado
|
|
225
|
+
// =============================================================
|
|
226
|
+
(0, vitest_1.describe)('Lambda Cube / errores', () => {
|
|
227
|
+
(0, vitest_1.it)('aplicación con argumento mal tipado es rechazada', () => {
|
|
228
|
+
// (λ x:P. x) Q donde P,Q son distintos tipos atómicos.
|
|
229
|
+
let ctx = new Map();
|
|
230
|
+
ctx = (0, lambda_cube_1.extendContext)(ctx, 'P', lambda_cube_1.cStar);
|
|
231
|
+
ctx = (0, lambda_cube_1.extendContext)(ctx, 'Q', lambda_cube_1.cStar);
|
|
232
|
+
ctx = (0, lambda_cube_1.extendContext)(ctx, 'q', (0, lambda_cube_1.cVar)('Q'));
|
|
233
|
+
const term = (0, lambda_cube_1.cApp)((0, lambda_cube_1.cLam)('x', (0, lambda_cube_1.cVar)('P'), (0, lambda_cube_1.cVar)('x')), (0, lambda_cube_1.cVar)('q'));
|
|
234
|
+
const r = (0, lambda_cube_1.inferType)(term, ctx, 'lambda');
|
|
235
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)(r)).toBe(true);
|
|
236
|
+
});
|
|
237
|
+
(0, vitest_1.it)('variable libre sin binding es rechazada', () => {
|
|
238
|
+
const r = (0, lambda_cube_1.inferType)((0, lambda_cube_1.cVar)('libre'), new Map(), 'lambda-C');
|
|
239
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)(r)).toBe(true);
|
|
240
|
+
});
|
|
241
|
+
(0, vitest_1.it)('aplicar algo que no es Π falla', () => {
|
|
242
|
+
// x P donde x : * (un sort no es función).
|
|
243
|
+
const ctx = (0, lambda_cube_1.extendContext)(new Map(), 'x', lambda_cube_1.cStar);
|
|
244
|
+
const r = (0, lambda_cube_1.inferType)((0, lambda_cube_1.cApp)((0, lambda_cube_1.cVar)('x'), lambda_cube_1.cStar), ctx, 'lambda-C');
|
|
245
|
+
(0, vitest_1.expect)((0, lambda_cube_1.isInferError)(r)).toBe(true);
|
|
246
|
+
});
|
|
247
|
+
});
|
|
248
|
+
// =============================================================
|
|
249
|
+
// 11. Cross-system: hasRule / inclusiones
|
|
250
|
+
// =============================================================
|
|
251
|
+
(0, vitest_1.describe)('Lambda Cube / inclusiones', () => {
|
|
252
|
+
(0, vitest_1.it)('λC incluye todas las reglas de los otros 7 sistemas', () => {
|
|
253
|
+
for (const sys of Object.keys(lambda_cube_1.SYSTEMS)) {
|
|
254
|
+
for (const r of (0, lambda_cube_1.rulesOf)(sys)) {
|
|
255
|
+
(0, vitest_1.expect)((0, lambda_cube_1.hasRule)('lambda-C', r.from, r.to)).toBe(true);
|
|
256
|
+
}
|
|
257
|
+
}
|
|
258
|
+
});
|
|
259
|
+
(0, vitest_1.it)('λ→ es el subsistema más pequeño', () => {
|
|
260
|
+
for (const sys of Object.keys(lambda_cube_1.SYSTEMS)) {
|
|
261
|
+
// (*, *) está en todo el cubo.
|
|
262
|
+
(0, vitest_1.expect)((0, lambda_cube_1.hasRule)(sys, '*', '*')).toBe(true);
|
|
263
|
+
}
|
|
264
|
+
});
|
|
265
|
+
});
|
|
266
|
+
//# sourceMappingURL=lambda-cube.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"lambda-cube.test.js","sourceRoot":"","sources":["../../../../src/tests/type-theory/lambda-cube/lambda-cube.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,kEAgC0C;AAE1C,gCAAgC;AAEhC,SAAS,MAAM,CAAC,CAAc;IAC5B,IAAI,IAAA,0BAAY,EAAC,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IAC1E,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,OAAO,CAAC,MAAqC;IACpD,OAAO,IAAI,GAAG,CAAC,IAAA,qBAAO,EAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AAClE,CAAC;AAED,gEAAgE;AAChE,0CAA0C;AAC1C,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,qBAAO,CAAgC,EAAE,CAAC;YACtE,MAAM,GAAG,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/C,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,eAAe;AACf,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,qEAAqE;QACrE,MAAM,GAAG,GAAgB,IAAA,2BAAa,EAAC,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,mBAAK,CAAC,CAAC;QAC9D,MAAM,IAAI,GAAG,IAAA,kBAAI,EAAC,GAAG,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,6DAA6D;QAC7D,MAAM,IAAI,GAAG,IAAA,iCAAmB,GAAE,CAAC;QACnC,MAAM,CAAC,GAAG,IAAA,uBAAS,EAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,mBAAmB;AACnB,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,IAAI,GAAG,IAAA,iCAAmB,GAAE,CAAC;QACnC,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,EAAE,EAAE,IAAA,qCAAuB,GAAE,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,GAAG,GAAG,IAAA,2BAAa,EAAC,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,mBAAK,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,IAAA,kBAAI,EAAC,IAAA,iCAAmB,GAAE,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACpD,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,IAAI,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,uBAAS,EAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,IAAA,2BAAa,EAAC,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,EAAE,EAAE,IAAA,+BAAiB,GAAE,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,IAAA,2BAAa,EAAC,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,EAAE,EAAE,IAAA,+BAAiB,GAAE,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,6BAA6B;AAC7B,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,IAAA,+BAAiB,GAAE,EAAE,IAAI,GAAG,EAAE,EAAE,cAAc,CAAC,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,EAAE,EAAE,IAAA,mCAAqB,GAAE,EAAE,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,CAAC,GAAG,IAAA,uBAAS,EAAC,IAAA,+BAAiB,GAAE,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,6BAA6B;AAC7B,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,wCAAwC;QACxC,IAAI,GAAG,GAAgB,IAAI,GAAG,EAAE,CAAC;QACjC,GAAG,GAAG,IAAA,2BAAa,EAAC,GAAG,EAAE,KAAK,EAAE,mBAAK,CAAC,CAAC;QACvC,GAAG,GAAG,IAAA,2BAAa,EAAC,GAAG,EAAE,QAAQ,EAAE,IAAA,oBAAM,EAAC,IAAA,kBAAI,EAAC,KAAK,CAAC,EAAE,mBAAK,CAAC,CAAC,CAAC;QAC/D,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,IAAA,2BAAa,GAAE,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,GAAG,GAAG,IAAA,2BAAa,EAAC,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,mBAAK,CAAC,CAAC;QACnD,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,IAAA,8BAAgB,GAAE,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,GAAG,GAAG,IAAA,2BAAa,EAAC,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,mBAAK,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,IAAA,uBAAS,EAAC,IAAA,8BAAgB,GAAE,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,GAAG,GAAG,IAAA,2BAAa,EAAC,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,mBAAK,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,IAAA,uBAAS,EAAC,IAAA,8BAAgB,GAAE,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,oCAAoC;AACpC,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,mBAAK,EAAE,IAAA,oBAAM,EAAC,IAAA,kBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,+BAA+B;QAC/B,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,uBAAS,EAAC,IAAA,iCAAmB,GAAE,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvF,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,uBAAS,EAAC,IAAA,iCAAmB,GAAE,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1F,0BAA0B;QAC1B,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,uBAAS,EAAC,IAAA,+BAAiB,GAAE,EAAE,IAAI,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrF,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,uBAAS,EAAC,IAAA,+BAAiB,GAAE,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxF,8BAA8B;QAC9B,MAAM,GAAG,GAAG,IAAA,2BAAa,EAAC,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,mBAAK,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,uBAAS,EAAC,IAAA,8BAAgB,GAAE,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9E,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,uBAAS,EAAC,IAAA,8BAAgB,GAAE,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,0BAA0B;AAC1B,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,IAAA,WAAE,EAAC,gBAAgB,EAAE,GAAG,EAAE;QACxB,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,mBAAK,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,uBAAS,EAAC,kBAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,qBAAqB;AACrB,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,GAAG,GAAgB,IAAA,2BAAa,EAAC,IAAA,2BAAa,EAAC,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,mBAAK,CAAC,EAAE,GAAG,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QAC7F,wDAAwD;QACxD,MAAM,GAAG,GAAG,IAAA,kBAAI,EAAC,IAAA,iCAAmB,GAAE,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,IAAA,kBAAI,EAAC,GAAG,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACvC,6EAA6E;QAC7E,MAAM,EAAE,GAAG,MAAM,CAAC,IAAA,uBAAS,EAAC,SAAS,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnC,iDAAiD;QACjD,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,IAAA,uBAAS,EAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,IAAA,2BAAa,EAAC,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,mBAAK,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,kBAAI,EAAC,IAAA,+BAAiB,GAAE,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACpD,+DAA+D;QAC/D,MAAM,OAAO,GAAG,IAAA,oBAAM,EAAC,IAAA,kBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAA,yBAAW,EAAC,MAAM,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,IAAA,uBAAS,EAAC,OAAO,EAAE,mBAAK,EAAE,GAAG,EAAE,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,aAAa;AACb,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,IAAA,mBAAK,EAAC,IAAA,iCAAmB,GAAE,CAAC,CAAC;QACvC,IAAI,IAAA,0BAAY,EAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;YAAE,OAAO;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,IAAA,mBAAK,EAAC,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,IAAA,0BAAY,EAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9C,oEAAoE;QACpE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,GAAG,GAAa,CAAC,CAAC;QACtB,OAAO,GAAG,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC1B,KAAK,EAAE,CAAC;YACR,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC;QACjB,CAAC;QACD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,GAAG,IAAA,mBAAK,EAAC,mBAAK,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,wBAAwB;AACxB,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,uDAAuD;QACvD,IAAI,GAAG,GAAgB,IAAI,GAAG,EAAE,CAAC;QACjC,GAAG,GAAG,IAAA,2BAAa,EAAC,GAAG,EAAE,GAAG,EAAE,mBAAK,CAAC,CAAC;QACrC,GAAG,GAAG,IAAA,2BAAa,EAAC,GAAG,EAAE,GAAG,EAAE,mBAAK,CAAC,CAAC;QACrC,GAAG,GAAG,IAAA,2BAAa,EAAC,GAAG,EAAE,GAAG,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,IAAA,kBAAI,EAAC,IAAA,kBAAI,EAAC,GAAG,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,kBAAI,EAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,IAAA,uBAAS,EAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,IAAA,uBAAS,EAAC,IAAA,kBAAI,EAAC,OAAO,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,6CAA6C;QAC7C,MAAM,GAAG,GAAG,IAAA,2BAAa,EAAC,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,mBAAK,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,IAAA,uBAAS,EAAC,IAAA,kBAAI,EAAC,IAAA,kBAAI,EAAC,GAAG,CAAC,EAAE,mBAAK,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAChE,0CAA0C;AAC1C,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,qBAAO,CAAgC,EAAE,CAAC;YACtE,KAAK,MAAM,CAAC,IAAI,IAAA,qBAAO,EAAC,GAAG,CAAC,EAAE,CAAC;gBAC7B,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,UAAU,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,qBAAO,CAAgC,EAAE,CAAC;YACtE,+BAA+B;YAC/B,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1,26 @@
|
|
|
1
|
+
import type { CubeTerm } from './types';
|
|
2
|
+
export type UntypedTerm = {
|
|
3
|
+
kind: 'var';
|
|
4
|
+
name: string;
|
|
5
|
+
} | {
|
|
6
|
+
kind: 'abs';
|
|
7
|
+
param: string;
|
|
8
|
+
body: UntypedTerm;
|
|
9
|
+
} | {
|
|
10
|
+
kind: 'app';
|
|
11
|
+
fn: UntypedTerm;
|
|
12
|
+
arg: UntypedTerm;
|
|
13
|
+
};
|
|
14
|
+
export interface EraseError {
|
|
15
|
+
error: string;
|
|
16
|
+
}
|
|
17
|
+
export declare function isEraseError(r: UntypedTerm | EraseError): r is EraseError;
|
|
18
|
+
/**
|
|
19
|
+
* Borrado total a λ-cálculo no tipado. Sorts y Π no tienen
|
|
20
|
+
* representante runtime — si aparecen como sub-término principal,
|
|
21
|
+
* el resultado es un error de borrado.
|
|
22
|
+
*/
|
|
23
|
+
export declare function erase(term: CubeTerm): UntypedTerm | EraseError;
|
|
24
|
+
/** Serialización legible del λ-untyped. */
|
|
25
|
+
export declare function untypedToString(t: UntypedTerm): string;
|
|
26
|
+
//# sourceMappingURL=erase.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"erase.d.ts","sourceRoot":"","sources":["../../../src/type-theory/lambda-cube/erase.ts"],"names":[],"mappings":"AAiBA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC,MAAM,MAAM,WAAW,GACnB;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC7B;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,WAAW,CAAA;CAAE,GACjD;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,EAAE,EAAE,WAAW,CAAC;IAAC,GAAG,EAAE,WAAW,CAAA;CAAE,CAAC;AAEvD,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,WAAW,GAAG,UAAU,GAAG,CAAC,IAAI,UAAU,CAEzE;AAED;;;;GAIG;AACH,wBAAgB,KAAK,CAAC,IAAI,EAAE,QAAQ,GAAG,WAAW,GAAG,UAAU,CAqB9D;AAED,2CAA2C;AAC3C,wBAAgB,eAAe,CAAC,CAAC,EAAE,WAAW,GAAG,MAAM,CAWtD"}
|