eyeling 1.34.3 → 1.34.5

package/lib/eyelang/builtins/matrix.js

@@ -1,226 +0,0 @@
-// Small dense-matrix arithmetic builtins.
-// These are reusable numeric kernels for ground matrices; when arguments are not
-// ground proper numeric lists, user-defined matrix predicates remain available.
-import { deref, isDecimalInteger, listFromItems, numberTerm, numberTextFromDouble, parseFiniteNumber, properListItems, unify } from '../term.js';
-
-export const matrixBuiltins = {
-  register(registry) {
-    registry.add('matrix_sum', 2, matrixSum, { deterministic: true, fallbackWhenNotReady: true, ready: matrixPairReady });
-    registry.add('matrix_multiply', 2, matrixMultiply, { deterministic: true, fallbackWhenNotReady: true, ready: matrixPairReady });
-    registry.add('cholesky_decomposition', 2, choleskyDecomposition, { deterministic: true, fallbackWhenNotReady: true, ready: firstMatrixReady });
-    registry.add('determinant', 2, determinant, { deterministic: true, fallbackWhenNotReady: true, ready: firstMatrixReady });
-    registry.add('matrix_inv_triang', 2, matrixInvTriang, { deterministic: true, fallbackWhenNotReady: true, ready: firstMatrixReady });
-    registry.add('matrix_inversion', 2, matrixInversion, { deterministic: true, fallbackWhenNotReady: true, ready: firstMatrixReady });
-  }
-};
-
-function firstMatrixReady(goal, env) { return parseMatrix(goal.args[0], env) !== null; }
-function matrixPairReady(goal, env) { return parseMatrixPair(goal.args[0], env) !== null; }
-
-function* matrixSum({ goal, env }) {
-  const pair = parseMatrixPair(goal.args[0], env);
-  if (!pair) return;
-  const [a, b] = pair;
-  if (!sameShape(a, b)) return;
-  const out = a.map((row, i) => row.map((cell, j) => addNum(cell, b[i][j])));
-  yield* unifyMatrix(goal.args[1], out, env);
-}
-
-function* matrixMultiply({ goal, env }) {
-  const pair = parseMatrixPair(goal.args[0], env);
-  if (!pair) return;
-  const out = multiplyMatrices(pair[0], pair[1]);
-  if (!out) return;
-  yield* unifyMatrix(goal.args[1], out, env);
-}
-
-function* choleskyDecomposition({ goal, env }) {
-  const matrix = parseMatrix(goal.args[0], env);
-  const out = cholesky(matrix);
-  if (!out) return;
-  yield* unifyMatrix(goal.args[1], out, env);
-}
-
-function* determinant({ goal, env }) {
-  const matrix = parseMatrix(goal.args[0], env);
-  const l = cholesky(matrix);
-  if (!l) return;
-  let prod = num(1n);
-  for (let i = l.length - 1; i >= 0; i--) prod = mulNum(l[i][i], prod);
-  const det = mulNum(prod, prod);
-  const next = env.clone();
-  if (unify(goal.args[1], numTerm(det), next)) yield next;
-}
-
-function* matrixInvTriang({ goal, env }) {
-  const matrix = parseMatrix(goal.args[0], env);
-  const out = invertLowerTriangular(matrix);
-  if (!out) return;
-  yield* unifyMatrix(goal.args[1], out, env);
-}
-
-function* matrixInversion({ goal, env }) {
-  const matrix = parseMatrix(goal.args[0], env);
-  const l = cholesky(matrix);
-  if (!l) return;
-  const li = invertLowerTriangular(l);
-  if (!li) return;
-  const lit = transpose(li);
-  const out = multiplyMatrices(lit, li);
-  if (!out) return;
-  yield* unifyMatrix(goal.args[1], out, env);
-}
-
-function cholesky(a) {
-  if (!isSquare(a)) return null;
-  const n = a.length;
-  const l = Array.from({ length: n }, () => Array.from({ length: n }, () => num(0n)));
-  for (let i = 0; i < n; i++) {
-    for (let j = 0; j <= i; j++) {
-      let sum = num(0n);
-      for (let k = 0; k < j; k++) sum = addNum(sum, mulNum(l[i][k], l[j][k]));
-      if (j === i) {
-        const v2 = subNum(a[i][i], sum);
-        const v = Math.sqrt(toNumber(v2));
-        if (!Number.isFinite(v)) return null;
-        l[i][j] = num(v);
-      } else {
-        const numerator = subNum(a[i][j], sum);
-        l[i][j] = divNum(numerator, l[j][j]);
-      }
-    }
-  }
-  return l;
-}
-
-function invertLowerTriangular(l) {
-  if (!isSquare(l)) return null;
-  const n = l.length;
-  const previous = [];
-  const out = [];
-  for (let i = 0; i < n; i++) {
-    const row = [];
-    for (let j = 0; j < n; j++) {
-      if (j > i) row.push(num(0n));
-      else if (i === j) row.push(divNum(num(1), l[i][i]));
-      else {
-        let sum = num(0n);
-        for (let k = j; k < i; k++) sum = addNum(sum, mulNum(l[i][k], previous[k][j]));
-        row.push(divNum(negNum(sum), l[i][i]));
-      }
-    }
-    previous.push(row);
-    out.push(row);
-  }
-  return out;
-}
-
-function multiplyMatrices(a, b) {
-  if (!a.length || !b.length || !a[0].length || !b[0].length) return null;
-  const rows = a.length, inner = a[0].length, cols = b[0].length;
-  if (b.length !== inner || a.some((row) => row.length !== inner) || b.some((row) => row.length !== cols)) return null;
-  const out = [];
-  for (let i = 0; i < rows; i++) {
-    const row = [];
-    for (let j = 0; j < cols; j++) {
-      let total = num(0n);
-      for (let k = inner - 1; k >= 0; k--) total = addNum(mulNum(a[i][k], b[k][j]), total);
-      row.push(total);
-    }
-    out.push(row);
-  }
-  return out;
-}
-
-function transpose(a) {
-  if (!a.length) return [];
-  return a[0].map((_, i) => a.map((row) => row[i]));
-}
-
-function sameShape(a, b) {
-  return a.length === b.length && a.every((row, i) => row.length === b[i].length);
-}
-
-function isSquare(a) {
-  return Array.isArray(a) && a.length > 0 && a.every((row) => row.length === a.length);
-}
-
-function parseMatrixPair(term, env) {
-  const pair = properListItems(term, env);
-  if (!pair || pair.length !== 2) return null;
-  const a = parseMatrix(pair[0], env), b = parseMatrix(pair[1], env);
-  return a && b ? [a, b] : null;
-}
-
-function parseMatrix(term, env) {
-  const rows = properListItems(term, env);
-  if (!rows) return null;
-  const matrix = [];
-  let width = null;
-  for (const rowTerm of rows) {
-    const rowItems = properListItems(rowTerm, env);
-    if (!rowItems) return null;
-    if (width == null) width = rowItems.length;
-    else if (width !== rowItems.length) return null;
-    const row = [];
-    for (const item of rowItems) {
-      const n = parseNum(item, env);
-      if (!n) return null;
-      row.push(n);
-    }
-    matrix.push(row);
-  }
-  return matrix;
-}
-
-function parseNum(term, env) {
-  const value = deref(term, env);
-  if (value.type !== 'number') return null;
-  if (isDecimalInteger(value.name)) return num(BigInt(value.name));
-  const f = parseFiniteNumber(value.name);
-  return f == null ? null : num(f);
-}
-
-function* unifyMatrix(target, matrix, env) {
-  const next = env.clone();
-  if (unify(target, matrixTerm(matrix), next)) yield next;
-}
-
-function matrixTerm(matrix) {
-  return listFromItems(matrix.map((row) => listFromItems(row.map(numTerm))));
-}
-
-function numTerm(value) {
-  if (value.kind === 'int') return numberTerm(value.value.toString());
-  return numberTerm(numberTextFromDouble(value.value));
-}
-
-function num(value) {
-  return typeof value === 'bigint' ? { kind: 'int', value } : { kind: 'float', value: Number(value) };
-}
-
-function toNumber(value) {
-  return value.kind === 'int' ? Number(value.value) : value.value;
-}
-
-function addNum(a, b) {
-  if (a.kind === 'int' && b.kind === 'int') return num(a.value + b.value);
-  return num(toNumber(a) + toNumber(b));
-}
-function subNum(a, b) {
-  if (a.kind === 'int' && b.kind === 'int') return num(a.value - b.value);
-  return num(toNumber(a) - toNumber(b));
-}
-function mulNum(a, b) {
-  if (a.kind === 'int' && b.kind === 'int') return num(a.value * b.value);
-  return num(toNumber(a) * toNumber(b));
-}
-function divNum(a, b) {
-  if (b.kind === 'int' && b.value === 0n) return num(Number.NaN);
-  if (b.kind === 'float' && b.value === 0) return num(Number.NaN);
-  if (a.kind === 'int' && b.kind === 'int' && a.value % b.value === 0n) return num(a.value / b.value);
-  return num(toNumber(a) / toNumber(b));
-}
-function negNum(a) {
-  return a.kind === 'int' ? num(-a.value) : num(-a.value);
-}

package/lib/eyelang/builtins/number-theory.js

@@ -1,114 +0,0 @@
-// Integer number-theory helpers for examples that would otherwise encode
-// arithmetic algorithms with many small recursive rule calls.
-// The predicates are intentionally general: extended GCD, Collatz trajectories,
-// Kaprekar iteration counts, and Goldbach pair generation.
-import { deref, listFromItems, numberTerm, unify } from '../term.js';
-
-export const numberTheoryBuiltins = {
-  register(registry) {
-    registry.add('extended_gcd', 5, extendedGcd, { deterministic: true, fallbackWhenNotReady: true, ready: firstTwoIntsReady });
-    registry.add('collatz_trajectory', 2, collatzTrajectory, { deterministic: true, fallbackWhenNotReady: true, ready: firstIntReady });
-    registry.add('kaprekar_steps', 2, kaprekarSteps, { deterministic: true, fallbackWhenNotReady: true, ready: firstIntReady });
-    registry.add('goldbach_pair', 3, goldbachPair, { fallbackWhenNotReady: true, ready: firstIntReady });
-  }
-};
-
-function firstIntReady(goal, env) { return intValue(goal.args[0], env) !== null; }
-function firstTwoIntsReady(goal, env) { return intValue(goal.args[0], env) !== null && intValue(goal.args[1], env) !== null; }
-
-function* extendedGcd({ goal, env }) {
-  const a = intValue(goal.args[0], env);
-  const b = intValue(goal.args[1], env);
-  if (a === null || b === null) return;
-  const { gcd, s, t } = egcdSigned(a, b);
-  const next = env.clone();
-  if (unify(goal.args[2], numberTerm(gcd.toString()), next) &&
-      unify(goal.args[3], numberTerm(s.toString()), next) &&
-      unify(goal.args[4], numberTerm(t.toString()), next)) yield next;
-}
-
-function egcdSigned(a, b) {
-  const signA = a < 0n ? -1n : 1n;
-  const signB = b < 0n ? -1n : 1n;
-  let oldR = absBigInt(a), r = absBigInt(b);
-  let oldS = 1n, s = 0n;
-  let oldT = 0n, t = 1n;
-  while (r !== 0n) {
-    const q = oldR / r;
-    [oldR, r] = [r, oldR - q * r];
-    [oldS, s] = [s, oldS - q * s];
-    [oldT, t] = [t, oldT - q * t];
-  }
-  return { gcd: oldR, s: oldS * signA, t: oldT * signB };
-}
-
-function absBigInt(n) { return n < 0n ? -n : n; }
-
-function* collatzTrajectory({ goal, env }) {
-  const n = intValue(goal.args[0], env);
-  if (n === null || n < 1n) return;
-  const seen = [];
-  let current = n;
-  while (current >= 1n) {
-    seen.push(numberTerm(current.toString()));
-    if (current === 1n) break;
-    current = current % 2n === 0n ? current / 2n : current * 3n + 1n;
-    if (seen.length > 100000) return;
-  }
-  const next = env.clone();
-  if (unify(goal.args[1], listFromItems(seen), next)) yield next;
-}
-
-function* kaprekarSteps({ goal, env }) {
-  const n = intValue(goal.args[0], env);
-  if (n === null || n < 0n || n > 9999n) return;
-  const count = kaprekarCount(Number(n));
-  if (count === null) return;
-  const next = env.clone();
-  if (unify(goal.args[1], numberTerm(String(count)), next)) yield next;
-}
-
-function kaprekarCount(start) {
-  if (start === 6174) return 0;
-  let current = start;
-  for (let count = 1; count <= 100; count++) {
-    const digits = String(current).padStart(4, '0').slice(-4).split('').map(Number).sort((a, b) => a - b);
-    const low = digitsToNumber(digits);
-    const high = digitsToNumber([...digits].reverse());
-    current = high - low;
-    if (current === 6174) return count;
-    if (current <= 0) return null;
-  }
-  return null;
-}
-
-function digitsToNumber(digits) {
-  return (((digits[0] * 10 + digits[1]) * 10 + digits[2]) * 10 + digits[3]);
-}
-
-function* goldbachPair({ goal, env }) {
-  const n = intValue(goal.args[0], env);
-  if (n === null || n < 4n || n % 2n !== 0n || n > BigInt(Number.MAX_SAFE_INTEGER)) return;
-  const limit = Number(n / 2n);
-  const total = Number(n);
-  for (let p = 2; p <= limit; p = p === 2 ? 3 : p + 2) {
-    const q = total - p;
-    if (!isPrimeNumber(p) || !isPrimeNumber(q)) continue;
-    const next = env.clone();
-    if (unify(goal.args[1], numberTerm(String(p)), next) && unify(goal.args[2], numberTerm(String(q)), next)) yield next;
-  }
-}
-
-function isPrimeNumber(n) {
-  if (n < 2) return false;
-  if (n === 2) return true;
-  if (n % 2 === 0) return false;
-  for (let d = 3; d <= Math.floor(Math.sqrt(n)); d += 2) if (n % d === 0) return false;
-  return true;
-}
-
-function intValue(term, env) {
-  const value = deref(term, env);
-  if (value.type !== 'number' || !/^-?\d+$/.test(value.name)) return null;
-  return BigInt(value.name);
-}

package/test/eyelang/conformance/cases/extension/036_extended_gcd.pl

@@ -1,3 +0,0 @@
-% Reference 9.2: extended_gcd/5 returns gcd and Bezout coefficients.
-answer(gcd, result(G, S, T)) :- extended_gcd(240, 46, G, S, T).
-materialize(answer, 2).

package/test/eyelang/conformance/cases/extension/037_collatz_trajectory.pl

@@ -1,3 +0,0 @@
-% Reference 9.2: collatz_trajectory/2 returns the full path to 1.
-answer(path, T) :- collatz_trajectory(6, T).
-materialize(answer, 2).

package/test/eyelang/conformance/cases/extension/038_kaprekar_steps.pl

@@ -1,3 +0,0 @@
-% Reference 9.2: kaprekar_steps/2 counts iterations to 6174.
-answer(steps, N) :- kaprekar_steps(3524, N).
-materialize(answer, 2).

package/test/eyelang/conformance/cases/extension/039_goldbach_pair.pl

@@ -1,3 +0,0 @@
-% Reference 9.2: goldbach_pair/3 enumerates prime decompositions in ascending first prime order.
-answer(pair, pair(P, Q)) :- goldbach_pair(28, P, Q).
-materialize(answer, 2).

package/test/eyelang/conformance/cases/extension/040_matrix_operations.pl

@@ -1,5 +0,0 @@
-% Reference 9.2: matrix helpers handle small ground numeric matrices.
-answer(sum, M) :- matrix_sum([[[1, 2], [3, 4]], [[5, 6], [7, 8]]], M).
-answer(product, M) :- matrix_multiply([[[1, 2], [3, 4]], [[2, 0], [1, 2]]], M).
-answer(determinant, D) :- determinant([[4, 2], [2, 3]], D).
-materialize(answer, 2).

package/test/eyelang/conformance/expected/extension/036_extended_gcd.out

@@ -1 +0,0 @@
-answer(gcd, result(2, -9, 47)).

package/test/eyelang/conformance/expected/extension/037_collatz_trajectory.out

@@ -1 +0,0 @@
-answer(path, [6, 3, 10, 5, 16, 8, 4, 2, 1]).

package/test/eyelang/conformance/expected/extension/038_kaprekar_steps.out

@@ -1 +0,0 @@
-answer(steps, 3).

package/test/eyelang/conformance/expected/extension/039_goldbach_pair.out

@@ -1,2 +0,0 @@
-answer(pair, pair(5, 23)).
-answer(pair, pair(11, 17)).

package/test/eyelang/conformance/expected/extension/040_matrix_operations.out

@@ -1,3 +0,0 @@
-answer(sum, [[6, 8], [10, 12]]).
-answer(product, [[4, 4], [10, 8]]).
-answer(determinant, 8.0000000000000018).