eyemind 0.1.31 → 0.1.33

package/SPEC.md

@@ -2,7 +2,7 @@
 
 ```text
 Title:      The eyemind Rule Language and Proof Format
-Version:    eyemind 0.1.31
+Version:    eyemind 0.1.33
 Status:     Informational
 Author:     Jos De Roo, KNoWS office of IDLab, Ghent University - imec
 Repository: https://github.com/eyereasoner/eyemind
@@ -22,7 +22,7 @@ command line.
 ## Status of This Memo
 
 This document is not an Internet Standards Track specification. It describes
-the language and formats as implemented by eyemind 0.1.31, for readers who want
+the language and formats as implemented by eyemind 0.1.33, for readers who want
 to write programs, produce or consume proofs and reports, or implement a
 compatible reasoner or checker. Where this document and the implementation
 disagree, that is a defect in one of them.
@@ -820,9 +820,12 @@ forbidden ("strict"), each `'absent'` or `'collected'` step fails C5.
 
 A trusted boundary cannot be proved, but the evidence at hand can refute it.
 The evidence for a goal is: when the goal is a ground primitive, the goal
-itself if it holds; when it is a control, none, and the boundary is left
-undecided; otherwise the program's facts and the goals of the document's
-steps with the same name and arity.
+itself if it holds, and otherwise the recomputed fact that it fails; when it
+is a control, none, and the boundary is left undecided; otherwise the
+program's facts and the goals of the document's steps with the same name and
+arity. A goal of the last kind **has evidence** only when there is at least
+one such fact or step goal; with none, nothing could refute the boundary, and
+it is left undecided.
 
 - An absence `not(G)` is decided when `G` is a single goal, or a ground
   conjunction, whose every goal has evidence. It fails C6 when every goal of
@@ -1052,7 +1055,7 @@ conclusions and proof documents in the canonical text, and checks every proof
 it produces as Section 11 describes. A conforming **checker** implements
 Sections 9, 11 and 12 and does not depend on a reasoner. For the same
 program, a conforming reasoner and checker MUST produce the same
-conclusions, proof documents and reports as eyemind 0.1.31, byte for byte,
+conclusions, proof documents and reports as eyemind 0.1.33, byte for byte,
 except for comments and the `Detail` texts of failures (Section 12), the internal names of
 variables where Section 3 says so, and where the host's floating-point
 library functions (`exp`, `log`, the trigonometric and hyperbolic functions,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyemind",
-  "version": "0.1.31",
+  "version": "0.1.33",
   "description": "A dependency-free JavaScript rule language with forward and backward reasoning and checkable proofs.",
   "type": "module",
   "main": "./src/index.js",

package/src/cli.js

@@ -74,6 +74,12 @@ export function main(argv, io) {
         i++;
         if (i >= argv.length) throw new UsageError(`${arg} needs a value`);
         const value = argv[i];
+        // An option in the value's place means the value was left out, as in
+        // --check-proof --strict-proof proof.js; reading the option as a file
+        // name would only fail later with a puzzling message.
+        if (/^--./.test(value) || ['-p', '-c', '-h'].includes(value)) {
+          throw new UsageError(`${arg} needs a value right after it, not the option ${value}`);
+        }
         if (arg === '--check-proof') {
           proofFile = value;
         } else if (arg === '--goal') {

package/src/proof.js

@@ -552,7 +552,9 @@ function checkBoundaries(program, steps, boundaries, fail) {
   const nextSerial = () => ++serial;
 
   // Each solution of a simple goal that the evidence shows, or null when the
-  // evidence cannot speak for the goal.
+  // evidence cannot speak for the goal. A recomputed primitive always speaks,
+  // even when it fails; a predicate with no fact or step at all does not, so
+  // a boundary over it is left undecided rather than counted as confronted.
   function evidence(goal) {
     if (!isCallable(goal)) return null;
     const goalKey = key(goal);
@@ -567,13 +569,16 @@ function checkBoundaries(program, steps, boundaries, fail) {
       return [];
     }
     if (CONTROL_KEYS.has(goalKey)) return null;
+    let shown;
     if (INSPECTION_KEYS.has(goalKey)) {
-      return program.inspections.get(goalKey).map((entry) => freshTerm(entry.term, `evidence${nextSerial()}`));
+      shown = program.inspections.get(goalKey).map((entry) => freshTerm(entry.term, `evidence${nextSerial()}`));
+    } else {
+      const facts = (program.groups.get(goalKey) || [])
+        .filter((clause) => !clause.body.length && !clause.forward)
+        .map((clause) => freshTerm(clause.head, `evidence${nextSerial()}`));
+      shown = [...facts, ...(stepGoals.get(goalKey) || []).map((item) => freshTerm(item, `evidence${nextSerial()}`))];
     }
-    const facts = (program.groups.get(goalKey) || [])
-      .filter((clause) => !clause.body.length && !clause.forward)
-      .map((clause) => freshTerm(clause.head, `evidence${nextSerial()}`));
-    return [...facts, ...(stepGoals.get(goalKey) || []).map((item) => freshTerm(item, `evidence${nextSerial()}`))];
+    return shown.length ? shown : null;
   }
 
   for (const boundary of boundaries) {

package/src/version.js

@@ -1,2 +1,2 @@
 // The release this checkout is; ./release keeps it in step with package.json.
-export const VERSION = '0.1.31';
+export const VERSION = '0.1.33';