eyelang 1.2.1 → 1.3.0

package/playground.html

@@ -371,7 +371,7 @@
         <summary id="advanced-heading">⚙ Advanced configuration</summary>
         <div class="toolbar" aria-label="URL loader">
           <label for="source-url">Load Eyelang from URL</label>
-          <input id="source-url" type="url" placeholder="https://example.org/program.pl">
+          <input id="source-url" type="url" placeholder="https://example.org/program.eye">
           <button id="load-url" type="button">Load from URL</button>
         </div>
         <div class="toolbar background-row">
@@ -593,7 +593,7 @@ answer(ok) :- eq(ok, ok).
     const HIGHLIGHT_LIMIT = 200000;
     const MAX_SHARE_URL_LENGTH = 1900;
     const GIST_STATE_FILENAME = 'eyelang-playground-state.json';
-    const KEYWORDS = new Set(['materialize', 'memoize']);
+    const KEYWORDS = new Set(['materialize', 'table']);
     const BUILTINS = new Set([
             "abs",
             "acos",
@@ -746,14 +746,14 @@ answer(ok) :- eq(ok, ok).
       if (!name) return;
       try {
         setStatus(`Loading ${name}…`);
-        const exampleUrl = new URL(`./examples/${name}.pl`, location.href);
+        const exampleUrl = new URL(`./examples/${name}.eye`, location.href);
         const response = await fetch(exampleUrl, { cache: 'no-store' });
         if (!response.ok) throw new Error(`${response.status} ${response.statusText}`);
-        setSource(await response.text(), `examples/${name}.pl`, { kind: 'example', name });
-        setStatus(`Loaded examples/${name}.pl.`);
+        setSource(await response.text(), `examples/${name}.eye`, { kind: 'example', name });
+        setStatus(`Loaded examples/${name}.eye.`);
       } catch (error) {
         setSource(FALLBACK_SOURCE, 'fallback program');
-        setStatus(`Could not load examples/${name}.pl: ${formatError(error)}`, true);
+        setStatus(`Could not load examples/${name}.eye: ${formatError(error)}`, true);
       }
     }
 
@@ -859,8 +859,8 @@ answer(ok) :- eq(ok, ok).
           while (j < text.length && /[\d.]/.test(text[j])) j++;
           out += span('number', text.slice(i, j));
           i = j;
-        } else if (/[A-Z_]/.test(ch)) {
-          let j = i + 1;
+        } else if (ch === '?' && /[A-Za-z_]/.test(text[i + 1] || '')) {
+          let j = i + 2;
           while (j < text.length && /[A-Za-z0-9_]/.test(text[j])) j++;
           out += span('variable', text.slice(i, j));
           i = j;
@@ -1087,9 +1087,9 @@ answer(ok) :- eq(ok, ok).
         setStatus('Creating GitHub Gist…');
         const files = {
           [GIST_STATE_FILENAME]: { content: stateText },
-          'program.pl': { content: source.value },
+          'program.eye': { content: source.value },
         };
-        if (backgroundSource.trim()) files['background.pl'] = { content: backgroundSource };
+        if (backgroundSource.trim()) files['background.eye'] = { content: backgroundSource };
         const response = await fetch('https://api.github.com/gists', {
           method: 'POST',
           headers: {

package/src/cli.js

@@ -133,10 +133,10 @@ async function usage(stream) {
   stream.write(`eyelang ${await packageVersion()}
 
 Usage:
-  eyelang [options] [file-or-url.pl|- ...]
+  eyelang [options] [file-or-url.eye|- ...]
 
 Input:
-  file-or-url.pl        Read a Eyelang program from a local file or http(s) URL.
+  file-or-url.eye        Read a Eyelang program from a local file or http(s) URL.
   -                     Read a Eyelang program from standard input.
 
 Options:

package/src/explain.js

@@ -69,7 +69,7 @@ function* proveGoalAll(program, goal, env, depth, maxDepth, registry, active) {
 
   const group = program.findGroup(goal.name, goal.arity);
   if (!group) return;
-  if (!group.memoized && activeVariant(goal, env, active)) return;
+  if (!group.tabled && activeVariant(goal, env, active)) return;
 
   const candidates = selectClauseCandidates(group, goal, env);
   for (const pass of [candidates.primary, candidates.fallback]) {

package/src/parser.js

@@ -23,13 +23,11 @@ function isNameContinueCode(code) {
   return code === 95 || isAsciiLetterCode(code) || isDigitCode(code);
 }
 
-function isDottedAtomContinue(source, pos) {
-  return source[pos] === '.' && isPlainAtomStartCode((source[pos + 1] ?? '').charCodeAt(0));
-}
 
-function isVariableStart(text) {
-  const code = text.charCodeAt(0);
-  return code === 95 || (code >= 65 && code <= 90);
+function isQuestionVariableStart(source, pos) {
+  if (source[pos] !== '?') return false;
+  const code = (source[pos + 1] ?? '').charCodeAt(0);
+  return code === 95 || isAsciiLetterCode(code);
 }
 
 function isPlainAtomStartCode(code) {
@@ -143,30 +141,20 @@ class Parser {
       return { type: TOK.NUMBER, text: this.source.slice(start, this.pos), line };
     }
 
-    if (isVariableStart(ch)) {
+    if (isQuestionVariableStart(this.source, this.pos)) {
       const start = this.pos;
+      this.take(); // ?
       this.take();
       while (isNameContinueCode(this.peek().charCodeAt(0))) this.take();
       let text = this.source.slice(start, this.pos);
-      if (text === '_') text = `__anon${this.anonymous++}`;
+      if (text === '?_') text = `__anon${this.anonymous++}`;
       return { type: TOK.VAR, text, line };
     }
 
     if (isPlainAtomStartCode(ch.charCodeAt(0))) {
       const start = this.pos;
       this.take();
-      while (true) {
-        if (isNameContinueCode(this.peek().charCodeAt(0))) {
-          this.take();
-          continue;
-        }
-        if (isDottedAtomContinue(this.source, this.pos)) {
-          this.take();
-          this.take();
-          continue;
-        }
-        break;
-      }
+      while (isNameContinueCode(this.peek().charCodeAt(0))) this.take();
       return { type: TOK.ATOM, text: this.source.slice(start, this.pos), line };
     }
 
@@ -330,8 +318,8 @@ function isSimpleName(text) {
 const SIMPLE_NUMBER = /^-?\d+(?:\.\d+)?(?:[eE][+-]?\d+)?$/;
 const FAST_BINARY_FACT = /^([a-z][A-Za-z0-9_]*)\(\s*([^,\s()[\]|"']+)\s*,\s*([^,\s()[\]|"']+)\s*\)\.$/;
 const FAST_BINARY_RULE = /^([a-z][A-Za-z0-9_]*)\(\s*([^,\s()[\]|"']+)\s*,\s*([^,\s()[\]|"']+)\s*\)\s*:-\s*([a-z][A-Za-z0-9_]*)\(\s*([^,\s()[\]|"']+)\s*,\s*([^,\s()[\]|"']+)\s*\)\.$/;
-const SIMPLE_VARIABLE = /^[_A-Z][A-Za-z0-9_]*$/;
-const SIMPLE_ATOM = /^[a-z][A-Za-z0-9_]*(?:\.[a-z][A-Za-z0-9_]*)*$/;
+const SIMPLE_VARIABLE = /^\?[A-Za-z_][A-Za-z0-9_]*$/;
+const SIMPLE_ATOM = /^[a-z][A-Za-z0-9_]*$/;
 const GRAPHIC_ATOM = /^[#$&*+\-\/<=>?@^~\\]+$/;
 
 function parseClausesFastNoSource(source) {
@@ -354,7 +342,7 @@ function parseClausesFastNoSource(source) {
   const scalarOrVariableFast = (text) => {
     if (!text || !isFastScalarToken(text)) throw new Error('bad simple term');
     const first = text.charCodeAt(0);
-    if (text === '_') return variable(`__anon${anonymous++}`);
+    if (text === '?_') return variable(`__anon${anonymous++}`);
     if (SIMPLE_VARIABLE.test(text)) {
       const existing = variableCache.get(text);
       if (existing) return existing;

package/src/program.js

@@ -39,7 +39,7 @@ export class Program {
       clauses: [],
       argIndexes: Array.from({ length: arity }, () => ({ buckets: new Map(), fallback: [] })),
       pairIndexes: [],
-      memoized: false,
+      tabled: false,
       recursive: false,
     };
     if (arity > 2) {
@@ -74,9 +74,9 @@ export class Program {
       const [name, arity] = h.args;
       if (name.type !== ATOM || arity.type !== 'number') continue;
       const key = `${name.name}/${Number(arity.name)}`;
-      if (h.name === 'memoize') {
+      if (h.name === 'table') {
         const group = this.groups.get(key);
-        if (group) group.memoized = true;
+        if (group) group.tabled = true;
       } else if (h.name === 'materialize') {
         this.hasMaterialize = true;
         this.materializedGroups.add(key);

package/src/solver.js

@@ -121,7 +121,7 @@ export class Solver {
         const group = this.program.findGroup(goal.name, goal.arity);
         if (!group) break;
 
-        if (group.memoized) {
+        if (group.tabled) {
           const key = memoKey(goal, env);
           if (key.hasBound) {
             const mapKey = `${goal.name}/${goal.arity}:${key.text}`;
@@ -162,7 +162,7 @@ export class Solver {
     if (goal.type !== COMPOUND) return;
     const group = this.program.findGroup(goal.name, goal.arity);
     if (!group) return;
-    if (group.memoized) {
+    if (group.tabled) {
       yield* this.solveMemoizedGoal(group, goal, rest, env, depth);
       return;
     }

package/src/term.js

@@ -138,7 +138,7 @@ const graphicAtomChars = new Set('#$&*+-/<=>?@^~\\'.split(''));
 function atomNeedsQuotes(name) {
   if (!name) return true;
   if (name === '[]') return false;
-  if (/^[a-z][A-Za-z0-9_]*(?:\.[a-z][A-Za-z0-9_]*)*$/.test(name)) return false;
+  if (/^[a-z][A-Za-z0-9_]*$/.test(name)) return false;
   for (const ch of name) if (!graphicAtomChars.has(ch)) return true;
   return false;
 }

package/test/conformance/README.md

@@ -4,8 +4,8 @@ This directory contains the executable conformance cases for the Eyelang languag
 
 The suite is intentionally file-based so another implementation can run the same programs and compare exact standard output. A case consists of:
 
-- `conformance/cases/<name>.pl` — input program;
-- `conformance/expected/<name>.pl` — exact expected standard output, stored as eyelang-readable facts.
+- `conformance/cases/<name>.eye` — input program;
+- `conformance/expected/<name>.eye` — exact expected standard output, stored as eyelang-readable facts.
 
 The current runner compares standard output from normal execution. Proof explanations are opt-in in the CLI and are not part of these conformance goldens. Standard error, performance, and resource limits are outside this suite.
 

package/test/conformance/cases/001_fact_output.eye

@@ -0,0 +1,4 @@
+% Reference 6, 7, 11: facts can be exposed through a materialized derived predicate.
+materialize(parent, 2).
+base_parent(pat, jan).
+parent(?x, ?y) :- base_parent(?x, ?y).

package/test/conformance/cases/002_rule_recursion.eye

@@ -0,0 +1,7 @@
+% Reference 6, 7: definite clauses, conjunction, and recursive proof search.
+materialize(ancestor, 2).
+parent(pat, jan).
+parent(jan, emma).
+ancestor_any(?x, ?y) :- parent(?x, ?y).
+ancestor_any(?x, ?z) :- parent(?x, ?y), ancestor_any(?y, ?z).
+ancestor(pat, ?y) :- ancestor_any(pat, ?y).

package/test/conformance/cases/002_rule_recursion.query

@@ -1 +1 @@
-ancestor(pat, X)
+ancestor(pat, ?x)

package/test/conformance/cases/003_terms_and_readback.eye

@@ -0,0 +1,16 @@
+% Reference 3, 5, 11: scalars, compounds, lists, and read-back printing.
+materialize(value, 2).
+raw_value(atom, pat).
+raw_value(quoted_atom, 'atom with spaces').
+raw_value(quoted_quote, 'needs''quote').
+raw_value(empty_atom, '').
+raw_value(string, "line\nquote: \"ok\"").
+raw_value(integer, -42).
+raw_value(decimal, 0.25).
+raw_value(scientific, 1.25e-3).
+raw_value(compound, pair(3, nested(atom, [x, y]))).
+raw_value(arity_zero_atom, nil).
+raw_value(empty_list, []).
+raw_value(proper_list, [a, b, c]).
+raw_value(improper_list, [a, b | tail]).
+value(?k, ?v) :- raw_value(?k, ?v).

package/test/conformance/cases/003_terms_and_readback.query

@@ -1 +1 @@
-value(K, V)
+value(?k, ?v)

package/test/conformance/cases/004_conjunction_and_parentheses.eye

@@ -0,0 +1,5 @@
+% Reference 5.5, 7: parenthesized comma terms are conjunctions in goal position.
+p(a).
+q(a).
+ok(?x, yes) :- (p(?x), q(?x)).
+materialize(ok, 2).

package/test/conformance/cases/004_conjunction_and_parentheses.query

@@ -1 +1 @@
-ok(X, Y)
+ok(?x, ?y)

package/test/conformance/cases/005_list_deconstruction.eye

@@ -0,0 +1,6 @@
+% Reference 5.4, 12.1: list syntax and unification in rule heads.
+first([?x | ?_rest], ?x).
+tail([?_head | ?tail], ?tail).
+answer(first, ?x) :- first([a, b, c], ?x).
+answer(tail, ?tail) :- tail([a, b, c], ?tail).
+materialize(answer, 2).

package/test/conformance/cases/005_list_deconstruction.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/006_comma_formula_data.eye

@@ -0,0 +1,4 @@
+% Reference 5.5: comma terms remain data outside goal position.
+record((name(alice, "Alice"), knows(alice, bob))).
+answer(formula, ?f) :- record(?f).
+materialize(answer, 2).

package/test/conformance/cases/006_comma_formula_data.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/007_anonymous_variables.eye

@@ -0,0 +1,5 @@
+% Reference 3.4, 5.1, 7.1: each anonymous variable occurrence is fresh.
+pair(a, one).
+pair(b, two).
+answer(fresh, yes) :- pair(a, ?_), pair(b, ?_).
+materialize(answer, 2).

package/test/conformance/cases/007_anonymous_variables.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/008_graphic_atoms.eye

@@ -0,0 +1,6 @@
+% Reference 3.5, 5.2, 11: graphic atom constants are scalar terms.
+materialize(value, 2).
+raw_value(hash, #).
+raw_value(arrow, =>).
+raw_value(comparison, =<).
+value(?k, ?v) :- raw_value(?k, ?v).

package/test/conformance/cases/008_graphic_atoms.query

@@ -1 +1 @@
-value(K, V)
+value(?k, ?v)

package/test/conformance/cases/009_comments_and_whitespace.eye

@@ -0,0 +1,5 @@
+% Reference 3.2, 3.6: comments are ignored outside quoted text and atoms.
+  item(quoted_percent, "% not a comment").    % trailing comment
+item(quoted_atom, 'has % sign').
+answer(?k, ?v) :- item(?k, ?v).
+materialize(answer, 2).

package/test/conformance/cases/009_comments_and_whitespace.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/010_variable_scope_and_reuse.eye

@@ -0,0 +1,8 @@
+% Reference 5.1, 7.1: variable occurrences are scoped per clause and reused within a clause.
+edge(a, b).
+edge(b, c).
+edge(c, d).
+two_step(?x, ?z) :- edge(?x, ?y), edge(?y, ?z).
+answer(from_a, ?z) :- two_step(a, ?z).
+answer(from_b, ?z) :- two_step(b, ?z).
+materialize(answer, 2).

package/test/conformance/cases/010_variable_scope_and_reuse.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/011_predicate_arity.eye

@@ -0,0 +1,6 @@
+% Reference 6: predicate name and arity both identify a predicate group.
+p(a).
+p(a, b).
+answer(unary, ?x) :- p(?x).
+answer(binary, pair(?x, ?y)) :- p(?x, ?y).
+materialize(answer, 2).

package/test/conformance/cases/011_predicate_arity.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/012_nested_compound_unification.eye

@@ -0,0 +1,5 @@
+% Reference 5.3, 7.1: unification follows nested compound term structure.
+fact(pair(a, nested(b, [c, d]))).
+answer(middle, ?x) :- fact(pair(a, nested(?x, [c, d]))).
+answer(list_tail, ?t) :- fact(pair(a, nested(b, [c | ?t]))).
+materialize(answer, 2).

package/test/conformance/cases/012_nested_compound_unification.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/013_multiple_clauses_order.eye

@@ -0,0 +1,6 @@
+% Reference 6, 7: multiple clauses for one predicate are explored as alternatives.
+color(red).
+color(blue).
+paint(?x) :- color(?x).
+answer(color, ?x) :- paint(?x).
+materialize(answer, 2).

package/test/conformance/cases/013_multiple_clauses_order.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/014_failure_filters_answers.eye

@@ -0,0 +1,7 @@
+% Reference 7.2: a failing subgoal removes that candidate answer.
+candidate(a).
+candidate(b).
+allowed(a).
+answer(?x, ok) :- candidate(?x), allowed(?x).
+
+materialize(answer, 2).

package/test/conformance/cases/014_failure_filters_answers.query

@@ -1 +1 @@
-answer(X, V)
+answer(?x, ?v)

package/test/conformance/cases/015_improper_list_unification.eye

@@ -0,0 +1,6 @@
+% Reference 5.4: improper list surface syntax unifies with head-tail structure.
+cell([head | tail], head, tail).
+answer(list, ?l) :- cell(?l, head, tail).
+answer(head, ?h) :- cell([?h | tail], ?h, tail).
+answer(tail, ?t) :- cell([head | ?t], head, ?t).
+materialize(answer, 2).

package/test/conformance/cases/015_improper_list_unification.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/016_arity_zero_atom.eye

@@ -0,0 +1,4 @@
+% Reference 4, 5.3: arity-zero data is written as an atom constant.
+status(nil, ok).
+answer(value, ?x) :- status(?x, ok).
+materialize(answer, 2).

package/test/conformance/cases/017_three_step_recursion.eye

@@ -0,0 +1,8 @@
+% Reference 7: recursive definite clauses can derive paths beyond one step.
+link(a, b).
+link(b, c).
+link(c, d).
+path(?x, ?y) :- link(?x, ?y).
+path(?x, ?z) :- link(?x, ?y), path(?y, ?z).
+answer(reachable, ?x) :- path(a, ?x).
+materialize(answer, 2).

package/test/conformance/cases/017_three_step_recursion.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/018_quoted_atom_readback.eye

@@ -0,0 +1,6 @@
+% Reference 3.5, 11: quoted atoms preserve spaces, quotes, and the empty atom.
+symbol('two words').
+symbol('needs''quote').
+symbol('').
+answer(symbol, ?x) :- symbol(?x).
+materialize(answer, 2).

package/test/conformance/cases/018_quoted_atom_readback.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/019_parenthesized_three_conjuncts.eye

@@ -0,0 +1,7 @@
+% Reference 5.5, 7: parenthesized comma terms with more than two members are conjunctions as goals.
+p(a).
+q(a).
+r(a).
+ok(?x) :- (p(?x), q(?x), r(?x)).
+answer(ok, ?x) :- ok(?x).
+materialize(answer, 2).

package/test/conformance/cases/019_parenthesized_three_conjuncts.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/020_nested_list_terms.eye

@@ -0,0 +1,5 @@
+% Reference 5.3, 5.4: lists may contain structured terms that unify positionally.
+node([pair(a, b), pair(c, d)]).
+answer(first_key, ?x) :- node([pair(?x, ?_), pair(c, d)]).
+answer(second_key, ?x) :- node([pair(a, b), pair(?x, d)]).
+materialize(answer, 2).

package/test/conformance/cases/020_nested_list_terms.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/021_repeated_variable_head.eye

@@ -0,0 +1,7 @@
+% Reference 5.1, 7.1: repeated variables in a rule body require the same term.
+pair(a, a).
+pair(a, b).
+pair(c, c).
+diagonal(?x) :- pair(?x, ?x).
+answer(diagonal, ?x) :- diagonal(?x).
+materialize(answer, 2).

package/test/conformance/cases/022_rule_head_structure.eye

@@ -0,0 +1,5 @@
+% Reference 5.3, 6, 7.1: structured rule heads destructure matching goals.
+unpack(pair(?x, ?y), ?x, ?y).
+answer(first, ?a) :- unpack(pair(alpha, beta), ?a, ?_).
+answer(second, ?b) :- unpack(pair(alpha, beta), ?_, ?b).
+materialize(answer, 2).

package/test/conformance/cases/023_quoted_escapes_readback.eye

@@ -0,0 +1,5 @@
+% Reference 3.5, 11: quoted strings and atoms preserve escape sequences at read-back.
+raw(string, "line\nnext\t\\slash").
+raw(atom, 'line\nnext\t\\slash').
+answer(?k, ?v) :- raw(?k, ?v).
+materialize(answer, 2).

package/test/conformance/cases/024_numeric_literal_readback.eye

@@ -0,0 +1,6 @@
+% 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).
+materialize(answer, 2).

package/test/conformance/cases/025_body_parentheses_with_formula_data.eye

@@ -0,0 +1,5 @@
+% Reference 5.5, 7: formula data can be passed through parenthesized conjunctions.
+record((left(a), right(b))).
+accept((left(a), right(b))).
+answer(ok, ?f) :- (record(?f), accept(?f)).
+materialize(answer, 2).

package/test/conformance/cases/026_question_underscore_named_variable_reuse.eye

@@ -0,0 +1,5 @@
+% Reference 3.4, 5.1: `?_name` variables are named variables; only exactly `?_` is anonymous.
+pair(a, a).
+pair(a, b).
+answer(shared, ?_value) :- pair(?_value, ?_value).
+materialize(answer, 2).

package/test/conformance/cases/027_default_derived_output.eye

@@ -0,0 +1,5 @@
+% Reference 11: default output prints new ground binary derivations, not source facts.
+parent(pat, jan).
+parent(jan, emma).
+ancestor(?x, ?y) :- parent(?x, ?y).
+ancestor(?x, ?z) :- parent(?x, ?y), ancestor(?y, ?z).

package/test/conformance/cases/028_materialize_focus.eye

@@ -0,0 +1,5 @@
+% Reference 10.2, 11: materialize/2 restricts selected default predicate groups.
+materialize(answer, 2).
+seed(a).
+helper(?x, y) :- seed(?x).
+answer(?x, ok) :- helper(?x, y).

package/test/conformance/cases/029_arithmetic_and_comparison.eye

@@ -0,0 +1,11 @@
+% Reference 9.2, 9.3: arithmetic and comparison built-ins.
+answer(sum, ?x) :- add(2, 3, ?x).
+answer(diff, ?x) :- sub(7, 4, ?x).
+answer(product, ?x) :- mul(6, 7, ?x).
+answer(integer_division, ?x) :- div(7, 2, ?x).
+answer(remainder, ?x) :- mod(7, 2, ?x).
+answer(power, ?x) :- pow(2, 8, ?x).
+answer(minimum, ?x) :- min(3, 9, ?x).
+answer(less_than, true) :- lt(3, 9).
+answer(greater_equal, true) :- ge(9, 9).
+materialize(answer, 2).

package/test/conformance/cases/029_arithmetic_and_comparison.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/030_strings_and_atoms.eye

@@ -0,0 +1,4 @@
+% Reference 9.6: atom and string built-ins.
+answer(str_concat, ?x) :- str_concat("eye", "lang", ?x).
+answer(contains, true) :- contains("eyelang", "yel").
+materialize(answer, 2).

package/test/conformance/cases/030_strings_and_atoms.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/031_lists_aggregation_ordering.eye

@@ -0,0 +1,10 @@
+% Reference 9.7, 9.8: list, aggregation, and ordering built-ins.
+answer(member, ?x) :- member(?x, [a, b]).
+answer(append, ?x) :- append([a], [b, c], ?x).
+answer(nth0, ?x) :- nth0(1, [a, b, c], ?x).
+answer(set_nth0, ?x) :- set_nth0(1, [a, b, c], x, ?x).
+answer(reverse, ?x) :- reverse([a, b, c], ?x).
+answer(length, ?n) :- length([a, b, c], ?n).
+answer(findall, ?x) :- findall(?n, between(1, 3, ?n), ?x).
+answer(sort, ?x) :- sort([b, a, b], ?x).
+materialize(answer, 2).

package/test/conformance/cases/031_lists_aggregation_ordering.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/032_holds_parts.eye

@@ -0,0 +1,4 @@
+% Reference 9.9: holds/3 exposes context members of any arity.
+context((ready, name(alice, "Alice"), route(alice, bob, 7))).
+answer(parts, exposed(?name, ?args)) :- context(?c), holds(?c, ?name, ?args).
+materialize(answer, 2).

package/test/conformance/cases/033_negation_once_generators.eye

@@ -0,0 +1,7 @@
+% Reference 9.5, 9.10: generators, negation as failure, and once/1.
+candidate(a).
+candidate(b).
+closed(b).
+answer(open, ?x) :- candidate(?x), not(closed(?x)).
+answer(first_between, ?x) :- once(between(2, 4, ?x)).
+materialize(answer, 2).

package/test/conformance/cases/033_negation_once_generators.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/034_equality_and_inequality.eye

@@ -0,0 +1,6 @@
+% Reference 9.1: eq/2 unifies terms and neq/2 succeeds on non-unifiable terms.
+answer(eq_variable, ?x) :- eq(?x, pair(a, [b, c])).
+answer(eq_nested, true) :- eq(pair(?x, ?x), pair(same, same)).
+answer(neq_atoms, true) :- neq(alice, bob).
+answer(neq_structures, true) :- neq(pair(a), pair(a, b)).
+materialize(answer, 2).

package/test/conformance/cases/034_equality_and_inequality.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/035_list_relations.eye

@@ -0,0 +1,5 @@
+% Reference 9.7: rest/2, select/3, and not_member/2.
+answer(rest, ?x) :- rest([a, b, c], ?x).
+answer(select, selected(?x, ?r)) :- select(?x, [a, b], ?r).
+answer(not_member, true) :- not_member(c, [a, b]).
+materialize(answer, 2).

package/test/conformance/cases/035_list_relations.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/036_append_splits.eye

@@ -0,0 +1,3 @@
+% Reference 9.7: append/3 can enumerate proper prefix/suffix splits.
+answer(split, split(?a, ?b)) :- append(?a, ?b, [a, b]).
+materialize(answer, 2).

package/test/conformance/cases/036_append_splits.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)

package/test/conformance/cases/037_matching_and_comparison.query

@@ -1 +1 @@
-answer(K, V)
+answer(?k, ?v)