eyeling 1.10.7 → 1.10.9

package/examples/get-uuid.n3

@@ -0,0 +1,65 @@
+# ===========================
+# get UUID
+# Example from Wout Slabbinck
+# ===========================
+
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix string: <http://www.w3.org/2000/10/swap/string#> .
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix crypto: <http://www.w3.org/2000/10/swap/crypto#> .
+@prefix odrl: <http://www.w3.org/ns/odrl/2/>.
+@prefix : <http://example.org/ns#> .
+
+# uuid backward rule (component)
+{
+   ?input :getUUID ?urnUuid 
+}
+<= 
+{
+   # 1. Convert input to a stable string
+   ?input :listToString ?inputString .
+   
+   # 2. Generate a stable hash (works identically in 2026 eyeJS and Eyeling)
+    ?inputString  crypto:sha ?hash .
+   
+   # 3. Format the hash into a UUID-compliant structure (8-4-4-4-12)
+   ( ?hash "^(.{8}).*$" ) string:scrape ?p1 .
+   ( ?hash "^.{8}(.{4}).*$" ) string:scrape ?p2 .
+   ( ?hash "^.{12}(.{4}).*$" ) string:scrape ?p3 .
+   ( ?hash "^.{16}(.{4}).*$" ) string:scrape ?p4 .
+   ( ?hash "^.{20}(.{12}).*$" ) string:scrape ?p5 .
+   ( "urn:uuid:" ?p1 "-" ?p2 "-" ?p3 "-" ?p4 "-" ?p5 ) string:concatenation ?urnUuidString .
+   
+   # 4. Cast the final string to a URI
+   ?urnUuid log:uri ?urnUuidString .
+} .
+
+# 1. Base Case: An empty list results in an empty string
+{ () :listToString "" } <= { } .
+
+# 2. Recursive Case: Process list using rdf:first and rdf:rest
+{   ?list :listToString ?result } <= {
+    ?list rdf:first ?head .
+    ?list rdf:rest ?tail .
+    
+    # Convert the current URI to a string
+    ?head log:uri ?headStr .
+    
+    # Recursively convert the tail of the list
+    ?tail :listToString ?tailStr .
+    
+    # Combine head and tail strings
+    ( ?headStr ?tailStr ) string:concatenation ?result .
+} .
+
+<test> a odrl:Policy  .
+<lol> a odrl:Policy .
+
+{    
+    ?policy a odrl:Policy .
+    ( ?policy ) :getUUID ?urnUuid .
+}
+=>
+{
+    ?urnUuid <a> <b> .
+} .

package/examples/output/get-uuid.n3

@@ -0,0 +1,2 @@
+<urn:uuid:a94a8fe5-ccb1-9ba6-1c4c-0873d391e987> <a> <b> .
+<urn:uuid:40392603-3d00-1b52-79df-37cbbe5287b7> <a> <b> .

package/eyeling.js

@@ -171,8 +171,8 @@ function main() {
     process.exit(0);
   }
 
-  // Build internal ListTerm values from rdf:first/rdf:rest (+ rdf:nil)
-  engine.materializeRdfLists(triples, frules, brules);
+  // NOTE: Do not rewrite rdf:first/rdf:rest RDF list nodes into list terms.
+  // list:* builtins interpret RDF list structures directly when needed.
 
   const facts = triples.filter((tr) => engine.isGroundTriple(tr));
 
@@ -1195,6 +1195,7 @@ function alphaEqTriple(a, b) {
 
 function termFastKey(t) {
   if (t instanceof Iri) return 'I:' + t.value;
+  if (t instanceof Blank) return 'B:' + t.label;
   if (t instanceof Literal) return 'L:' + normalizeLiteralForFastKey(t.value);
   return null;
 }
@@ -2731,6 +2732,118 @@ function listAppendSplit(parts, resElems, subst) {
   return out;
 }
 
+
+// ---------------------------------------------------------------------------
+// RDF-list support for list:* builtins
+// ---------------------------------------------------------------------------
+
+function __rdfListObjectsForSP(facts, predIri, subj) {
+  ensureFactIndexes(facts);
+  const sk = termFastKey(subj);
+  if (sk !== null) {
+    const ps = facts.__byPS.get(predIri);
+    if (ps) {
+      const bucket = ps.get(sk);
+      if (bucket && bucket.length) return bucket.map((tr) => tr.o);
+    }
+  }
+
+  // Fallback scan (covers non-indexable terms)
+  const pb = facts.__byPred.get(predIri) || [];
+  const out = [];
+  for (const tr of pb) {
+    if (termsEqual(tr.s, subj)) out.push(tr.o);
+  }
+  return out;
+}
+
+function __rdfListElemsFromNode(head, facts) {
+  if (!(head instanceof Iri || head instanceof Blank)) return null;
+
+  // Cache per fact-set (important in forward chaining)
+  if (!Object.prototype.hasOwnProperty.call(facts, '__rdfListCache')) {
+    Object.defineProperty(facts, '__rdfListCache', {
+      value: new Map(),
+      enumerable: false,
+      writable: true,
+      configurable: true,
+    });
+  }
+
+  const key = termFastKey(head);
+  if (key === null) return null;
+  const cache = facts.__rdfListCache;
+  if (cache.has(key)) return cache.get(key);
+
+  const RDF_FIRST = RDF_NS + 'first';
+  const RDF_REST = RDF_NS + 'rest';
+  const RDF_NIL = RDF_NS + 'nil';
+
+  const elems = [];
+  const seen = new Set();
+  let cur = head;
+
+  while (true) {
+    if (cur instanceof Iri && cur.value === RDF_NIL) {
+      cache.set(key, elems);
+      return elems;
+    }
+
+    if (!(cur instanceof Iri || cur instanceof Blank)) {
+      cache.set(key, null);
+      return null;
+    }
+
+    const ck = termFastKey(cur);
+    if (ck === null) {
+      cache.set(key, null);
+      return null;
+    }
+    if (seen.has(ck)) {
+      cache.set(key, null);
+      return null; // cycle
+    }
+    seen.add(ck);
+
+    const firsts = __rdfListObjectsForSP(facts, RDF_FIRST, cur);
+    const rests = __rdfListObjectsForSP(facts, RDF_REST, cur);
+
+    if (firsts.length !== 1 || rests.length !== 1) {
+      cache.set(key, null);
+      return null;
+    }
+
+    elems.push(firsts[0]);
+    const rest = rests[0];
+
+    if (rest instanceof Iri && rest.value === RDF_NIL) {
+      cache.set(key, elems);
+      return elems;
+    }
+
+    // Mixed tail: rdf:rest can be an N3 list literal (e.g., (:b))
+    if (rest instanceof ListTerm) {
+      elems.push(...rest.elems);
+      cache.set(key, elems);
+      return elems;
+    }
+    if (rest instanceof OpenListTerm) {
+      elems.push(...rest.prefix);
+      elems.push(new Var(rest.tailVar));
+      cache.set(key, elems);
+      return elems;
+    }
+
+    cur = rest;
+  }
+}
+
+function __listElemsForBuiltin(listLike, facts) {
+  if (listLike instanceof ListTerm) return listLike.elems;
+  if (listLike instanceof Iri || listLike instanceof Blank) return __rdfListElemsFromNode(listLike, facts);
+  return null;
+}
+
 function evalListFirstLikeBuiltin(sTerm, oTerm, subst) {
   if (!(sTerm instanceof ListTerm)) return [];
   if (!sTerm.elems.length) return [];
@@ -3717,14 +3830,28 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // list:first and rdf:first
   // true iff $s is a list and $o is the first member of that list.
   // Schema: $s+ list:first $o-
-  if (pv === LIST_NS + 'first' || pv === RDF_NS + 'first') {
+  if (pv === LIST_NS + 'first') {
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs || !xs.length) return [];
+    const s2 = unifyTerm(g.o, xs[0], subst);
+    return s2 !== null ? [s2] : [];
+  }
+  if (pv === RDF_NS + 'first') {
     return evalListFirstLikeBuiltin(g.s, g.o, subst);
   }
 
   // list:rest and rdf:rest
   // true iff $s is a (non-empty) list and $o is the rest (tail) of that list.
   // Schema: $s+ list:rest $o-
-  if (pv === LIST_NS + 'rest' || pv === RDF_NS + 'rest') {
+  if (pv === LIST_NS + 'rest') {
+    if (g.s instanceof ListTerm || g.s instanceof OpenListTerm) return evalListRestLikeBuiltin(g.s, g.o, subst);
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs || !xs.length) return [];
+    const rest = new ListTerm(xs.slice(1));
+    const s2 = unifyTerm(g.o, rest, subst);
+    return s2 !== null ? [s2] : [];
+  }
+  if (pv === RDF_NS + 'rest') {
     return evalListRestLikeBuiltin(g.s, g.o, subst);
   }
 
@@ -3733,8 +3860,8 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // For a list subject $s, generate solutions by unifying $o with (index value).
   // This allows $o to be a variable (e.g., ?Y) or a pattern (e.g., (?i "Dewey")).
   if (pv === LIST_NS + 'iterate') {
-    if (!(g.s instanceof ListTerm)) return [];
-    const xs = g.s.elems;
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs) return [];
     const outs = [];
 
     for (let i = 0; i < xs.length; i++) {
@@ -3774,9 +3901,8 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // true iff $s is a list and $o is the last member of that list.
   // Schema: $s+ list:last $o-
   if (pv === LIST_NS + 'last') {
-    if (!(g.s instanceof ListTerm)) return [];
-    const xs = g.s.elems;
-    if (!xs.length) return [];
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs || !xs.length) return [];
     const last = xs[xs.length - 1];
     const s2 = unifyTerm(g.o, last, subst);
     return s2 !== null ? [s2] : [];
@@ -3787,10 +3913,10 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // Schema: ( $s.1+ $s.2?[*] )+ list:memberAt $o?[*]
   if (pv === LIST_NS + 'memberAt') {
     if (!(g.s instanceof ListTerm) || g.s.elems.length !== 2) return [];
-    const [listTerm, indexTerm] = g.s.elems;
-    if (!(listTerm instanceof ListTerm)) return [];
+    const [listRef, indexTerm] = g.s.elems;
 
-    const xs = listTerm.elems;
+    const xs = __listElemsForBuiltin(listRef, facts);
+    if (!xs) return [];
     const outs = [];
 
     for (let i = 0; i < xs.length; i++) {
@@ -3847,9 +3973,10 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
 
   // list:member
   if (pv === LIST_NS + 'member') {
-    if (!(g.s instanceof ListTerm)) return [];
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs) return [];
     const outs = [];
-    for (const x of g.s.elems) {
+    for (const x of xs) {
       const s2 = unifyTerm(g.o, x, subst);
       if (s2 !== null) outs.push(s2);
     }
@@ -3869,8 +3996,9 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
 
   // list:length  (strict: do not accept integer<->decimal matches for a ground object)
   if (pv === LIST_NS + 'length') {
-    if (!(g.s instanceof ListTerm)) return [];
-    const nTerm = internLiteral(String(g.s.elems.length));
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs) return [];
+    const nTerm = internLiteral(String(xs.length));
 
     const o2 = applySubstTerm(g.o, subst);
     if (isGroundTerm(o2)) {
@@ -3883,8 +4011,9 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
 
   // list:notMember
   if (pv === LIST_NS + 'notMember') {
-    if (!(g.s instanceof ListTerm)) return [];
-    for (const el of g.s.elems) {
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs) return [];
+    for (const el of xs) {
       if (unifyTerm(g.o, el, subst) !== null) return [];
     }
     return [{ ...subst }];
@@ -3892,12 +4021,23 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
 
   // list:reverse
   if (pv === LIST_NS + 'reverse') {
+    // Forward: compute o from s
     if (g.s instanceof ListTerm) {
       const rev = [...g.s.elems].reverse();
       const rterm = new ListTerm(rev);
       const s2 = unifyTerm(g.o, rterm, subst);
       return s2 !== null ? [s2] : [];
     }
+
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (xs) {
+      const rev = [...xs].reverse();
+      const rterm = new ListTerm(rev);
+      const s2 = unifyTerm(g.o, rterm, subst);
+      return s2 !== null ? [s2] : [];
+    }
+
+    // Reverse: compute s from o (only for explicit list terms)
     if (g.o instanceof ListTerm) {
       const rev = [...g.o.elems].reverse();
       const rterm = new ListTerm(rev);
@@ -5269,7 +5409,12 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
     const goal0 = applySubstTriple(rawGoal, state.subst);
 
     // 1) Builtins
-    if (isBuiltinPred(goal0.p)) {
+    const __pv0 = goal0.p instanceof Iri ? goal0.p.value : null;
+    const __rdfFirstOrRest = __pv0 === RDF_NS + 'first' || __pv0 === RDF_NS + 'rest';
+    const __treatBuiltin =
+      isBuiltinPred(goal0.p) && !(__rdfFirstOrRest && !(goal0.s instanceof ListTerm || goal0.s instanceof OpenListTerm));
+
+    if (__treatBuiltin) {
       const remaining = max - results.length;
       if (remaining <= 0) return results;
       const builtinMax = Number.isFinite(remaining) && !restGoals.length ? remaining : undefined;
@@ -5932,7 +6077,8 @@ function reasonStream(n3Text, opts = {}) {
   // Make the parsed prefixes available to log:trace output
   trace.setTracePrefixes(prefixes);
 
-  materializeRdfLists(triples, frules, brules);
+  // NOTE: Do not rewrite rdf:first/rdf:rest RDF list nodes into list terms.
+  // list:* builtins interpret RDF list structures directly when needed.
 
   // facts becomes the saturated closure because pushFactIndexed(...) appends into it
   const facts = triples.filter((tr) => isGroundTriple(tr));
@@ -7459,6 +7605,21 @@ function isLogImpliedBy(p) {
 // PREFIX ENVIRONMENT
 // ===========================================================================
 
+
+// Conservative check for whether a candidate local part can be safely serialized as a prefixed name.
+// If false, we fall back to <IRI> to guarantee syntactically valid N3/Turtle output.
+function isValidQNameLocal(local) {
+  if (typeof local !== 'string' || local.length === 0) return false;
+  // Disallow characters that would break PN_LOCAL unless escaped (we keep this conservative).
+  if (/[#:\/\?\s]/.test(local)) return false;
+  // Allow a safe ASCII subset.
+  if (/[^A-Za-z0-9._-]/.test(local)) return false;
+  // Avoid edge cases that typically require escaping.
+  if (local.endsWith('.')) return false;
+  if (/^[.-]/.test(local)) return false;
+  return true;
+}
+
 class PrefixEnv {
   constructor(map, baseIri) {
     this.map = map || {}; // prefix -> IRI (including "" for @prefix :)
@@ -7505,6 +7666,8 @@ class PrefixEnv {
       if (iri.startsWith(base)) {
         const local = iri.slice(base.length);
         if (!local) continue;
+        // Only emit a QName when the local part is safe to serialize without escaping.
+        if (!isValidQNameLocal(local)) continue;
         const cand = [p, local];
         if (best === null || cand[1].length < best[1].length) best = cand;
       }

package/lib/cli.js

@@ -159,8 +159,8 @@ function main() {
     process.exit(0);
   }
 
-  // Build internal ListTerm values from rdf:first/rdf:rest (+ rdf:nil)
-  engine.materializeRdfLists(triples, frules, brules);
+  // NOTE: Do not rewrite rdf:first/rdf:rest RDF list nodes into list terms.
+  // list:* builtins interpret RDF list structures directly when needed.
 
   const facts = triples.filter((tr) => engine.isGroundTriple(tr));
 

package/lib/engine.js

@@ -539,6 +539,7 @@ function alphaEqTriple(a, b) {
 
 function termFastKey(t) {
   if (t instanceof Iri) return 'I:' + t.value;
+  if (t instanceof Blank) return 'B:' + t.label;
   if (t instanceof Literal) return 'L:' + normalizeLiteralForFastKey(t.value);
   return null;
 }
@@ -2075,6 +2076,118 @@ function listAppendSplit(parts, resElems, subst) {
   return out;
 }
 
+
+// ---------------------------------------------------------------------------
+// RDF-list support for list:* builtins
+// ---------------------------------------------------------------------------
+
+function __rdfListObjectsForSP(facts, predIri, subj) {
+  ensureFactIndexes(facts);
+  const sk = termFastKey(subj);
+  if (sk !== null) {
+    const ps = facts.__byPS.get(predIri);
+    if (ps) {
+      const bucket = ps.get(sk);
+      if (bucket && bucket.length) return bucket.map((tr) => tr.o);
+    }
+  }
+
+  // Fallback scan (covers non-indexable terms)
+  const pb = facts.__byPred.get(predIri) || [];
+  const out = [];
+  for (const tr of pb) {
+    if (termsEqual(tr.s, subj)) out.push(tr.o);
+  }
+  return out;
+}
+
+function __rdfListElemsFromNode(head, facts) {
+  if (!(head instanceof Iri || head instanceof Blank)) return null;
+
+  // Cache per fact-set (important in forward chaining)
+  if (!Object.prototype.hasOwnProperty.call(facts, '__rdfListCache')) {
+    Object.defineProperty(facts, '__rdfListCache', {
+      value: new Map(),
+      enumerable: false,
+      writable: true,
+      configurable: true,
+    });
+  }
+
+  const key = termFastKey(head);
+  if (key === null) return null;
+  const cache = facts.__rdfListCache;
+  if (cache.has(key)) return cache.get(key);
+
+  const RDF_FIRST = RDF_NS + 'first';
+  const RDF_REST = RDF_NS + 'rest';
+  const RDF_NIL = RDF_NS + 'nil';
+
+  const elems = [];
+  const seen = new Set();
+  let cur = head;
+
+  while (true) {
+    if (cur instanceof Iri && cur.value === RDF_NIL) {
+      cache.set(key, elems);
+      return elems;
+    }
+
+    if (!(cur instanceof Iri || cur instanceof Blank)) {
+      cache.set(key, null);
+      return null;
+    }
+
+    const ck = termFastKey(cur);
+    if (ck === null) {
+      cache.set(key, null);
+      return null;
+    }
+    if (seen.has(ck)) {
+      cache.set(key, null);
+      return null; // cycle
+    }
+    seen.add(ck);
+
+    const firsts = __rdfListObjectsForSP(facts, RDF_FIRST, cur);
+    const rests = __rdfListObjectsForSP(facts, RDF_REST, cur);
+
+    if (firsts.length !== 1 || rests.length !== 1) {
+      cache.set(key, null);
+      return null;
+    }
+
+    elems.push(firsts[0]);
+    const rest = rests[0];
+
+    if (rest instanceof Iri && rest.value === RDF_NIL) {
+      cache.set(key, elems);
+      return elems;
+    }
+
+    // Mixed tail: rdf:rest can be an N3 list literal (e.g., (:b))
+    if (rest instanceof ListTerm) {
+      elems.push(...rest.elems);
+      cache.set(key, elems);
+      return elems;
+    }
+    if (rest instanceof OpenListTerm) {
+      elems.push(...rest.prefix);
+      elems.push(new Var(rest.tailVar));
+      cache.set(key, elems);
+      return elems;
+    }
+
+    cur = rest;
+  }
+}
+
+function __listElemsForBuiltin(listLike, facts) {
+  if (listLike instanceof ListTerm) return listLike.elems;
+  if (listLike instanceof Iri || listLike instanceof Blank) return __rdfListElemsFromNode(listLike, facts);
+  return null;
+}
+
 function evalListFirstLikeBuiltin(sTerm, oTerm, subst) {
   if (!(sTerm instanceof ListTerm)) return [];
   if (!sTerm.elems.length) return [];
@@ -3061,14 +3174,28 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // list:first and rdf:first
   // true iff $s is a list and $o is the first member of that list.
   // Schema: $s+ list:first $o-
-  if (pv === LIST_NS + 'first' || pv === RDF_NS + 'first') {
+  if (pv === LIST_NS + 'first') {
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs || !xs.length) return [];
+    const s2 = unifyTerm(g.o, xs[0], subst);
+    return s2 !== null ? [s2] : [];
+  }
+  if (pv === RDF_NS + 'first') {
     return evalListFirstLikeBuiltin(g.s, g.o, subst);
   }
 
   // list:rest and rdf:rest
   // true iff $s is a (non-empty) list and $o is the rest (tail) of that list.
   // Schema: $s+ list:rest $o-
-  if (pv === LIST_NS + 'rest' || pv === RDF_NS + 'rest') {
+  if (pv === LIST_NS + 'rest') {
+    if (g.s instanceof ListTerm || g.s instanceof OpenListTerm) return evalListRestLikeBuiltin(g.s, g.o, subst);
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs || !xs.length) return [];
+    const rest = new ListTerm(xs.slice(1));
+    const s2 = unifyTerm(g.o, rest, subst);
+    return s2 !== null ? [s2] : [];
+  }
+  if (pv === RDF_NS + 'rest') {
     return evalListRestLikeBuiltin(g.s, g.o, subst);
   }
 
@@ -3077,8 +3204,8 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // For a list subject $s, generate solutions by unifying $o with (index value).
   // This allows $o to be a variable (e.g., ?Y) or a pattern (e.g., (?i "Dewey")).
   if (pv === LIST_NS + 'iterate') {
-    if (!(g.s instanceof ListTerm)) return [];
-    const xs = g.s.elems;
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs) return [];
     const outs = [];
 
     for (let i = 0; i < xs.length; i++) {
@@ -3118,9 +3245,8 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // true iff $s is a list and $o is the last member of that list.
   // Schema: $s+ list:last $o-
   if (pv === LIST_NS + 'last') {
-    if (!(g.s instanceof ListTerm)) return [];
-    const xs = g.s.elems;
-    if (!xs.length) return [];
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs || !xs.length) return [];
     const last = xs[xs.length - 1];
     const s2 = unifyTerm(g.o, last, subst);
     return s2 !== null ? [s2] : [];
@@ -3131,10 +3257,10 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // Schema: ( $s.1+ $s.2?[*] )+ list:memberAt $o?[*]
   if (pv === LIST_NS + 'memberAt') {
     if (!(g.s instanceof ListTerm) || g.s.elems.length !== 2) return [];
-    const [listTerm, indexTerm] = g.s.elems;
-    if (!(listTerm instanceof ListTerm)) return [];
+    const [listRef, indexTerm] = g.s.elems;
 
-    const xs = listTerm.elems;
+    const xs = __listElemsForBuiltin(listRef, facts);
+    if (!xs) return [];
     const outs = [];
 
     for (let i = 0; i < xs.length; i++) {
@@ -3191,9 +3317,10 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
 
   // list:member
   if (pv === LIST_NS + 'member') {
-    if (!(g.s instanceof ListTerm)) return [];
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs) return [];
     const outs = [];
-    for (const x of g.s.elems) {
+    for (const x of xs) {
       const s2 = unifyTerm(g.o, x, subst);
       if (s2 !== null) outs.push(s2);
     }
@@ -3213,8 +3340,9 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
 
   // list:length  (strict: do not accept integer<->decimal matches for a ground object)
   if (pv === LIST_NS + 'length') {
-    if (!(g.s instanceof ListTerm)) return [];
-    const nTerm = internLiteral(String(g.s.elems.length));
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs) return [];
+    const nTerm = internLiteral(String(xs.length));
 
     const o2 = applySubstTerm(g.o, subst);
     if (isGroundTerm(o2)) {
@@ -3227,8 +3355,9 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
 
   // list:notMember
   if (pv === LIST_NS + 'notMember') {
-    if (!(g.s instanceof ListTerm)) return [];
-    for (const el of g.s.elems) {
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (!xs) return [];
+    for (const el of xs) {
       if (unifyTerm(g.o, el, subst) !== null) return [];
     }
     return [{ ...subst }];
@@ -3236,12 +3365,23 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
 
   // list:reverse
   if (pv === LIST_NS + 'reverse') {
+    // Forward: compute o from s
     if (g.s instanceof ListTerm) {
       const rev = [...g.s.elems].reverse();
       const rterm = new ListTerm(rev);
       const s2 = unifyTerm(g.o, rterm, subst);
       return s2 !== null ? [s2] : [];
     }
+
+    const xs = __listElemsForBuiltin(g.s, facts);
+    if (xs) {
+      const rev = [...xs].reverse();
+      const rterm = new ListTerm(rev);
+      const s2 = unifyTerm(g.o, rterm, subst);
+      return s2 !== null ? [s2] : [];
+    }
+
+    // Reverse: compute s from o (only for explicit list terms)
     if (g.o instanceof ListTerm) {
       const rev = [...g.o.elems].reverse();
       const rterm = new ListTerm(rev);
@@ -4613,7 +4753,12 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
     const goal0 = applySubstTriple(rawGoal, state.subst);
 
     // 1) Builtins
-    if (isBuiltinPred(goal0.p)) {
+    const __pv0 = goal0.p instanceof Iri ? goal0.p.value : null;
+    const __rdfFirstOrRest = __pv0 === RDF_NS + 'first' || __pv0 === RDF_NS + 'rest';
+    const __treatBuiltin =
+      isBuiltinPred(goal0.p) && !(__rdfFirstOrRest && !(goal0.s instanceof ListTerm || goal0.s instanceof OpenListTerm));
+
+    if (__treatBuiltin) {
       const remaining = max - results.length;
       if (remaining <= 0) return results;
       const builtinMax = Number.isFinite(remaining) && !restGoals.length ? remaining : undefined;
@@ -5276,7 +5421,8 @@ function reasonStream(n3Text, opts = {}) {
   // Make the parsed prefixes available to log:trace output
   trace.setTracePrefixes(prefixes);
 
-  materializeRdfLists(triples, frules, brules);
+  // NOTE: Do not rewrite rdf:first/rdf:rest RDF list nodes into list terms.
+  // list:* builtins interpret RDF list structures directly when needed.
 
   // facts becomes the saturated closure because pushFactIndexed(...) appends into it
   const facts = triples.filter((tr) => isGroundTriple(tr));

package/lib/prelude.js

@@ -217,6 +217,21 @@ function isLogImpliedBy(p) {
 // PREFIX ENVIRONMENT
 // ===========================================================================
 
+
+// Conservative check for whether a candidate local part can be safely serialized as a prefixed name.
+// If false, we fall back to <IRI> to guarantee syntactically valid N3/Turtle output.
+function isValidQNameLocal(local) {
+  if (typeof local !== 'string' || local.length === 0) return false;
+  // Disallow characters that would break PN_LOCAL unless escaped (we keep this conservative).
+  if (/[#:\/\?\s]/.test(local)) return false;
+  // Allow a safe ASCII subset.
+  if (/[^A-Za-z0-9._-]/.test(local)) return false;
+  // Avoid edge cases that typically require escaping.
+  if (local.endsWith('.')) return false;
+  if (/^[.-]/.test(local)) return false;
+  return true;
+}
+
 class PrefixEnv {
   constructor(map, baseIri) {
     this.map = map || {}; // prefix -> IRI (including "" for @prefix :)
@@ -263,6 +278,8 @@ class PrefixEnv {
       if (iri.startsWith(base)) {
         const local = iri.slice(base.length);
         if (!local) continue;
+        // Only emit a QName when the local part is safe to serialize without escaping.
+        if (!isValidQNameLocal(local)) continue;
         const cand = [p, local];
         if (best === null || cand[1].length < best[1].length) best = cand;
       }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyeling",
-  "version": "1.10.7",
+  "version": "1.10.9",
   "description": "A minimal Notation3 (N3) reasoner in JavaScript.",
   "main": "./index.js",
   "keywords": [

package/test/api.test.js

@@ -866,6 +866,37 @@ ex:a p:trig ex:b.
       assert.ok(!String(out).includes('http://example.org/p'));
     },
   },
+  {
+    name: 'issue #6: RDF list nodes should not be rewritten; list:* builtins should traverse rdf:first/rest',
+    opt: {},
+    input: `@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
+@prefix list: <http://www.w3.org/2000/10/swap/list#> .
+@prefix : <urn:example:> .
+
+:path2 rdf:first :b; rdf:rest rdf:nil.
+:path1 rdf:type :P; rdf:first :a; rdf:rest :path2.
+:path1-nok rdf:type :P; rdf:first :a; rdf:rest (:b).
+
+{ ?p rdf:type :P. ?p rdf:first ?first. }
+=>
+{ :result :query1 (?p ?first). }.
+
+{ ?p rdf:type :P. (?p ?i) list:memberAt ?m. }
+=>
+{ :result :query2 (?p ?i ?m). }.
+`,
+    expect: [
+      /:result\s+:query1\s+\(:path1\s+:a\)\s*\./,
+      /:result\s+:query1\s+\(:path1-nok\s+:a\)\s*\./,
+      /:result\s+:query2\s+\(:path1\s+0\s+:a\)\s*\./,
+      /:result\s+:query2\s+\(:path1\s+1\s+:b\)\s*\./,
+      /:result\s+:query2\s+\(:path1-nok\s+0\s+:a\)\s*\./,
+      /:result\s+:query2\s+\(:path1-nok\s+1\s+:b\)\s*\./,
+    ],
+    notExpect: [
+      /:result\s+:query1\s+\(\(:a\s+:b\)\s+:a\)/,
+    ],
+  }
 ];
 
 let passed = 0;