eyeling 1.33.8 → 1.33.9

package/README.md

@@ -829,7 +829,7 @@ The eyelang engine has its own built-in registry under `lib/eyelang/builtins/`.
 | Aggregation | `findall/3`, `countall/2`, `sumall/3`, `aggregate_min/5`, `aggregate_max/5` |
 | Control | `not/1`, `once/1` |
 | Context terms | `holds/2`, `holds/3` |
-| Search and optimization helpers | `n_queens/2`, `weighted_hamiltonian_cycle/4`, `weighted_hamiltonian_path/4`, `hamiltonian_cycle/3`, `fixed_length_cycle/4`, `bounded_path/5`, `cnf_model/3`, `qm_prime_implicants/4`, `qm_minimal_cover/4`, `alphametic_sum/5` |
+| Search and optimization helpers | `n_queens/2`, `weighted_hamiltonian_cycle/4`, `weighted_hamiltonian_path/4`, `hamiltonian_cycle/3`, `fixed_length_cycle/4`, `bounded_path/5`, `cnf_model/3`, `qm_prime_implicants/4`, `qm_minimal_cover/4` |
 | Numeric extension helpers | `extended_gcd/5`, `collatz_trajectory/2`, `kaprekar_steps/2`, `goldbach_pair/3` |
 | Matrix helpers | `matrix_sum/2`, `matrix_multiply/2`, `cholesky_decomposition/2`, `determinant/2`, `matrix_inv_triang/2`, `matrix_inversion/2` |
 

package/docs/eyelang-guide.md

@@ -261,7 +261,7 @@ best(Cycle, Cost) :-
   weighted_hamiltonian_cycle(edge, Cities, Cycle, Cost).
 ```
 
-The reusable search and numeric helpers include `n_queens/2`, Hamiltonian path/cycle helpers, `cnf_model/3`, Quine-McCluskey helpers, bounded subset/path helpers, number-theory helpers such as `extended_gcd/5`, matrix helpers such as `matrix_multiply/2`, and `alphametic_sum/5`. These helpers are extension builtins of this implementation; [the eyelang language reference](eyelang-language-reference.md) defines the portable core and standard builtin profile.
+The reusable search and numeric helpers include `n_queens/2`, Hamiltonian path/cycle helpers, `bounded_path/5`, `cnf_model/3`, Quine-McCluskey helpers, number-theory helpers such as `extended_gcd/5`, and matrix helpers such as `matrix_multiply/2`. These helpers are extension builtins of this implementation; [the eyelang language reference](eyelang-language-reference.md) defines the portable core and standard builtin profile.
 
 To add a builtin, create or extend a module with `register(registry)` and call `registry.add(name, arity, handler, options)`. The default registry is assembled in [`lib/eyelang/builtins/registry.js`](../lib/eyelang/builtins/registry.js). Builtins that are only safe for specific argument modes should provide a `ready` predicate and `fallbackWhenNotReady: true`, so user-defined clauses remain visible until the builtin is applicable.
 
@@ -336,7 +336,6 @@ The repository includes examples for recursion, graph reachability, finite searc
 | [`composition-of-injective-functions-is-injective.pl`](../examples/eyelang/composition-of-injective-functions-is-injective.pl) | Encodes composition and injectivity of finite functions. | [`output/composition-of-injective-functions-is-injective.pl`](../examples/eyelang/output/composition-of-injective-functions-is-injective.pl) |
 | [`context-association.pl`](../examples/eyelang/context-association.pl) | Associates named contexts with their contents. | [`output/context-association.pl`](../examples/eyelang/output/context-association.pl) |
 | [`control-system.pl`](../examples/eyelang/control-system.pl) | Evaluates control-system measurements and targets. | [`output/control-system.pl`](../examples/eyelang/output/control-system.pl) |
-| [`cryptarithmetic-send-more-money.pl`](../examples/eyelang/cryptarithmetic-send-more-money.pl) | Solves SEND+MORE and related puzzles. | [`output/cryptarithmetic-send-more-money.pl`](../examples/eyelang/output/cryptarithmetic-send-more-money.pl) |
 | [`cyclic-path.pl`](../examples/eyelang/cyclic-path.pl) | Computes paths in a cyclic graph. | [`output/cyclic-path.pl`](../examples/eyelang/output/cyclic-path.pl) |
 | [`d3-group.pl`](../examples/eyelang/d3-group.pl) | Enumerates subgroups of the D3 group. | [`output/d3-group.pl`](../examples/eyelang/output/d3-group.pl) |
 | [`dairy-energy-balance.pl`](../examples/eyelang/dairy-energy-balance.pl) | Classifies dairy cow energy balance. | [`output/dairy-energy-balance.pl`](../examples/eyelang/output/dairy-energy-balance.pl) |

package/docs/eyelang-language-reference.md

@@ -468,7 +468,7 @@ An extension built-in SHOULD obey the same surface-language discipline as standa
 - it SHOULD document its intended modes, especially which arguments must be ground before it runs deterministically;
 - it MUST NOT change the meaning of ordinary facts, rules, unification, or standard built-ins.
 
-For example, an implementation may include extension modules for number-theory algorithms, graph search, matrix operations, or alphametic puzzles. Those modules may be valuable and may make example programs much faster, but their predicate names, arities, algorithms, and modes are implementation-defined unless they are separately standardized.
+For example, an implementation may include extension modules for number-theory algorithms, graph search, or matrix operations. Those modules may be valuable and may make example programs much faster, but their predicate names, arities, algorithms, and modes are implementation-defined unless they are separately standardized.
 
 An implementation that provides explanation output SHOULD make extension built-ins explainable at least as opaque successful or failed built-in calls, so that proof traces do not incorrectly report "no clauses" for a host-provided relation.
 

package/lib/eyelang/builtins/registry.js

@@ -10,7 +10,6 @@ import { controlBuiltins } from './control.js';
 import { searchBuiltins } from './search.js';
 import { numberTheoryBuiltins } from './number-theory.js';
 import { matrixBuiltins } from './matrix.js';
-import { alphameticBuiltins } from './alphametic.js';
 
 export class BuiltinRegistry {
   constructor() {
@@ -37,7 +36,7 @@ export class BuiltinRegistry {
 
 export function createDefaultRegistry() {
   const registry = new BuiltinRegistry();
-  for (const mod of [coreBuiltins, arithmeticBuiltins, stringBuiltins, listBuiltins, aggregationBuiltins, contextBuiltins, controlBuiltins, searchBuiltins, numberTheoryBuiltins, matrixBuiltins, alphameticBuiltins]) {
+  for (const mod of [coreBuiltins, arithmeticBuiltins, stringBuiltins, listBuiltins, aggregationBuiltins, contextBuiltins, controlBuiltins, searchBuiltins, numberTheoryBuiltins, matrixBuiltins]) {
     mod.register(registry);
   }
   return registry;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyeling",
-  "version": "1.33.8",
+  "version": "1.33.9",
   "description": "A minimal Notation3 (N3) reasoner in JavaScript.",
   "main": "./index.js",
   "keywords": [

package/examples/eyelang/cryptarithmetic-send-more-money.pl

@@ -1,49 +0,0 @@
-% Cryptarithmetic without cut.
-%
-% Two column-pruned puzzles are included.  SEND + MORE = MONEY is the classic
-% eight-letter puzzle, and DONALD + GERALD = ROBERT uses all ten digits across
-% a six-column addition.  Each column constraint is applied as soon as possible
-% so the finite digit search prunes early without cut.
-
-% Output declarations: materialize/2 selects the relations written to this example's golden output.
-materialize(status, 2).
-materialize(assignment, 2).
-materialize(equation, 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.
-send_more_money(solution(S, E, N, D, M, O, R, Y), Send, More, Money) :-
-  alphametic_sum(
-    [s, e, n, d, m, o, r, y],
-    [[s, e, n, d], [m, o, r, e]],
-    [m, o, n, e, y],
-    [S, E, N, D, M, O, R, Y],
-    [Send, More, Money]
-  ).
-
-donald_gerald_robert(solution(D, O, N, A, L, G, E, R, B, T), Donald, Gerald, Robert) :-
-  alphametic_sum(
-    [d, o, n, a, l, g, e, r, b, t],
-    [[d, o, n, a, l, d], [g, e, r, a, l, d]],
-    [r, o, b, e, r, t],
-    [D, O, N, A, L, G, E, R, B, T],
-    [Donald, Gerald, Robert]
-  ).
-
-status(send_more_money, solved) :-
-  once(send_more_money(_Solution, _Send, _More, _Money)).
-
-assignment(send_more_money, Solution) :-
-  once(send_more_money(Solution, _Send, _More, _Money)).
-
-equation(send_more_money, plus(Send, More, Money)) :-
-  once(send_more_money(_Solution, Send, More, Money)).
-
-status(donald_gerald_robert, solved) :-
-  once(donald_gerald_robert(_Solution, _Donald, _Gerald, _Robert)).
-
-assignment(donald_gerald_robert, Solution) :-
-  once(donald_gerald_robert(Solution, _Donald, _Gerald, _Robert)).
-
-equation(donald_gerald_robert, plus(Donald, Gerald, Robert)) :-
-  once(donald_gerald_robert(_Solution, Donald, Gerald, Robert)).

package/examples/eyelang/output/cryptarithmetic-send-more-money.pl

@@ -1,6 +0,0 @@
-status(send_more_money, solved).
-status(donald_gerald_robert, solved).
-assignment(send_more_money, solution(9, 5, 6, 7, 1, 0, 8, 2)).
-assignment(donald_gerald_robert, solution(5, 2, 6, 4, 8, 1, 9, 7, 3, 0)).
-equation(send_more_money, plus(9567, 1085, 10652)).
-equation(donald_gerald_robert, plus(526485, 197485, 723970)).

package/lib/eyelang/builtins/alphametic.js

@@ -1,144 +0,0 @@
-// Reusable alphametic addition solver.
-// It evaluates column constraints right-to-left, so examples such as
-// SEND+MORE=MONEY and DONALD+GERALD=ROBERT do not need to express digit search
-// with many relational select/3 and arithmetic goals.
-import { atom, deref, listFromItems, numberTerm, properListItems, unify } from '../term.js';
-
-export const alphameticBuiltins = {
-  register(registry) {
-    registry.add('alphametic_sum', 5, alphameticSum, {
-      fallbackWhenNotReady: true,
-      ready: alphameticReady,
-    });
-  }
-};
-
-function alphameticReady(goal, env) {
-  return atomList(goal.args[0], env) !== null && wordList(goal.args[1], env) !== null && atomList(goal.args[2], env) !== null;
-}
-
-function* alphameticSum({ goal, env }) {
-  const letters = atomList(goal.args[0], env);
-  const addends = wordList(goal.args[1], env);
-  const result = atomList(goal.args[2], env);
-  if (!letters || !addends || !result || letters.length > 10 || addends.length === 0) return;
-
-  const letterSet = new Set(letters);
-  for (const word of [...addends, result]) for (const letter of word) if (!letterSet.has(letter)) return;
-
-  const leading = new Set();
-  for (const word of [...addends, result]) if (word.length > 1) leading.add(word[0]);
-  const maxLen = Math.max(result.length, ...addends.map((word) => word.length));
-  const assignment = new Map();
-  const used = Array(10).fill(false);
-
-  function canUse(letter, digit) {
-    return !used[digit] && !(digit === 0 && leading.has(letter));
-  }
-
-  function assignDigit(letter, digit) {
-    assignment.set(letter, digit);
-    used[digit] = true;
-  }
-
-  function unassignDigit(letter, digit) {
-    assignment.delete(letter);
-    used[digit] = false;
-  }
-
-  function* assignAddends(column, carry, index, sum) {
-    if (index >= addends.length) {
-      yield* finishColumn(column, sum);
-      return;
-    }
-    const word = addends[index];
-    const letter = word[word.length - 1 - column];
-    if (letter === undefined) {
-      yield* assignAddends(column, carry, index + 1, sum);
-      return;
-    }
-    const assigned = assignment.get(letter);
-    if (assigned !== undefined) {
-      yield* assignAddends(column, carry, index + 1, sum + assigned);
-      return;
-    }
-    for (let digit = 0; digit <= 9; digit++) {
-      if (!canUse(letter, digit)) continue;
-      assignDigit(letter, digit);
-      yield* assignAddends(column, carry, index + 1, sum + digit);
-      unassignDigit(letter, digit);
-    }
-  }
-
-  function* finishColumn(column, sum) {
-    const resultLetter = result[result.length - 1 - column];
-    const digit = sum % 10;
-    const nextCarry = Math.floor(sum / 10);
-    if (resultLetter === undefined) {
-      if (digit === 0) yield* solveColumn(column + 1, nextCarry);
-      return;
-    }
-    const assigned = assignment.get(resultLetter);
-    if (assigned !== undefined) {
-      if (assigned === digit) yield* solveColumn(column + 1, nextCarry);
-      return;
-    }
-    if (!canUse(resultLetter, digit)) return;
-    assignDigit(resultLetter, digit);
-    yield* solveColumn(column + 1, nextCarry);
-    unassignDigit(resultLetter, digit);
-  }
-
-  function* solveColumn(column, carry) {
-    if (column >= maxLen) {
-      if (carry !== 0) return;
-      if (assignment.size !== letters.length) return;
-      yield new Map(assignment);
-      return;
-    }
-    yield* assignAddends(column, carry, 0, carry);
-  }
-
-  for (const solution of solveColumn(0, 0)) {
-    const digitTerms = letters.map((letter) => numberTerm(String(solution.get(letter))));
-    const values = [...addends, result].map((word) => wordValue(word, solution));
-    const valueTerms = values.map((value) => numberTerm(String(value)));
-    const next = env.clone();
-    if (unify(goal.args[3], listFromItems(digitTerms), next) && unify(goal.args[4], listFromItems(valueTerms), next)) yield next;
-  }
-}
-
-function wordValue(word, assignment) {
-  let value = 0;
-  for (const letter of word) value = value * 10 + assignment.get(letter);
-  return value;
-}
-
-function atomList(term, env) {
-  const items = properListItems(term, env);
-  if (!items) return null;
-  const out = [];
-  for (const item of items) {
-    const text = atomKey(deref(item, env));
-    if (text == null) return null;
-    out.push(text);
-  }
-  return out;
-}
-
-function wordList(term, env) {
-  const items = properListItems(term, env);
-  if (!items) return null;
-  const out = [];
-  for (const item of items) {
-    const word = atomList(item, env);
-    if (!word) return null;
-    out.push(word);
-  }
-  return out;
-}
-
-function atomKey(term) {
-  if (term.type === 'atom' || term.type === 'string' || term.type === 'number') return term.name;
-  return null;
-}

package/test/eyelang/conformance/cases/extension/045_alphametic_sum_small.pl

@@ -1,3 +0,0 @@
-% Reference 9.5: alphametic_sum/5 enumerates unique digit assignments for column addition.
-answer(solution, result(Digits, Values)) :- alphametic_sum([a, b], [[a], [a]], [b], Digits, Values).
-materialize(answer, 2).

package/test/eyelang/conformance/expected/extension/045_alphametic_sum_small.out

@@ -1,4 +0,0 @@
-answer(solution, result([1, 2], [1, 1, 2])).
-answer(solution, result([2, 4], [2, 2, 4])).
-answer(solution, result([3, 6], [3, 3, 6])).
-answer(solution, result([4, 8], [4, 4, 8])).