eyeprolog 0.5.11 → 0.5.13

package/README.md

@@ -32,9 +32,11 @@ Programs may declare their default queries with `%% goal:` comments.
 ## Portable library
 
 EyeProlog adds 50 public library predicates to its 115-predicate ISO profile.
-**48 of the 50 are ordinary Prolog clauses** in `src/eyeprolog-library.pl` and
-are autoloaded in Node and the browser. Only `uuid/1` and `local_time/1` require
-host support. Portable text predicates use ISO atoms or character lists; the
+**All 50 are ordinary Prolog clauses** across `src/eyeprolog-library.pl` and
+`src/eyeprolog-common-library.pl`; both are autoloaded in Node and the
+browser. None requires host support. Other Prolog systems should load only
+`eyeprolog-library.pl`, which avoids redefining their common list predicates.
+Portable text predicates use ISO atoms or character lists; the
 RDF tools emit lexical values as ISO atoms as well.
 
 ## RDF 1.2

package/examples/age.pl

@@ -1,8 +1,7 @@
 % Age checker adapted from Eyeling.
-% The example combines date literals, ISO-8601 duration values, local_time/1,
-% difference/3, and duration comparison.  It deliberately uses the current
-% local date so the derived ageAbove/2 fact remains an executable temporal
-% check rather than a precomputed constant.
+% The example combines date literals, ISO-8601 duration values, an explicit
+% local_time/1 fact, difference/3, and duration comparison. Declaring the date
+% as scenario data keeps the result reproducible across hosts and runs.
 
 %% goal: birthDay(X0, X1)
 
@@ -15,9 +14,10 @@
 
 birthDay(patH, '1944-08-21').
 duration(check, 'P80Y').
+local_time('2026-05-30').
 
-% A person is above a duration if the local date minus the birthday is greater
-% than that duration.
+% A person is above a duration if the declared local date minus the birthday
+% is greater than that duration.
 ageAbove(S, A) :-
   birthDay(S, B),
   duration(check, A),
@@ -27,4 +27,4 @@ ageAbove(S, A) :-
 
 % Test mirroring the Eyeling example.
 holds_result(test, true) :-
-  ageAbove(S, 'P80Y').
+  ageAbove(_, 'P80Y').

package/examples/blocks-world-planning.pl

@@ -48,7 +48,7 @@ move(State, move(Block, From, To), Newstate) :-
   (Block \= To),
   (From \= To),
   select(on(Block, From), State, Rest),
-  sort([on(Block, To)|Rest], Newstate).
+  sort_unique([on(Block, To)|Rest], Newstate).
 
 plan(State, Goal, 0, _visited, [], State) :-
   (State = Goal).
@@ -63,8 +63,8 @@ plan(State, Goal, Depth, Visited, [Move|Moves], Final) :-
 five_move_plan(Moves, Final) :-
   initial(Start),
   goal(Goal),
-  sort(Start, Sortedstart),
-  sort(Goal, Sortedgoal),
+  sort_unique(Start, Sortedstart),
+  sort_unique(Goal, Sortedgoal),
   plan(Sortedstart, Sortedgoal, 5, [Sortedstart], Moves, Final).
 
 status(blocks_world, planned) :-

package/examples/combinatorics-findall-sort.pl

@@ -1,7 +1,7 @@
-% Eyelet-inspired combinations example using findall/3 and sort/2.
+% Eyelet-inspired combinations example using findall/3 and sort_unique/2.
 %
 % combination/3 generates the same subset in several selection orders.  findall/3
-% collects those candidates, and sort/2 canonicalizes the list so each unordered
+% collects those candidates, and sort_unique/2 canonicalizes the list so each unordered
 % 3-combination of five items is reported once.
 %% goal: combinations(X0, X1)
 
@@ -24,12 +24,12 @@ combination(I, Items, Combination) :-
   select(Item, Items, Remaining),
   (J is I - 1),
   combination(J, Remaining, Partial),
-  sort([Item | Partial], Combination).
+  sort_unique([Item | Partial], Combination).
 
 % findall collects all generation orders; sort canonicalizes and deduplicates.
 unique_combinations(K, Items, Unique) :-
   findall(C, combination(K, Items, C), All),
-  sort(All, Unique).
+  sort_unique(All, Unique).
 
 combinations(combinations_5_choose_3, Unique) :-
   unique_combinations(3, [1, 2, 3, 4, 5], Unique).

package/examples/d3-group.pl

@@ -1,4 +1,4 @@
-% Eyelet-inspired D3 group example using findall/3 and sort/2.
+% Eyelet-inspired D3 group example using findall/3 and sort_unique/2.
 % The six facts are the symmetries of an equilateral triangle, with compose/3 as
 % the Cayley table and inverse/2 as the inverse relation.  Candidate subsets are
 % generated as subsequences, then filtered for subgroup closure.
@@ -72,7 +72,7 @@ subsequence([_head | Tail], Rest) :-
 
 all_symmetries(Symmetries) :-
   findall(X, symmetry(X), Raw),
-  sort(Raw, Symmetries).
+  sort_unique(Raw, Symmetries).
 
 % A valid subgroup is closed under both composition and inverse.
 closed_under_composition(Group) :-
@@ -90,7 +90,7 @@ valid_group(Group) :-
 
 all_subgroups(Groups) :-
   findall(G, valid_group(G), Raw),
-  sort(Raw, Groups).
+  sort_unique(Raw, Groups).
 
 subgroups(d3_group, Groups) :-
   all_subgroups(Groups).

package/examples/dijkstra-findall-sort.pl

@@ -1,7 +1,7 @@
-% Eyelet-inspired Dijkstra example using findall/3 and sort/2.
+% Eyelet-inspired Dijkstra example using findall/3 and sort_unique/2.
 % The priority queue is represented as sorted list entries [Cost, Node | Path].
 % Each expansion collects unvisited neighbors with findall/3, appends them to
-% the frontier, and uses sort/2 so the cheapest frontier entry is processed next.
+% the frontier, and uses sort_unique/2 so the cheapest frontier entry is processed next.
 
 %% goal: shortestPath(X0, X1)
 
@@ -34,7 +34,7 @@ dijkstra_queue([[Cost, Node | Path] | Queue], Goal, Visited, Resultpath, Resultc
     (edge(Node, Neighbor, Weight), \+ member(Neighbor, Visited), (Newcost is Cost + Weight)),
     Neighbors),
   append(Queue, Neighbors, Newqueue),
-  sort(Newqueue, Sortedqueue),
+  sort_unique(Newqueue, Sortedqueue),
   dijkstra_queue(Sortedqueue, Goal, [Node | Visited], Resultpath, Resultcost).
 
 shortestPath(dijkstra_findall_sort, Path) :-

package/examples/enigma1225.pl

@@ -89,7 +89,7 @@ eval_matrix(Matrix, FreqSorted) :-
     setof(E, member(E, Entries), Set),
     maplist(count_var(Entries), Set, Multiplicities),
     zip(Multiplicities, Set, Frequencies),
-    sort(Frequencies, FreqSorted),
+    sort_unique(Frequencies, FreqSorted),
     maplist(snd, FreqSorted, VarsSorted),
     length(VarsSorted, NVars),
     from_to(1, NVars, VarsSorted).
@@ -237,4 +237,3 @@ lists_reform([[A|B]|C], [A|D], [B|E]) :-
 
 % query
 %% goal: enigma1225(8, _)
-

package/examples/eulerian-path.pl

@@ -1,4 +1,4 @@
-% Eyelet-inspired Eulerian path example using findall/3 and sort/2.
+% Eyelet-inspired Eulerian path example using findall/3 and sort_unique/2.
 %
 % The graph is undirected; edges have identifiers so the trail consumes each
 % physical edge exactly once even when vertices are revisited.  The remaining
@@ -49,15 +49,15 @@ odd_degree(V) :-
 
 odd_vertices(Odds) :-
   findall(V, odd_degree(V), Raw),
-  sort(Raw, Odds).
+  sort_unique(Raw, Odds).
 
 all_edges(Edges) :-
   findall(E, edge(E, _a, _b), Raw),
-  sort(Raw, Edges).
+  sort_unique(Raw, Edges).
 
 vertices(Vertices) :-
   findall(V, vertex(V), Raw),
-  sort(Raw, Vertices).
+  sort_unique(Raw, Vertices).
 
 eulerian_start(Start) :-
   odd_vertices([Start, _end]).

package/examples/four-color-map.pl

@@ -102,13 +102,13 @@ border_count(36).
 
 all_countries_coloured(map_eu) :-
   findall(Country, valid_assignment(Country), Countries),
-  sort(Countries, Uniquecountries),
+  sort_unique(Countries, Uniquecountries),
   length(Uniquecountries, Count),
   country_count(Count).
 
 all_borders_checked(map_eu) :-
   findall([A, B], border_colours_differ(A, B), Borders),
-  sort(Borders, Uniqueborders),
+  sort_unique(Borders, Uniqueborders),
   length(Uniqueborders, Count),
   border_count(Count).
 

package/examples/input/odrl-dpv-healthcare-risk-ranked-rules.pl

@@ -15,7 +15,7 @@ healthcare_risk_report(Ranked) :-
     ),
     Unsorted
   ),
-  sort(Unsorted, Sorted),
+  sort_unique(Unsorted, Sorted),
   ranked_values(Sorted, 1, Ranked).
 
 risk_report(Risk, Score, Level, Clause, Mitigation) :-

package/examples/input/odrl-dpv-risk-ranked-rules.pl

@@ -15,7 +15,7 @@ consumer_risk_report(Ranked) :-
     ),
     Unsorted
   ),
-  sort(Unsorted, Sorted),
+  sort_unique(Unsorted, Sorted),
   ranked_values(Sorted, 1, Ranked).
 
 risk_report(Risk, Score, Level, Clause, Mitigation) :-

package/examples/input/rdf12-annotated-claims-rules.pl

@@ -25,7 +25,7 @@ ranked_claims(Claims) :-
     ),
     Unsorted
   ),
-  sort(Unsorted, Sorted),
+  sort_unique(Unsorted, Sorted),
   pair_values(Sorted, Claims).
 
 annotated_status_claim(Status, Source, Score) :-

package/examples/odrl-dpv-healthcare-risk-ranked.pl

@@ -56,7 +56,7 @@ healthcare_risk_report(Ranked) :-
     ),
     Unsorted
   ),
-  sort(Unsorted, Sorted),
+  sort_unique(Unsorted, Sorted),
   ranked_values(Sorted, 1, Ranked).
 
 risk_report(Risk, Score, Level, Clause, Mitigation) :-

package/examples/odrl-dpv-risk-ranked.pl

@@ -68,7 +68,7 @@ consumer_risk_report(Ranked) :-
     ),
     Unsorted
   ),
-  sort(Unsorted, Sorted),
+  sort_unique(Unsorted, Sorted),
   ranked_values(Sorted, 1, Ranked).
 
 risk_report(Risk, Score, Level, Clause, Mitigation) :-

package/examples/proof/age.pl

@@ -3,7 +3,7 @@ why(
   ageAbove(patH, 'P80Y'),
   proof(
     goal(ageAbove(patH, 'P80Y')),
-    by(rule("age.pl", clause(3))),
+    by(rule("age.pl", clause(4))),
     bindings([binding("S", patH), binding("A", 'P80Y'), binding("B", '1944-08-21'), binding("D", '2026-05-30'), binding("F", 'P81Y9M9D')]),
     uses([
       proof(
@@ -16,7 +16,7 @@ why(
       ),
       proof(
         goal(local_time('2026-05-30')),
-        by(builtin(local_time, 1))
+        by(fact("age.pl", clause(3)))
       ),
       proof(
         goal(difference('2026-05-30', '1944-08-21', 'P81Y9M9D')),
@@ -35,12 +35,12 @@ why(
   holds_result(test, true),
   proof(
     goal(holds_result(test, true)),
-    by(rule("age.pl", clause(4))),
-    bindings([binding("S", patH)]),
+    by(rule("age.pl", clause(5))),
+    bindings([binding("__anon0", patH)]),
     uses([
       proof(
         goal(ageAbove(patH, 'P80Y')),
-        by(rule("age.pl", clause(3))),
+        by(rule("age.pl", clause(4))),
         bindings([binding("S", patH), binding("A", 'P80Y'), binding("B", '1944-08-21'), binding("D", '2026-05-30'), binding("F", 'P81Y9M9D')]),
         uses([
           proof(
@@ -53,7 +53,7 @@ why(
           ),
           proof(
             goal(local_time('2026-05-30')),
-            by(builtin(local_time, 1))
+            by(fact("age.pl", clause(3)))
           ),
           proof(
             goal(difference('2026-05-30', '1944-08-21', 'P81Y9M9D')),

package/examples/proof/d3-group.pl

@@ -16,8 +16,8 @@ why(
             by(builtin(findall, 3))
           ),
           proof(
-            goal(sort([], [])),
-            by(library(sort, 2))
+            goal(sort_unique([], [])),
+            by(library(sort_unique, 2))
           )
         ])
       )
@@ -43,8 +43,8 @@ why(
             by(builtin(findall, 3))
           ),
           proof(
-            goal(sort([], [])),
-            by(library(sort, 2))
+            goal(sort_unique([], [])),
+            by(library(sort_unique, 2))
           )
         ])
       ),

package/examples/proof/iso-dynamic-database.pl

@@ -12,7 +12,7 @@ why(
         uses([
           proof(
             goal(task(check_power, urgent)),
-            by(fact("<input>", clause(275)))
+            by(fact("<input>", clause(303)))
           )
         ])
       )

package/examples/quine-mccluskey.pl

@@ -75,7 +75,7 @@ check(4, 'Canonical Tie-Breaking (Lexicographical First)', Status) :-
         find_combination(Size, Primes, C),
         covers_all(C, Minterms)
     ), Alternatives),
-    sort(Alternatives, [Best|_]),
+    sort_unique(Alternatives, [Best|_]),
     equality_status(Cover, Best, Status).
 
 check(5, 'Consistency (Solution is subset of Primes)', Status) :-
@@ -166,9 +166,9 @@ compute_primes(Primes) :-
     findall(B, (minterm(M), int_to_bits(M, B)), Mts),
     findall(B, (dont_care(D), int_to_bits(D, B)), Dcs),
     append(Mts, Dcs, All),
-    sort(All, Init),
+    sort_unique(All, Init),
     generate_loop(Init, [], RawPrimes),
-    sort(RawPrimes, Primes).
+    sort_unique(RawPrimes, Primes).
 
 generate_loop(Group, Acc, Final) :-
     findall(Nx-[P1,P2], (
@@ -176,8 +176,8 @@ generate_loop(Group, Acc, Final) :-
     ), Pairs),
     findall(N, member(N-_, Pairs), NextRaw),
     findall(P, (member(_-Pars, Pairs), member(P, Pars)), UsedRaw),
-    sort(NextRaw, NextGen),
-    sort(UsedRaw, Used),
+    sort_unique(NextRaw, NextGen),
+    sort_unique(UsedRaw, Used),
     findall(P, (member(P, Group), \+ member(P, Used)), New),
     append(Acc, New, AccUpd),
     (NextGen = [] -> Final = AccUpd ; generate_loop(NextGen, AccUpd, Final)).
@@ -187,13 +187,13 @@ solve_minimal_cover(Primes, MinimalCover) :-
     % 1. Essentials
     findall(M-Ps, (member(M, Minterms), findall(P, (member(P, Primes), covers_int(P, M)), Ps)), Chart),
     findall(P, member(_-[P], Chart), EssRaw),
-    sort(EssRaw, Essentials),
+    sort_unique(EssRaw, Essentials),
     % 2. Remaining
     remaining_minterms(Minterms, Essentials, RemMts),
     subtract_list(Primes, Essentials, NonEss),
     (RemMts = [] -> BestRest = [] ; find_smallest_subset(NonEss, RemMts, BestRest)),
     append(Essentials, BestRest, Total),
-    sort(Total, MinimalCover).
+    sort_unique(Total, MinimalCover).
 
 remaining_minterms([], _, []).
 remaining_minterms([M|Ms], Essentials, Rest) :-

package/examples/rdf12-annotated-claims.pl

@@ -41,7 +41,7 @@ ranked_claims(Claims) :-
     ),
     Unsorted
   ),
-  sort(Unsorted, Sorted),
+  sort_unique(Unsorted, Sorted),
   pair_values(Sorted, Claims).
 
 annotated_status_claim(Status, Source, Score) :-

package/examples/sudoku.pl

@@ -46,7 +46,7 @@ best_choice(Grid, Row, Column, Candidates) :-
     ),
     Choices
   ),
-  sort(Choices, [choice(_Count, Row, Column, Candidates)|_]).
+  sort_unique(Choices, [choice(_Count, Row, Column, Candidates)|_]).
 
 empty_cell(Grid, Row, Column) :-
   between(0, 8, Row),

package/examples/uuid.pl

@@ -1,12 +1,12 @@
-% uuid/1 creates exactly one fresh version 4 UUID atom.
+% uuid/3 creates a version 4 UUID atom from explicit random state.
 %
-% The UUID itself varies between runs, so this example checks its type and
-% canonical shape while returning a stable, reviewable answer.
+% The same initial seed reproduces the same UUID across runs. Threading the
+% returned seed into another call produces the next UUID in the sequence.
 
 %% goal: uuid_example(Result)
 
 uuid_example(true) :-
-  uuid(UUID),
+  uuid(20260807, UUID, _),
   atom(UUID),
   atom_length(UUID, 36),
   sub_atom(UUID, 8, 1, 27, '-'),

package/package.json

@@ -3,7 +3,7 @@
   "publishConfig": {
     "access": "public"
   },
-  "version": "0.5.11",
+  "version": "0.5.13",
   "description": "EyeProlog turns facts and rules into answers and proofs.",
   "type": "module",
   "main": "./index.js",

package/playground.html

@@ -655,6 +655,7 @@
             "aggregate_max",
             "aggregate_min",
             "append",
+            "apply",
             "arg",
             "asin",
             "atan2",
@@ -681,7 +682,6 @@
             "le",
             "length",
             "list_to_set",
-            "local_time",
             "log",
             "lowercase",
             "lt",
@@ -699,6 +699,7 @@
             "number_string",
             "once",
             "pow",
+            "random",
             "replace",
             "reverse",
             "rounded",
@@ -707,7 +708,7 @@
             "sin",
             "slice",
             "smallest_divisor_from",
-            "sort",
+            "sort_unique",
             "split",
             "sqrt",
             "string_concat",
@@ -744,6 +745,7 @@
     let backgroundSource = '';
     let backgroundName = '';
     let activeWorker = null;
+    let activeWorkerStartupTimer = null;
     let renderToken = 0;
     let syntaxErrorLine = null;
     let sourceReference = { kind: 'custom' };
@@ -957,9 +959,29 @@
       runButton.disabled = true;
       stopButton.disabled = false;
 
-      const workerUrl = new URL('./src/playground-worker.js?playground=20260803d', location.href);
+      const workerUrl = new URL('./src/playground-worker.js?playground=20260807b', location.href);
       activeWorker = new Worker(workerUrl, { type: 'module' });
-      activeWorker.onmessage = (event) => finishRun(event.data);
+      const worker = activeWorker;
+      const request = {
+        source: combinedSource(),
+        options: { goals: selectedGoals(), proof: proof.checked, stats: stats.checked },
+      };
+      activeWorkerStartupTimer = setTimeout(() => {
+        if (activeWorker !== worker) return;
+        finishRun({
+          ok: false,
+          error: 'The reasoning worker did not finish loading. Reload the page to refresh cached EyeProlog assets.',
+        });
+      }, 10000);
+      activeWorker.onmessage = (event) => {
+        if (event.data?.type === 'ready') {
+          clearTimeout(activeWorkerStartupTimer);
+          activeWorkerStartupTimer = null;
+          worker.postMessage(request);
+          return;
+        }
+        finishRun(event.data);
+      };
       activeWorker.onerror = (event) => {
         const location = event.filename
           ? ` (${event.filename}${event.lineno ? `:${event.lineno}${event.colno ? `:${event.colno}` : ''}` : ''})`
@@ -974,10 +996,6 @@
         ok: false,
         error: 'The reasoning worker returned an unreadable message.',
       });
-      activeWorker.postMessage({
-        source: combinedSource(),
-        options: { goals: selectedGoals(), proof: proof.checked, stats: stats.checked },
-      });
     }
 
     function combinedSource() {
@@ -1072,6 +1090,8 @@
     }
 
     function cleanupWorker() {
+      if (activeWorkerStartupTimer != null) clearTimeout(activeWorkerStartupTimer);
+      activeWorkerStartupTimer = null;
       if (activeWorker) activeWorker.terminate();
       activeWorker = null;
     }

package/src/cli.js

@@ -115,7 +115,7 @@ async function loadEngine() {
       import('./program.js'),
       import('./solver.js'),
       import('./iso.js'),
-      import('./library.js'),
+      import('./eyeprolog-autoload.js'),
     ]);
     engineModule = { ...term, ...parser, ...program, ...solver, ...iso, ...library };
   }

package/src/explain.js

@@ -4,7 +4,7 @@
 // human-readable and machine-readable.
 import { ATOM, COMPOUND, Env, Term, VAR, deref, flattenConjunction, freshTerm, termToString, unify, variantTerms } from './term.js';
 import { selectClauseCandidates } from './program.js';
-import { getEyePrologRegistry } from './library.js';
+import { getEyePrologRegistry } from './eyeprolog-autoload.js';
 import { Solver, nextFreshId } from './solver.js';
 
 export function whyProof(program, goal, options = {}) {

package/src/eyeprolog-autoload.js

@@ -0,0 +1,133 @@
+// Autoload the pure-Prolog EyeProlog library in Node and the browser.
+import { createDefaultRegistry } from './iso.js';
+import { parseClauses } from './parser.js';
+import { fs, isNode } from './platform.js';
+
+export const eyePrologNativeLibraryIndicators = Object.freeze([]);
+
+export const eyePrologPortableLibraryIndicators = Object.freeze([
+  'uuid/3',
+  'difference/3',
+  'apply/3',
+  'maplist/3',
+  'tan/2',
+  'asin/2',
+  'acos/2',
+  'atan2/3',
+  'lt/2',
+  'gt/2',
+  'le/2',
+  'ge/2',
+  'between/3',
+  'smallest_divisor_from/3',
+  'random/3',
+  'matches/3',
+  'split/3',
+  'replace/4',
+  'lowercase/2',
+  'uppercase/2',
+  'trim/2',
+  'number_string/2',
+  'atom_string/2',
+  'term_string/2',
+  'append/3',
+  'string_concat/3',
+  'contains/2',
+  'matches/2',
+  'join/3',
+  'substring/4',
+  'member/2',
+  'select/3',
+  'last/2',
+  'nth0/3',
+  'nth1/3',
+  'set_nth0/4',
+  'take/3',
+  'drop/3',
+  'slice/4',
+  'reverse/2',
+  'length/2',
+  'sum_list/2',
+  'min_list/2',
+  'max_list/2',
+  'list_to_set/2',
+  'sort_unique/2',
+  'countall/2',
+  'sumall/3',
+  'aggregate_min/5',
+  'aggregate_max/5',
+]);
+
+export const eyePrologLibraryIndicators = Object.freeze([
+  ...eyePrologNativeLibraryIndicators,
+  ...eyePrologPortableLibraryIndicators,
+]);
+
+const autoloadedPrograms = new WeakSet();
+const libraryFiles = [
+  'eyeprolog-library.pl',
+  'eyeprolog-common-library.pl',
+];
+const libraryCacheKey = isNode
+  ? null
+  : (new URL(import.meta.url).searchParams.get('playground') ?? '20260807b');
+const librarySources = await Promise.all(libraryFiles.map(async (filename) => ({
+  filename,
+  source: await loadLibrarySource(libraryFileUrl(filename)),
+})));
+const portableClauseTemplates = librarySources.flatMap(({ filename, source }) => parseClauses(source, {
+  filename: `src/${filename}`,
+  sourceMetadata: true,
+}));
+
+async function loadLibrarySource(url) {
+  if (isNode) return fs.readFileSync(url, 'utf8');
+  const response = await fetch(url);
+  if (!response.ok) throw new Error(`could not load EyeProlog library: ${response.status}`);
+  return response.text();
+}
+
+function libraryFileUrl(filename) {
+  const url = new URL(`./${filename}`, import.meta.url);
+  if (!isNode && libraryCacheKey) url.searchParams.set('playground', libraryCacheKey);
+  return url;
+}
+
+export function ensureEyePrologLibrary(program) {
+  if (autoloadedPrograms.has(program)) return program;
+
+  // User clauses already present in the Program stay first in clause order;
+  // the autoloaded library clauses are appended as defaults. This preserves
+  // useful source specializations such as length(numbers,N) while still making
+  // the relational length(List,N) library clauses available inside them.
+  let added = 0;
+  for (const template of portableClauseTemplates) {
+    // Clause terms are immutable; clone only the mutable indexing shell so the
+    // cached parse can be safely shared across independent Program instances.
+    const clause = {
+      ...template,
+      body: template.body.slice(),
+      index: program.clauses.length,
+      eyePrologLibraryPortable: true,
+    };
+    program.clauses.push(clause);
+    program.indexClause(clause);
+    added++;
+  }
+  if (added > 0) program.markRecursivePredicates();
+  autoloadedPrograms.add(program);
+  return program;
+}
+
+export function createEyePrologRegistry() {
+  const registry = createDefaultRegistry();
+  registry.eyePrologLibrary = true;
+  return registry;
+}
+
+let eyePrologRegistry = null;
+
+export function getEyePrologRegistry() {
+  if (eyePrologRegistry == null) eyePrologRegistry = createEyePrologRegistry();
+  return eyePrologRegistry;
+}