eyelang 1.1.14 → 1.1.15

package/docs/guide.md

@@ -302,10 +302,10 @@ Use `holds/2` when you want to match the member term directly, for example `name
 
 ## Example catalog
 
-The repository includes examples for recursion, graph reachability, finite search, arithmetic, list processing, optimization, policies, puzzles, and applied scientific calculations. Bundled examples use relation-style output.
+Each example has a checked golden output in `examples/output`.
 
-| Input | Short description | Output |
-| --- | --- | --- |
+| Example | What it demonstrates | Golden output |
+|---|---|---|
 | [`access-control-policy.pl`](../examples/access-control-policy.pl) | Evaluates role and condition based access decisions. | [`output/access-control-policy.pl`](../examples/output/access-control-policy.pl) |
 | [`ackermann.pl`](../examples/ackermann.pl) | Computes Ackermann-style hyperoperation values. | [`output/ackermann.pl`](../examples/output/ackermann.pl) |
 | [`age.pl`](../examples/age.pl) | Checks whether people meet age thresholds. | [`output/age.pl`](../examples/output/age.pl) |
@@ -391,6 +391,8 @@ The repository includes examples for recursion, graph reachability, finite searc
 | [`heron-theorem.pl`](../examples/heron-theorem.pl) | Computes triangle area by Heron's theorem. | [`output/heron-theorem.pl`](../examples/output/heron-theorem.pl) |
 | [`ideal-gas-law.pl`](../examples/ideal-gas-law.pl) | Applies the ideal gas law. | [`output/ideal-gas-law.pl`](../examples/output/ideal-gas-law.pl) |
 | [`illegitimate-reasoning.pl`](../examples/illegitimate-reasoning.pl) | Detects suspect reasoning patterns. | [`output/illegitimate-reasoning.pl`](../examples/output/illegitimate-reasoning.pl) |
+| [`job-shop-scheduling.pl`](../examples/job-shop-scheduling.pl) | Searches a small job-shop schedule and minimizes makespan. | [`output/job-shop-scheduling.pl`](../examples/output/job-shop-scheduling.pl) |
+| [`knapsack-optimization.pl`](../examples/knapsack-optimization.pl) | Optimizes a finite 0/1 knapsack pack with aggregation. | [`output/knapsack-optimization.pl`](../examples/output/knapsack-optimization.pl) |
 | [`knowledge-engineering-alignment-flow.pl`](../examples/knowledge-engineering-alignment-flow.pl) | Specializes reusable alignment rules into a target-shaped flow view. | [`output/knowledge-engineering-alignment-flow.pl`](../examples/output/knowledge-engineering-alignment-flow.pl) |
 | [`law-of-cosines.pl`](../examples/law-of-cosines.pl) | Computes a triangle side by cosine law. | [`output/law-of-cosines.pl`](../examples/output/law-of-cosines.pl) |
 | [`least-squares-regression.pl`](../examples/least-squares-regression.pl) | Fits a least-squares regression line. | [`output/least-squares-regression.pl`](../examples/output/least-squares-regression.pl) |
@@ -399,6 +401,7 @@ The repository includes examples for recursion, graph reachability, finite searc
 | [`manufacturing-quality-control.pl`](../examples/manufacturing-quality-control.pl) | Evaluates process capability and quality. | [`output/manufacturing-quality-control.pl`](../examples/output/manufacturing-quality-control.pl) |
 | [`microgrid-dispatch.pl`](../examples/microgrid-dispatch.pl) | Plans microgrid dispatch and reserve. | [`output/microgrid-dispatch.pl`](../examples/output/microgrid-dispatch.pl) |
 | [`monkey-bananas.pl`](../examples/monkey-bananas.pl) | Solves the monkey-and-bananas puzzle. | [`output/monkey-bananas.pl`](../examples/output/monkey-bananas.pl) |
+| [`n-queens-8.pl`](../examples/n-queens-8.pl) | Solves the 8-queens search problem with diagonal constraints. | [`output/n-queens-8.pl`](../examples/output/n-queens-8.pl) |
 | [`network-sla.pl`](../examples/network-sla.pl) | Checks network path SLA compliance. | [`output/network-sla.pl`](../examples/output/network-sla.pl) |
 | [`newton-raphson.pl`](../examples/newton-raphson.pl) | Finds roots by Newton-Raphson iteration. | [`output/newton-raphson.pl`](../examples/output/newton-raphson.pl) |
 | [`nixon-diamond.pl`](../examples/nixon-diamond.pl) | Reports the classic Nixon-diamond conflict. | [`output/nixon-diamond.pl`](../examples/output/nixon-diamond.pl) |
@@ -418,12 +421,14 @@ The repository includes examples for recursion, graph reachability, finite searc
 | [`reusable-builtins.pl`](../examples/reusable-builtins.pl) | Tours reusable numeric, list, and string builtins. | [`output/reusable-builtins.pl`](../examples/output/reusable-builtins.pl) |
 | [`riemann-hypothesis.pl`](../examples/riemann-hypothesis.pl) | Checks a finite catalogue of non-trivial zeta zeros against the Riemann-hypothesis condition. | [`output/riemann-hypothesis.pl`](../examples/output/riemann-hypothesis.pl) |
 | [`security-incident-correlation.pl`](../examples/security-incident-correlation.pl) | Correlates security incidents across signals. | [`output/security-incident-correlation.pl`](../examples/output/security-incident-correlation.pl) |
+| [`send-more-money.pl`](../examples/send-more-money.pl) | Solves the SEND + MORE = MONEY cryptarithm. | [`output/send-more-money.pl`](../examples/output/send-more-money.pl) |
 | [`service-impact.pl`](../examples/service-impact.pl) | Analyzes service impact over cyclic dependencies. | [`output/service-impact.pl`](../examples/output/service-impact.pl) |
 | [`sieve.pl`](../examples/sieve.pl) | Enumerates primes with a sieve-style program. | [`output/sieve.pl`](../examples/output/sieve.pl) |
 | [`skolem-functions.pl`](../examples/skolem-functions.pl) | Generates deterministic functional terms. | [`output/skolem-functions.pl`](../examples/output/skolem-functions.pl) |
 | [`socket-age.pl`](../examples/socket-age.pl) | Shows socket-declared age reasoning inputs and plugs. | [`output/socket-age.pl`](../examples/output/socket-age.pl) |
 | [`socket-family.pl`](../examples/socket-family.pl) | Shows socket-declared family-source inputs and ancestry rules. | [`output/socket-family.pl`](../examples/output/socket-family.pl) |
 | [`socrates.pl`](../examples/socrates.pl) | Derives that Socrates is mortal. | [`output/socrates.pl`](../examples/output/socrates.pl) |
+| [`stable-marriage.pl`](../examples/stable-marriage.pl) | Finds stable matchings by excluding blocking pairs. | [`output/stable-marriage.pl`](../examples/output/stable-marriage.pl) |
 | [`statistics-summary.pl`](../examples/statistics-summary.pl) | Computes population statistics for a sample. | [`output/statistics-summary.pl`](../examples/output/statistics-summary.pl) |
 | [`superdense-coding.pl`](../examples/superdense-coding.pl) | Models superdense-coding bit transmission. | [`output/superdense-coding.pl`](../examples/output/superdense-coding.pl) |
 | [`term-tools.pl`](../examples/term-tools.pl) | Inspects, builds, renders, and validates terms with reusable term/control builtins. | [`output/term-tools.pl`](../examples/output/term-tools.pl) |

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyelang",
-  "version": "1.1.14",
+  "version": "1.1.15",
   "description": "A small Prolog-syntax-subset logic programming language for rules, goals, answers, and proofs.",
   "type": "module",
   "main": "./index.js",

package/playground.html

@@ -434,135 +434,140 @@
 
   <script type="module">
     const EXAMPLES = [
-  "access-control-policy",
-  "ackermann",
-  "age",
-  "aliases-and-namespaces",
-  "alignment-demo",
-  "allen-interval-calculus",
-  "ancestor",
-  "animal",
-  "annotation",
-  "auroracare",
-  "backward",
-  "basic-monadic",
-  "bayes-diagnosis",
-  "bayes-therapy",
-  "beam-deflection",
-  "blocks-world-planning",
-  "bmi",
-  "braking-safety-worlds",
-  "buck-converter-design",
-  "cache-performance",
-  "canary-release",
-  "cat-koko",
-  "clinical-trial-screening",
-  "collatz-1000",
-  "combinatorics-findall-sort",
-  "competitive-enzyme-kinetics",
-  "complex",
-  "composition-of-injective-functions-is-injective",
-  "context-association",
-  "context-schema-audit",
-  "control-system",
-  "cyclic-path",
-  "d3-group",
-  "dairy-energy-balance",
-  "data-negotiation",
-  "deep-taxonomy-10",
-  "deep-taxonomy-100",
-  "deep-taxonomy-1000",
-  "deep-taxonomy-10000",
-  "deep-taxonomy-100000",
-  "delfour",
-  "deontic-logic",
-  "derived-backward-rule",
-  "derived-rule",
-  "diamond-property",
-  "dijkstra-findall-sort",
-  "dijkstra-risk-path",
-  "dijkstra",
-  "dining-philosophers",
-  "dog",
-  "dpv-odrl-purpose-mapping",
-  "drone-corridor-planner",
-  "easter-computus",
-  "electrical-rc-filter",
-  "epidemic-policy",
-  "equivalence-classes-overlap-implies-same-class",
-  "eulerian-path",
-  "ev-range-worlds",
-  "existential-rule",
-  "exoplanet-validation-worlds",
-  "expression-eval",
-  "family-cousins",
-  "fastpow",
-  "fft8-numeric",
-  "fibonacci",
-  "field-nitrogen-balance",
-  "flandor",
-  "floating-point",
-  "four-color-map",
-  "fundamental-theorem-arithmetic",
-  "gd-step-certified",
-  "gdpr-compliance",
-  "good-cobbler",
-  "gps",
-  "graph-reachability",
-  "gray-code-counter",
-  "greatest-lower-bound-uniqueness",
-  "group-inverse-uniqueness",
-  "hamiltonian-path",
-  "hamming-code",
-  "hanoi",
-  "heat-loss",
-  "heron-theorem",
-  "ideal-gas-law",
-  "illegitimate-reasoning",
-  "knowledge-engineering-alignment-flow",
-  "law-of-cosines",
-  "least-squares-regression",
-  "list-collection",
-  "lldm",
-  "manufacturing-quality-control",
-  "microgrid-dispatch",
-  "monkey-bananas",
-  "network-sla",
-  "newton-raphson",
-  "nixon-diamond",
-  "observability-log-correlation",
-  "odrl-dpv-fpv-trust-flow",
-  "odrl-dpv-healthcare-risk-ranked",
-  "odrl-dpv-risk-ranked",
-  "orbital-transfer-design",
-  "path-discovery",
-  "peano-arithmetic",
-  "peasant",
-  "pendulum-period",
-  "polynomial",
-  "proof-contrapositive",
-  "quadratic-formula",
-  "radioactive-decay",
-  "reusable-builtins",
-  "riemann-hypothesis",
-  "security-incident-correlation",
-  "service-impact",
-  "sieve",
-  "skolem-functions",
-  "socket-age",
-  "socket-family",
-  "socrates",
-  "statistics-summary",
-  "superdense-coding",
-  "term-tools",
-  "trust-flow-provenance-threshold",
-  "turing",
-  "vector-similarity",
-  "vulnerability-impact",
-  "witch",
-  "wolf-goat-cabbage",
-  "zebra"
-];
+      "access-control-policy",
+      "ackermann",
+      "age",
+      "aliases-and-namespaces",
+      "alignment-demo",
+      "allen-interval-calculus",
+      "ancestor",
+      "animal",
+      "annotation",
+      "auroracare",
+      "backward",
+      "basic-monadic",
+      "bayes-diagnosis",
+      "bayes-therapy",
+      "beam-deflection",
+      "blocks-world-planning",
+      "bmi",
+      "braking-safety-worlds",
+      "buck-converter-design",
+      "cache-performance",
+      "canary-release",
+      "cat-koko",
+      "clinical-trial-screening",
+      "collatz-1000",
+      "combinatorics-findall-sort",
+      "competitive-enzyme-kinetics",
+      "complex",
+      "composition-of-injective-functions-is-injective",
+      "context-association",
+      "context-schema-audit",
+      "control-system",
+      "cyclic-path",
+      "d3-group",
+      "dairy-energy-balance",
+      "data-negotiation",
+      "deep-taxonomy-10",
+      "deep-taxonomy-100",
+      "deep-taxonomy-1000",
+      "deep-taxonomy-10000",
+      "deep-taxonomy-100000",
+      "delfour",
+      "deontic-logic",
+      "derived-backward-rule",
+      "derived-rule",
+      "diamond-property",
+      "dijkstra",
+      "dijkstra-findall-sort",
+      "dijkstra-risk-path",
+      "dining-philosophers",
+      "dog",
+      "dpv-odrl-purpose-mapping",
+      "drone-corridor-planner",
+      "easter-computus",
+      "electrical-rc-filter",
+      "epidemic-policy",
+      "equivalence-classes-overlap-implies-same-class",
+      "eulerian-path",
+      "ev-range-worlds",
+      "existential-rule",
+      "exoplanet-validation-worlds",
+      "expression-eval",
+      "family-cousins",
+      "fastpow",
+      "fft8-numeric",
+      "fibonacci",
+      "field-nitrogen-balance",
+      "flandor",
+      "floating-point",
+      "four-color-map",
+      "fundamental-theorem-arithmetic",
+      "gd-step-certified",
+      "gdpr-compliance",
+      "good-cobbler",
+      "gps",
+      "graph-reachability",
+      "gray-code-counter",
+      "greatest-lower-bound-uniqueness",
+      "group-inverse-uniqueness",
+      "hamiltonian-path",
+      "hamming-code",
+      "hanoi",
+      "heat-loss",
+      "heron-theorem",
+      "ideal-gas-law",
+      "illegitimate-reasoning",
+      "job-shop-scheduling",
+      "knapsack-optimization",
+      "knowledge-engineering-alignment-flow",
+      "law-of-cosines",
+      "least-squares-regression",
+      "list-collection",
+      "lldm",
+      "manufacturing-quality-control",
+      "microgrid-dispatch",
+      "monkey-bananas",
+      "n-queens-8",
+      "network-sla",
+      "newton-raphson",
+      "nixon-diamond",
+      "observability-log-correlation",
+      "odrl-dpv-fpv-trust-flow",
+      "odrl-dpv-healthcare-risk-ranked",
+      "odrl-dpv-risk-ranked",
+      "orbital-transfer-design",
+      "path-discovery",
+      "peano-arithmetic",
+      "peasant",
+      "pendulum-period",
+      "polynomial",
+      "proof-contrapositive",
+      "quadratic-formula",
+      "radioactive-decay",
+      "reusable-builtins",
+      "riemann-hypothesis",
+      "security-incident-correlation",
+      "send-more-money",
+      "service-impact",
+      "sieve",
+      "skolem-functions",
+      "socket-age",
+      "socket-family",
+      "socrates",
+      "stable-marriage",
+      "statistics-summary",
+      "superdense-coding",
+      "term-tools",
+      "trust-flow-provenance-threshold",
+      "turing",
+      "vector-similarity",
+      "vulnerability-impact",
+      "witch",
+      "wolf-goat-cabbage",
+      "zebra"
+    ];
     const FALLBACK_SOURCE = `materialize(answer, 1).
 answer(ok) :- eq(ok, ok).
 `;
@@ -1015,11 +1020,13 @@ answer(ok) :- eq(ok, ok).
 
     async function copyShareLink() {
       const link = buildShareLink();
-      if (link == null) {
-        setStatus('This program is too large for a reliable URL. Use “Create Gist share” instead.', true);
+      if (link != null) {
+        await copyText(link, 'Share link copied.');
         return;
       }
-      await copyText(link, 'Share link copied.');
+      await createGistShare({
+        reason: 'This program is too large for an inline URL, so Copy share link will create a Gist share instead.',
+      });
     }
 
     function buildShareLink() {
@@ -1043,12 +1050,16 @@ answer(ok) :- eq(ok, ok).
       return `${basePlaygroundUrl()}#${params.toString()}`;
     }
 
-    async function createGistShare() {
+    async function createGistShare(options = {}) {
       const stateText = JSON.stringify(currentShareState(), null, 2);
-      const token = prompt('Optional GitHub token with gist scope. It is only sent to api.github.com and is not stored. Leave blank to copy Gist-ready state instead.');
-      if (token === null) return;
+      if (options.reason) setStatus(options.reason);
+      const token = prompt(`${options.reason ? `${options.reason}\n\n` : ''}Optional GitHub token with gist scope. It is only sent to api.github.com and is not stored. Leave blank to copy Gist-ready state and open gist.github.com.`);
+      if (token === null) {
+        setStatus('Gist share cancelled.');
+        return;
+      }
       if (!token.trim()) {
-        await copyText(stateText, `Gist-ready state copied. Create a Gist file named ${GIST_STATE_FILENAME}, paste it, then share its raw URL with #state-url=...`);
+        await copyText(stateText, `Gist-ready state copied. Create a Gist file named ${GIST_STATE_FILENAME}, paste it, then copy its raw URL into a playground #state-url link.`);
         window.open('https://gist.github.com/', '_blank', 'noopener');
         return;
       }

package/test/run-regression.mjs

@@ -524,6 +524,17 @@ function whiteBoxCases() {
         assertEqual(termToString(candidates.primary[0].head, new Env(), true), 'edge(a, b)', 'primary head');
       },
     },
+    {
+      name: 'n-queens example keeps diagonal checks memoized',
+      run: () => {
+        const text = fs.readFileSync(path.join(packageRoot, 'examples', 'n-queens-8.pl'), 'utf8');
+        const program = Program.parseSources([{ text, filename: 'n-queens-8.pl' }]);
+        const group = program.findGroup('no_diagonal_attack', 3);
+        assertEqual(Boolean(group), true, 'no_diagonal_attack/3 group exists');
+        assertEqual(group.memoized, true, 'no_diagonal_attack/3 memoized');
+        assertEqual(group.recursive, true, 'no_diagonal_attack/3 recursive');
+      },
+    },
     {
       name: 'collatz example keeps recursive trajectory predicate memoized',
       run: () => {
@@ -684,6 +695,9 @@ function playgroundStaticIssues() {
   if (!html.includes('id="create-gist"') || !html.includes('createGistShare') || !html.includes('GIST_STATE_FILENAME') || !html.includes("fetch('https://api.github.com/gists'")) {
     issues.push('playground must support Gist-backed sharing for large programs');
   }
+  if (!html.includes('await createGistShare({') || html.includes('Use “Create Gist share” instead')) {
+    issues.push('playground Copy share link must automatically fall back to Gist sharing for large programs');
+  }
   if (!html.includes("params.has('state-url')") || !html.includes('#state-url=')) {
     issues.push('playground must restore state from raw Gist state URLs');
   }