eyeling 1.15.9 → 1.15.10

package/HANDBOOK.md

@@ -376,6 +376,10 @@ That’s alpha-equivalence:
 
 Eyeling implements alpha-equivalence by checking whether there exists a consistent renaming mapping between the two formulas’ variables/blanks that makes the triples match.
 
+Important scope nuance: only blanks/variables that are local to the quoted formula participate in alpha-renaming. If a formula is being matched after an outer substitution has already instantiated part of it, those substituted terms are treated as fixed. In other words, alpha-equivalence may rename formula-local placeholders, but it must not rename names that came from the enclosing match. This prevents a substituted outer blank node from being confused with a local blank node inside the quoted formula.
+
+So `{ _:x :p :o }` obtained by substituting `?A = _:x` into `{ ?A :p :o }` must not alpha-match `{ _:b :p :o }` by renaming `_:x` to `_:b`.
+
 ### 6.2 Groundness: “variables inside formulas don’t leak”
 
 Eyeling makes a deliberate choice about _groundness_:

package/README.md

@@ -1,5 +1,7 @@
 # eyeling
 
+[![npm version](https://img.shields.io/npm/v/eyereasoner.svg)](https://www.npmjs.com/package/eyereasoner) [![DOI](https://zenodo.org/badge/581706557.svg)](https://doi.org/10.5281/zenodo.19068086)
+
 A compact [Notation3 (N3)](https://notation3.org/) reasoner in **JavaScript**.
 
 - Single self-contained bundle (`eyeling.js`), no external runtime dependencies

package/examples/french-cities.n3

@@ -29,3 +29,5 @@
 # OWL rules
 {?P a owl:TransitiveProperty. ?S ?P ?X. ?X ?P ?O.} => {?S ?P ?O}.
 
+# query
+{?C :path :nantes} log:query {?C :path :nantes}.

package/examples/jsonterm-advanced.n3

@@ -0,0 +1,92 @@
+# =================================================================
+# More advanced jsonterm example.
+#
+# Mapping used:
+# - JSON objects become anonymous node structures.
+# - JSON arrays become N3 lists.
+# - JSON null becomes a normal symbol here, j:null.
+# - JSON booleans become ordinary boolean literals: true and false.
+# =================================================================
+
+@prefix ex: <https://example.org/#> .
+@prefix j: <https://example.org/json#> .
+
+[
+  j:id "user-101";
+  j:profile [
+    j:name "Alice";
+    j:active true;
+    j:address [
+      j:city "Ghent";
+      j:country "BE"
+    ]
+  ];
+  j:roles ("admin" "editor");
+  j:preferences [
+    j:languages ("nl" "fr" "en");
+    j:theme "dark";
+    j:beta false
+  ];
+  j:orders (
+    [
+      j:id "ord-1";
+      j:total 125;
+      j:items ("book" "pen")
+    ]
+    [
+      j:id "ord-2";
+      j:total 45;
+      j:items ("notebook");
+      j:coupon j:null
+    ]
+  )
+] ex:kind j:UserDocument .
+
+{
+  ?Doc ex:kind j:UserDocument .
+  ?Doc j:profile [
+    j:name ?Name;
+    j:active true;
+    j:address [ j:country "BE" ]
+  ] .
+}
+=>
+{
+  ?Doc ex:userName ?Name .
+  ?Doc ex:eligibleForReview true .
+} .
+
+{
+  ?Doc j:preferences [
+    j:languages ("nl" "fr" "en");
+    j:theme "dark";
+    j:beta false
+  ] .
+}
+=>
+{
+  ?Doc ex:profileTag "multilingual-dark-profile" .
+} .
+
+{
+  ?Doc j:orders (
+    [ j:id ?FirstId; j:total 125; j:items ("book" "pen") ]
+    [ j:id ?SecondId; j:total 45; j:items ("notebook"); j:coupon j:null ]
+  ) .
+}
+=>
+{
+  ?Doc ex:hasHighValueStarterOrder true .
+  ?Doc ex:hasCouponlessFollowup true .
+} .
+
+{
+  ?Doc ex:eligibleForReview true .
+  ?Doc ex:profileTag "multilingual-dark-profile" .
+  ?Doc ex:hasHighValueStarterOrder true .
+  ?Doc ex:hasCouponlessFollowup true .
+}
+=>
+{
+  ex:test ex:is true .
+} .

package/examples/jsonterm.n3

@@ -0,0 +1,37 @@
+# =================================================
+# jsonterm example
+#
+# Mapping used:
+# - JSON objects become anonymous node structures.
+# - JSON arrays become N3 lists.
+# - JSON null becomes a normal symbol here, j:null.
+# =================================================
+
+@prefix ex: <https://example.org/#> .
+@prefix j: <https://example.org/json#> .
+
+[
+  j:user "alice";
+  j:roles ("admin" j:null)
+]
+("likes" 1)
+[
+  j:city "Paris";
+  j:coords (2.35 48.85)
+] .
+
+{
+  [
+    j:user ?U;
+    j:roles ("admin" j:null)
+  ]
+  ("likes" 1)
+  [
+    j:city "Paris";
+    j:coords (2.35 48.85)
+  ] .
+}
+=>
+{
+  ex:test ex:is true .
+} .

package/examples/output/french-cities.n3

@@ -1,23 +1,6 @@
 @prefix : <http://www.agfa.com/w3c/euler/graph.axiom#> .
 
-:paris :path :orleans .
-:paris :path :chartres .
-:paris :path :amiens .
-:orleans :path :blois .
-:orleans :path :bourges .
-:blois :path :tours .
-:chartres :path :lemans .
-:lemans :path :angers .
-:lemans :path :tours .
 :angers :path :nantes .
-:paris :path :blois .
-:paris :path :bourges .
-:paris :path :lemans .
-:orleans :path :tours .
-:chartres :path :angers .
-:chartres :path :tours .
-:lemans :path :nantes .
-:paris :path :tours .
-:paris :path :angers .
 :chartres :path :nantes .
+:lemans :path :nantes .
 :paris :path :nantes .

package/examples/output/jsonterm-advanced.n3

@@ -0,0 +1,8 @@
+@prefix ex: <https://example.org/#> .
+
+_:b1 ex:userName "Alice" .
+_:b1 ex:eligibleForReview true .
+_:b1 ex:profileTag "multilingual-dark-profile" .
+_:b1 ex:hasHighValueStarterOrder true .
+_:b1 ex:hasCouponlessFollowup true .
+ex:test ex:is true .

package/examples/output/jsonterm.n3

@@ -0,0 +1,3 @@
+@prefix ex: <https://example.org/#> .
+
+ex:test ex:is true .

package/eyeling.js

@@ -5352,27 +5352,80 @@ function triplesListEqual(xs, ys) {
   return true;
 }
 
-// Alpha-equivalence for quoted formulas, up to *variable* and blank-node renaming.
+function collectProtectedNamesInTerm(t, protectedVars, protectedBlanks) {
+  if (t instanceof Var) {
+    protectedVars.add(t.name);
+    return;
+  }
+  if (t instanceof Blank) {
+    protectedBlanks.add(t.label);
+    return;
+  }
+  if (t instanceof ListTerm) {
+    for (const e of t.elems) collectProtectedNamesInTerm(e, protectedVars, protectedBlanks);
+    return;
+  }
+  if (t instanceof OpenListTerm) {
+    for (const e of t.prefix) collectProtectedNamesInTerm(e, protectedVars, protectedBlanks);
+    protectedVars.add(t.tailVar);
+    return;
+  }
+  if (t instanceof GraphTerm) {
+    for (const tr of t.triples) {
+      collectProtectedNamesInTerm(tr.s, protectedVars, protectedBlanks);
+      collectProtectedNamesInTerm(tr.p, protectedVars, protectedBlanks);
+      collectProtectedNamesInTerm(tr.o, protectedVars, protectedBlanks);
+    }
+  }
+}
+
+function collectProtectedNamesFromSubst(subst) {
+  const protectedVars = new Set();
+  const protectedBlanks = new Set();
+  if (!subst) return { protectedVars, protectedBlanks };
+  for (const k in subst) {
+    if (!Object.prototype.hasOwnProperty.call(subst, k)) continue;
+    collectProtectedNamesInTerm(subst[k], protectedVars, protectedBlanks);
+  }
+  return { protectedVars, protectedBlanks };
+}
+
+// Alpha-equivalence for quoted formulas, up to *local* variable and blank-node renaming.
+// Terms that originate from the surrounding substitution are treated as fixed and are
+// therefore not alpha-renamable inside the quoted formula.
 // Treats a formula as an unordered set of triples (order-insensitive match).
-function alphaEqVarName(x, y, vmap) {
+function alphaEqVarName(x, y, vmap, protectedVarsA, protectedVarsB) {
+  const xProtected = protectedVarsA && protectedVarsA.has(x);
+  const yProtected = protectedVarsB && protectedVarsB.has(y);
+  if (xProtected || yProtected) return xProtected && yProtected && x === y;
   if (Object.prototype.hasOwnProperty.call(vmap, x)) return vmap[x] === y;
   vmap[x] = y;
   return true;
 }
 
-function alphaEqTermInGraph(a, b, vmap, bmap) {
-  // Blank nodes: renamable
+function alphaEqBlankLabel(x, y, bmap, protectedBlanksA, protectedBlanksB) {
+  const xProtected = protectedBlanksA && protectedBlanksA.has(x);
+  const yProtected = protectedBlanksB && protectedBlanksB.has(y);
+  if (xProtected || yProtected) return xProtected && yProtected && x === y;
+  if (Object.prototype.hasOwnProperty.call(bmap, x)) return bmap[x] === y;
+  bmap[x] = y;
+  return true;
+}
+
+function alphaEqTermInGraph(a, b, vmap, bmap, opts) {
+  const protectedVarsA = opts && opts.protectedVarsA;
+  const protectedVarsB = opts && opts.protectedVarsB;
+  const protectedBlanksA = opts && opts.protectedBlanksA;
+  const protectedBlanksB = opts && opts.protectedBlanksB;
+
+  // Blank nodes: renamable only when they are local to the formula.
   if (a instanceof Blank && b instanceof Blank) {
-    const x = a.label;
-    const y = b.label;
-    if (Object.prototype.hasOwnProperty.call(bmap, x)) return bmap[x] === y;
-    bmap[x] = y;
-    return true;
+    return alphaEqBlankLabel(a.label, b.label, bmap, protectedBlanksA, protectedBlanksB);
   }
 
-  // Variables: renamable (ONLY inside quoted formulas)
+  // Variables: renamable only when they are local to the formula.
   if (a instanceof Var && b instanceof Var) {
-    return alphaEqVarName(a.name, b.name, vmap);
+    return alphaEqVarName(a.name, b.name, vmap, protectedVarsA, protectedVarsB);
   }
 
   if (a instanceof Iri && b instanceof Iri) return a.value === b.value;
@@ -5381,7 +5434,7 @@ function alphaEqTermInGraph(a, b, vmap, bmap) {
   if (a instanceof ListTerm && b instanceof ListTerm) {
     if (a.elems.length !== b.elems.length) return false;
     for (let i = 0; i < a.elems.length; i++) {
-      if (!alphaEqTermInGraph(a.elems[i], b.elems[i], vmap, bmap)) return false;
+      if (!alphaEqTermInGraph(a.elems[i], b.elems[i], vmap, bmap, opts)) return false;
     }
     return true;
   }
@@ -5389,29 +5442,30 @@ function alphaEqTermInGraph(a, b, vmap, bmap) {
   if (a instanceof OpenListTerm && b instanceof OpenListTerm) {
     if (a.prefix.length !== b.prefix.length) return false;
     for (let i = 0; i < a.prefix.length; i++) {
-      if (!alphaEqTermInGraph(a.prefix[i], b.prefix[i], vmap, bmap)) return false;
+      if (!alphaEqTermInGraph(a.prefix[i], b.prefix[i], vmap, bmap, opts)) return false;
     }
-    // tailVar is a var-name string, so treat it as renamable too
-    return alphaEqVarName(a.tailVar, b.tailVar, vmap);
+    // tailVar is a var-name string, so treat it as renamable too when local.
+    return alphaEqVarName(a.tailVar, b.tailVar, vmap, protectedVarsA, protectedVarsB);
   }
 
-  // Nested formulas: compare with fresh maps (separate scope)
+  // Nested formulas: compare with fresh maps (separate scope), but keep the same
+  // protected outer names so already-substituted terms stay fixed everywhere.
   if (a instanceof GraphTerm && b instanceof GraphTerm) {
-    return alphaEqGraphTriples(a.triples, b.triples);
+    return alphaEqGraphTriples(a.triples, b.triples, opts);
   }
 
   return false;
 }
 
-function alphaEqTripleInGraph(a, b, vmap, bmap) {
+function alphaEqTripleInGraph(a, b, vmap, bmap, opts) {
   return (
-    alphaEqTermInGraph(a.s, b.s, vmap, bmap) &&
-    alphaEqTermInGraph(a.p, b.p, vmap, bmap) &&
-    alphaEqTermInGraph(a.o, b.o, vmap, bmap)
+    alphaEqTermInGraph(a.s, b.s, vmap, bmap, opts) &&
+    alphaEqTermInGraph(a.p, b.p, vmap, bmap, opts) &&
+    alphaEqTermInGraph(a.o, b.o, vmap, bmap, opts)
   );
 }
 
-function alphaEqGraphTriples(xs, ys) {
+function alphaEqGraphTriples(xs, ys, opts) {
   if (xs.length !== ys.length) return false;
   // Fast path: exact same sequence.
   if (triplesListEqual(xs, ys)) return true;
@@ -5430,7 +5484,7 @@ function alphaEqGraphTriples(xs, ys) {
 
       const v2 = { ...vmap };
       const b2 = { ...bmap };
-      if (!alphaEqTripleInGraph(x, y, v2, b2)) continue;
+      if (!alphaEqTripleInGraph(x, y, v2, b2, opts)) continue;
 
       used[j] = true;
       if (step(i + 1, v2, b2)) return true;
@@ -6149,7 +6203,17 @@ function unifyTermWithOptions(a, b, subst, opts) {
 
   // Graphs
   if (a instanceof GraphTerm && b instanceof GraphTerm) {
-    if (alphaEqGraphTriples(a.triples, b.triples)) return subst;
+    const protectedNames = collectProtectedNamesFromSubst(subst);
+    if (
+      alphaEqGraphTriples(a.triples, b.triples, {
+        protectedVarsA: protectedNames.protectedVars,
+        protectedVarsB: protectedNames.protectedVars,
+        protectedBlanksA: protectedNames.protectedBlanks,
+        protectedBlanksB: protectedNames.protectedBlanks,
+      })
+    ) {
+      return subst;
+    }
     return unifyGraphTriples(a.triples, b.triples, subst);
   }
 
@@ -6521,7 +6585,17 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
 
     // Graphs
     if (a instanceof GraphTerm && b instanceof GraphTerm) {
-      if (alphaEqGraphTriples(a.triples, b.triples)) return true;
+      const protectedNames = collectProtectedNamesFromSubst(substMut);
+      if (
+        alphaEqGraphTriples(a.triples, b.triples, {
+          protectedVarsA: protectedNames.protectedVars,
+          protectedVarsB: protectedNames.protectedVars,
+          protectedBlanksA: protectedNames.protectedBlanks,
+          protectedBlanksB: protectedNames.protectedBlanks,
+        })
+      ) {
+        return true;
+      }
       // Fallback: reuse allocation-heavy graph unifier rarely hit in typical workloads.
       const delta = unifyGraphTriples(a.triples, b.triples, {});
       if (delta === null) return false;

package/lib/engine.js

@@ -736,27 +736,80 @@ function triplesListEqual(xs, ys) {
   return true;
 }
 
-// Alpha-equivalence for quoted formulas, up to *variable* and blank-node renaming.
+function collectProtectedNamesInTerm(t, protectedVars, protectedBlanks) {
+  if (t instanceof Var) {
+    protectedVars.add(t.name);
+    return;
+  }
+  if (t instanceof Blank) {
+    protectedBlanks.add(t.label);
+    return;
+  }
+  if (t instanceof ListTerm) {
+    for (const e of t.elems) collectProtectedNamesInTerm(e, protectedVars, protectedBlanks);
+    return;
+  }
+  if (t instanceof OpenListTerm) {
+    for (const e of t.prefix) collectProtectedNamesInTerm(e, protectedVars, protectedBlanks);
+    protectedVars.add(t.tailVar);
+    return;
+  }
+  if (t instanceof GraphTerm) {
+    for (const tr of t.triples) {
+      collectProtectedNamesInTerm(tr.s, protectedVars, protectedBlanks);
+      collectProtectedNamesInTerm(tr.p, protectedVars, protectedBlanks);
+      collectProtectedNamesInTerm(tr.o, protectedVars, protectedBlanks);
+    }
+  }
+}
+
+function collectProtectedNamesFromSubst(subst) {
+  const protectedVars = new Set();
+  const protectedBlanks = new Set();
+  if (!subst) return { protectedVars, protectedBlanks };
+  for (const k in subst) {
+    if (!Object.prototype.hasOwnProperty.call(subst, k)) continue;
+    collectProtectedNamesInTerm(subst[k], protectedVars, protectedBlanks);
+  }
+  return { protectedVars, protectedBlanks };
+}
+
+// Alpha-equivalence for quoted formulas, up to *local* variable and blank-node renaming.
+// Terms that originate from the surrounding substitution are treated as fixed and are
+// therefore not alpha-renamable inside the quoted formula.
 // Treats a formula as an unordered set of triples (order-insensitive match).
-function alphaEqVarName(x, y, vmap) {
+function alphaEqVarName(x, y, vmap, protectedVarsA, protectedVarsB) {
+  const xProtected = protectedVarsA && protectedVarsA.has(x);
+  const yProtected = protectedVarsB && protectedVarsB.has(y);
+  if (xProtected || yProtected) return xProtected && yProtected && x === y;
   if (Object.prototype.hasOwnProperty.call(vmap, x)) return vmap[x] === y;
   vmap[x] = y;
   return true;
 }
 
-function alphaEqTermInGraph(a, b, vmap, bmap) {
-  // Blank nodes: renamable
+function alphaEqBlankLabel(x, y, bmap, protectedBlanksA, protectedBlanksB) {
+  const xProtected = protectedBlanksA && protectedBlanksA.has(x);
+  const yProtected = protectedBlanksB && protectedBlanksB.has(y);
+  if (xProtected || yProtected) return xProtected && yProtected && x === y;
+  if (Object.prototype.hasOwnProperty.call(bmap, x)) return bmap[x] === y;
+  bmap[x] = y;
+  return true;
+}
+
+function alphaEqTermInGraph(a, b, vmap, bmap, opts) {
+  const protectedVarsA = opts && opts.protectedVarsA;
+  const protectedVarsB = opts && opts.protectedVarsB;
+  const protectedBlanksA = opts && opts.protectedBlanksA;
+  const protectedBlanksB = opts && opts.protectedBlanksB;
+
+  // Blank nodes: renamable only when they are local to the formula.
   if (a instanceof Blank && b instanceof Blank) {
-    const x = a.label;
-    const y = b.label;
-    if (Object.prototype.hasOwnProperty.call(bmap, x)) return bmap[x] === y;
-    bmap[x] = y;
-    return true;
+    return alphaEqBlankLabel(a.label, b.label, bmap, protectedBlanksA, protectedBlanksB);
   }
 
-  // Variables: renamable (ONLY inside quoted formulas)
+  // Variables: renamable only when they are local to the formula.
   if (a instanceof Var && b instanceof Var) {
-    return alphaEqVarName(a.name, b.name, vmap);
+    return alphaEqVarName(a.name, b.name, vmap, protectedVarsA, protectedVarsB);
   }
 
   if (a instanceof Iri && b instanceof Iri) return a.value === b.value;
@@ -765,7 +818,7 @@ function alphaEqTermInGraph(a, b, vmap, bmap) {
   if (a instanceof ListTerm && b instanceof ListTerm) {
     if (a.elems.length !== b.elems.length) return false;
     for (let i = 0; i < a.elems.length; i++) {
-      if (!alphaEqTermInGraph(a.elems[i], b.elems[i], vmap, bmap)) return false;
+      if (!alphaEqTermInGraph(a.elems[i], b.elems[i], vmap, bmap, opts)) return false;
     }
     return true;
   }
@@ -773,29 +826,30 @@ function alphaEqTermInGraph(a, b, vmap, bmap) {
   if (a instanceof OpenListTerm && b instanceof OpenListTerm) {
     if (a.prefix.length !== b.prefix.length) return false;
     for (let i = 0; i < a.prefix.length; i++) {
-      if (!alphaEqTermInGraph(a.prefix[i], b.prefix[i], vmap, bmap)) return false;
+      if (!alphaEqTermInGraph(a.prefix[i], b.prefix[i], vmap, bmap, opts)) return false;
     }
-    // tailVar is a var-name string, so treat it as renamable too
-    return alphaEqVarName(a.tailVar, b.tailVar, vmap);
+    // tailVar is a var-name string, so treat it as renamable too when local.
+    return alphaEqVarName(a.tailVar, b.tailVar, vmap, protectedVarsA, protectedVarsB);
   }
 
-  // Nested formulas: compare with fresh maps (separate scope)
+  // Nested formulas: compare with fresh maps (separate scope), but keep the same
+  // protected outer names so already-substituted terms stay fixed everywhere.
   if (a instanceof GraphTerm && b instanceof GraphTerm) {
-    return alphaEqGraphTriples(a.triples, b.triples);
+    return alphaEqGraphTriples(a.triples, b.triples, opts);
   }
 
   return false;
 }
 
-function alphaEqTripleInGraph(a, b, vmap, bmap) {
+function alphaEqTripleInGraph(a, b, vmap, bmap, opts) {
   return (
-    alphaEqTermInGraph(a.s, b.s, vmap, bmap) &&
-    alphaEqTermInGraph(a.p, b.p, vmap, bmap) &&
-    alphaEqTermInGraph(a.o, b.o, vmap, bmap)
+    alphaEqTermInGraph(a.s, b.s, vmap, bmap, opts) &&
+    alphaEqTermInGraph(a.p, b.p, vmap, bmap, opts) &&
+    alphaEqTermInGraph(a.o, b.o, vmap, bmap, opts)
   );
 }
 
-function alphaEqGraphTriples(xs, ys) {
+function alphaEqGraphTriples(xs, ys, opts) {
   if (xs.length !== ys.length) return false;
   // Fast path: exact same sequence.
   if (triplesListEqual(xs, ys)) return true;
@@ -814,7 +868,7 @@ function alphaEqGraphTriples(xs, ys) {
 
       const v2 = { ...vmap };
       const b2 = { ...bmap };
-      if (!alphaEqTripleInGraph(x, y, v2, b2)) continue;
+      if (!alphaEqTripleInGraph(x, y, v2, b2, opts)) continue;
 
       used[j] = true;
       if (step(i + 1, v2, b2)) return true;
@@ -1533,7 +1587,17 @@ function unifyTermWithOptions(a, b, subst, opts) {
 
   // Graphs
   if (a instanceof GraphTerm && b instanceof GraphTerm) {
-    if (alphaEqGraphTriples(a.triples, b.triples)) return subst;
+    const protectedNames = collectProtectedNamesFromSubst(subst);
+    if (
+      alphaEqGraphTriples(a.triples, b.triples, {
+        protectedVarsA: protectedNames.protectedVars,
+        protectedVarsB: protectedNames.protectedVars,
+        protectedBlanksA: protectedNames.protectedBlanks,
+        protectedBlanksB: protectedNames.protectedBlanks,
+      })
+    ) {
+      return subst;
+    }
     return unifyGraphTriples(a.triples, b.triples, subst);
   }
 
@@ -1905,7 +1969,17 @@ function proveGoals(goals, subst, facts, backRules, depth, visited, varGen, maxR
 
     // Graphs
     if (a instanceof GraphTerm && b instanceof GraphTerm) {
-      if (alphaEqGraphTriples(a.triples, b.triples)) return true;
+      const protectedNames = collectProtectedNamesFromSubst(substMut);
+      if (
+        alphaEqGraphTriples(a.triples, b.triples, {
+          protectedVarsA: protectedNames.protectedVars,
+          protectedVarsB: protectedNames.protectedVars,
+          protectedBlanksA: protectedNames.protectedBlanks,
+          protectedBlanksB: protectedNames.protectedBlanks,
+        })
+      ) {
+        return true;
+      }
       // Fallback: reuse allocation-heavy graph unifier rarely hit in typical workloads.
       const delta = unifyGraphTriples(a.triples, b.triples, {});
       if (delta === null) return false;

package/package.json

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

package/test/api.test.js

@@ -1432,6 +1432,34 @@ ex:w a ex:Woman .
 `,
     expect: [/:(?:test)\s+:(?:is)\s+true\s*\./],
   },
+
+  {
+    name: '59 regression: quoted-formula alpha-equivalence must not rename blanks introduced by outer substitution',
+    opt: { proofComments: false },
+    input: `@prefix : <http://example.org/> .
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
+@prefix math: <http://www.w3.org/2000/10/swap/math#> .
+
+_:x :hates { _:foo :making :mess }.
+
+{
+    ?A :hates { ?A :making :mess }.
+}
+=>
+{
+    ?A :hates :Himself.
+}.
+
+{
+    ?A :hates :Himself.
+}
+=>
+{
+    :test :is false.
+}.
+`,
+    notExpect: [/:(?:test)\s+:(?:is)\s+false\s*\./],
+  },
 ];
 
 let passed = 0;