eyeprolog 0.5.3

package/test/conformance/README.md

@@ -0,0 +1,100 @@
+# EyeProlog profile conformance suite
+
+This directory contains executable tests for the EyeProlog implementation and
+reasoner.
+[*The Art of EyeProlog*](../../the-art-of-eyeprolog.md) is the reference for the
+supported ISO Prolog profile, built-ins, extensions, and reasoner behavior.
+
+The suite is intentionally file-based. Exact standard output, errors, warnings,
+and proof output test the behavior of the JavaScript implementation.
+
+“Conformance” here means conformance to EyeProlog's documented ISO compatibility
+profile and implementation extensions. The default registry covers the exact
+predicate indicators listed in Appendix B of the book across the supported
+ISO/IEC 13211-1:1995 standard families. This suite is still not an independent certification of
+every processor requirement, lexical edge, option combination, or prescribed
+error precedence. Cases under `iso/` identify standards-derived behavior;
+other directories cover EyeProlog host contracts and extensions.
+
+All conformance files live under topic directories such as `arithmetic/`, `lists/`, `syntax/`, or `variables/`; new top-level numbered files should not be added. The report uses those directories as coverage categories.
+
+A normal positive case consists of:
+
+- `conformance/cases/<name>.pl` — input program;
+- `conformance/expected/<name>.pl` — exact expected standard output, stored as EyeProlog-readable facts.
+
+Expected-error cases consist of:
+
+- `conformance/errors/<name>.pl` — input program that must fail during parsing or execution;
+- `conformance/expected-errors/<name>.txt` — exact expected error message followed by a newline.
+
+Expected-warning cases consist of:
+
+- `conformance/warnings/<name>.pl` — input program run through the CLI with `--warnings`;
+- `conformance/expected-warnings/<name>.pl` — exact expected standard output;
+- `conformance/expected-warnings/<name>.txt` — exact expected standard error.
+
+Expected-proof cases consist of:
+
+- `conformance/proofs/<name>.pl` — input program run through the CLI with `--proof`;
+- `conformance/expected-proofs/<name>.pl` — exact expected standard output, including both answer facts and `why/2` proof facts.
+
+Case names may be nested in category directories such as `arithmetic/`, `strings/`, `lists/`, `terms/`, `atoms/`, `variables/`, `negation/`, or `syntax/`. Expected files mirror the same relative path.
+
+## Running the suite
+
+Run all tests, including conformance, regression, documentation sync, API, RDF
+tools, examples, and book examples:
+
+```sh
+npm test
+```
+
+Run only the conformance suite:
+
+```sh
+node test/run-conformance.mjs
+```
+
+Summarize conformance coverage by category:
+
+```sh
+node test/run-conformance-report.mjs
+node test/run-conformance-report.mjs conformance-report.md
+```
+
+Run matching conformance cases by passing a filename or directory fragment:
+
+```sh
+node test/run-conformance.mjs reusable
+node test/run-conformance.mjs 092_scalar_string_conversions
+node test/run-conformance.mjs variables/
+node test/run-conformance.mjs error/variables
+```
+
+The runner executes normal programs with queries in-process through the public JavaScript API so small conformance cases avoid measuring Node startup overhead. Warning and proof cases intentionally use the CLI because warning output and `why/2` proof output are host-interface contracts.
+
+## Scope
+
+The corpus covers accepted syntax, typed scalar identity and explicit scalar conversions, query answers,
+read-back printing, built-ins, directives, warnings, errors, proof output,
+and host behavior. It verifies the book's descriptions and is not a separate
+language specification.
+
+The `iso/` category follows the mode, success/failure, and error rows in
+ISO/IEC 13211-1 clauses 7 and 8. In particular, isolated negative cases keep
+instantiation, type, domain, permission, representation, and evaluation errors
+independently observable.
+
+Selected cases are adapted from the ISO and standard-core suites of Scryer
+Prolog, Trealla Prolog, and SWI-Prolog. Their upstream identifiers and licenses
+are recorded in [THIRD_PARTY.md](THIRD_PARTY.md).
+
+The corpus has 279 cases in `iso/` and 685 file-based conformance cases in
+total. The generated `conformance-report.md` is the authoritative source for
+current category totals. Together with regression, documentation-sync, API,
+RDF-tool, example, and book-example checks, `npm test` is the release gate.
+
+## Updating expected output
+
+There is no committed auto-accept mode. To update an expected file, run the matching case with the conformance runner, inspect the result, and replace the corresponding file under `conformance/expected/`, `conformance/expected-errors/`, `conformance/expected-warnings/`, or `conformance/expected-proofs/` deliberately.

package/test/conformance/THIRD_PARTY.md

@@ -0,0 +1,130 @@
+# Third-party conformance test provenance
+
+## Logtalk Prolog conformance tests
+
+Selected standard term, atom, character, collection, control, and conversion
+cases under `iso/` are adapted from the `tests/prolog` backend Prolog conformance suite in
+[Logtalk](https://github.com/LogtalkDotOrg/logtalk3). Each adapted file
+identifies its upstream test names. The cases were rewritten for EyeProlog's
+file-based query and exact-output harness and are therefore modified from the
+upstream files.
+
+Copyright 1998-2026 Paulo Moura <pmoura@logtalk.org>
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use
+this file except in compliance with the License. You may obtain a copy of the
+License at <https://www.apache.org/licenses/LICENSE-2.0>.
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
+WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
+License for the specific language governing permissions and limitations under
+the License.
+
+## Scryer Prolog ISO conformity tests
+
+Selected lexical, term, numeric, comment, and operator cases under `iso/` are
+adapted from `tests-pl/iso-conformity-tests.pl` in
+[Scryer Prolog](https://github.com/mthom/scryer-prolog). Each adapted file
+identifies the corresponding upstream test numbers. The cases were rewritten
+for EyeProlog's file-based query and exact-output harness.
+
+BSD 3-Clause License
+
+Copyright (c) 2016, Mark Thom
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the name of the copyright holder nor the names of its
+  contributors may be used to endorse or promote products derived from
+  this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+## Trealla Prolog core tests
+
+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)
+in Trealla Prolog. Each adapted file identifies its upstream test file. The
+cases were rewritten for EyeProlog's query and exact-output harness.
+
+MIT License
+
+Trealla Prolog Copyright (c) 2020 Andrew George Davison
+<andrew.davison@gmail.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+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.
+
+BSD 2-Clause License
+
+Copyright (c) 2009-2021, University of Amsterdam,
+SWI-Prolog Solutions b.v.
+
+Copyright (c) 2007-2024, University of Amsterdam,
+SWI-Prolog Solutions b.v.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice,
+   this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.

package/test/conformance/cases/aggregation/044_findall_user_goal.pl

@@ -0,0 +1,7 @@
+% Reference 9.8: findall/3 collects templates for every solution of a user goal.
+p(b).
+p(a).
+p(b).
+answer(bag, X) :- findall(P, p(P), X).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/aggregation/057_countall_empty_and_nonempty.pl

@@ -0,0 +1,5 @@
+item(a).
+item(b).
+answer(counts, counts(C, Z)) :- countall(item(X), C), countall(missing(X), Z).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/aggregation/058_sumall_numeric_template.pl

@@ -0,0 +1,6 @@
+score(a, 4).
+score(b, 5).
+score(c, -2).
+answer(sum, Sum) :- sumall(S, score(_item, S), Sum).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/aggregation/059_aggregate_min_template.pl

@@ -0,0 +1,6 @@
+score(alpha, 7).
+score(beta, 3).
+score(gamma, 5).
+answer(min, result(Bests, Best)) :- aggregate_min(S, item(Name, S), score(Name, S), Bests, Best).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/aggregation/060_aggregate_max_compound_key.pl

@@ -0,0 +1,6 @@
+score(alpha, 7).
+score(beta, 7).
+score(gamma, 5).
+answer(max, result(Key, Bestname)) :- aggregate_max([S, Name], Name, score(Name, S), Key, Bestname).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/aggregation/075_aggregation_edges.pl

@@ -0,0 +1,13 @@
+% Reference 9.1: aggregation handles empty result sets, structured templates, and ordered best answers.
+%% goal: answer(X0, X1)
+
+score(alice, 2).
+score(bob, 1).
+score(cara, 3).
+answer(findall_empty, X) :- findall(V, missing(V), X).
+answer(count_filtered, X) :- countall((score(Name, Score), (Score > 1)), X).
+answer(sum_empty, X) :- sumall(V, missing(V), X).
+answer(sum_scores, X) :- sumall(Score, score(Name, Score), X).
+answer(best_min, pair(Key, Value)) :- aggregate_min(Score, Name, score(Name, Score), Key, Value).
+answer(best_max, pair(Key, Value)) :- aggregate_max(Score, Name, score(Name, Score), Key, Value).
+answer(best_empty_rejected, ok) :- \+ aggregate_min(Key, Value, missing(Value), Key, Value).

package/test/conformance/cases/aggregation/098_aggregation_nested_templates.pl

@@ -0,0 +1,12 @@
+% Reference 9.8: aggregation copies resolved structured templates from inner goals.
+%% goal: answer(X0, X1)
+
+score(alice, math, 9).
+score(alice, logic, 7).
+score(bob, math, 5).
+score(bob, logic, 8).
+answer(all_pairs, X) :- findall(result(Name, Subject, Score), score(Name, Subject, Score), X).
+answer(count_high, X) :- countall((score(Name, Subject, Score), (Score >= 8)), X).
+answer(sum_alice, X) :- sumall(Score, score(alice, Subject, Score), X).
+answer(best_score, pair(Key, Value)) :- aggregate_max(Score, result(Name, Subject), score(Name, Subject, Score), Key, Value).
+answer(lowest_pair, pair(Key, Value)) :- aggregate_min([Score, Name], Subject, score(Name, Subject, Score), Key, Value).

package/test/conformance/cases/aggregation/aggregate_max_no_answers_fails.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(ok) :- \+ aggregate_max(Key, Value, missing(Value), BestKey, BestValue).

package/test/conformance/cases/aggregation/aggregate_min_structured_key.pl

@@ -0,0 +1,6 @@
+%% goal: answer(X0, X1)
+
+candidate(a, 3).
+candidate(b, 1).
+candidate(c, 2).
+answer(Key, Value) :- aggregate_min(score(Score), Name, candidate(Name, Score), Key, Value).

package/test/conformance/cases/aggregation/countall_zero.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(N) :- countall(missing(X), N).

package/test/conformance/cases/aggregation/extra_aggregate_max_iri_key.pl

@@ -0,0 +1,5 @@
+%% goal: answer(X0, X1, X2)
+
+rank('<urn:example:a>', low).
+rank('<urn:example:z>', high).
+answer(aggregate_max_iri_key, Key, Value) :- aggregate_max(K, V, rank(K, V), Key, Value).

package/test/conformance/cases/aggregation/extra_aggregate_min_tie_first.pl

@@ -0,0 +1,6 @@
+%% goal: answer(X0, X1, X2)
+
+score(2, first).
+score(1, keep).
+score(1, also).
+answer(aggregate_min_tie_first, Key, Value) :- aggregate_min(K, V, score(K, V), Key, Value).

package/test/conformance/cases/aggregation/extra_countall_with_filter.pl

@@ -0,0 +1,6 @@
+%% goal: answer(X0, X1)
+
+num(1).
+num(2).
+num(3).
+answer(countall_with_filter, N) :- countall((num(X), (X > 1)), N).

package/test/conformance/cases/aggregation/extra_findall_repeated_template.pl

@@ -0,0 +1,5 @@
+%% goal: answer(X0, X1)
+
+item(a).
+item(b).
+answer(findall_repeated_template, Bag) :- findall(pair(X, X), item(X), Bag).

package/test/conformance/cases/aggregation/extra_sumall_float_template.pl

@@ -0,0 +1,5 @@
+%% goal: answer(X0, X1)
+
+val(1.5).
+val(2.25).
+answer(sumall_float_template, Sum) :- sumall(X, val(X), Sum).

package/test/conformance/cases/aggregation/findall_empty_bag.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(Bag) :- findall(X, missing(X), Bag).

package/test/conformance/cases/aggregation/sumall_empty_zero.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(N) :- sumall(X, missing(X), N).

package/test/conformance/cases/arithmetic/024_numeric_literal_readback.pl

@@ -0,0 +1,7 @@
+% Reference 3.3, 11: signed, decimal, and exponent numeric literals retain lexical form.
+raw(negative_decimal, -3.5).
+raw(positive_exp, 6.02e23).
+raw(negative_exp, -1.0e-3).
+answer(K, V) :- raw(K, V).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/arithmetic/029_arithmetic_and_comparison.pl

@@ -0,0 +1,11 @@
+% Reference 9.2, 9.3: arithmetic and comparison built-ins.
+answer(sum, X) :- (X is 2 + 3).
+answer(diff, X) :- (X is 7 - 4).
+answer(product, X) :- (X is 6 * 7).
+answer(integer_division, X) :- (X is 7 / 2).
+answer(remainder, X) :- (X is 7 mod 2).
+answer(power, X) :- (X is 2 ** 8).
+answer(minimum, X) :- (3 =< 9 -> X = 3 ; X = 9).
+answer(less_than, true) :- (3 < 9).
+answer(greater_equal, true) :- (9 >= 9).
+%% goal: answer(X0, X1)

package/test/conformance/cases/arithmetic/039_numeric_functions.pl

@@ -0,0 +1,10 @@
+% Reference 9.2: scalar arithmetic functions return numeric values.
+answer(neg, X) :- (X is -(5)).
+answer(abs, X) :- (X is abs(-5)).
+answer(rounded, X) :- (X is round(2.6)).
+answer(sin_zero, X) :- (X is sin(0)).
+answer(cos_zero, X) :- (X is cos(0)).
+answer(log_one, X) :- (X is log(1)).
+answer(float_division, X) :- (X is 7.0 / 2.0).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/arithmetic/040_between_enumeration.pl

@@ -0,0 +1,4 @@
+% Reference 9.5: between/3 enumerates every integer in an inclusive range.
+answer(n, X) :- between(3, 5, X).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/arithmetic/041_smallest_divisor.pl

@@ -0,0 +1,4 @@
+% Reference 9.5: smallest_divisor_from/3 finds the first divisor at or above the start.
+answer(divisor, D) :- smallest_divisor_from(21, 2, D).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/arithmetic/054_numeric_and_lexical_comparison.pl

@@ -0,0 +1,6 @@
+% Reference 9.3: comparisons handle numeric and lexical scalar ordering.
+answer(numeric_gt, true) :- (10 > 2).
+answer(numeric_le, true) :- (2 =< 2.0).
+answer(lexical_ge, true) :- (beta @>= alpha).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/arithmetic/061_date_difference.pl

@@ -0,0 +1,5 @@
+% Reference 9.1: difference/3 computes ISO date durations.
+answer(duration, D) :- difference("2024-03-01", "2020-02-29", D).
+answer(month_borrow, D) :- difference("2024-03-01", "2024-01-31", D).
+%% goal: answer(X0, X1)
+

package/test/conformance/cases/arithmetic/062_reusable_numeric_builtins.pl

@@ -0,0 +1,11 @@
+% Reference 9.1: reusable numeric functions compose with ISO control.
+%% goal: answer(X0, X1)
+
+answer(max, X) :- (17 >= 42 -> X = 17 ; X = 42).
+answer(sqrt, X) :- (X is sqrt(81)).
+answer(floor, X) :- (X is floor(3.9)).
+answer(ceiling, X) :- (X is ceiling(3.1)).
+answer(trunc, X) :- (X is truncate(-3.9)).
+answer(exp, X) :- (X is exp(0)).
+answer(tan, X) :- tan(0, X).
+answer(atan2, X) :- atan2(0, -1, X).

package/test/conformance/cases/arithmetic/066_numeric_edges.pl

@@ -0,0 +1,10 @@
+% Reference 9.1: reusable numeric functions preserve integer paths and define finite failure modes.
+%% goal: answer(X0, X1)
+
+answer(max_negative, X) :- (-10 >= -3 -> X = -10 ; X = -3).
+answer(min_float, X) :- (2.5 =< -1.25 -> X = 2.5 ; X = -1.25).
+answer(floor_negative, X) :- (X is floor(-3.1)).
+answer(ceiling_negative, X) :- (X is ceiling(-3.9)).
+answer(trunc_positive, X) :- (X is truncate(3.9)).
+answer(sqrt_fraction, X) :- (X is sqrt(2.25)).
+answer(pow_fraction, X) :- (X is 9 ** 0.5).

package/test/conformance/cases/arithmetic/079_big_integer_arithmetic.pl

@@ -0,0 +1,9 @@
+% Reference 9.2: integer arithmetic keeps exact BigInt paths where possible.
+%% goal: answer(X0, X1)
+
+answer(add_big, X) :- (X is 9007199254740993 + 7).
+answer(sub_big, X) :- (X is 9007199254741000 - 7).
+answer(mul_big, X) :- (X is 123456789 * 987654321).
+answer(pow_big, X) :- (X is 2 ** 63).
+answer(div_big, X) :- (X is 9223372036854775808 / 2).
+answer(mod_big, X) :- (X is 9223372036854775809 mod 10).

package/test/conformance/cases/arithmetic/080_rounding_modes.pl

@@ -0,0 +1,11 @@
+% Reference 9.2: rounding built-ins have distinct behavior for positive and negative decimals.
+%% goal: answer(X0, X1)
+
+answer(floor_pos, X) :- (X is floor(3.9)).
+answer(floor_neg, X) :- (X is floor(-3.1)).
+answer(ceiling_pos, X) :- (X is ceiling(3.1)).
+answer(ceiling_neg, X) :- (X is ceiling(-3.9)).
+answer(trunc_pos, X) :- (X is truncate(3.9)).
+answer(trunc_neg, X) :- (X is truncate(-3.9)).
+answer(round_half_up, X) :- (X is round(2.5)).
+answer(round_half_neg, X) :- (X is round(-2.5)).

package/test/conformance/cases/arithmetic/081_zero_safe_numeric_functions.pl

@@ -0,0 +1,10 @@
+% Reference 9.2: transcendental functions have stable exact outputs at simple inputs.
+%% goal: answer(X0, X1)
+
+answer(sin_zero, X) :- (X is sin(0)).
+answer(cos_zero, X) :- (X is cos(0)).
+answer(tan_zero, X) :- tan(0, X).
+answer(exp_zero, X) :- (X is exp(0)).
+answer(log_one, X) :- (X is log(1)).
+answer(atan2_zero, X) :- atan2(0, 1, X).
+answer(sqrt_one, X) :- (X is sqrt(1)).

package/test/conformance/cases/arithmetic/082_comparison_semantics.pl

@@ -0,0 +1,11 @@
+% Reference 9.3: comparison handles numbers, durations, strings, and lexical scalars.
+%% goal: answer(X0, X1)
+
+answer(integer_order, ok) :- (9 < 10).
+answer(decimal_equal_le, ok) :- (2.0 =< 2).
+answer(numeric_not_lexical, ok) :- (10 < 100).
+answer(duration_years, ok) :- ('P1Y' @< 'P2Y').
+answer(duration_months, ok) :- ('P1Y1M' @> 'P1Y').
+answer(atom_lexical, ok) :- (alpha @< beta).
+answer(string_lexical, ok) :- ("z" @> "a").
+answer(compound_lexical_text, ok) :- (pair(a, 1) @< pair(b, 1)).

package/test/conformance/cases/arithmetic/083_between_modes_and_empty_ranges.pl

@@ -0,0 +1,9 @@
+% Reference 9.5: between/3 enumerates inclusively, checks bound values, and rejects empty ranges.
+%% goal: answer(X0, X1)
+
+answer(enumerated, X) :- between(-1, 1, X).
+answer(check_bound, ok) :- between(1, 3, 2).
+answer(check_low_edge, ok) :- between(1, 3, 1).
+answer(check_high_edge, ok) :- between(1, 3, 3).
+answer(check_outside_rejected, ok) :- \+ between(1, 3, 4).
+answer(empty_range_rejected, ok) :- \+ between(3, 1, X).

package/test/conformance/cases/arithmetic/between_bound_value.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(ok) :- between(1, 5, 3).

package/test/conformance/cases/arithmetic/between_singleton.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(X) :- between(4, 4, X).

package/test/conformance/cases/arithmetic/duration_comparison.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(ok) :- ("P1Y" @< "P2Y"), ("P1Y2M" @> "P1Y1M").

package/test/conformance/cases/arithmetic/extra_acos_one.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(acos_one, X) :- acos(1, X).

package/test/conformance/cases/arithmetic/extra_asin_zero.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(asin_zero, X) :- asin(0, X).

package/test/conformance/cases/arithmetic/extra_atan2_axis.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(atan2_axis, X) :- atan2(0, 1, X).

package/test/conformance/cases/arithmetic/extra_difference_leap_day.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(difference_leap_day, X) :- difference("2024-03-01", "2024-02-28", X).

package/test/conformance/cases/arithmetic/extra_difference_same_day.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(difference_same_day, X) :- difference("2026-06-23", "2026-06-23", X).

package/test/conformance/cases/arithmetic/extra_div_float_exact.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(div_float_exact, X) :- (X is 7.5 / 2.5).

package/test/conformance/cases/arithmetic/extra_div_integer_trunc.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(div_integer_trunc, X) :- (X is 7 / 2).

package/test/conformance/cases/arithmetic/extra_exp_zero.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(exp_zero, X) :- (X is exp(0)).

package/test/conformance/cases/arithmetic/extra_ge_equal_duration.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(ge_equal_duration) :- ("P1Y2M3D" @>= "P1Y2M3D").

package/test/conformance/cases/arithmetic/extra_le_equal_string.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(le_equal_string) :- ("abc" @=< "abc").

package/test/conformance/cases/arithmetic/extra_log_one.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(log_one, X) :- (X is log(1)).

package/test/conformance/cases/arithmetic/extra_mod_negative_right.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(mod_negative_right, X) :- (X is 7 mod -3).

package/test/conformance/cases/arithmetic/extra_pow_large_integer.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0, X1)
+
+answer(pow_large_integer, X) :- (X is 2 ** 10).

package/test/conformance/cases/arithmetic/float_add_and_div.pl

@@ -0,0 +1,4 @@
+%% goal: answer(X0, X1)
+
+answer(add, X) :- (X is 1.5 + 2.25).
+answer(div, X) :- (X is 7 / 2).

package/test/conformance/cases/arithmetic/min_max_mixed.pl

@@ -0,0 +1,4 @@
+%% goal: answer(X0, X1)
+
+answer(min, X) :- (3 =< 2.5 -> X = 3 ; X = 2.5).
+answer(max, X) :- (3 >= 2.5 -> X = 3 ; X = 2.5).

package/test/conformance/cases/arithmetic/mod_negative_left.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(X) :- (X is -7 mod 3).

package/test/conformance/cases/arithmetic/neg_abs_integer.pl

@@ -0,0 +1,5 @@
+% Integer-preserving unary arithmetic.
+%% goal: answer(X0, X1)
+
+answer(neg, X) :- (X is -(7)).
+answer(abs, X) :- (X is abs(-7)).

package/test/conformance/cases/arithmetic/pow_negative_exponent_fails.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(X) :- X is 2 ** -1.

package/test/conformance/cases/arithmetic/pow_zero_exponent.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(X) :- (X is 9 ** 0).

package/test/conformance/cases/arithmetic/rounding_negative_float.pl

@@ -0,0 +1,6 @@
+%% goal: answer(X0, X1)
+
+answer(floor, X) :- (X is floor(-1.2)).
+answer(ceiling, X) :- (X is ceiling(-1.2)).
+answer(trunc, X) :- (X is truncate(-1.8)).
+answer(rounded, X) :- (X is round(-1.5)).

package/test/conformance/cases/arithmetic/smallest_divisor_prime.pl

@@ -0,0 +1,3 @@
+%% goal: answer(X0)
+
+answer(X) :- smallest_divisor_from(17, 2, X).