eyeling 1.33.4 → 1.33.6

package/examples/eyelang/exact-cover-sudoku.pl

@@ -1,113 +0,0 @@
-% Exact-cover-style 9x9 Sudoku without cut.
-%
-% Instead of generating every row permutation, each row has three candidate
-% rows that already satisfy the visible givens from a classic Sudoku puzzle.
-% The solver then chooses one candidate per row and checks the exact-cover
-% constraints for all columns and 3x3 boxes.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(status, 2).
-materialize(solution, 2).
-materialize(firstRow, 2).
-
-% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-cover9(Cells) :-
-  sort(Cells, [1, 2, 3, 4, 5, 6, 7, 8, 9]).
-
-% Puzzle givens, with dots shown in the comment for readability:
-% 53..7....
-% 6..195...
-% .98....6.
-% 8...6...3
-% 4..8.3..1
-% 7...2...6
-% .6....28.
-% ...419..5
-% ....8..79
-
-row_candidate(1, [5, 3, 6, 4, 7, 8, 9, 1, 2]).
-row_candidate(1, [5, 3, 8, 6, 7, 4, 9, 1, 2]).
-row_candidate(1, [5, 3, 4, 6, 7, 8, 9, 1, 2]).
-
-row_candidate(2, [6, 2, 7, 1, 9, 5, 3, 4, 8]).
-row_candidate(2, [6, 3, 2, 1, 9, 5, 7, 4, 8]).
-row_candidate(2, [6, 7, 2, 1, 9, 5, 3, 4, 8]).
-
-row_candidate(3, [3, 9, 8, 1, 4, 2, 5, 6, 7]).
-row_candidate(3, [4, 9, 8, 3, 1, 2, 5, 6, 7]).
-row_candidate(3, [1, 9, 8, 3, 4, 2, 5, 6, 7]).
-
-row_candidate(4, [8, 9, 5, 7, 6, 1, 4, 2, 3]).
-row_candidate(4, [8, 7, 9, 5, 6, 1, 4, 2, 3]).
-row_candidate(4, [8, 5, 9, 7, 6, 1, 4, 2, 3]).
-
-row_candidate(5, [4, 6, 2, 8, 5, 3, 7, 9, 1]).
-row_candidate(5, [4, 5, 6, 8, 2, 3, 7, 9, 1]).
-row_candidate(5, [4, 2, 6, 8, 5, 3, 7, 9, 1]).
-
-row_candidate(6, [7, 3, 1, 9, 2, 4, 8, 5, 6]).
-row_candidate(6, [7, 9, 3, 1, 2, 4, 8, 5, 6]).
-row_candidate(6, [7, 1, 3, 9, 2, 4, 8, 5, 6]).
-
-row_candidate(7, [1, 6, 9, 5, 3, 7, 2, 8, 4]).
-row_candidate(7, [5, 6, 1, 9, 3, 7, 2, 8, 4]).
-row_candidate(7, [9, 6, 1, 5, 3, 7, 2, 8, 4]).
-
-row_candidate(8, [8, 2, 7, 4, 1, 9, 6, 3, 5]).
-row_candidate(8, [7, 8, 2, 4, 1, 9, 6, 3, 5]).
-row_candidate(8, [2, 8, 7, 4, 1, 9, 6, 3, 5]).
-
-row_candidate(9, [4, 3, 5, 2, 8, 6, 1, 7, 9]).
-row_candidate(9, [5, 4, 3, 2, 8, 6, 1, 7, 9]).
-row_candidate(9, [3, 4, 5, 2, 8, 6, 1, 7, 9]).
-
-sudoku9([
-  [A1, A2, A3, A4, A5, A6, A7, A8, A9],
-  [B1, B2, B3, B4, B5, B6, B7, B8, B9],
-  [C1, C2, C3, C4, C5, C6, C7, C8, C9],
-  [D1, D2, D3, D4, D5, D6, D7, D8, D9],
-  [E1, E2, E3, E4, E5, E6, E7, E8, E9],
-  [F1, F2, F3, F4, F5, F6, F7, F8, F9],
-  [G1, G2, G3, G4, G5, G6, G7, G8, G9],
-  [H1, H2, H3, H4, H5, H6, H7, H8, H9],
-  [I1, I2, I3, I4, I5, I6, I7, I8, I9]
-]) :-
-  row_candidate(1, [A1, A2, A3, A4, A5, A6, A7, A8, A9]),
-  row_candidate(2, [B1, B2, B3, B4, B5, B6, B7, B8, B9]),
-  row_candidate(3, [C1, C2, C3, C4, C5, C6, C7, C8, C9]),
-  row_candidate(4, [D1, D2, D3, D4, D5, D6, D7, D8, D9]),
-  row_candidate(5, [E1, E2, E3, E4, E5, E6, E7, E8, E9]),
-  row_candidate(6, [F1, F2, F3, F4, F5, F6, F7, F8, F9]),
-  row_candidate(7, [G1, G2, G3, G4, G5, G6, G7, G8, G9]),
-  row_candidate(8, [H1, H2, H3, H4, H5, H6, H7, H8, H9]),
-  row_candidate(9, [I1, I2, I3, I4, I5, I6, I7, I8, I9]),
-
-  cover9([A1, B1, C1, D1, E1, F1, G1, H1, I1]),
-  cover9([A2, B2, C2, D2, E2, F2, G2, H2, I2]),
-  cover9([A3, B3, C3, D3, E3, F3, G3, H3, I3]),
-  cover9([A4, B4, C4, D4, E4, F4, G4, H4, I4]),
-  cover9([A5, B5, C5, D5, E5, F5, G5, H5, I5]),
-  cover9([A6, B6, C6, D6, E6, F6, G6, H6, I6]),
-  cover9([A7, B7, C7, D7, E7, F7, G7, H7, I7]),
-  cover9([A8, B8, C8, D8, E8, F8, G8, H8, I8]),
-  cover9([A9, B9, C9, D9, E9, F9, G9, H9, I9]),
-
-  cover9([A1, A2, A3, B1, B2, B3, C1, C2, C3]),
-  cover9([A4, A5, A6, B4, B5, B6, C4, C5, C6]),
-  cover9([A7, A8, A9, B7, B8, B9, C7, C8, C9]),
-  cover9([D1, D2, D3, E1, E2, E3, F1, F2, F3]),
-  cover9([D4, D5, D6, E4, E5, E6, F4, F5, F6]),
-  cover9([D7, D8, D9, E7, E8, E9, F7, F8, F9]),
-  cover9([G1, G2, G3, H1, H2, H3, I1, I2, I3]),
-  cover9([G4, G5, G6, H4, H5, H6, I4, I5, I6]),
-  cover9([G7, G8, G9, H7, H8, H9, I7, I8, I9]).
-
-status(exact_cover_sudoku, solved) :-
-  once(sudoku9(_Grid)).
-
-solution(exact_cover_sudoku, Grid) :-
-  once(sudoku9(Grid)).
-
-firstRow(exact_cover_sudoku, Row) :-
-  once(sudoku9([Row|_Rows])).

package/examples/eyelang/output/exact-cover-sudoku.pl

@@ -1,3 +0,0 @@
-status(exact_cover_sudoku, solved).
-solution(exact_cover_sudoku, [[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]).
-firstRow(exact_cover_sudoku, [5, 3, 4, 6, 7, 8, 9, 1, 2]).

package/examples/eyelang/output/sudoku.pl

@@ -1,2 +0,0 @@
-solution(classic, [[1, 6, 2, 8, 5, 7, 4, 9, 3], [5, 3, 4, 1, 2, 9, 6, 7, 8], [7, 8, 9, 6, 4, 3, 5, 2, 1], [4, 7, 5, 3, 1, 2, 9, 8, 6], [9, 1, 3, 5, 8, 6, 7, 4, 2], [6, 2, 8, 7, 9, 4, 1, 3, 5], [3, 5, 6, 4, 7, 8, 2, 1, 9], [2, 4, 1, 9, 3, 5, 8, 6, 7], [8, 9, 7, 2, 6, 1, 3, 5, 4]]).
-solution(third, [[4, 7, 8, 2, 6, 9, 1, 3, 5], [2, 9, 5, 1, 7, 3, 4, 8, 6], [1, 3, 6, 4, 5, 8, 7, 9, 2], [9, 4, 2, 6, 3, 5, 8, 7, 1], [8, 1, 7, 9, 4, 2, 5, 6, 3], [6, 5, 3, 8, 1, 7, 2, 4, 9], [7, 2, 1, 3, 9, 4, 6, 5, 8], [5, 6, 9, 7, 8, 1, 3, 2, 4], [3, 8, 4, 5, 2, 6, 9, 1, 7]]).

package/examples/eyelang/sudoku.pl

@@ -1,20 +0,0 @@
-% Generic 9x9 Sudoku example using the compiled sudoku/2 builtin.
-%
-% Puzzles are 81-character strings read row-major. Digits 1..9 are givens;
-% 0, dot, or underscore marks a blank. The builtin also accepts a 9x9 list
-% of integers in the same representation.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(solution, 2).
-
-% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
-puzzle(classic,
-  "100007090030129008009600500005300900010080002600794000350408219240005867897201304").
-
-puzzle(third,
-  "078200000005000400100400092000035070007000500050810000720004008009000300000006910").
-
-% Derivation rules: each rule below contributes one logical step toward the displayed results.
-solution(Name, Rows) :-
-  puzzle(Name, Grid),
-  sudoku(Grid, Rows).

package/lib/eyelang/builtins/sudoku.js

@@ -1,141 +0,0 @@
-// Sudoku-specific helpers used by the example suite.
-// The cover9/1 optimization prunes invalid row blocks early while leaving the declarative fallback available.
-import { deref, lexicalValue, listFromItems, numberTerm, properListItems, unify } from '../term.js';
-
-export const sudokuBuiltins = {
-  register(registry) {
-    registry.add('sudoku', 2, sudoku);
-    registry.add('cover9', 1, cover9, { deterministic: true, ready: cover9Ready });
-  }
-};
-
-
-function cover9Ready(goal, env) {
-  const items = properListItems(goal.args[0], env);
-  if (!items || items.length !== 9) return false;
-  for (const item of items) {
-    const text = lexicalValue(item, env);
-    if (!/^[1-9]$/.test(text ?? '')) return false;
-  }
-  return true;
-}
-
-function* cover9({ goal, env }) {
-  // cover9/1 succeeds exactly when a nine-cell block contains each digit once.
-  // The bit mask makes this a constant-time duplicate check after the list is ground.
-  const items = properListItems(goal.args[0], env);
-  if (!items || items.length !== 9) return;
-  let mask = 0;
-  for (const item of items) {
-    const text = lexicalValue(item, env);
-    if (!/^[1-9]$/.test(text ?? '')) return;
-    const bit = 1 << (Number(text) - 1);
-    if (mask & bit) return;
-    mask |= bit;
-  }
-  if (mask === 0x1ff) yield env;
-}
-
-function* sudoku({ solver, goal, env }) {
-  const cells = parseGrid(goal.args[0], env);
-  if (!cells) return;
-  const masks = initMasks(cells);
-  if (!masks) return;
-  for (const solved of search(cells, masks)) {
-    const next = env.clone();
-    if (unify(goal.args[1], solutionTerm(solved), next)) yield next;
-    if (solver.solutionsSeen >= solver.solutionLimit) return;
-  }
-}
-
-function parseGrid(term, env) {
-  const resolved = deref(term, env);
-  if (['atom', 'string', 'number'].includes(resolved.type)) return parseGridString(resolved.name);
-  const rows = properListItems(term, env);
-  if (!rows || rows.length !== 9) return null;
-  const cells = [];
-  for (const row of rows) {
-    const cols = properListItems(row, env);
-    if (!cols || cols.length !== 9) return null;
-    for (const cell of cols) {
-      const text = lexicalValue(cell, env);
-      if (!/^\d+$/.test(text ?? '')) return null;
-      const value = Number(text);
-      if (value < 0 || value > 9) return null;
-      cells.push(value);
-    }
-  }
-  return cells;
-}
-
-function parseGridString(text) {
-  if (!text || text.length !== 81) return null;
-  const cells = [];
-  for (const ch of text) {
-    if (ch === '.' || ch === '_') cells.push(0);
-    else if (ch >= '0' && ch <= '9') cells.push(Number(ch));
-    else return null;
-  }
-  return cells;
-}
-
-function initMasks(cells) {
-  const row = Array(9).fill(0), col = Array(9).fill(0), box = Array(9).fill(0);
-  for (let i = 0; i < 81; i++) {
-    const value = cells[i];
-    if (value === 0) continue;
-    const r = Math.floor(i / 9), c = i % 9, b = Math.floor(r / 3) * 3 + Math.floor(c / 3);
-    const bit = 1 << (value - 1);
-    if ((row[r] & bit) || (col[c] & bit) || (box[b] & bit)) return null;
-    row[r] |= bit; col[c] |= bit; box[b] |= bit;
-  }
-  return { row, col, box };
-}
-
-function popcount(mask) {
-  let n = 0;
-  while (mask) { n += mask & 1; mask >>= 1; }
-  return n;
-}
-
-function* search(cells, masks) {
-  // Choose the empty cell with the fewest legal candidates. This MRV heuristic
-  // is the main reason the compiled sudoku/2 helper stays fast.
-  const all = 0x1ff;
-  let best = -1, bestCandidates = 0, bestCount = 10;
-  for (let i = 0; i < 81; i++) {
-    if (cells[i] !== 0) continue;
-    const r = Math.floor(i / 9), c = i % 9, b = Math.floor(r / 3) * 3 + Math.floor(c / 3);
-    const candidates = all & ~(masks.row[r] | masks.col[c] | masks.box[b]);
-    const count = popcount(candidates);
-    if (count === 0) return;
-    if (count < bestCount) {
-      best = i; bestCandidates = candidates; bestCount = count;
-      if (count === 1) break;
-    }
-  }
-  if (best < 0) {
-    yield cells.slice();
-    return;
-  }
-  const r = Math.floor(best / 9), c = best % 9, b = Math.floor(r / 3) * 3 + Math.floor(c / 3);
-  for (let value = 1; value <= 9; value++) {
-    const bit = 1 << (value - 1);
-    if (!(bestCandidates & bit)) continue;
-    cells[best] = value;
-    masks.row[r] |= bit; masks.col[c] |= bit; masks.box[b] |= bit;
-    yield* search(cells, masks);
-    masks.box[b] &= ~bit; masks.col[c] &= ~bit; masks.row[r] &= ~bit;
-    cells[best] = 0;
-  }
-}
-
-function solutionTerm(cells) {
-  const rows = [];
-  for (let r = 0; r < 9; r++) {
-    const items = [];
-    for (let c = 0; c < 9; c++) items.push(numberTerm(cells[r * 9 + c]));
-    rows.push(listFromItems(items));
-  }
-  return listFromItems(rows);
-}

package/test/eyelang/conformance/cases/extension/025_is_list_filter.pl

@@ -1,5 +0,0 @@
-% SPEC 9.7: is_list/1 succeeds only for proper lists.
-thing([a, b]).
-thing(pair(a, b)).
-answer(list, X) :- thing(X), is_list(X).
-materialize(answer, 2).

package/test/eyelang/conformance/cases/extension/025_is_list_filter.query

@@ -1 +0,0 @@
-answer(K, V)

package/test/eyelang/conformance/cases/extension/041_atom_range_generators.pl

@@ -1,5 +0,0 @@
-% SPEC 9.5: atom range helpers generate prefixed atoms deterministically.
-answer(single, X) :- atom_range(n, 2, 4, X).
-answer(multiple, X) :- atom_ranges([a, b], 1, 2, X).
-answer(bound_check, yes) :- atom_range(n, 2, 4, n3).
-materialize(answer, 2).

package/test/eyelang/conformance/cases/extension/044_cover9_filter.pl

@@ -1,6 +0,0 @@
-% SPEC 9.5: cover9/1 accepts exactly the digits 1 through 9 once.
-answer(ok, yes) :- cover9([1, 2, 3, 4, 5, 6, 7, 8, 9]).
-answer(candidate, X) :- row(X), cover9(X).
-row([1, 2, 3, 4, 5, 6, 7, 8, 9]).
-row([1, 1, 2, 3, 4, 5, 6, 7, 8]).
-materialize(answer, 2).

package/test/eyelang/conformance/expected/extension/025_is_list_filter.out

@@ -1 +0,0 @@
-answer(list, [a, b]).

package/test/eyelang/conformance/expected/extension/041_atom_range_generators.out

@@ -1,8 +0,0 @@
-answer(single, n2).
-answer(single, n3).
-answer(single, n4).
-answer(multiple, a1).
-answer(multiple, a2).
-answer(multiple, b1).
-answer(multiple, b2).
-answer(bound_check, yes).

package/test/eyelang/conformance/expected/extension/044_cover9_filter.out

@@ -1,2 +0,0 @@
-answer(ok, yes).
-answer(candidate, [1, 2, 3, 4, 5, 6, 7, 8, 9]).