eyelang 0.5.0 → 0.5.2

package/examples/book/chapter-23/04-traveler_in_good_standing.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 23.
+% From The Art of Eyelang, Chapter 23.
 traveler_in_good_standing(Person) :-
   registered(Person),
   identity_checked(Person),

package/examples/book/chapter-23/05-connection.pl

@@ -1,2 +1,2 @@
-% From The Art of EyeLang, Chapter 23 — Specializing a relation.
+% From The Art of Eyelang, Chapter 23 — Specializing a relation.
 connection(Mode, From, To, Cost).

package/examples/book/chapter-23/06-rail_connection.pl

@@ -1,3 +1,3 @@
-% From The Art of EyeLang, Chapter 23.
+% From The Art of Eyelang, Chapter 23.
 rail_connection(From, To, Cost) :-
   connection(rail, From, To, Cost).

package/examples/book/chapter-23/07-sum_numbers.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 23 — Accumulators and modes.
+% From The Art of Eyelang, Chapter 23 — Accumulators and modes.
 sum_numbers([], 0).
 sum_numbers([X | Xs], Sum) :-
   sum_numbers(Xs, Rest),

package/examples/book/chapter-23/08-sum_numbers_acc.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 23.
+% From The Art of Eyelang, Chapter 23.
 sum_numbers_acc(List, Sum) :- sum_from(List, 0, Sum).
 
 sum_from([], Accumulator, Accumulator).

package/examples/book/chapter-24/01-simple_path.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 24 — Search over states.
+% From The Art of Eyelang, Chapter 24 — Search over states.
 simple_path(From, To, Path) :-
   walk(From, To, [From], Reversed),
   reverse(Reversed, Path).

package/examples/book/chapter-24/02-reachable.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 24 — Existence, one witness, and all witnesses.
+% From The Art of Eyelang, Chapter 24 — Existence, one witness, and all witnesses.
 reachable(From, To).
 once(simple_path(From, To, Path)).
 findall(Path, simple_path(From, To, Path), Paths).

package/examples/book/chapter-24/03-best_plan.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 24 — Optimization is search plus an order.
+% From The Art of Eyelang, Chapter 24 — Optimization is search plus an order.
 best_plan(Request, Plan, Cost) :-
   aggregate_min(
     [CandidateCost, CandidatePlan],

package/examples/book/chapter-25/01-person.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 25 — Source and concept layers.
+% From The Art of Eyelang, Chapter 25 — Source and concept layers.
 person(ada).
 badge(b17, ada).
 badge_status(b17, active).

package/examples/book/chapter-25/02-active_badge.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 25.
+% From The Art of Eyelang, Chapter 25.
 active_badge(Person, Badge) :-
   badge(Badge, Person),
   badge_status(Badge, active).

package/examples/book/chapter-25/03-in_good_standing.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 25 — Closed-world choice.
+% From The Art of Eyelang, Chapter 25 — Closed-world choice.
 in_good_standing(Person) :-
   person(Person),
   \+ suspended(Person).

package/examples/book/chapter-25/04-incompatible_status.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 25 — Integrity before decisions.
+% From The Art of Eyelang, Chapter 25 — Integrity before decisions.
 incompatible_status(active, revoked).
 incompatible_status(revoked, active).
 

package/examples/book/chapter-26/01-mortal.pl

@@ -1,2 +1,2 @@
-% From The Art of EyeLang, Chapter 26.
+% From The Art of Eyelang, Chapter 26.
 mortal(X) :- human(X).

package/examples/book/chapter-26/02-triple.pl

@@ -1,2 +1,2 @@
-% From The Art of EyeLang, Chapter 26 — Proof objects and proof checking.
+% From The Art of Eyelang, Chapter 26 — Proof objects and proof checking.
 triple(3, 4, 5).

package/examples/book/chapter-26/03-edge.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 26 — The least model as mathematical closure.
+% From The Art of Eyelang, Chapter 26 — The least model as mathematical closure.
 edge(a, b).
 edge(b, c).
 

package/examples/book/chapter-27/01-natural.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 27.
+% From The Art of Eyelang, Chapter 27.
 natural(z).
 natural(s(N)) :- natural(N).
 

package/examples/book/chapter-27/02-list_length.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 27 — Structural induction and data design.
+% From The Art of Eyelang, Chapter 27 — Structural induction and data design.
 list_length([], 0).
 list_length([_ | Tail], N) :-
   list_length(Tail, M),

package/examples/book/chapter-27/03-reverse_acc.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 27 — Accumulators and strengthened invariants.
+% From The Art of Eyelang, Chapter 27 — Accumulators and strengthened invariants.
 reverse_acc(List, Reversed) :-
   reverse_go(List, [], Reversed).
 

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

@@ -1,2 +1,2 @@
-% From The Art of EyeLang, Chapter 28 — Unification is structural equation solving.
+% From The Art of Eyelang, Chapter 28 — Unification is structural equation solving.
 (pair(X, f(Y)) = pair(g(a), f(b))).

package/examples/book/chapter-28/02-triangle.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 28 — Symmetry reduces search.
+% From The Art of Eyelang, Chapter 28 — Symmetry reduces search.
 triangle(A, B, C) :-
   between(1, 20, A),
   between(A, 20, B),

package/examples/book/chapter-28/03-rectangle.pl

@@ -1,2 +1,2 @@
-% From The Art of EyeLang, Chapter 28 — Relations reveal inverse problems.
+% From The Art of Eyelang, Chapter 28 — Relations reveal inverse problems.
 rectangle(W, H, Area) :- (Area is W * H).

package/examples/book/chapter-28/04-preserves_combine.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 28 — Composition, homomorphism, and reusable laws.
+% From The Art of Eyelang, Chapter 28 — Composition, homomorphism, and reusable laws.
 preserves_combine(X, Y) :-
   combine(X, Y, XY),
   image(X, IX),

package/examples/book/chapter-29/01-noncommuting_pair.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 29 — One counterexample has asymmetric power.
+% From The Art of Eyelang, Chapter 29 — One counterexample has asymmetric power.
 noncommuting_pair(A, B) :-
   matrix(A),
   matrix(B),

package/examples/book/chapter-32/01-eligible.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 32 — Follow bindings from left to right.
+% From The Art of Eyelang, Chapter 32 — Follow bindings from left to right.
 eligible(Person) :-
   (Age >= 18),
   age(Person, Age).

package/examples/book/chapter-32/02-eligible-2.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 32.
+% From The Art of Eyelang, Chapter 32.
 eligible(Person) :-
   age(Person, Age),
   (Age >= 18).

package/examples/book/chapter-33/01-assigned_badge.pl

@@ -1,2 +1,2 @@
-% From The Art of EyeLang, Chapter 33 — Pattern 1: Ground sentence first.
+% From The Art of Eyelang, Chapter 33 — Pattern 1: Ground sentence first.
 assigned_badge(alex, badge_17).

package/examples/book/chapter-33/02-source_role.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 33 — Pattern 2: Normalize at the boundary.
+% From The Art of Eyelang, Chapter 33 — Pattern 2: Normalize at the boundary.
 source_role(person_7, "Doctor").
 
 canonical_role(Person, clinician) :-

package/examples/book/chapter-33/03-chosen_pair.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 33 — Pattern 3: Generate, constrain, describe.
+% From The Art of Eyelang, Chapter 33 — Pattern 3: Generate, constrain, describe.
 chosen_pair(pair(X, Y), reason(sum_is_ten)) :-
   between(0, 10, X),
   between(X, 10, Y),

package/examples/book/chapter-33/04-path.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 33 — Pattern 4: Carry the witness.
+% From The Art of Eyelang, Chapter 33 — Pattern 4: Carry the witness.
 path(X, Y, [X, Y]) :- edge(X, Y).
 path(X, Z, [X | Rest]) :-
   edge(X, Y),

package/examples/book/chapter-33/05-unregistered.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 33 — Pattern 5: Bound absence.
+% From The Art of Eyelang, Chapter 33 — Pattern 5: Bound absence.
 unregistered(Person) :-
   person(Person),
   \+ registered(Person).

package/examples/book/chapter-33/06-step.pl

@@ -1,2 +1,2 @@
-% From The Art of EyeLang, Chapter 33 — Pattern 6: Explicit state transition.
+% From The Art of Eyelang, Chapter 33 — Pattern 6: Explicit state transition.
 step(state(Room, outside), enter(Room), state(Room, inside)).

package/examples/book/chapter-33/07-depends.pl

@@ -1,3 +1,3 @@
-% From The Art of EyeLang, Chapter 33 — Pattern 7: Fixed-point closure.
+% From The Art of Eyelang, Chapter 33 — Pattern 7: Fixed-point closure.
 depends(X, Y) :- direct_dependency(X, Y).
 depends(X, Z) :- direct_dependency(X, Y), depends(Y, Z).

package/examples/book/chapter-33/08-within_limit.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 33 — Pattern 8: Proof façade.
+% From The Art of Eyelang, Chapter 33 — Pattern 8: Proof façade.
 within_limit(Device) :-
   reading(Device, Value),
   maximum(Max),

package/examples/book/chapter-33/09-invalid_badge_assignment.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 33 — Pattern 9: Integrity before inference.
+% From The Art of Eyelang, Chapter 33 — Pattern 9: Integrity before inference.
 invalid_badge_assignment(Badge, PersonA, PersonB) :-
   assigned_badge(PersonA, Badge),
   assigned_badge(PersonB, Badge),

package/examples/book/chapter-33/10-theory_version.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 33 — Pattern 10: Version the evidence boundary.
+% From The Art of Eyelang, Chapter 33 — Pattern 10: Version the evidence boundary.
 theory_version("2026-07-24").
 source_snapshot("telemetry-0042").
 numeric_model(ieee_754_double).

package/examples/book/chapter-34/01-travel_status.pl

@@ -1,3 +1,3 @@
-% From The Art of EyeLang, Chapter 34.
+% From The Art of Eyelang, Chapter 34.
 travel_status(From, To, Status) :-
   (route(From, To) -> Status = connected ; Status = disconnected).

package/examples/book/chapter-34/02-require_route.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 34.
+% From The Art of Eyelang, Chapter 34.
 require_route(From, To) :-
   (route(From, To) -> true ; throw(no_route(From, To))).
 

package/examples/book/chapter-34/03-regional_total.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 34.
+% From The Art of Eyelang, Chapter 34.
 regional_total(Region, Total) :-
   bagof(Amount, Seller^sale(Region, Seller, Amount), Amounts),
   sum_amounts(Amounts, Total).

package/examples/book/chapter-35/01-term_shape.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 35.
+% From The Art of Eyelang, Chapter 35.
 term_shape(Term, shape(Name, Arity, Arguments)) :-
   functor(Term, Name, Arity),
   (Term =.. [Name | Arguments]).

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

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 36.
+% From The Art of Eyelang, Chapter 36.
 :- dynamic(task/2).
 
 prepare_queue :-

package/examples/book/chapter-36/02-program-2.pl

@@ -1,2 +1,2 @@
-% From The Art of EyeLang, Chapter 36.
+% From The Art of Eyelang, Chapter 36.
 :- initialization(prepare_queue).

package/examples/book/chapter-36/03-program-3.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 36.
+% From The Art of Eyelang, Chapter 36.
 :- op(600, xfx, reports).
 
 sensor_7 reports temperature.

package/examples/book/chapter-37/01-write_event.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeLang, Chapter 37.
+% From The Art of Eyelang, Chapter 37.
 write_event(Path, Event) :-
   open(Path, write, Stream, [type(text)]),
   write_canonical(Stream, Event),

package/examples/book/chapter-38/01-city.pl

@@ -1,3 +1,3 @@
-% From The Art of EyeLang, Chapter 38.
+% From The Art of Eyelang, Chapter 38.
 city('München').
 message("café").

package/examples/cdcl-sat-solver.pl

@@ -1,7 +1,7 @@
 % A tiny CDCL-style SAT trace with one learned clause.
 %
 % Industrial CDCL solvers use watched literals, mutable trails, non-chronological
-% backjumping, clause databases, restarts, and activity heuristics.  EyeLang has
+% backjumping, clause databases, restarts, and activity heuristics.  Eyelang has
 % no mutable state or destructive trail updates, so this example models one small
 % conflict-analysis episode as relations over immutable terms.
 %
@@ -31,7 +31,7 @@ lit_true(neg(Var), Value_rel) :- call_value(Value_rel, Var, false, _).
 lit_false(pos(Var), Value_rel) :- call_value(Value_rel, Var, false, _).
 lit_false(neg(Var), Value_rel) :- call_value(Value_rel, Var, true, _).
 
-% EyeLang cannot pass predicates as first-class values, so this small dispatcher
+% Eyelang cannot pass predicates as first-class values, so this small dispatcher
 % lets the same literal helpers inspect either the initial or final trail.
 call_value(initial, Var, Value, Reason) :- initial_value(Var, Value, Reason).
 call_value(final, Var, Value, Reason) :- final_value(Var, Value, Reason).

package/examples/collatz-1000.pl

@@ -12,7 +12,7 @@
 
 
 % Program structure: facts set up the scenario, and rules derive the queried conclusions.
-% The N3 source defines repeat/2 recursively; this EyeLang version uses the
+% The N3 source defines repeat/2 recursively; this Eyelang version uses the
 % equivalent bounded generator so the 1000-case regression remains stack-safe.
 
 % Query / query execution of the test suite.

package/examples/equality-saturation.pl

@@ -1,7 +1,7 @@
 % Bounded equality saturation over tiny arithmetic expression terms.
 %
 % Real equality-saturation engines use mutable e-graphs, union-find classes,
-% congruence closure, rewrite scheduling, and cost-based extraction.  EyeLang has
+% congruence closure, rewrite scheduling, and cost-based extraction.  Eyelang has
 % none of those primitives, so this example simulates the idea relationally: it
 % enumerates expressions reachable within a small rewrite-fuel bound, scores the
 % generated terms, and extracts the cheapest equivalent expression.

package/examples/existential-rule.pl

@@ -1,6 +1,6 @@
 % Existential-style introduction with explicit Herbrand witnesses.
 %
-% EyeLang has no blank nodes and no existential variables in rule heads.  A
+% Eyelang has no blank nodes and no existential variables in rule heads.  A
 % rule can still express the practical executable shape of an existential
 % consequence by putting a named functional term directly in the head.
 

package/examples/herbrand-semantics.pl

@@ -7,7 +7,7 @@
 
 
 % Under unrestricted Tarskian semantics, alice and bob could denote the same
-% element. In EyeLang's Herbrand universe, their different syntax is enough.
+% element. In Eyelang's Herbrand universe, their different syntax is enough.
 different(alice, bob) :-
   (alice \= bob).
 

package/examples/herbrand-witnesses.pl

@@ -1,6 +1,6 @@
 % Existential-style consequences as explicit Herbrand witness terms.
 %
-% EyeLang has no blank nodes and no existential variables in rule heads.  The
+% Eyelang has no blank nodes and no existential variables in rule heads.  The
 % practical executable form is to put a named functional term directly in the
 % rule head.  The term is ordinary data: stable, visible, and proof-friendly.
 

package/examples/iso-integer-arithmetic.pl

@@ -1,6 +1,6 @@
 % ISO integer division, remainders, shifts, and bit operations.
 %
-% In EyeLang's supported profile, div and // both truncate the quotient toward
+% In Eyelang's supported profile, div and // both truncate the quotient toward
 % zero. mod normalizes by a positive divisor while rem keeps the dividend sign.
 %% goal: report(X0, X1)
 

package/examples/knowledge-engineering-alignment-flow.pl

@@ -1,4 +1,4 @@
-% Knowledge-engineering alignment flow in EyeLang.
+% Knowledge-engineering alignment flow in Eyelang.
 %
 % The source graph uses local observation predicates.  The mapping facts below
 % align those local names with small SOSA-like and FPV-like vocabulary atoms, then

package/examples/language.pl

@@ -1,6 +1,6 @@
-% EyeLang language-identity example.
+% Eyelang language-identity example.
 %
-% This file intentionally uses the modern EyeLang surface syntax:
+% This file intentionally uses the modern Eyelang surface syntax:
 %   - `.pl` source files instead of Prolog `.pl` files
 %   - ISO Prolog-style uppercase variables
 %   - automatic tabling for recursive predicates

package/examples/law-of-cosines.pl

@@ -1,7 +1,7 @@
 % Law of cosines: c^2 = a^2 + b^2 - 2ab cos(C).
 %
 % This pure-geometry example keeps trigonometry outside the language by storing
-% cos(C) as data.  EyeLang then performs the algebraic part of the theorem with
+% cos(C) as data.  Eyelang then performs the algebraic part of the theorem with
 % ordinary arithmetic predicates and querys both c^2 and c.
 %
 % The 60-degree sample uses cos(C) = 0.5, so the proof shows each intermediate

package/examples/linear-logic-resources.pl

@@ -1,6 +1,6 @@
 % Linear logic emulation with explicit consumable resources.
 %
-% EyeLang predicates are reusable Horn clauses, so this example represents the
+% Eyelang predicates are reusable Horn clauses, so this example represents the
 % linear part explicitly as a multiset-like state list.  A rule consumes its
 % input resources with select/3 and produces a new state.  If a resource is not
 % present, the step fails, which models the “use exactly once” discipline of

package/examples/markov-logic-network.pl

@@ -1,6 +1,6 @@
 % Markov Logic Network style scoring over a tiny finite domain.
 %
-% EyeLang is deterministic, so this is not a probabilistic MLN engine.  The
+% Eyelang is deterministic, so this is not a probabilistic MLN engine.  The
 % example encodes the usual MLN MAP idea explicitly: enumerate possible worlds,
 % mark which weighted soft formulas each world satisfies, sum the weights, and
 % choose the highest-scoring world.  Weights are stored as integer tenths of a

package/examples/matrix-noncommutativity.pl

@@ -1,7 +1,7 @@
 % Matrix multiplication and non-commutativity.
 %
 % The original matrix example contains a larger matrix library.  This compact
-% EyeLang case keeps the core operation visible: multiply two 2x2 matrices and
+% Eyelang case keeps the core operation visible: multiply two 2x2 matrices and
 % show that, in general, A*B is not the same matrix as B*A.
 
 %% goal: matrix_result(X0, X1)

package/examples/partial-evaluator.pl

@@ -1,7 +1,7 @@
 % A tiny partial evaluator for expression terms.
 %
 % Real partial evaluation can specialize interpreters, control unfolding, avoid
-% code explosion, and even approach self-application.  This bounded EyeLang
+% code explosion, and even approach self-application.  This bounded Eyelang
 % version specializes a miniature expression language with known static inputs:
 % constants are folded, known variables are substituted, and dynamic variables
 % remain as residual code.

package/examples/peano-calculus.pl

@@ -1,7 +1,7 @@
 % Peano addition, multiplication, and factorial over explicit Herbrand terms.
 %
 % The original logic-programming example uses `0` and `s(...)`.  Here zero is
-% the atom `z`, so every natural number is an ordinary EyeLang term: z, s(z),
+% the atom `z`, so every natural number is an ordinary Eyelang term: z, s(z),
 % s(s(z)), and so on.  The rules are relational; the query answers choose
 % a few finite calculations as readable examples.
 

package/examples/prime-range.pl

@@ -1,7 +1,7 @@
 % Prime ranges and Euler totient over finite integer domains.
 %
 % The source example combines prime search with Euler's totient function.  This
-% EyeLang version keeps the computation finite and declarative: composite
+% Eyelang version keeps the computation finite and declarative: composite
 % numbers are described by proper divisors, primes are candidates that are not
 % composite, and `totient/2` counts numbers coprime with the input.
 

package/examples/register-allocation.pl

@@ -1,7 +1,7 @@
 % Register allocation as bounded graph coloring with spilling.
 %
 % Production allocators combine liveness analysis, interference graphs, register
-% classes, coalescing, requery execution, and spill-code insertion.  This EyeLang
+% classes, coalescing, requery execution, and spill-code insertion.  This Eyelang
 % example reduces the problem to its logical core: enumerate assignments of a
 % few temporaries to two registers or memory, reject register conflicts, and use
 % aggregate_min/5 to choose the cheapest spill plan.

package/examples/route-planning.pl

@@ -1,6 +1,6 @@
 % Route planning with explicit route terms.
 %
-% This is the EyeLang version of the classic Paris-to-Nantes path example: the
+% This is the Eyelang version of the classic Paris-to-Nantes path example: the
 % facts describe one-way road links, and `path/2` derives both the endpoint pair
 % and a structured `go(..., ..., ...)` plan.  The plan is ordinary data, so the
 % route can be inspected, stored, or used by later rules.

package/examples/sat-solver-dpll.pl

@@ -1,6 +1,6 @@
 % DPLL-style SAT solving for a small CNF formula.
 %
-% The example keeps the solver itself in EyeLang.  It recursively assigns
+% The example keeps the solver itself in Eyelang.  It recursively assigns
 % variables in a fixed order, prunes a branch as soon as any clause is already
 % impossible, and accepts a complete assignment when every clause is satisfied.
 % aggregate_min/5 is then used only to choose one canonical satisfying model.

package/examples/symbolic-derivative.pl

@@ -1,7 +1,7 @@
 % Symbolic differentiation over explicit expression terms.
 %
 % The source derivative example uses Prolog operators such as `+`, `*`, `^`, and
-% cut.  EyeLang keeps expressions as ordinary terms: `add/2`, `mul/2`, `pow/2`,
+% cut.  Eyelang keeps expressions as ordinary terms: `add/2`, `mul/2`, `pow/2`,
 % `log/1`, and so on.  The result is intentionally unsimplified so the rule that
 % produced each part remains visible.
 

package/examples/term-tools.pl

@@ -2,7 +2,7 @@
 % structured terms.
 %
 % Each report/2 answer demonstrates one meta-programming operation over ordinary
-% EyeLang terms: functor/3 and arg/3 inspect shape, =../2 can decompose or rebuild
+% Eyelang terms: functor/3 and arg/3 inspect shape, =../2 can decompose or rebuild
 % a compound, term_string/2 renders a term, and forall/2 validates all edge
 % weights.
 %

package/examples/trust-flow-provenance-threshold.pl

@@ -1,4 +1,4 @@
-% Provenance-derived trust-flow thresholding in EyeLang.
+% Provenance-derived trust-flow thresholding in Eyelang.
 %
 % Each message combines publisher trust, signature strength, and transform quality
 % into one confidence score.  Receiver-specific thresholds then classify messages

package/examples/vector-similarity.pl

@@ -4,7 +4,7 @@
 % public cosineSimilarity/2 report then combines those folds as
 % dot(A,B)/(norm(A)*norm(B)) for a named vector pair.
 %
-% The example keeps vectors as ordinary EyeLang lists, so it doubles as a compact
+% The example keeps vectors as ordinary Eyelang lists, so it doubles as a compact
 % demonstration of numeric recursion over list structure.
 
 %% goal: dotProduct(X0, X1)

package/examples/web-names.pl

@@ -1,4 +1,4 @@
-% Web names as first-class EyeLang atoms.
+% Web names as first-class Eyelang atoms.
 %
 % Angle-bracket IRI atoms are ordinary atoms with globally meaningful names.
 % They are self-contained, require no prefix declarations, and can be joined

package/examples/workplace-compliance.pl

@@ -1,6 +1,6 @@
 % Workplace compliance from explicit action facts.
 %
-% The source example generated a large dynamic dataset.  EyeLang keeps the data
+% The source example generated a large dynamic dataset.  Eyelang keeps the data
 % explicit and reproducible: each `does/2` fact records an observed employee
 % action, and the rules classify compliant and non-compliant behaviour.