eyelang 1.5.2 → 1.5.4

package/examples/pendulum-period.pl

@@ -3,17 +3,20 @@
 % For small oscillations, T = 2*pi*sqrt(length / gravity).  Gravity is chosen
 % as pi^2 m/s^2 so a one-meter pendulum has a period of two seconds.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(period_s, 2).
 materialize(periodError_s, 2).
 materialize(status, 2).
 materialize(reason, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 constant(pi, 3.141592653589793).
 experiment(pendulum1, length_m, 1.0).
 experiment(pendulum1, gravity_m_s2, 9.869604401089358).
 limit(pendulum1, target_period_s, 2.0).
 limit(pendulum1, tolerance_s, 0.01).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 period(Experiment, Period) :-
   experiment(Experiment, length_m, Length),
   experiment(Experiment, gravity_m_s2, Gravity),

package/examples/polynomial.pl

@@ -6,12 +6,14 @@
 % searching a finite complex-integer candidate grid.  The two cases below are
 % the same quartic polynomials used by the Eyelet source.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(polynomial, 2).
 materialize(root, 2).
 materialize(reconstructedPolynomial, 2).
 materialize(reconstructionMatches, 2).
 materialize(allRootsVerified, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 case(real_quartic).
 case(complex_quartic).
 
@@ -32,6 +34,7 @@ known_roots(complex_quartic, [[0, 1], [1, 1], [3, 2], [5, 1]]).
 
 c_zero([0, 0]).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 c_add([A, B], [C, D], [E, F]) :-
   add(A, C, E),
   add(B, D, F).

package/examples/project-portfolio-optimization.pl

@@ -5,6 +5,7 @@
 % accumulate, then use aggregate builtins to select useful optima without
 % building and sorting a large bag of candidate portfolios.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(bestPortfolio, 2).
 materialize(lowRiskTarget, 2).
 materialize(feasibleCount, 2).
@@ -12,6 +13,7 @@ materialize(projectCount, 2).
 materialize(totalAvailableValue, 2).
 materialize(note, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 budget(portfolio2026, 75).
 riskCap(portfolio2026, 28).
 targetValue(portfolio2026, 125).
@@ -31,6 +33,7 @@ allProjectData([
   p(security, 25, 16, 7)
 ]).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 project(Name, Value, Cost, Risk) :-
   allProjectData(Projects),
   member(p(Name, Value, Cost, Risk), Projects).

package/examples/proof-contrapositive.pl

@@ -3,13 +3,16 @@
 % The implication itself is represented as data with implies/2.  The proof
 % rule remains ordinary eyelang: if A implies B and B is false, then A is false.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(refutes, 2).
 materialize(method, 2).
 materialize(reason, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 implies(raining, wet_ground).
 false(wet_ground).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 false(A) :-
   implies(A, B),
   false(B).

package/examples/quadratic-formula.pl

@@ -3,12 +3,15 @@
 % Each equation is represented as a*x^2 + b*x + c = 0.  The example uses
 % eyelang arithmetic predicates to derive the discriminant and the two roots.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(discriminant, 2).
 materialize(root, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 equation(eq1, 1.0, -5.0, 6.0).
 equation(eq2, 2.0, -4.0, -6.0).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 discriminant(Case, D) :-
   equation(Case, A, B, C),
   pow(B, 2.0, B2),

package/examples/quine-mccluskey.pl

@@ -1,11 +1,13 @@
 % Eyelet-inspired Quine-McCluskey minimization using findall/3 and sort/2.
 % Problem: f(A,B,C,D) = Sigma m(1,3,7,11,15) + d(0,2,5).
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(primeImplicants, 2).
 materialize(minimalCover, 2).
 materialize(equation, 2).
 materialize(reason, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 minterm(1).
 minterm(3).
 minterm(7).
@@ -33,6 +35,7 @@ bits(13, [1, 1, 0, 1]).
 bits(14, [1, 1, 1, 0]).
 bits(15, [1, 1, 1, 1]).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 initial_pattern(P) :- minterm(M), bits(M, P).
 initial_pattern(P) :- dont_care(D), bits(D, P).
 

package/examples/radioactive-decay.pl

@@ -2,17 +2,20 @@
 %
 % Activity remaining after elapsed time is initial_activity * 0.5^(t/half_life).
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(halfLivesElapsed, 2).
 materialize(remainingActivity_Bq, 2).
 materialize(decayedActivity_Bq, 2).
 materialize(status, 2).
 materialize(reason, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 sample(iodine_sample, initial_activity_bq, 80.0).
 sample(iodine_sample, half_life_h, 8.0).
 sample(iodine_sample, elapsed_h, 16.0).
 threshold(iodine_sample, low_activity_bq, 25.0).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 half_lives(Sample, Count) :-
   sample(Sample, elapsed_h, Elapsed),
   sample(Sample, half_life_h, HalfLife),

package/examples/sat-dpll.pl

@@ -5,6 +5,7 @@
 % larger instance has eight variables and twelve clauses, so it is still small
 % enough for full model collection but no longer a toy four-variable search.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(status, 2).
 materialize(witness, 2).
 materialize(modelCount, 2).
@@ -12,6 +13,7 @@ materialize(variableCount, 2).
 materialize(clauseCount, 2).
 materialize(reason, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 problem(sat_instance,
   [a, b, c, d, e, f, g, h],
   [
@@ -33,6 +35,7 @@ truth(false).
 truth(true).
 
 assignment([], []).
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 assignment([Var|Vars], [value(Var, Truth)|Rest]) :-
   truth(Truth),
   assignment(Vars, Rest).

package/examples/security-incident-correlation.pl

@@ -3,10 +3,12 @@
 % The rules correlate endpoint, identity, vulnerability, and threat-intelligence
 % signals into an escalation decision with concise reason relations.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(type, 2).
 materialize(status, 2).
 materialize(reason, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 incident(inc42).
 incident(inc43).
 
@@ -30,6 +32,7 @@ alert(inc43, outbound_ip, ip_198_51_100_42).
 vulnerability(endpoint23, cve_critical_rce).
 threat_intel(ip_203_0_113_17, command_and_control).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 critical_asset(Endpoint) :-
   asset(Endpoint, criticality, high).
 

package/examples/service-impact.pl

@@ -3,10 +3,12 @@
 % fraud_service, fraud_service calls risk_rules, and risk_rules calls payment_service
 % for authorization data. A payment outage should still produce a finite impact set.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(impactedByFailureOf, 2).
 materialize(status, 2).
 materialize(businessFunctionAtRisk, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 depends_on(web_store, checkout_api).
 depends_on(mobile_app, checkout_api).
 depends_on(checkout_api, payment_service).
@@ -25,6 +27,7 @@ business_function(show_stock, inventory_service).
 
 failed(payment_service).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 impacted(Service, Failed) :- depends_on(Service, Failed).
 impacted(Service, Failed) :- depends_on(Service, Dependency), impacted(Dependency, Failed).
 

package/examples/sieve.pl

@@ -4,10 +4,13 @@
 % eyelang uses the built-in smallest_divisor_from/3 relation to keep the
 % example fast while preserving the same generated prime list.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(primes, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 want_primes(1000).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 prime_under(Limit, P) :-
   between(2, Limit, P),
   smallest_divisor_from(P, 2, P).

package/examples/skolem-functions.pl

@@ -4,6 +4,7 @@
 % function symbol whose arguments contain the values that make the resource
 % unique, such as skolem_observation(Patient, Test).
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(type, 2).
 materialize(patient, 2).
 materialize(test, 2).
@@ -12,10 +13,12 @@ materialize(about, 2).
 materialize(sameInputsSameId, 2).
 materialize(noObservationClash, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 test_result(alice, glucose, 6.8).
 test_result(alice, cholesterol, 4.2).
 test_result(bob, glucose, 5.1).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 high_glucose(Patient) :-
   test_result(Patient, glucose, Value),
   gt(Value, 6.0).

package/examples/socket-age.pl

@@ -14,8 +14,10 @@
 % Run:
 %   eyelang socket-age.pl
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(ageAbove, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 socket(patient_registry, provides(birthDay_2)).
 socket(policy_source, provides(duration_2)).
 socket(clock_source, provides(today_1)).
@@ -28,6 +30,7 @@ birthDay(patH, "1944-08-21").
 duration(check, "P80Y").
 today("2026-05-30").
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 ageAbove(S, A) :-
     birthDay(S, B),
     duration(check, A),

package/examples/socket-family.pl

@@ -9,14 +9,17 @@
 % Run:
 %   eyelang socket-family.pl
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(ancestor, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 socket(family_source, provides(parent_2)).
 plug(family_file, family_source).
 
 parent(pat, jan).
 parent(jan, emma).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 ancestor(X, Y) :-
     parent(X, Y).
 

package/examples/socrates.pl

@@ -3,11 +3,14 @@
 % Eyelet uses type('Socrates', 'Man') and a single rule deriving Mortal.
 % eyelang keeps the same reasoning shape and emits relation facts.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(type, 2).
 materialize(is, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 type(socrates, man).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 type(X, mortal) :-
   type(X, man).
 

package/examples/statistics-summary.pl

@@ -3,14 +3,17 @@
 % The sample is the textbook data set [2,4,4,4,5,5,7,9], whose population
 % mean is 5, variance is 4, and standard deviation is 2.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(count, 2).
 materialize(mean, 2).
 materialize(populationVariance, 2).
 materialize(populationStddev, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 sample(scores, [2.0, 4.0, 4.0, 4.0, 5.0, 5.0, 7.0, 9.0]).
 
 sum([], 0.0).
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 sum([X|Xs], Total) :-
   sum(Xs, Rest),
   add(X, Rest, Total).

package/examples/sudoku.pl

@@ -4,14 +4,17 @@
 % 0, dot, or underscore marks a blank. The builtin also accepts a 9x9 list
 % of integers in the same representation.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(solution, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 puzzle(classic,
   "100007090030129008009600500005300900010080002600794000350408219240005867897201304").
 
 puzzle(third,
   "078200000005000400100400092000035070007000500050810000720004008009000300000006910").
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 solution(Name, Rows) :-
   puzzle(Name, Grid),
   sudoku(Grid, Rows).

package/examples/superdense-coding.pl

@@ -7,10 +7,12 @@
 % with a single support path after the interference choices are expanded.
 
 % |R) = |0, 0) + |1, 1)
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(decodesAs, 2).
 materialize(preservesMessage, 2).
 materialize(cancelsCrossTalk, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 r(false, false).
 r(true, true).
 
@@ -28,6 +30,7 @@ k(true, false).
 k(true, true).
 
 % KG and GK compositions.
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 kg(X, Y) :-
   g(X, Z),
   k(Z, Y).

package/examples/traveling-salesman.pl

@@ -1,8 +1,11 @@
 % Traveling salesman problem, adapted from Eyelet input/traveling-salesman.pl.
 % The optimal tour matches Eyelet output-swipl/traveling-salesman.pl.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(optimalTour, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
+% The target list fixes the city set; weighted_hamiltonian_path/4 searches tours.
 target_cities([aaa, bbb, ccc, ddd, eee, fff, ggg]).
 
 distance(aaa, bbb, 10).
@@ -22,6 +25,8 @@ distance(ddd, fff, 35).
 distance(ddd, ggg, 5).
 distance(eee, fff, 20).
 
+% Distances are stored once; distance2/3 makes the graph undirected.
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 distance2(A, B, D) :-
   distance(A, B, D).
 distance2(A, B, D) :-
@@ -41,6 +46,7 @@ total_distance([X, Y|Tail], D) :-
 tsp(Cities, Tour, Distance) :-
   weighted_hamiltonian_path(distance, Cities, Tour, Distance).
 
+% Materialized output keeps only the minimum-distance candidate.
 optimalTour(Cities, Optimal) :-
   target_cities(Cities),
   findall([T, D], tsp(Cities, T, D), Solutions),

package/examples/turing.pl

@@ -3,10 +3,13 @@
 % The machine below adds 1 to a binary number represented as a list of bits.
 % The blank tape symbol is #.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(input, 2).
 materialize(output, 2).
 materialize(addsOne, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 compute([], OutTape) :-
   start(_Machine, I),
   find(I, [], #, [], OutTape).

package/examples/vector-similarity.pl

@@ -1,14 +1,19 @@
 % Vector dot product, Euclidean norm, and cosine similarity.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(dotProduct, 2).
 materialize(normA, 2).
 materialize(normB, 2).
 materialize(cosineSimilarity, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
+% Two named vectors form the single cosine-similarity case.
 vector(pair1, a, [1.0, 2.0, 3.0]).
 vector(pair1, b, [4.0, -5.0, 6.0]).
 
+% Recursive list folds compute dot products and sums of squares.
 dot([], [], 0.0).
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 dot([A|As], [B|Bs], Dot) :-
   mul(A, B, Product),
   dot(As, Bs, Rest),
@@ -24,6 +29,7 @@ norm(Vector, Norm) :-
   sum_squares(Vector, SumSquares),
   pow(SumSquares, 0.5, Norm).
 
+% cosine = dot(A,B) / (norm(A) * norm(B)).
 cosine_similarity(Case, Similarity) :-
   vector(Case, a, A),
   vector(Case, b, B),

package/examples/witch.pl

@@ -5,12 +5,15 @@
 % things that float are made of wood; things made of wood burn; and a woman
 % who burns is a witch.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(floats, 1).
 materialize(madeOfWood, 1).
 materialize(burns, 1).
 materialize(witch, 1).
 materialize(is, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 witch(X) :-
   burns(X),
   woman(X).

package/examples/wolf-goat-cabbage.pl

@@ -5,11 +5,14 @@
 % bank w or east bank e.  The recursive search keeps a visited list so eyelang
 % explores the finite state space without looping.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(solution, 2).
 materialize(solved, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
 memoize(solve, 4).
 
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 solution(Moves) :-
   solve([w, w, w, w], [e, e, e, e], [[w, w, w, w]], Moves),
   length(Moves, 7).

package/examples/zebra.pl

@@ -4,10 +4,13 @@
 % Cigarette).  The answer is the classic one: the Norwegian drinks water and the
 % Japanese owns the zebra.
 
+% Output declarations: materialize/2 selects the relations written to this example's golden output.
 materialize(waterDrinker, 2).
 materialize(zebraOwner, 2).
 materialize(solved, 2).
 
+% Program structure: facts set up the scenario, and rules derive the materialized conclusions.
+% Derivation rules: each rule below contributes one logical step toward the displayed results.
 zebra(WaterDrinker, ZebraOwner) :-
   eq(Houses, [_, _, _, _, _]),
   first(Houses, house(_, norwegian, _, _, _)),

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyelang",
-  "version": "1.5.2",
+  "version": "1.5.4",
   "type": "module",
   "description": "A small rule engine for Prolog-style Horn clauses",
   "keywords": [

package/playground.html

@@ -432,6 +432,7 @@
   "ancestor",
   "animal",
   "annotation",
+  "auroracare",
   "backward",
   "basic-monadic",
   "bayes-diagnosis",
@@ -491,6 +492,7 @@
   "fibonacci",
   "field-nitrogen-balance",
   "floating-point",
+  "flandor",
   "four-color-map",
   "fundamental-theorem-arithmetic",
   "gcd-bezout-identity",