eyeprolog 1.3.95 → 1.3.96

package/examples/book/README.md

@@ -238,12 +238,13 @@ npm run generate
 
 ## Chapter 39: Built-in predicates by programming role
 
-- [01-answer.pl](chapter-39/01-answer.pl) — The EyeProlog library
-- [02-answer-2.pl](chapter-39/02-answer-2.pl)
-- [03-answer-3.pl](chapter-39/03-answer-3.pl)
-- [04-cost.pl](chapter-39/04-cost.pl)
-- [05-message.pl](chapter-39/05-message.pl)
-- [06-task.pl](chapter-39/06-task.pl)
+- [01-program.pl](chapter-39/01-program.pl) — The EyeProlog library
+- [02-answer.pl](chapter-39/02-answer.pl)
+- [03-answer-2.pl](chapter-39/03-answer-2.pl)
+- [04-answer-3.pl](chapter-39/04-answer-3.pl)
+- [05-cost.pl](chapter-39/05-cost.pl)
+- [06-message.pl](chapter-39/06-message.pl)
+- [07-task.pl](chapter-39/07-task.pl)
 
 ## Chapter 40: Running EyeProlog: command line and corpus
 

package/examples/book/chapter-39/01-program.pl

@@ -0,0 +1,4 @@
+% From The Art of EyeProlog, Chapter 39 — The EyeProlog library.
+?- dif(f(X,A),f(Y,B)), ( true ; A = B ).
+   dif(f(X, A), f(Y, B))
+;  A = B, dif(X, Y).

package/examples/book/chapter-39/{01-answer.pl → 02-answer.pl}

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 39 — The EyeProlog library.
+% From The Art of EyeProlog, Chapter 39.
 :- use_module(library(dates)).
 :- use_module(library(between), [between/3]).
 :- use_module(library(random)).

package/package.json

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

package/test/run-regression.mjs

@@ -400,6 +400,20 @@ function regressionCases() {
           'dif/2 residuals are minimal without auxiliary terms');
         assertEqual(residuals.stderr, '', 'dif/2 normalization display stderr');
 
+        const perfection = runCli([], {
+          input:
+            'dif(f(X,A),f(Y,B)), ( true ; A = B ).\n' +
+            ';\n' +
+            'halt.\n',
+        });
+        assertEqual(perfection.status, 0, 'dif/2 branch-local projection status');
+        assertEqual(perfection.stdout,
+          '?-    dif(f(X, A), f(Y, B))\n' +
+          ';  A = B, dif(X, Y).\n' +
+          '?- ',
+          'dif/2 residual projection is re-evaluated after branch-local bindings');
+        assertEqual(perfection.stderr, '', 'dif/2 branch-local projection stderr');
+
         const pendingDifCount = (text) => {
           const solver = new Solver(Program.parse(''), { registry: getEyePrologRegistry() });
           const solutions = solver.solve([parseGoalText(text)], new Env(), 0);

package/the-art-of-eyeprolog.md

@@ -6293,7 +6293,15 @@ answers `Y=1`, `Y=2`, and `Y=3`.
 can still unify. Its residual store is normalized by logical implication:
 symmetric or equivalent constraints share one residual, and a stronger
 constraint removes weaker ones regardless of insertion order. Independent
-disequalities remain separate.
+disequalities remain separate. Residual projection is re-evaluated in each
+solution environment, so a compound disequality is kept intact until later
+bindings make one aligned subterm pair sufficient. For example:
+
+```eyeprolog
+?- dif(f(X,A),f(Y,B)), ( true ; A = B ).
+   dif(f(X, A), f(Y, B))
+;  A = B, dif(X, Y).
+```
 
 <!-- eyeprolog-library-catalog:start -->