eyeling 1.34.2 → 1.34.4

package/examples/eyelang/output/matrix.pl

@@ -1,10 +0,0 @@
-result(det3, determinant([[2, -1, 0], [-1, 2, -1], [0, -1, 2]], 4.0)).
-result(inv3, matrix_inversion([[2, -1, 0], [-1, 2, -1], [0, -1, 2]], [[0.74999999999999978, 0.5, 0.25], [0.5, 1.0000000000000004, 0.50000000000000022], [0.25, 0.50000000000000022, 0.75000000000000011]])).
-result(inv4, matrix_inversion([[18, 22, 54, 42], [22, 70, 86, 62], [54, 86, 174, 134], [42, 62, 134, 106]], [[2.5156250000000067, 0.48437500000000011, -1.2968749999999987, 0.35937499999999561], [0.48437500000000011, 0.14062499999999961, -0.32812499999999822, 0.14062499999999797], [-1.2968749999999987, -0.32812499999999822, 1.0156249999999925, -0.57812499999999201], [0.35937499999999561, 0.14062499999999797, -0.57812499999999201, 0.51562499999999278]])).
-result(invtri3, matrix_inv_triang([[2, 0, 0], [-1, 2, 0], [0, -1, 2]], [[0.5, 0, 0], [0.25, 0.5, 0], [0.125, 0.25, 0.5]])).
-result(mul_small, matrix_multiply([[[1, 2], [3, 4], [5, 6]], [[1, 1, 1], [1, 1, 1]]], [[3, 3, 3], [7, 7, 7], [11, 11, 11]])).
-result(mul_identity_check, matrix_multiply([[[18, 22, 54, 42], [22, 70, 86, 62], [54, 86, 174, 134], [42, 62, 134, 106]], [[2.515624999999984, 0.4843749999999933, -1.296874999999973, 0.3593749999999767], [0.4843749999999933, 0.1406249999999978, -0.3281249999999918, 0.1406249999999936], [-1.296874999999973, -0.3281249999999918, 1.015624999999971, -0.5781249999999781], [0.3593749999999767, 0.1406249999999936, -0.5781249999999781, 0.5156249999999853]]], [[1.0000000000000497, 5.3290705182007514e-15, 1.7763568394002505e-14, 4.4408920985006262e-15], [5.6843418860808015e-14, 1.0000000000000089, 2.8421709430404007e-14, 1.0658141036401503e-14], [1.7053025658242404e-13, 1.7763568394002505e-14, 1.0000000000000426, 3.907985046680551e-14], [8.5265128291212022e-14, 3.5527136788005009e-15, 7.1054273576010019e-14, 0.99999999999999467]])).
-result(sum_small, matrix_sum([[[1, 2], [3, 4], [5, 6]], [[1, 2], [3, 4], [5, 6]]], [[2, 4], [6, 8], [10, 12]])).
-result(chol3, cholesky_decomposition([[25, 15, -5], [15, 18, 0], [-5, 0, 11]], [[5.0, 0, 0], [3.0, 3.0, 0], [-1.0, 1.0, 3.0]])).
-result(chol4, cholesky_decomposition([[18, 22, 54, 42], [22, 70, 86, 62], [54, 86, 174, 134], [42, 62, 134, 106]], [[4.2426406871192848, 0, 0, 0], [5.1854497287013492, 6.5659052011974026, 0, 0], [12.727922061357857, 3.0460384954008553, 1.6497422479090704, 0], [9.8994949366116654, 1.6245538642137891, 1.8497110052313821, 1.3926212476455924]])).
-checksConsistentWithTreallaReference(matrix, true).

package/examples/eyelang/output/n-queens.pl

@@ -1,93 +0,0 @@
-solution(nQueens8, [1, 5, 8, 6, 3, 7, 2, 4]).
-solution(nQueens8, [1, 6, 8, 3, 7, 4, 2, 5]).
-solution(nQueens8, [1, 7, 4, 6, 8, 2, 5, 3]).
-solution(nQueens8, [1, 7, 5, 8, 2, 4, 6, 3]).
-solution(nQueens8, [2, 4, 6, 8, 3, 1, 7, 5]).
-solution(nQueens8, [2, 5, 7, 1, 3, 8, 6, 4]).
-solution(nQueens8, [2, 5, 7, 4, 1, 8, 6, 3]).
-solution(nQueens8, [2, 6, 1, 7, 4, 8, 3, 5]).
-solution(nQueens8, [2, 6, 8, 3, 1, 4, 7, 5]).
-solution(nQueens8, [2, 7, 3, 6, 8, 5, 1, 4]).
-solution(nQueens8, [2, 7, 5, 8, 1, 4, 6, 3]).
-solution(nQueens8, [2, 8, 6, 1, 3, 5, 7, 4]).
-solution(nQueens8, [3, 1, 7, 5, 8, 2, 4, 6]).
-solution(nQueens8, [3, 5, 2, 8, 1, 7, 4, 6]).
-solution(nQueens8, [3, 5, 2, 8, 6, 4, 7, 1]).
-solution(nQueens8, [3, 5, 7, 1, 4, 2, 8, 6]).
-solution(nQueens8, [3, 5, 8, 4, 1, 7, 2, 6]).
-solution(nQueens8, [3, 6, 2, 5, 8, 1, 7, 4]).
-solution(nQueens8, [3, 6, 2, 7, 1, 4, 8, 5]).
-solution(nQueens8, [3, 6, 2, 7, 5, 1, 8, 4]).
-solution(nQueens8, [3, 6, 4, 1, 8, 5, 7, 2]).
-solution(nQueens8, [3, 6, 4, 2, 8, 5, 7, 1]).
-solution(nQueens8, [3, 6, 8, 1, 4, 7, 5, 2]).
-solution(nQueens8, [3, 6, 8, 1, 5, 7, 2, 4]).
-solution(nQueens8, [3, 6, 8, 2, 4, 1, 7, 5]).
-solution(nQueens8, [3, 7, 2, 8, 5, 1, 4, 6]).
-solution(nQueens8, [3, 7, 2, 8, 6, 4, 1, 5]).
-solution(nQueens8, [3, 8, 4, 7, 1, 6, 2, 5]).
-solution(nQueens8, [4, 1, 5, 8, 2, 7, 3, 6]).
-solution(nQueens8, [4, 1, 5, 8, 6, 3, 7, 2]).
-solution(nQueens8, [4, 2, 5, 8, 6, 1, 3, 7]).
-solution(nQueens8, [4, 2, 7, 3, 6, 8, 1, 5]).
-solution(nQueens8, [4, 2, 7, 3, 6, 8, 5, 1]).
-solution(nQueens8, [4, 2, 7, 5, 1, 8, 6, 3]).
-solution(nQueens8, [4, 2, 8, 5, 7, 1, 3, 6]).
-solution(nQueens8, [4, 2, 8, 6, 1, 3, 5, 7]).
-solution(nQueens8, [4, 6, 1, 5, 2, 8, 3, 7]).
-solution(nQueens8, [4, 6, 8, 2, 7, 1, 3, 5]).
-solution(nQueens8, [4, 6, 8, 3, 1, 7, 5, 2]).
-solution(nQueens8, [4, 7, 1, 8, 5, 2, 6, 3]).
-solution(nQueens8, [4, 7, 3, 8, 2, 5, 1, 6]).
-solution(nQueens8, [4, 7, 5, 2, 6, 1, 3, 8]).
-solution(nQueens8, [4, 7, 5, 3, 1, 6, 8, 2]).
-solution(nQueens8, [4, 8, 1, 3, 6, 2, 7, 5]).
-solution(nQueens8, [4, 8, 1, 5, 7, 2, 6, 3]).
-solution(nQueens8, [4, 8, 5, 3, 1, 7, 2, 6]).
-solution(nQueens8, [5, 1, 4, 6, 8, 2, 7, 3]).
-solution(nQueens8, [5, 1, 8, 4, 2, 7, 3, 6]).
-solution(nQueens8, [5, 1, 8, 6, 3, 7, 2, 4]).
-solution(nQueens8, [5, 2, 4, 6, 8, 3, 1, 7]).
-solution(nQueens8, [5, 2, 4, 7, 3, 8, 6, 1]).
-solution(nQueens8, [5, 2, 6, 1, 7, 4, 8, 3]).
-solution(nQueens8, [5, 2, 8, 1, 4, 7, 3, 6]).
-solution(nQueens8, [5, 3, 1, 6, 8, 2, 4, 7]).
-solution(nQueens8, [5, 3, 1, 7, 2, 8, 6, 4]).
-solution(nQueens8, [5, 3, 8, 4, 7, 1, 6, 2]).
-solution(nQueens8, [5, 7, 1, 3, 8, 6, 4, 2]).
-solution(nQueens8, [5, 7, 1, 4, 2, 8, 6, 3]).
-solution(nQueens8, [5, 7, 2, 4, 8, 1, 3, 6]).
-solution(nQueens8, [5, 7, 2, 6, 3, 1, 4, 8]).
-solution(nQueens8, [5, 7, 2, 6, 3, 1, 8, 4]).
-solution(nQueens8, [5, 7, 4, 1, 3, 8, 6, 2]).
-solution(nQueens8, [5, 8, 4, 1, 3, 6, 2, 7]).
-solution(nQueens8, [5, 8, 4, 1, 7, 2, 6, 3]).
-solution(nQueens8, [6, 1, 5, 2, 8, 3, 7, 4]).
-solution(nQueens8, [6, 2, 7, 1, 3, 5, 8, 4]).
-solution(nQueens8, [6, 2, 7, 1, 4, 8, 5, 3]).
-solution(nQueens8, [6, 3, 1, 7, 5, 8, 2, 4]).
-solution(nQueens8, [6, 3, 1, 8, 4, 2, 7, 5]).
-solution(nQueens8, [6, 3, 1, 8, 5, 2, 4, 7]).
-solution(nQueens8, [6, 3, 5, 7, 1, 4, 2, 8]).
-solution(nQueens8, [6, 3, 5, 8, 1, 4, 2, 7]).
-solution(nQueens8, [6, 3, 7, 2, 4, 8, 1, 5]).
-solution(nQueens8, [6, 3, 7, 2, 8, 5, 1, 4]).
-solution(nQueens8, [6, 3, 7, 4, 1, 8, 2, 5]).
-solution(nQueens8, [6, 4, 1, 5, 8, 2, 7, 3]).
-solution(nQueens8, [6, 4, 2, 8, 5, 7, 1, 3]).
-solution(nQueens8, [6, 4, 7, 1, 3, 5, 2, 8]).
-solution(nQueens8, [6, 4, 7, 1, 8, 2, 5, 3]).
-solution(nQueens8, [6, 8, 2, 4, 1, 7, 5, 3]).
-solution(nQueens8, [7, 1, 3, 8, 6, 4, 2, 5]).
-solution(nQueens8, [7, 2, 4, 1, 8, 5, 3, 6]).
-solution(nQueens8, [7, 2, 6, 3, 1, 4, 8, 5]).
-solution(nQueens8, [7, 3, 1, 6, 8, 5, 2, 4]).
-solution(nQueens8, [7, 3, 8, 2, 5, 1, 6, 4]).
-solution(nQueens8, [7, 4, 2, 5, 8, 1, 3, 6]).
-solution(nQueens8, [7, 4, 2, 8, 6, 1, 3, 5]).
-solution(nQueens8, [7, 5, 3, 1, 6, 8, 2, 4]).
-solution(nQueens8, [8, 2, 4, 1, 7, 5, 3, 6]).
-solution(nQueens8, [8, 2, 5, 3, 1, 7, 4, 6]).
-solution(nQueens8, [8, 3, 1, 6, 2, 5, 7, 4]).
-solution(nQueens8, [8, 4, 1, 3, 6, 2, 7, 5]).
-solved(nQueens8, true).

package/examples/eyelang/output/quine-mccluskey.pl

@@ -1,3 +0,0 @@
-primeImplicants(quine_mccluskey, [[0, 0, x, x], [0, x, x, 1], [x, x, 1, 1]]).
-minimalCover(quine_mccluskey, [[0, 0, x, x], [x, x, 1, 1]]).
-equation(quine_mccluskey, "f = ~A~B + CD").

package/examples/eyelang/output/sat-dpll.pl

@@ -1,5 +0,0 @@
-status(sat_instance, satisfiable).
-witness(sat_instance, [value(a, false), value(b, true), value(c, false), value(d, true), value(e, false), value(f, true), value(g, false), value(h, true)]).
-modelCount(sat_instance, 18).
-variableCount(sat_instance, 8).
-clauseCount(sat_instance, 12).

package/examples/eyelang/output/traveling-salesman.pl

@@ -1 +0,0 @@
-optimalTour([aaa, bbb, ccc, ddd, eee, fff, ggg], [[aaa, bbb, fff, ccc, eee, ddd, ggg], 75]).

package/examples/eyelang/quine-mccluskey.pl

@@ -1,143 +0,0 @@
-% Eyelet-inspired Quine-McCluskey minimization using findall/3 and sort/2.
-% Problem: f(A,B,C,D) = Sigma m(1,3,7,11,15) + d(0,2,5).
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(primeImplicants, 2).
-materialize(minimalCover, 2).
-materialize(equation, 2).
-materialize(reason, 2).
-
-% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-minterm(1).
-minterm(3).
-minterm(7).
-minterm(11).
-minterm(15).
-
-dont_care(0).
-dont_care(2).
-dont_care(5).
-
-bits(0, [0, 0, 0, 0]).
-bits(1, [0, 0, 0, 1]).
-bits(2, [0, 0, 1, 0]).
-bits(3, [0, 0, 1, 1]).
-bits(4, [0, 1, 0, 0]).
-bits(5, [0, 1, 0, 1]).
-bits(6, [0, 1, 1, 0]).
-bits(7, [0, 1, 1, 1]).
-bits(8, [1, 0, 0, 0]).
-bits(9, [1, 0, 0, 1]).
-bits(10, [1, 0, 1, 0]).
-bits(11, [1, 0, 1, 1]).
-bits(12, [1, 1, 0, 0]).
-bits(13, [1, 1, 0, 1]).
-bits(14, [1, 1, 1, 0]).
-bits(15, [1, 1, 1, 1]).
-
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-initial_pattern(P) :- minterm(M), bits(M, P).
-initial_pattern(P) :- dont_care(D), bits(D, P).
-
-combine(A, B, R) :-
-  diff_count(A, B, 0, 1, [], Rev),
-  reverse(Rev, R).
-
-diff_count([], [], Count, Count, Acc, Acc).
-diff_count([X | A], [X | B], Count, Max, Acc, R) :-
-  diff_count(A, B, Count, Max, [X | Acc], R).
-diff_count([X | A], [Y | B], Count, Max, Acc, R) :-
-  neq(X, Y),
-  add(Count, 1, Next),
-  le(Next, Max),
-  diff_count(A, B, Next, Max, [x | Acc], R).
-
-combined_once(P) :-
-  initial_pattern(A),
-  initial_pattern(B),
-  combine(A, B, P).
-
-combined_twice(P) :-
-  combined_once(A),
-  combined_once(B),
-  combine(A, B, P).
-
-used_initial(P) :-
-  initial_pattern(Q),
-  combine(P, Q, _R).
-
-used_once(P) :-
-  combined_once(Q),
-  combine(P, Q, _R).
-
-prime(P) :-
-  initial_pattern(P),
-  not(used_initial(P)).
-prime(P) :-
-  combined_once(P),
-  not(used_once(P)).
-prime(P) :-
-  combined_twice(P).
-
-prime_implicants(Primes) :-
-  minterms(Minterms),
-  dont_cares(DontCares),
-  bit_table(Bits),
-  qm_prime_implicants(Minterms, DontCares, Bits, Primes).
-
-covers([], []).
-covers([x | Pattern], [_Bit | Bits]) :-
-  covers(Pattern, Bits).
-covers([Bit | Pattern], [Bit | Bits]) :-
-  neq(Bit, x),
-  covers(Pattern, Bits).
-
-covers_int(Pattern, Int) :-
-  bits(Int, Bits),
-  covers(Pattern, Bits).
-
-covers_all(_Cover, []).
-covers_all(Cover, [M | Minterms]) :-
-  member(P, Cover),
-  covers_int(P, M),
-  covers_all(Cover, Minterms).
-
-minterms(Minterms) :-
-  findall(M, minterm(M), Raw),
-  sort(Raw, Minterms).
-
-dont_cares(DontCares) :-
-  findall(D, dont_care(D), Raw),
-  sort(Raw, DontCares).
-
-bit_table(Bits) :-
-  findall(bit(N, Pattern), bits(N, Pattern), Bits).
-
-pair_from([A | Rest], A, B) :-
-  member(B, Rest).
-pair_from([_Head | Rest], A, B) :-
-  pair_from(Rest, A, B).
-
-cover_candidate(Cover) :-
-  prime_implicants(Primes),
-  pair_from(Primes, A, B),
-  sort([A, B], Cover),
-  minterms(Minterms),
-  covers_all(Cover, Minterms).
-
-minimal_cover(Cover) :-
-  minterms(Minterms),
-  dont_cares(DontCares),
-  bit_table(Bits),
-  qm_minimal_cover(Minterms, DontCares, Bits, Cover).
-
-primeImplicants(quine_mccluskey, Primes) :-
-  prime_implicants(Primes).
-
-minimalCover(quine_mccluskey, Cover) :-
-  minimal_cover(Cover).
-
-equation(quine_mccluskey, "f = ~A~B + CD") :-
-  minimal_cover([[0, 0, x, x], [x, x, 1, 1]]).
-
-reason(quine_mccluskey, "findall builds implicant sets and sort removes duplicates before cover selection").

package/examples/eyelang/sat-dpll.pl

@@ -1,80 +0,0 @@
-% SAT solving without cut.
-%
-% A compact DPLL-style example for a finite CNF formula.  The program first
-% generates truth assignments, then checks every clause declaratively.  This
-% larger instance has eight variables and twelve clauses, so it is still small
-% enough for full model collection but no longer a toy four-variable search.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(status, 2).
-materialize(witness, 2).
-materialize(modelCount, 2).
-materialize(variableCount, 2).
-materialize(clauseCount, 2).
-materialize(reason, 2).
-
-% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-problem(sat_instance,
-  [a, b, c, d, e, f, g, h],
-  [
-    [pos(a), pos(b)],
-    [neg(a), pos(c)],
-    [neg(b), pos(d)],
-    [pos(c), pos(d)],
-    [neg(c), pos(e)],
-    [neg(d), pos(f)],
-    [pos(e), pos(f)],
-    [neg(e), pos(g)],
-    [neg(f), pos(h)],
-    [pos(g), pos(h)],
-    [neg(g), pos(a)],
-    [neg(h), pos(b)]
-  ]).
-
-truth(false).
-truth(true).
-
-assignment([], []).
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-assignment([Var|Vars], [value(Var, Truth)|Rest]) :-
-  truth(Truth),
-  assignment(Vars, Rest).
-
-literal_true(pos(Var), Assignment) :-
-  member(value(Var, true), Assignment).
-literal_true(neg(Var), Assignment) :-
-  member(value(Var, false), Assignment).
-
-clause_true([Literal|_Rest], Assignment) :-
-  literal_true(Literal, Assignment).
-clause_true([_Literal|Rest], Assignment) :-
-  clause_true(Rest, Assignment).
-
-cnf_true([], _Assignment).
-cnf_true([Clause|Clauses], Assignment) :-
-  clause_true(Clause, Assignment),
-  cnf_true(Clauses, Assignment).
-
-model(Name, Assignment) :-
-  problem(Name, Variables, Clauses),
-  cnf_model(Variables, Clauses, Assignment).
-
-status(sat_instance, satisfiable) :-
-  once(model(sat_instance, _Assignment)).
-
-witness(sat_instance, Assignment) :-
-  once(model(sat_instance, Assignment)).
-
-modelCount(sat_instance, Count) :-
-  findall(Assignment, model(sat_instance, Assignment), Models),
-  length(Models, Count).
-
-variableCount(sat_instance, Count) :-
-  problem(sat_instance, Variables, _Clauses),
-  length(Variables, Count).
-
-clauseCount(sat_instance, Count) :-
-  problem(sat_instance, _Variables, Clauses),
-  length(Clauses, Count).
-
-reason(sat_instance, "finite 8-variable CNF search succeeds without cut").

package/examples/eyelang/traveling-salesman.pl

@@ -1,64 +0,0 @@
-% Traveling salesman problem, adapted from Eyelet input/traveling-salesman.pl.
-% The optimal tour matches Eyelet output-swipl/traveling-salesman.pl.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(optimalTour, 2).
-
-% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-% The target list fixes the city set; weighted_hamiltonian_path/4 searches tours.
-target_cities([aaa, bbb, ccc, ddd, eee, fff, ggg]).
-
-distance(aaa, bbb, 10).
-distance(aaa, ccc, 15).
-distance(aaa, ddd, 20).
-distance(aaa, eee, 25).
-distance(aaa, fff, 30).
-distance(bbb, ccc, 35).
-distance(bbb, ddd, 40).
-distance(bbb, eee, 20).
-distance(bbb, fff, 25).
-distance(ccc, ddd, 30).
-distance(ccc, eee, 15).
-distance(ccc, fff, 10).
-distance(ddd, eee, 10).
-distance(ddd, fff, 35).
-distance(ddd, ggg, 5).
-distance(eee, fff, 20).
-
-% Distances are stored once; distance2/3 makes the graph undirected.
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-distance2(A, B, D) :-
-  distance(A, B, D).
-distance2(A, B, D) :-
-  distance(B, A, D).
-
-permutation([], []).
-permutation(List, [X|Perm]) :-
-  select(X, List, Rest),
-  permutation(Rest, Perm).
-
-total_distance([_Last], 0).
-total_distance([X, Y|Tail], D) :-
-  distance2(X, Y, D1),
-  total_distance([Y|Tail], D2),
-  add(D1, D2, D).
-
-tsp(Cities, Tour, Distance) :-
-  weighted_hamiltonian_path(distance, Cities, Tour, Distance).
-
-% Materialized output keeps only the minimum-distance candidate.
-optimalTour(Cities, Optimal) :-
-  target_cities(Cities),
-  findall([T, D], tsp(Cities, T, D), Solutions),
-  min_distance(Solutions, Optimal).
-
-min_distance([Sol|Sols], Optimal) :-
-  min_distance_acc(Sols, Sol, Optimal).
-
-min_distance_acc([], Best, Best).
-min_distance_acc([[_T, D]|Rest], [_BestTour, BestDistance], Optimal) :-
-  lt(D, BestDistance),
-  min_distance_acc(Rest, [_T, D], Optimal).
-min_distance_acc([[_T, D]|Rest], [BestTour, BestDistance], Optimal) :-
-  ge(D, BestDistance),
-  min_distance_acc(Rest, [BestTour, BestDistance], Optimal).

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);
-}