eyeprolog 1.5.84 → 1.5.85

package/conformance-report.md

@@ -24,7 +24,7 @@ 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 | 176 | 219 | 0 | 0 | 395 |
+| iso | 211 | 219 | 0 | 0 | 430 |
 | lists | 52 | 3 | 0 | 0 | 55 |
 | modules | 2 | 0 | 0 | 0 | 2 |
 | negation | 8 | 0 | 19 | 0 | 27 |
@@ -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** | **498** | **274** | **19** | **21** | **812** |
+| **Total** | **533** | **274** | **19** | **21** | **847** |
 
 ## DCG conformance clarification
 

package/package.json

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

package/src/quads.js

@@ -252,14 +252,29 @@ function checkAnswerPermutation(program, query, leaves, actual, alternative) {
 
 function malformedAlternative(query, alternative) {
   const queryNames = new Set(namedVariables(query).map((variable) => variable.name));
-  for (const leaf of splitOperator(alternative, ';').map(describeLeaf)) {
+  const altLeaves = splitOperator(alternative, ';').map(describeLeaf);
+  // `sto` is written once, on the branch's first outcome, to declare the
+  // whole `;`-separated branch occurs-check/rational-tree dependent (see the
+  // matching `leaves.some((leaf) => leaf.sto)` in checkAlternative); a later
+  // leaf in the same branch carries that declaration too even though only
+  // the first leaf's text says so.
+  const branchSto = altLeaves.some((leaf) => leaf.sto);
+  for (const leaf of altLeaves) {
     if (leaf.malformed != null) return leaf.malformed;
     const names = new Set();
     const substitutions = [...leaf.bindings, ...leaf.approximations];
+    // A binding's left-hand variable may be a query variable, or an auxiliary
+    // variable this same answer description already introduced on an earlier
+    // binding's right-hand side. `Xs = [_A|_B], _B = [E|_B]` names the "rest
+    // of the same infinite structure" as _B before binding it -- the usual
+    // idiom for describing a rational-tree or repeating-pattern answer
+    // (see also substitutionMatches, which resolves these the same way).
+    const introduced = new Set(queryNames);
     for (const binding of substitutions) {
       const name = binding.args[0].name;
-      if (!queryNames.has(name) || names.has(name)) return binding;
+      if (!introduced.has(name) || names.has(name)) return binding;
       names.add(name);
+      for (const variable of namedVariables(binding.args[1])) introduced.add(variable.name);
     }
     for (const binding of substitutions) {
       const name = binding.args[0].name;
@@ -276,7 +291,7 @@ function malformedAlternative(query, alternative) {
       // outside `sto`: an answer description should give each variable's
       // value in fully resolved form rather than in terms of a sibling
       // binding.
-      if (!leaf.sto && referenced.some((variable) => names.has(variable.name))) return binding;
+      if (!branchSto && referenced.some((variable) => names.has(variable.name))) return binding;
     }
   }
   return null;
@@ -522,22 +537,33 @@ function substitutionMatches(query, bindings, approximations, actualEnv) {
   const queryVariablesByName = new Map(queryVariables.map((variable) => [variable.name, variable]));
   const expectedEnv = new Env();
   const rebound = new Set();
+  // A binding's left-hand variable may be a query variable, or an auxiliary
+  // variable this same answer description already introduced on an earlier
+  // binding's right-hand side (see malformedAlternative's matching
+  // `introduced` set): `Xs = [_A|_B], _B = [E|_B]` names the "rest of the
+  // same infinite structure" as _B before binding it, the usual idiom for
+  // describing a rational-tree or repeating-pattern answer.
+  const introduced = new Set(queryNames);
   for (const binding of [...bindings, ...approximations]) {
     const variable = binding.args[0];
-    if (!queryNames.has(variable.name) || rebound.has(variable.name)) return false;
+    if (!introduced.has(variable.name) || rebound.has(variable.name)) return false;
     rebound.add(variable.name);
     if (binding.name === '=') {
       if (!unify(variable, binding.args[1], expectedEnv)) return false;
-      continue;
+    } else {
+      // Approximate (~~) bindings compare against an actually observed value,
+      // which only exists for the query's own variables.
+      const actualVariable = queryVariablesByName.get(variable.name);
+      if (actualVariable == null) return false;
+      const actualValue = deref(actualVariable, actualEnv);
+      if (!approximatelyMatches(actualValue, binding.args[1])) return false;
+      // Once the approximate predicate has accepted the actual float, bind the
+      // expected-side variable to that exact observed term. This lets the
+      // ordinary variant matcher continue to check the rest of the answer,
+      // including variable sharing, without turning `~~` into a fuzzy unifier.
+      if (!unify(variable, copyResolved(actualValue, actualEnv), expectedEnv)) return false;
     }
-    const actualVariable = queryVariablesByName.get(variable.name);
-    const actualValue = deref(actualVariable, actualEnv);
-    if (!approximatelyMatches(actualValue, binding.args[1])) return false;
-    // Once the approximate predicate has accepted the actual float, bind the
-    // expected-side variable to that exact observed term. This lets the
-    // ordinary variant matcher continue to check the rest of the answer,
-    // including variable sharing, without turning `~~` into a fuzzy unifier.
-    if (!unify(variable, copyResolved(actualValue, actualEnv), expectedEnv)) return false;
+    for (const referenced of namedVariables(binding.args[1])) introduced.add(referenced.name);
   }
   const expected = compound('$quad_answer', queryVariables.map((variable) => copyResolved(variable, expectedEnv)));
   const actual = compound('$quad_answer', queryVariables.map((variable) => copyResolved(variable, actualEnv)));

package/test/conformance/NEUMERKEL-LATEST.md

@@ -1,6 +1,6 @@
 # EyeProlog — latest Neumerkel conformity
 
-Status: **PASS — 1 divergence to be addressed** — **718/719** discovered upstream cases passed.
+Status: **PASS** — **758/758** discovered upstream cases passed.
 
 This tracked report records the latest upstream inventory successfully checked by EyeProlog.
 `npm test` fetches the eight TU Wien sources again and executes the discovered cases.
@@ -15,13 +15,9 @@ Counts are output from upstream, not hard-coded test constants.
 | dif/2 | 26 | 26 |
 | length/2 | 37 | 37 |
 | phrase/2,3 | 58 | 58 |
-| Prologue draft | 32 | 33 |
+| Prologue draft | 72 | 72 |
 | setup_call_cleanup/3 | 25 | 25 |
-| **Total** | **718** | **719** |
-
-## Known divergences
-
-- **Prologue draft** (line 118): bounded=false: EyeProlog reports no max_integer value at all (ISO 7.11.1.1), so this quad's evaluation_error(int_overflow) | Max = unbounded pair never applies
+| **Total** | **758** | **758** |
 
 ## Upstream sources
 

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 395 cases in `iso/` and 812 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 430 cases in `iso/` and 847 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

@@ -70,6 +70,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 Selected standard-core cases under `iso/` are adapted from the numbered tests
 in [`tests/tests`](https://github.com/trealla-prolog/trealla/tree/main/tests/tests)
+and [`tests/issues`](https://github.com/trealla-prolog/trealla/tree/main/tests/issues)
 in Trealla Prolog. Each adapted file identifies its upstream test file. The
 cases were rewritten for EyeProlog's query and exact-output harness.
 

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

@@ -0,0 +1,8 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, test
+% 41. See test/conformance/THIRD_PARTY.md.
+
+%% goal: backslash_atom(A)
+
+backslash_atom(A) :-
+    A = ('\\'),
+    A = (\).

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

@@ -0,0 +1,10 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, test
+% 49. See test/conformance/THIRD_PARTY.md.
+
+:- op(9, xf, e9).
+
+%% goal: bare_exponent_lexing(X)
+
+bare_exponent_lexing(X) :-
+    X = (1e9),
+    X = e9(1).

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

@@ -0,0 +1,12 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 291, 307, and 309. See test/conformance/THIRD_PARTY.md.
+
+%% goal: bracket_and_curly_term_parsing(A, B, C)
+
+bracket_and_curly_term_parsing(A, B, C) :-
+    A = [(a,b)],
+    A = [','(a,b)],
+    B = [/**/],
+    B == [],
+    C = {a,b},
+    C = '{}'(','(a,b)).

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

@@ -0,0 +1,8 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 79-80. See test/conformance/THIRD_PARTY.md.
+
+%% goal: default_prefix_operator_priorities(A, B)
+
+default_prefix_operator_priorities(A, B) :-
+    current_op(A, fy, -),
+    current_op(B, fy, +).

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

@@ -0,0 +1,10 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 198-199. See test/conformance/THIRD_PARTY.md.
+
+%% goal: dollar_sign_atoms(A, B)
+
+dollar_sign_atoms(A, B) :-
+    atom($-),
+    atom(-$),
+    A = ($-),
+    B = (-$).

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

@@ -0,0 +1,7 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, test
+% 97. See test/conformance/THIRD_PARTY.md.
+
+%% goal: empty_list_atom_functor(X)
+
+empty_list_atom_functor(X) :-
+    '[]'(1) = [ ](X).

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

@@ -0,0 +1,12 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 50-51, 204, and 220. See test/conformance/THIRD_PARTY.md.
+
+:- op(9, xf, e).
+
+%% goal: exponent_minus_lexing(X, Y)
+
+exponent_minus_lexing(X, Y) :-
+    X = (1e-9),
+    X = -(e(1), 9),
+    Y = (1.0e- 9),
+    Y = -(e(1.0), 9).

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

@@ -0,0 +1,11 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, test
+% 53. See test/conformance/THIRD_PARTY.md.
+
+%% goal: large_float_exponent(X)
+
+large_float_exponent(X) :-
+    X = 1.0e100,
+    float(X),
+    X > 1.0e99,
+    Y is X / 10.0,
+    Y =:= 1.0e99.

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

@@ -0,0 +1,15 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 7-10. See test/conformance/THIRD_PARTY.md.
+
+%% goal: line_continuation_in_quoted_atoms(A, B, C)
+
+line_continuation_in_quoted_atoms(A, B, C) :-
+    A = '\
+',
+    A == '',
+    B = '\
+a',
+    B == a,
+    C = 'a\
+ b',
+    C == 'a b'.

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

@@ -0,0 +1,11 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, test
+% 164. See test/conformance/THIRD_PARTY.md.
+
+:- op(7, fy, p).
+:- op(9, yfx, p).
+
+%% goal: lower_priority_prefix_with_infix(T)
+
+lower_priority_prefix_with_infix(T) :-
+    T = (1 p p p 2),
+    T = p(1, p(p(2))).

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

@@ -0,0 +1,11 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, test
+% 163. See test/conformance/THIRD_PARTY.md.
+
+:- op(9, fy, p).
+:- op(9, xfy, p).
+
+%% goal: mixed_prefix_infix_priority(T)
+
+mixed_prefix_infix_priority(T) :-
+    T = (1 p p p 2),
+    T = p(1, p(p(2))).

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

@@ -0,0 +1,29 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 70-72, 99, 158, 237, and 268. See test/conformance/THIRD_PARTY.md.
+
+%% goal: comma_operator_immutable(E1, E2, E3)
+
+comma_operator_immutable(E1, E2, E3) :-
+    catch((op(1000,xfy,','), fail), error(E1, _), true),
+    catch((op(1001,xfy,','), fail), error(E2, _), true),
+    catch((op(0,xfy,','), fail), error(E3, _), true).
+
+%% goal: bar_low_priority_rejected(E)
+
+bar_low_priority_rejected(E) :-
+    catch((op(999,xfy,'|'), fail), error(E, _), true).
+
+%% goal: invalid_operator_specifier(E)
+
+invalid_operator_specifier(E) :-
+    catch((op(100,yfy,foo), fail), error(E, _), true).
+
+%% goal: curly_braces_operator_rejected(E)
+
+curly_braces_operator_rejected(E) :-
+    catch((op(500,xfy,'{}'), fail), error(E, _), true).
+
+%% goal: infix_postfix_clash_rejected(E)
+
+infix_postfix_clash_rejected(E) :-
+    catch((op(699,xf,>), fail), error(E, _), true).

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

@@ -0,0 +1,10 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 234-235. See test/conformance/THIRD_PARTY.md.
+
+:- op(400, fx, f).
+
+%% goal: space_before_paren_is_operator_application(T)
+
+space_before_paren_is_operator_application(T) :-
+    T = (f (1,2)),
+    T = f(','(1,2)).

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

@@ -0,0 +1,10 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, test
+% 55. See test/conformance/THIRD_PARTY.md.
+
+:- op(1, yf, yf1).
+
+%% goal: postfix_operator_negative_number(T)
+
+postfix_operator_negative_number(T) :-
+    T = {-1 yf1},
+    T = {yf1(-1)}.

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

@@ -0,0 +1,8 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, test
+% 236. See test/conformance/THIRD_PARTY.md.
+
+%% goal: prefix_minus_chain(X)
+
+prefix_minus_chain(X) :-
+    X = (a- - -b),
+    X = -(a, -(-(b))).

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

@@ -0,0 +1,16 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 100, 103, 114-116, and 165. See test/conformance/THIRD_PARTY.md.
+
+%% goal: quote_and_char_code_literals(A, B, C, D)
+
+quote_and_char_code_literals(A, B, C, D) :-
+    '''' = '\'',
+    A = '\141\141',
+    A == a141,
+    B = 0'\',
+    integer(B),
+    C = 0''',
+    integer(C),
+    C == B,
+    D = '.''-''.',
+    atom(D).

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

@@ -0,0 +1,10 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 308 and 324. See test/conformance/THIRD_PARTY.md.
+
+%% goal: special_atom_names(A, B)
+
+special_atom_names(A, B) :-
+    A = '.+',
+    atom(A),
+    B = '%',
+    atom(B).

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

@@ -0,0 +1,9 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 172-173. See test/conformance/THIRD_PARTY.md.
+
+%% goal: subnormal_float_underflow(X)
+
+subnormal_float_underflow(X) :-
+    X is 10.0** -323,
+    X > 0.0,
+    X =:= 1.0e-323.

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

@@ -0,0 +1,12 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 65-66 and 318. See test/conformance/THIRD_PARTY.md.
+
+%% goal: unary_plus_compound(A, B)
+
+unary_plus_compound(A, B) :-
+    compound(+1),
+    compound(+ 1),
+    A = (+1),
+    A = +(1),
+    B = (+ (1*2)^3),
+    B = +((1*2)^3).

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

@@ -0,0 +1,14 @@
+% Adapted from Scryer Prolog tests-pl/iso-conformity-tests.pl, tests
+% 215, 248, and 249. See test/conformance/THIRD_PARTY.md.
+
+:- op(100, yfx, ~).
+
+%% goal: user_operator_with_prefix_minus(A, B, C)
+
+user_operator_with_prefix_minus(A, B, C) :-
+    A = (- (1~2~3)),
+    A = -(~(~(1,2),3)),
+    B = (- (1~2)),
+    B = -(~(1,2)),
+    C = (1~2),
+    C = ~(1,2).

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

@@ -0,0 +1,11 @@
+% Adapted from Trealla Prolog tests/tests/test0046.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: append_concat(X0)
+
+append_concat(L) :-
+    append([a,b],[c,d],L).
+
+%% goal: append_split(X0, X1)
+
+append_split(L1, L2) :-
+    append(L1, L2, [a,b,c,d]).

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

@@ -0,0 +1,7 @@
+% Adapted from Trealla Prolog tests/tests/test0066.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: euler_and_int_division(X0, X1)
+
+euler_and_int_division(E, Q) :-
+    E is e,
+    Q is 1 / 10.

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

@@ -0,0 +1,11 @@
+% Adapted from Trealla Prolog tests/tests/test0034.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: atom_codes_cjk(ok)
+
+atom_codes_cjk(ok) :-
+    atom_codes('一二三', [19968, 20108, 19977]).
+
+%% goal: atom_codes_cjk_reverse(X0)
+
+atom_codes_cjk_reverse(Atom) :-
+    atom_codes(Atom, [19968, 20108, 19977]).

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

@@ -0,0 +1,32 @@
+% Adapted from Trealla Prolog tests/tests/test0079.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: bignum_ops(X0, X1, X2, X3, X4)
+
+bignum_ops(N1, GcdA, GcdB, Mod, Div) :-
+    N1 is -123456789012345678901234567890,
+    N1 =:= -123456789012345678901234567890,
+    GcdA is gcd(987654321098765432109876543210, 42),
+    GcdA =:= 42,
+    GcdB is gcd(987654321098765432109876543210, 123456789012345678901234567890),
+    GcdB =:= 9000000000900000000090,
+    Mod is 15241578753238836750495351562536198787501905199875019052100 mod 1234567890123456789123,
+    Div is 15241578753238836750495351562536198787501905199875019052100 div 12345678901234567891234567.
+
+%% goal: bignum_float_conversion(X0)
+
+bignum_float_conversion(F) :-
+    F is float(1881676372353657772546715999894626455109783106026821047606410765129148590562263).
+
+%% goal: bignum_mod_rem_agree_for_positive_operands(X0, X1)
+
+bignum_mod_rem_agree_for_positive_operands(Mod, Rem) :-
+    Mod is 15241578753238836750495351562536198787501905199875019052100 mod 1234567890123456789123,
+    Rem is 15241578753238836750495351562536198787501905199875019052100 rem 1234567890123456789123,
+    Mod =:= Rem.
+
+%% goal: bignum_gcd_commutative(X0, X1)
+
+bignum_gcd_commutative(A, B) :-
+    A is gcd(987654321098765432109876543210, 42),
+    B is gcd(42, 987654321098765432109876543210),
+    A =:= B.

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

@@ -0,0 +1,6 @@
+% Adapted from Trealla Prolog tests/issues/test0159.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: call_extends_missing_arity(X0, X1)
+
+call_extends_missing_arity(Error, Context) :-
+    catch(call(true, false), error(Error, Context), true).

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

@@ -0,0 +1,9 @@
+% Adapted from Trealla Prolog tests/tests/test0071.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: findall_solutions_are_independent_copies(ok)
+
+findall_solutions_are_independent_copies(ok) :-
+    findall(I, member(I, [A,B,B,A]), [A1,B1,B2,A2]),
+    A1 \== A2,
+    B1 \== B2,
+    A1 \== B1.

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

@@ -0,0 +1,25 @@
+% Adapted from Trealla Prolog tests/tests/test0117.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: float_parts_1e30(X0, X1)
+
+float_parts_1e30(I, F) :-
+    I is float_integer_part(1.0e30),
+    F is float_fractional_part(1.0e30).
+
+%% goal: float_parts_neg1e30(X0, X1)
+
+float_parts_neg1e30(I, F) :-
+    I is float_integer_part(-1.0e30),
+    F is float_fractional_part(-1.0e30).
+
+%% goal: float_parts_1e300(X0, X1)
+
+float_parts_1e300(I, F) :-
+    I is float_integer_part(1.0e300),
+    F is float_fractional_part(1.0e300).
+
+%% goal: float_parts_zero(X0, X1)
+
+float_parts_zero(I, F) :-
+    I is float_integer_part(0.0),
+    F is float_fractional_part(0.0).

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

@@ -0,0 +1,12 @@
+% Adapted from Trealla Prolog tests/tests/test0010.pl, test0011.pl.
+% See test/conformance/THIRD_PARTY.md.
+:- dynamic(seen/2).
+
+upto(N, X) :- N > 0, N1 is N - 1, upto(N1, X).
+upto(N, X) :- N > 0, X = N.
+
+%% goal: forall_via_double_negation(X0)
+
+forall_via_double_negation(Pairs) :-
+    \+ (upto(3, I), upto(I, J), \+ assertz(seen(I, J))),
+    findall(I-J, retract(seen(I, J)), Pairs).

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

@@ -0,0 +1,22 @@
+% Adapted from Trealla Prolog tests/tests/test0045.pl.
+% See test/conformance/THIRD_PARTY.md.
+cond(1).
+cond(2).
+
+ok(a).
+ok(b).
+
+%% goal: then_branch_backtracks(X0)
+
+then_branch_backtracks(X) :-
+    (true -> ok(X) ; fail).
+
+%% goal: else_branch_backtracks(X0)
+
+else_branch_backtracks(X) :-
+    (fail -> fail ; ok(X)).
+
+%% goal: cond_commits_to_first_solution(X0)
+
+cond_commits_to_first_solution(X) :-
+    (cond(X) -> true ; true).

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

@@ -0,0 +1,6 @@
+% Adapted from Trealla Prolog tests/tests/test0102.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: number_codes_char_literal(X0)
+
+number_codes_char_literal(N) :-
+    number_codes(N, [48, 39, 92, 110]).

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

@@ -0,0 +1,63 @@
+% Adapted from Trealla Prolog tests/tests/test0064.pl.
+% See test/conformance/THIRD_PARTY.md.
+:- dynamic(p/2).
+:- dynamic(p/3).
+
+p(Z, Z).
+clouds(are, nice).
+p(Z, h(Z, W), f(W)).
+
+%% goal: fact_unifies_leaving_variable_unbound(ok)
+
+fact_unifies_leaving_variable_unbound(ok) :-
+    findall(Z, p(Z, Z), [Z]),
+    var(Z).
+
+%% goal: distinct_arguments_reject(ok)
+
+distinct_arguments_reject(ok) :-
+    \+ p(z, w).
+
+%% goal: repeated_argument_accepts(ok)
+
+repeated_argument_accepts(ok) :-
+    p(w, w).
+
+%% goal: distinct_fact_arguments_reject(ok)
+
+distinct_fact_arguments_reject(ok) :-
+    \+ clouds(Z, Z).
+
+%% goal: fact_second_argument(X0)
+
+fact_second_argument(Zs) :-
+    findall(Z, clouds(are, Z), Zs).
+
+%% goal: nested_pattern_rejects_conflict(ok)
+
+nested_pattern_rejects_conflict(ok) :-
+    \+ p(z, h(z, z), f(w)).
+
+%% goal: nested_pattern_accepts(ok)
+
+nested_pattern_accepts(ok) :-
+    p(z, h(z, w), f(w)).
+
+%% goal: nested_shared_variable_binds_consistently(X0)
+
+nested_shared_variable_binds_consistently(Ws) :-
+    findall(W, p(z, h(z, W), f(w)), Ws).
+
+%% goal: nested_shared_variable_all_positions(X0)
+
+nested_shared_variable_all_positions(Zs) :-
+    findall(Z, p(Z, h(Z, w), f(Z)), Zs).
+
+%% goal: retract_reassert_roundtrip(ok)
+
+retract_reassert_roundtrip(ok) :-
+    retract(p(_, _, _)),
+    assertz(p(Z, h(Z, W), f(W))),
+    p(f(f(a)), h(f(f(a)), f(a)), f(f(a))),
+    retract(p(Z, h(Z, W), f(W))),
+    \+ clause(p(_, _, _), true).

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

@@ -0,0 +1,6 @@
+% Adapted from Trealla Prolog tests/tests/test0074.pl.
+% See test/conformance/THIRD_PARTY.md.
+%% goal: term_variables_partial_list_type_error(ok)
+
+term_variables_partial_list_type_error(ok) :-
+    catch(term_variables(t, [_, _|a]), error(type_error(list, [_, _|a]), _), true).