eyeprolog 1.5.90 → 1.5.92

package/conformance-report.md

@@ -24,8 +24,8 @@ bytes, avoiding a second live fetch and its race window.
 | context | 11 | 0 | 0 | 0 | 11 |
 | control | 15 | 0 | 0 | 0 | 15 |
 | explicit-tabling | 6 | 0 | 0 | 0 | 6 |
-| iso | 238 | 219 | 0 | 0 | 457 |
-| lists | 52 | 3 | 0 | 0 | 55 |
+| iso | 259 | 220 | 0 | 0 | 479 |
+| lists | 61 | 3 | 0 | 0 | 64 |
 | modules | 2 | 0 | 0 | 0 | 2 |
 | negation | 8 | 0 | 19 | 0 | 27 |
 | proofs | 0 | 0 | 0 | 21 | 21 |
@@ -37,7 +37,7 @@ bytes, avoiding a second live fetch and its race window.
 | terms | 26 | 3 | 0 | 0 | 29 |
 | unification | 18 | 0 | 0 | 0 | 18 |
 | variables | 16 | 7 | 0 | 0 | 23 |
-| **Total** | **560** | **274** | **19** | **21** | **874** |
+| **Total** | **590** | **275** | **19** | **21** | **905** |
 
 ## DCG conformance clarification
 

package/package.json

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

package/test/conformance/README.md

@@ -138,7 +138,7 @@ Selected cases are adapted from the ISO and standard-core suites of Logtalk,
 Scryer Prolog, Trealla Prolog, and SWI-Prolog. Their upstream identifiers and licenses
 are recorded in [THIRD_PARTY.md](THIRD_PARTY.md).
 
-The corpus has 457 cases in `iso/` and 874 file-based conformance cases in total. Of those, 11 cases in `stc/` are explicitly labelled working-draft review evidence rather than normative ISO claims. The strict-reader WG17 syntax matrix is discovered dynamically and executed live by the Neumerkel gate, the same as its other seven TU Wien sources; release/report checks separately verify the tracked `NEUMERKEL-LATEST.md`. The generated `conformance-report.md` records local corpus totals and links to that live evidence. Together with regression, documentation-sync, API, example, and book-example checks, `npm test` is the release gate.
+The corpus has 479 cases in `iso/` and 905 file-based conformance cases in total. Of those, 11 cases in `stc/` are explicitly labelled working-draft review evidence rather than normative ISO claims. The strict-reader WG17 syntax matrix is discovered dynamically and executed live by the Neumerkel gate, the same as its other seven TU Wien sources; release/report checks separately verify the tracked `NEUMERKEL-LATEST.md`. The generated `conformance-report.md` records local corpus totals and links to that live evidence. Together with regression, documentation-sync, API, example, and book-example checks, `npm test` is the release gate.
 
 ## Updating expected output
 

package/test/conformance/THIRD_PARTY.md

@@ -102,14 +102,24 @@ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 SOFTWARE.
 
-## SWI-Prolog core tests
-
-Selected standard-core operator and finite-tree unification cases under `iso/`
-are adapted from `tests/core/test_op.pl` and
-`tests/core/test_occurs_check.pl` in
-[SWI-Prolog](https://github.com/SWI-Prolog/swipl-devel). Each adapted file
-identifies its upstream source. The cases were rewritten for EyeProlog's query and
-exact-output harness.
+## SWI-Prolog core and library tests
+
+Selected standard-core operator, finite-tree unification, arithmetic, sort,
+list, exception, and syntax cases under `iso/` are adapted from files under
+`tests/core_lang/` and `tests/core_text/` in
+[SWI-Prolog](https://github.com/SWI-Prolog/swipl-devel) -- named
+`tests/core/test_op.pl` and `tests/core/test_occurs_check.pl` in older
+checkouts, before that directory was split. Each adapted file identifies its
+upstream source file.
+
+Selected standard-library cases under the topic directories (not `iso/`,
+since these exercise EyeProlog's own bundled `src/lib/` modules rather than
+ISO core semantics) are adapted from files under `tests/library/` in the same
+project -- `test_lists.pl`, `test_ordsets.pl`, `test_assoc.pl`,
+`test_aggregate.pl`, and `test_ugraphs.pl`. Each adapted file identifies its
+upstream source file and the `library(...)` module it needs.
+
+The cases were rewritten for EyeProlog's query and exact-output harness.
 
 BSD 2-Clause License
 

package/test/conformance/cases/iso/scryer_current_predicate_after_existence_error.pl

@@ -0,0 +1,7 @@
+% Adapted from Scryer Prolog tests-pl/issue3370_current_predicate_call.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: current_predicate_after_existence_error(X0)
+
+current_predicate_after_existence_error(R) :-
+    catch(call(foo_undefined, 1), _, true),
+    ( current_predicate(foo_undefined/1) -> R = defined ; R = not_defined ).

package/test/conformance/cases/iso/scryer_current_prolog_flag_shared_var.pl

@@ -0,0 +1,6 @@
+% Adapted from Scryer Prolog tests-pl/issue2914.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: current_prolog_flag_shared_var(X0)
+
+current_prolog_flag_shared_var(R) :-
+    ( current_prolog_flag(X, X) -> R = true ; R = false ).

package/test/conformance/cases/iso/scryer_op_name_type_error.pl

@@ -0,0 +1,6 @@
+% Adapted from Scryer Prolog tests-pl/invalid_decl3.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: op_name_type_error(X0)
+
+op_name_type_error(E) :-
+    catch(op(5, xfx, example(a, b)), error(E, _), true).

package/test/conformance/cases/iso/swipl_call_n_builds_control_construct.pl

@@ -0,0 +1,8 @@
+% Adapted from SWI-Prolog tests/core_lang/test_call.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: call_n_builds_control_construct(X0, X1, X2)
+
+call_n_builds_control_construct(IfThenElse, Disj, Conj) :-
+    findall(X, call(;((true -> X = a)), X = b), IfThenElse),
+    findall(X, call(;(X = a), X = b), Disj),
+    findall(X, call(','(X = a), X = b), Conj).

package/test/conformance/cases/iso/swipl_catch_partial_unification_rethrow.pl

@@ -0,0 +1,9 @@
+% Adapted from SWI-Prolog tests/core_lang/test_call.pl (catch, partial_unification).
+% See test/conformance/THIRD_PARTY.md.
+%% goal: catch_partial_unification_rethrow(X0)
+
+t3_rethrow :- throw(f(_, 2)).
+t2_rethrow(X) :- catch(t3_rethrow, f(2, 1), X = 2).
+t1_rethrow(X) :- catch(t2_rethrow(X), f(1, 2), X = 1).
+
+catch_partial_unification_rethrow(X) :- t1_rethrow(X).

package/test/conformance/cases/iso/swipl_keysort_remaining_errors.pl

@@ -0,0 +1,10 @@
+% Adapted from SWI-Prolog tests/core_lang/test_sort.pl (keysort tests a, b, c;
+% the pair-type case (d) is already covered by corrigenda_keysort_pair_type.pl).
+% See test/conformance/THIRD_PARTY.md.
+%% goal: keysort_remaining_errors(X0, X1, X2)
+
+keysort_remaining_errors(Open, Improper, ElementOpen) :-
+    catch(keysort([a-b, b-b, a-b | _], _), error(Open, _), true),
+    L = [a-b, b-b | a],
+    catch(keysort(L, _), error(Improper, _), true),
+    catch(keysort([a-b, _], _), error(ElementOpen, _), true).

package/test/conformance/cases/iso/swipl_length_errors.pl

@@ -0,0 +1,8 @@
+% Adapted from SWI-Prolog tests/core_lang/test_bips.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: length_errors(X0, X1, X2)
+
+length_errors(NegLen, NonIntAtom, NonIntFloat) :-
+    catch(length(_, -2), error(NegLen, _), true),
+    catch(length(_, a), error(NonIntAtom, _), true),
+    catch(length(_, 0.1), error(NonIntFloat, _), true).

package/test/conformance/cases/iso/swipl_memberchk_binding_retention.pl

@@ -0,0 +1,6 @@
+% Adapted from SWI-Prolog tests/core_lang/test_list.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: memberchk_binding_retention(X0)
+
+memberchk_binding_retention(X) :-
+    memberchk(f(X, a), [f(x, b), f(y, a)]).

package/test/conformance/cases/iso/swipl_operator_table_self_named.pl

@@ -0,0 +1,16 @@
+% Adapted from SWI-Prolog tests/core_text/test_syntax.pl (iso_op_table_6).
+% See test/conformance/THIRD_PARTY.md.
+:- op(100, fy, fy).
+:- op(100, xfy, xfy).
+:- op(100, yfx, yfx).
+:- op(100, yf, yf).
+
+%% goal: operator_table_self_named(X0, X1, X2, X3, X4, X5)
+
+operator_table_self_named(R1, R2, R3, R4, R5, R6) :-
+    T1 = (fy fy 1), T1 == fy(fy(1)), R1 = T1,
+    T2 = (1 xfy 2 xfy 3), T2 == xfy(1, xfy(2, 3)), R2 = T2,
+    T3 = (1 xfy 2 yfx 3), T3 == xfy(1, yfx(2, 3)), R3 = T3,
+    T4 = (fy 2 yf), T4 == fy(yf(2)), R4 = T4,
+    T5 = (1 yf yf), T5 == yf(yf(1)), R5 = T5,
+    T6 = (1 yfx 2 yfx 3), T6 == yfx(yfx(1, 2), 3), R6 = T6.

package/test/conformance/cases/iso/swipl_sort_partial_list_errors.pl

@@ -0,0 +1,8 @@
+% Adapted from SWI-Prolog tests/core_lang/test_sort.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: sort_partial_list_errors(X0, X1)
+
+sort_partial_list_errors(Open, Improper) :-
+    catch(sort([a, b, a | _], _), error(Open, _), true),
+    L = [a, b | a],
+    catch(sort(L, _), error(Improper, _), true).

package/test/conformance/cases/iso/swipl_write_canonical_var_and_curly.pl

@@ -0,0 +1,8 @@
+% Adapted from SWI-Prolog tests/core_text/test_write.pl (write_canonical tests).
+% See test/conformance/THIRD_PARTY.md.
+%% goal: write_canonical_var_and_curly(ok)
+
+write_canonical_var_and_curly(ok) :-
+    write_canonical('$VAR'(1)), nl,
+    write_canonical({a, b}), nl,
+    write_canonical(x(B, B)), nl.

package/test/conformance/cases/iso/trealla_clause_enumeration_backtracking.pl

@@ -0,0 +1,13 @@
+% Adapted from Trealla Prolog tests/tests/test0019.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: clause_enumeration_backtracking(X0)
+
+populate_x24c :-
+    assertz(x24c(0)),
+    assertz(x24c(1)),
+    assertz(x24c(2)),
+    assertz(x24c(3)).
+
+clause_enumeration_backtracking(L) :-
+    populate_x24c,
+    findall(X - B, clause(x24c(X), B), L).

package/test/conformance/cases/iso/trealla_compare_standard_order.pl

@@ -0,0 +1,8 @@
+% Adapted from Trealla Prolog tests/tests/test0059.pl (test15d).
+% See test/conformance/THIRD_PARTY.md.
+%% goal: compare_standard_order(ok)
+
+compare_standard_order(ok) :-
+    compare(<, 1, 2),
+    compare(=, 2, 2),
+    compare(>, 3, 2).

package/test/conformance/cases/iso/trealla_copy_term_bound_list_tail.pl

@@ -0,0 +1,6 @@
+% Adapted from Trealla Prolog tests/tests/test0070.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: copy_term_bound_list_tail(X0)
+
+copy_term_bound_list_tail(T2) :-
+    L = [aa, bb, cc], L = [_ | T], copy_term(T, T2).

package/test/conformance/cases/iso/trealla_curly_and_colon_syntax_equivalence.pl

@@ -0,0 +1,10 @@
+% Adapted from Trealla Prolog tests/tests/test0073.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: curly_and_colon_syntax_equivalence(X0, X1, X2, X3, X4)
+
+curly_and_colon_syntax_equivalence(X, Y, Z, A, B) :-
+    X = {a:b},
+    Y = {}(a:b),
+    Z = :(a, b),
+    A = a:b,
+    B = (a:b).

package/test/conformance/cases/iso/trealla_curly_braces_as_predicate.pl

@@ -0,0 +1,10 @@
+% Adapted from Trealla Prolog tests/tests/test0059.pl (test17).
+% See test/conformance/THIRD_PARTY.md.
+%% goal: curly_braces_as_predicate(ok)
+
+curly_braces_as_predicate(ok) :-
+    assertz({abc, 123}), assertz({xyz, 456}),
+    clause({abc, X}, B), X = 123, B = true,
+    clause({xyz, Y}, C), Y = 456, C = true,
+    {abc, Z}, Z = 123,
+    retract({xyz, W}), W = 456.

package/test/conformance/cases/iso/trealla_forall_arithmetic_facts.pl

@@ -0,0 +1,10 @@
+% Adapted from Trealla Prolog tests/tests/test0032.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: forall_arithmetic_facts(ok)
+
+eq32(3, 1 + 2).
+eq32(24, 6 * 4).
+eq32(1, 5 mod 2).
+
+forall_arithmetic_facts(ok) :-
+    forall(eq32(Left, Right), Left =:= Right).

package/test/conformance/cases/iso/trealla_functor_arg_partial_term.pl

@@ -0,0 +1,18 @@
+% Adapted from Trealla Prolog tests/tests/test0059.pl (test1, test3).
+% See test/conformance/THIRD_PARTY.md.
+%% goal: functor_arg_partial_term(ok)
+
+functor_arg_partial_term(ok) :-
+    F = f(a, _, c),
+    functor(F, f, 3),
+    arg(2, F, b),
+    F = f(a, b, c).
+
+%% goal: copy_term_then_reunify_propagates(ok)
+
+copy_term_then_reunify_propagates(ok) :-
+    F = f(A, B, C),
+    copy_term(F, X),
+    F = X,
+    A = a, B = b, C = c,
+    arg(2, X, b).

package/test/conformance/cases/iso/trealla_ground_progressive_backtracking.pl

@@ -0,0 +1,21 @@
+% Adapted from Trealla Prolog tests/tests/test0059.pl (test18).
+% See test/conformance/THIRD_PARTY.md.
+%% goal: ground_progressive_backtracking(ok)
+
+t18a2(X) :- X = f(a, b), fail.
+t18a2(X) :- X = f(b, c), fail.
+t18a2(X) :- X = f(_, world).
+t18a(X) :- t18a2(X).
+
+t18b2(X) :- X = f(e, f), fail.
+t18b2(X) :- X = f(f, g), fail.
+t18b2(X) :- X = f(hello, _).
+t18b(X) :- t18b2(X).
+
+ground_progressive_backtracking(ok) :-
+    X = f(_, _),
+    t18a(X),
+    \+ ground(X),
+    t18b(X),
+    ground(X),
+    X = f(hello, world).

package/test/conformance/cases/iso/trealla_once_inside_findall_template.pl

@@ -0,0 +1,12 @@
+% Adapted from Trealla Prolog tests/tests/test0059.pl (test16c).
+% See test/conformance/THIRD_PARTY.md.
+%% goal: once_inside_findall_template(X0)
+
+age_once(peter, 7).
+age_once(anne, 5).
+age_once(pat, 8).
+age_once(tom, 5).
+
+once_inside_findall_template(L) :-
+    findall(X, once(age_once(X, _)), L),
+    ground(L), L = [peter].

package/test/conformance/cases/iso/trealla_variable_aliasing_across_calls.pl

@@ -0,0 +1,9 @@
+% Adapted from Trealla Prolog tests/tests/test0059.pl (test14).
+% See test/conformance/THIRD_PARTY.md.
+%% goal: variable_aliasing_across_calls(ok)
+
+bar_alias([A], B) :- A = B.
+foo_alias(A, B) :- bar_alias(A, B).
+
+variable_aliasing_across_calls(ok) :-
+    A = a, foo_alias([A], B), A = B.

package/test/conformance/cases/lists/swipl_aggregate_sum_count.pl

@@ -0,0 +1,14 @@
+% Adapted from SWI-Prolog tests/library/test_aggregate.pl.
+% See test/conformance/THIRD_PARTY.md.
+:- use_module(library(aggregate)).
+:- use_module(library(between)).
+
+%% goal: aggregate_sum_template(X0)
+
+aggregate_sum_template(Sum) :-
+    aggregate(sum(X), between(1, 2, X), Sum), !.
+
+%% goal: aggregate_count_existential(X0)
+
+aggregate_count_existential(Count) :-
+    aggregate(count, X ^ between(1, 2, X), Count), !.

package/test/conformance/cases/lists/swipl_assoc_del_min_roundtrip.pl

@@ -0,0 +1,27 @@
+% Adapted from SWI-Prolog tests/library/test_assoc.pl (random_min, del_empty,
+% del_no_member; a fixed key list stands in for SWI's random/1-seeded one).
+% See test/conformance/THIRD_PARTY.md.
+:- use_module(library(assoc)).
+
+del_min_assoc_to_list(A, L) :- del_min_assoc_to_list(A, [], L).
+del_min_assoc_to_list(t, L, L) :- !.
+del_min_assoc_to_list(A, Rest, [Key - Val | Result]) :-
+    del_min_assoc(A, Key, Val, A1) -> is_assoc(A1), del_min_assoc_to_list(A1, Rest, Result).
+
+%% goal: assoc_del_min_roundtrip(X0)
+
+assoc_del_min_roundtrip(L) :-
+    list_to_assoc([5-e, 3-c, 8-h, 1-a, 4-d, 7-g, 2-b, 6-f, 10-j, 9-i, 11-k], A),
+    del_min_assoc_to_list(A, L), !.
+
+%% goal: assoc_del_min_empty_fails(ok)
+
+assoc_del_min_empty_fails(ok) :-
+    empty_assoc(A),
+    \+ del_min_assoc(A, _, _, _), !.
+
+%% goal: assoc_del_min_no_member_fails(ok)
+
+assoc_del_min_no_member_fails(ok) :-
+    list_to_assoc([1-a, 2-b, 4-c], A),
+    \+ del_min_assoc(3, A, _, _), !.

package/test/conformance/cases/lists/swipl_assoc_is_assoc_malformed.pl

@@ -0,0 +1,37 @@
+% Adapted from SWI-Prolog tests/library/test_assoc.pl (unbalanced_1/2/3,
+% unordered_1/2/3, bad_structure_1/2, bad_structure_keys_not_ground).
+% See test/conformance/THIRD_PARTY.md.
+:- use_module(library(assoc)).
+
+%% goal: assoc_is_assoc_rejects_unbalanced(ok)
+
+assoc_is_assoc_rejects_unbalanced(ok) :-
+    \+ is_assoc(t(5, 1, <, t(3, 1, <, t(2, 1, <, t(1, 1, -, t, t), t), t(4, 1, -, t, t)),
+                  t(8, 1, -, t(7, 1, <, t(6, 1, -, t, t), t), t(10, 1, -, t(9, 1, -, t, t), t(11, 1, -, t, t))))),
+    \+ is_assoc(t(5, 1, -, t(3, 1, -, t(2, 1, <, t(1, 1, -, t, t), t), t(4, 1, -, t, t)),
+                  t(8, 1, -, t(7, 1, <, t(6, 1, -, t, t), t), t(10, 1, -, t(9, 1, -, t, t), t(11, 1, -, t, t))))),
+    \+ is_assoc(t(5, 1, -, t(3, 1, <, t(2, 1, <, t(1, 1, -, t, t), t), t(4, 1, -, t, t)),
+                  t(8, 1, -, t(7, 1, <, t(6, 1, -, t, t), t), t(10, 1, -, t(9, 1, -, t, t), t(11, 1, >, t, t))))),
+    !.
+
+%% goal: assoc_is_assoc_rejects_unordered(ok)
+
+assoc_is_assoc_rejects_unordered(ok) :-
+    \+ is_assoc(t(5, 1, -, t(3, 1, <, t(2, 1, >, t, t(1, 1, -, t, t)), t(4, 1, -, t, t)),
+                  t(8, 1, -, t(7, 1, <, t(6, 1, -, t, t), t), t(10, 1, -, t(9, 1, -, t, t), t(11, 1, -, t, t))))),
+    \+ is_assoc(t(5, 1, -, t(4, 1, <, t(2, 1, <, t(1, 1, -, t, t), t), t(4, 1, -, t, t)),
+                  t(8, 1, -, t(7, 1, <, t(6, 1, -, t, t), t), t(10, 1, -, t(9, 1, -, t, t), t(11, 1, -, t, t))))),
+    \+ is_assoc(t(5, 1, -, t(3, 1, <, t(2, 1, <, t(1, 1, -, t, t), t), t(6, 1, -, t, t)),
+                  t(8, 1, -, t(7, 1, <, t(6, 1, -, t, t), t), t(10, 1, -, t(9, 1, -, t, t), t(11, 1, -, t, t))))),
+    !.
+
+%% goal: assoc_is_assoc_rejects_bad_structure(ok)
+
+assoc_is_assoc_rejects_bad_structure(ok) :-
+    \+ is_assoc(t(5, 1, =, t(3, 1, <, t(2, 1, <, t(1, 1, -, t, t), t), t(4, 1, -, t, t)),
+                  t(8, 1, -, t(7, 1, <, t(6, 1, -, t, t), t), t(10, 1, -, t(9, 1, -, t, t), t(11, 1, -, t, t))))),
+    \+ is_assoc(t(5, 1, -, t(3, 1, <, t(2, 1, <, t(1, 1, -, t, t), t), t(4, 1, -, t, t)),
+                  t(8, 1, -, t(7, 1, <, t(6, 1, -, t, t), t), t(10, 1, -, t(9, 1, -, t, t), t(11, 1, -, f, t))))),
+    \+ is_assoc(t(5, 1, -, t(3-_X, 1, <, t(2, 1, <, t(1, 1, -, t, t), t), t(4, 1, -, t, t)),
+                  t(8, 1, -, t(7, 1, <, t(6, 1, -, t, t), t), t(10, 1, -, t(9, 1, -, t, t), t(11, 1, -, t, t))))),
+    !.

package/test/conformance/cases/lists/swipl_assoc_is_assoc_valid.pl

@@ -0,0 +1,10 @@
+% Adapted from SWI-Prolog tests/library/test_assoc.pl (wirth_85).
+% See test/conformance/THIRD_PARTY.md.
+:- use_module(library(assoc)).
+
+%% goal: assoc_is_assoc_valid(ok)
+
+assoc_is_assoc_valid(ok) :-
+    is_assoc(t(5, 1, -, t(3, 1, <, t(2, 1, <, t(1, 1, -, t, t), t), t(4, 1, -, t, t)),
+                t(8, 1, -, t(7, 1, <, t(6, 1, -, t, t), t), t(10, 1, -, t(9, 1, -, t, t), t(11, 1, -, t, t))))),
+    !.

package/test/conformance/cases/lists/swipl_lists_foldl_empty.pl

@@ -0,0 +1,15 @@
+% Adapted from SWI-Prolog tests/library/test_apply.pl (foldl empty tests).
+% See test/conformance/THIRD_PARTY.md.
+:- use_module(library(lists)).
+
+false_foldl(_, _, _) :- fail.
+
+%% goal: lists_foldl_empty_atom_starter(X0)
+
+lists_foldl_empty_atom_starter(V) :-
+    foldl(false_foldl, [], foo, V), V == foo, !.
+
+%% goal: lists_foldl_empty_unbound_starter(ok)
+
+lists_foldl_empty_unbound_starter(ok) :-
+    foldl(false_foldl, [], VA, VB), VA == VB, !.

package/test/conformance/cases/lists/swipl_lists_reverse_mode.pl

@@ -0,0 +1,13 @@
+% Adapted from SWI-Prolog tests/library/test_lists.pl.
+% See test/conformance/THIRD_PARTY.md.
+:- use_module(library(lists)).
+
+%% goal: lists_reverse_mode(X0)
+
+% A trailing cut keeps this deterministic: nothing else stops the search
+% for a second (nonexistent) solution once L's unique correct length is
+% found, since nothing else bounds how long a next candidate open list
+% could grow while still failing to match (see SWI's own "must be
+% deterministic" comment on this test).
+lists_reverse_mode(L) :-
+    reverse(L, [a, b]), L == [b, a], !.

package/test/conformance/cases/lists/swipl_ordsets_intersection_difference.pl

@@ -0,0 +1,13 @@
+% Adapted from SWI-Prolog tests/library/test_ordsets.pl.
+% See test/conformance/THIRD_PARTY.md.
+:- use_module(library(ordsets)).
+
+%% goal: ordsets_intersection_difference(X0, X1, X2, X3, X4)
+
+ordsets_intersection_difference(R1, R2, R3, R4, R5) :-
+    ord_intersection([], [], X1, Y1), R1 = X1 - Y1,
+    ord_intersection([a, b, c], [b], X2, Y2), R2 = X2 - Y2,
+    ord_intersection([a], [a, b, c], X3, Y3), R3 = X3 - Y3,
+    ord_intersection([b], [a, b, c], X4, Y4), R4 = X4 - Y4,
+    ord_intersection([c], [a, b, c], X5, Y5), R5 = X5 - Y5,
+    !.

package/test/conformance/cases/lists/swipl_ordsets_is_ordset.pl

@@ -0,0 +1,21 @@
+% Adapted from SWI-Prolog tests/library/test_ordsets.pl.
+% See test/conformance/THIRD_PARTY.md.
+:- use_module(library(ordsets)).
+
+%% goal: ordsets_is_ordset_basic(ok)
+
+ordsets_is_ordset_basic(ok) :-
+    is_ordset([a, b, c]), !.
+
+% Genuinely interesting: is_ordset/1 must check standard order of terms
+% rather than being implemented as a cheap sort(L,L) check -- that would
+% wrongly succeed here, since X and Y are indistinguishable unbound
+% variables at the point [Y,X] is checked.
+%% goal: ordsets_is_ordset_unbound_pair(ok)
+
+unbound_pair(_).
+
+ordsets_is_ordset_unbound_pair(ok) :-
+    unbound_pair(T),
+    T = a(X, Y),
+    \+ is_ordset([Y, X]), !.

package/test/conformance/cases/lists/swipl_ugraphs_top_sort.pl

@@ -0,0 +1,8 @@
+% Adapted from SWI-Prolog tests/library/test_ugraphs.pl.
+% See test/conformance/THIRD_PARTY.md.
+:- use_module(library(ugraphs)).
+
+%% goal: ugraphs_top_sort_linear(X0)
+
+ugraphs_top_sort_linear(L) :-
+    top_sort([1-[2], 2-[3], 3-[]], L), !.

package/test/conformance/errors/iso/swipl_operator_clash_syntax_error.pl

@@ -0,0 +1,5 @@
+% Adapted from SWI-Prolog tests/core_text/test_syntax.pl (op_3): `:-` is xfx
+% (non-associative), so a chained `a:-b:-c` is a genuine operator-priority
+% clash, not a parse of either association. See test/conformance/THIRD_PARTY.md.
+%% goal: answer
+answer :- X = (a:-b:-c).

package/test/conformance/expected/iso/scryer_current_predicate_after_existence_error.pl

@@ -0,0 +1 @@
+current_predicate_after_existence_error(not_defined).

package/test/conformance/expected/iso/scryer_current_prolog_flag_shared_var.pl

@@ -0,0 +1 @@
+current_prolog_flag_shared_var(false).

package/test/conformance/expected/iso/scryer_op_name_type_error.pl

@@ -0,0 +1 @@
+op_name_type_error(type_error(list, example(a, b))).

package/test/conformance/expected/iso/swipl_call_n_builds_control_construct.pl

@@ -0,0 +1 @@
+call_n_builds_control_construct("a", "ab", []).

package/test/conformance/expected/iso/swipl_catch_partial_unification_rethrow.pl

@@ -0,0 +1 @@
+catch_partial_unification_rethrow(1).

package/test/conformance/expected/iso/swipl_keysort_remaining_errors.pl

@@ -0,0 +1 @@
+keysort_remaining_errors(instantiation_error, type_error(list, [a - b, b - b | a]), instantiation_error).

package/test/conformance/expected/iso/swipl_length_errors.pl

@@ -0,0 +1 @@
+length_errors(domain_error(not_less_than_zero, -2), type_error(integer, a), type_error(integer, 0.1)).

package/test/conformance/expected/iso/swipl_memberchk_binding_retention.pl

@@ -0,0 +1 @@
+memberchk_binding_retention(y).

package/test/conformance/expected/iso/swipl_operator_table_self_named.pl

@@ -0,0 +1 @@
+operator_table_self_named(fy fy 1, 1 xfy 2 xfy 3, 1 xfy 2 yfx 3, fy 2 yf, 1 yf yf, 1 yfx 2 yfx 3).

package/test/conformance/expected/iso/swipl_sort_partial_list_errors.pl

@@ -0,0 +1 @@
+sort_partial_list_errors(instantiation_error, type_error(list, "ab"||a)).

package/test/conformance/expected/iso/swipl_write_canonical_var_and_curly.pl

@@ -0,0 +1,4 @@
+'$VAR'(1)
+{}(','(a,b))
+x(_A,_A)
+write_canonical_var_and_curly(ok).

package/test/conformance/expected/iso/trealla_clause_enumeration_backtracking.pl

@@ -0,0 +1 @@
+clause_enumeration_backtracking([0 - true, 1 - true, 2 - true, 3 - true]).

package/test/conformance/expected/iso/trealla_compare_standard_order.pl

@@ -0,0 +1 @@
+compare_standard_order(ok).

package/test/conformance/expected/iso/trealla_copy_term_bound_list_tail.pl

@@ -0,0 +1 @@
+copy_term_bound_list_tail([bb, cc]).

package/test/conformance/expected/iso/trealla_curly_and_colon_syntax_equivalence.pl

@@ -0,0 +1 @@
+curly_and_colon_syntax_equivalence({a:b}, {a:b}, a:b, a:b, a:b).

package/test/conformance/expected/iso/trealla_curly_braces_as_predicate.pl

@@ -0,0 +1 @@
+curly_braces_as_predicate(ok).

package/test/conformance/expected/iso/trealla_forall_arithmetic_facts.pl

@@ -0,0 +1 @@
+forall_arithmetic_facts(ok).

package/test/conformance/expected/iso/trealla_functor_arg_partial_term.pl

@@ -0,0 +1,2 @@
+functor_arg_partial_term(ok).
+copy_term_then_reunify_propagates(ok).

package/test/conformance/expected/iso/trealla_ground_progressive_backtracking.pl

@@ -0,0 +1 @@
+ground_progressive_backtracking(ok).

package/test/conformance/expected/iso/trealla_once_inside_findall_template.pl

@@ -0,0 +1 @@
+once_inside_findall_template([peter]).

package/test/conformance/expected/iso/trealla_variable_aliasing_across_calls.pl

@@ -0,0 +1 @@
+variable_aliasing_across_calls(ok).

package/test/conformance/expected/lists/swipl_aggregate_sum_count.pl

@@ -0,0 +1,2 @@
+aggregate_sum_template(3).
+aggregate_count_existential(2).

package/test/conformance/expected/lists/swipl_assoc_del_min_roundtrip.pl

@@ -0,0 +1,3 @@
+assoc_del_min_roundtrip([1 - a, 2 - b, 3 - c, 4 - d, 5 - e, 6 - f, 7 - g, 8 - h, 9 - i, 10 - j, 11 - k]).
+assoc_del_min_empty_fails(ok).
+assoc_del_min_no_member_fails(ok).

package/test/conformance/expected/lists/swipl_assoc_is_assoc_malformed.pl

@@ -0,0 +1,3 @@
+assoc_is_assoc_rejects_unbalanced(ok).
+assoc_is_assoc_rejects_unordered(ok).
+assoc_is_assoc_rejects_bad_structure(ok).

package/test/conformance/expected/lists/swipl_assoc_is_assoc_valid.pl

@@ -0,0 +1 @@
+assoc_is_assoc_valid(ok).

package/test/conformance/expected/lists/swipl_lists_foldl_empty.pl

@@ -0,0 +1,2 @@
+lists_foldl_empty_atom_starter(foo).
+lists_foldl_empty_unbound_starter(ok).

package/test/conformance/expected/lists/swipl_lists_reverse_mode.pl

@@ -0,0 +1 @@
+lists_reverse_mode("ba").

package/test/conformance/expected/lists/swipl_ordsets_intersection_difference.pl

@@ -0,0 +1 @@
+ordsets_intersection_difference([] - [], "b" - [], "a" - "bc", "b" - "ac", "c" - "ab").

package/test/conformance/expected/lists/swipl_ordsets_is_ordset.pl

@@ -0,0 +1,2 @@
+ordsets_is_ordset_basic(ok).
+ordsets_is_ordset_unbound_pair(ok).

package/test/conformance/expected/lists/swipl_ugraphs_top_sort.pl

@@ -0,0 +1 @@
+ugraphs_top_sort_linear([1, 2, 3]).

package/test/conformance/expected-errors/iso/swipl_operator_clash_syntax_error.txt

@@ -0,0 +1 @@
+parse line 5: non-associative operator :- requires parentheses

package/the-art-of-eyeprolog.md

@@ -10438,7 +10438,7 @@ must preserve the same observable outcome. Additional normal-mode syntax may
 accept texts outside the strict grammar, but it may not reinterpret an accepted
 standard case.
 
-The file-based conformance corpus contains 874 cases, including 457 focused ISO cases derived from the success, failure, mode, and error behavior in ISO/IEC 13211-1 clauses 7 and 8, Part 2 modules, and Part 3 grammar rules.
+The file-based conformance corpus contains 905 cases, including 479 focused ISO cases derived from the success, failure, mode, and error behavior in ISO/IEC 13211-1 clauses 7 and 8, Part 2 modules, and Part 3 grammar rules.
 Separate exact-output suites check 229 normal examples and 61 proof examples; all executable chapter programs are parsed and their declared goals are executed. The nine-case
 playground contract suite imports the production worker, sends real reasoning
 requests through its message protocol, and crawls the served module graph for