eyeprolog 1.6.34 → 1.6.35

package/examples/book/README.md

@@ -22,26 +22,23 @@ node tools/extract-book-examples.mjs
 
 - [01-same_shape.pl](chapter-02/01-same_shape.pl) — Unification
 - [02-measurement.pl](chapter-02/02-measurement.pl)
-- [03-label.pl](chapter-02/03-label.pl)
 
 ## Chapter 3: Rules and their two readings
 
 - [01-eligible.pl](chapter-03/01-eligible.pl)
-- [02-adult.pl](chapter-03/02-adult.pl)
-- [03-can_enter.pl](chapter-03/03-can_enter.pl)
-- [04-high_score.pl](chapter-03/04-high_score.pl)
-- [05-parent.pl](chapter-03/05-parent.pl) — The Herbrand world
-- [06-ancestor.pl](chapter-03/06-ancestor.pl)
-- [07-different.pl](chapter-03/07-different.pl) — Why terms denote themselves
-- [08-has_parent.pl](chapter-03/08-has_parent.pl) — Quantification and visible witnesses
-- [09-program.pl](chapter-03/09-program.pl) — Equality, unification, and the occurs check
-- [10-closed.pl](chapter-03/10-closed.pl) — Meaning is not the search strategy
-- [11-p.pl](chapter-03/11-p.pl)
+- [02-can_enter.pl](chapter-03/02-can_enter.pl)
+- [03-high_score.pl](chapter-03/03-high_score.pl)
+- [04-ancestor.pl](chapter-03/04-ancestor.pl) — Deeper foundations: the Herbrand world
+- [05-different.pl](chapter-03/05-different.pl) — Terms denote themselves
+- [06-has_parent.pl](chapter-03/06-has_parent.pl) — Witnesses instead of hidden objects
+- [07-program.pl](chapter-03/07-program.pl) — The occurs check
+- [08-closed.pl](chapter-03/08-closed.pl) — Meaning is not the search strategy
+- [09-p.pl](chapter-03/09-p.pl)
 
 ## Chapter 4: Recursion: describing reachability
 
 - [01-ancestor.pl](chapter-04/01-ancestor.pl)
-- [02-path.pl](chapter-04/02-path.pl) — Constructing the recursive argument
+- [02-path.pl](chapter-04/02-path.pl) — Cycles and tabling
 
 ## Chapter 5: Lists as relations
 
@@ -58,8 +55,8 @@ node tools/extract-book-examples.mjs
 ## Chapter 7: Failure, negation, and quantification
 
 - [01-allowed.pl](chapter-07/01-allowed.pl)
-- [02-move.pl](chapter-07/02-move.pl)
-- [03-all_tests_pass.pl](chapter-07/03-all_tests_pass.pl)
+- [02-all_tests_pass.pl](chapter-07/02-all_tests_pass.pl)
+- [03-move.pl](chapter-07/03-move.pl) — Negation through recursion
 
 ## Chapter 8: Collecting and choosing answers
 
@@ -76,14 +73,13 @@ node tools/extract-book-examples.mjs
 - [01-color.pl](chapter-10/01-color.pl)
 - [02-plan.pl](chapter-10/02-plan.pl)
 
-## Chapter 11: Queries, answers, and proofs
-
-- [01-type.pl](chapter-11/01-type.pl)
-
 ## Chapter 12: Integrity checks as ordinary predicates
 
 - [01-invalid_probability.pl](chapter-12/01-invalid_probability.pl)
-- [02-invalid_assignment.pl](chapter-12/02-invalid_assignment.pl)
+
+## Chapter 13: Termination, tabling, and performance
+
+- [01-reach.pl](chapter-13/01-reach.pl)
 
 ## Chapter 14: Knowledge engineering
 
@@ -92,46 +88,45 @@ node tools/extract-book-examples.mjs
 ## Chapter 17: Logic and control
 
 - [01-path.pl](chapter-17/01-path.pl)
-- [02-adult.pl](chapter-17/02-adult.pl) — The same relation, a different computation
+- [02-adult.pl](chapter-17/02-adult.pl) — Same meaning, different computation
 - [03-bad_member.pl](chapter-17/03-bad_member.pl)
 - [04-item.pl](chapter-17/04-item.pl)
 
 ## Chapter 18: Constructing a program
 
-- [01-routeable.pl](chapter-18/01-routeable.pl) — Begin with ground sentences
+- [01-routeable.pl](chapter-18/01-routeable.pl) — Begin with a ground sentence
 - [02-routeable-2.pl](chapter-18/02-routeable-2.pl)
-- [03-prefix.pl](chapter-18/03-prefix.pl) — Invent examples before recursion
-- [04-candidate_pair.pl](chapter-18/04-candidate_pair.pl) — Separate generate, test, and describe
-- [05-compatible_pair.pl](chapter-18/05-compatible_pair.pl)
+- [03-prefix.pl](chapter-18/03-prefix.pl) — Examples before recursion
+- [04-candidate_pair.pl](chapter-18/04-candidate_pair.pl) — Generate, then test
 
 ## Chapter 19: Correctness and termination
 
-- [01-factorial.pl](chapter-19/01-factorial.pl) — Termination needs its own argument
-- [02-invalid_limits.pl](chapter-19/02-invalid_limits.pl) — Integrity is not merely failure
+- [01-factorial.pl](chapter-19/01-factorial.pl) — Termination needs its own measure
+- [02-invalid_limits.pl](chapter-19/02-invalid_limits.pl) — Integrity is not failure
 
 ## Chapter 20: Improving a program
 
-- [01-connected.pl](chapter-20/01-connected.pl) — Strengthen calls before adding machinery
-- [02-within_thermal_limits.pl](chapter-20/02-within_thermal_limits.pl) — Introduce helpers that express invariants
-- [03-search.pl](chapter-20/03-search.pl) — Move invariant work outward
+- [01-connected.pl](chapter-20/01-connected.pl) — Ask a better question first
+- [02-within_thermal_limits.pl](chapter-20/02-within_thermal_limits.pl) — Name invariants with helpers
+- [03-search.pl](chapter-20/03-search.pl) — Hoist invariant work
 
 ## Chapter 21: Reading the computation
 
 - [01-parent.pl](chapter-21/01-parent.pl)
-- [02-grandparent.pl](chapter-21/02-grandparent.pl) — Substitutions accumulate
+- [02-grandparent.pl](chapter-21/02-grandparent.pl) — Bindings flow forward
 - [03-loop_edge.pl](chapter-21/03-loop_edge.pl)
 - [04-eligible.pl](chapter-21/04-eligible.pl) — Failure rewinds choices, not facts
-- [05-grows.pl](chapter-21/05-grows.pl) — Variants, cycles, and tables
+- [05-grows.pl](chapter-21/05-grows.pl) — Variants and tables
 
 ## Chapter 22: Trees, languages, and symbolic evaluation
 
 - [01-tree.pl](chapter-22/01-tree.pl)
 - [02-tree_member.pl](chapter-22/02-tree_member.pl)
-- [03-mirror.pl](chapter-22/03-mirror.pl) — Transforming a tree
-- [04-sentence.pl](chapter-22/04-sentence.pl) — A standard definite clause grammar
-- [05-evaluate.pl](chapter-22/05-evaluate.pl) — Interpreting an expression
+- [03-mirror.pl](chapter-22/03-mirror.pl) — Relating two trees
+- [04-sentence.pl](chapter-22/04-sentence.pl) — A definite clause grammar
+- [05-evaluate.pl](chapter-22/05-evaluate.pl) — An evaluator
 - [06-lookup.pl](chapter-22/06-lookup.pl)
-- [07-simplify.pl](chapter-22/07-simplify.pl) — Rewriting symbolic expressions
+- [07-simplify.pl](chapter-22/07-simplify.pl) — Rewriting
 
 ## Chapter 23: Transforming programs
 
@@ -139,81 +134,71 @@ node tools/extract-book-examples.mjs
 - [02-adult-2.pl](chapter-23/02-adult-2.pl)
 - [03-can_board.pl](chapter-23/03-can_board.pl)
 - [04-traveler_in_good_standing.pl](chapter-23/04-traveler_in_good_standing.pl)
-- [05-connection.pl](chapter-23/05-connection.pl) — Specializing a relation
-- [06-rail_connection.pl](chapter-23/06-rail_connection.pl)
-- [07-sum_numbers.pl](chapter-23/07-sum_numbers.pl) — Accumulators and modes
-- [08-sum_numbers_acc.pl](chapter-23/08-sum_numbers_acc.pl)
+- [05-rail_connection.pl](chapter-23/05-rail_connection.pl) — Specialization
+- [06-sum_numbers.pl](chapter-23/06-sum_numbers.pl) — Accumulators change modes
+- [07-sum_numbers_acc.pl](chapter-23/07-sum_numbers_acc.pl)
 
 ## Chapter 24: Designing finite search
 
-- [01-worker.pl](chapter-24/01-worker.pl) — Generate, constrain, describe
+- [01-worker.pl](chapter-24/01-worker.pl) — Generate and constrain
 - [02-simple_path.pl](chapter-24/02-simple_path.pl) — Search over states
 - [03-best_plan.pl](chapter-24/03-best_plan.pl) — Optimization is search plus an order
 
 ## Chapter 25: Case study: an auditable decision service
 
-- [01-person.pl](chapter-25/01-person.pl) — Source and concept layers
+- [01-person.pl](chapter-25/01-person.pl) — Sources and concepts
 - [02-active_badge.pl](chapter-25/02-active_badge.pl)
-- [03-in_good_standing.pl](chapter-25/03-in_good_standing.pl) — Closed-world choice
-- [04-permit.pl](chapter-25/04-permit.pl) — Decision, reasons, and proof
+- [03-in_good_standing.pl](chapter-25/03-in_good_standing.pl) — The closed-world choice
+- [04-permit.pl](chapter-25/04-permit.pl) — Decision and reason
 - [05-incompatible_status.pl](chapter-25/05-incompatible_status.pl) — Integrity before decisions
 
 ## Chapter 26: A proof can be a computation
 
-- [01-mortal.pl](chapter-26/01-mortal.pl)
-- [02-triple.pl](chapter-26/02-triple.pl) — Answers are existential witnesses
-- [03-triple-2.pl](chapter-26/03-triple-2.pl) — Proof objects and proof checking
-- [04-edge.pl](chapter-26/04-edge.pl) — The least model as mathematical closure
+- [01-triple.pl](chapter-26/01-triple.pl)
+- [02-edge.pl](chapter-26/02-edge.pl) — The least model as closure
 
 ## Chapter 27: Recursion is induction in motion
 
 - [01-natural.pl](chapter-27/01-natural.pl)
-- [02-list_length.pl](chapter-27/02-list_length.pl) — Structural induction and data design
-- [03-reverse_acc.pl](chapter-27/03-reverse_acc.pl) — Accumulators and strengthened invariants
+- [02-list_length.pl](chapter-27/02-list_length.pl) — Data shapes give you the induction
+- [03-reverse_acc.pl](chapter-27/03-reverse_acc.pl) — Accumulators need stronger invariants
 
 ## Chapter 28: Algebra, symmetry, and representation
 
 - [01-triangle.pl](chapter-28/01-triangle.pl) — Symmetry reduces search
-- [02-rectangle.pl](chapter-28/02-rectangle.pl) — Relations reveal inverse problems
-- [03-integer_rectangle.pl](chapter-28/03-integer_rectangle.pl)
-- [04-preserves_combine.pl](chapter-28/04-preserves_combine.pl) — Composition, homomorphism, and reusable laws
+- [02-integer_rectangle.pl](chapter-28/02-integer_rectangle.pl) — Relations expose inverse problems
+- [03-preserves_combine.pl](chapter-28/03-preserves_combine.pl) — Laws as testable relations
 
 ## Chapter 29: Search as experimental mathematics
 
-- [01-counterexample_to_odd_square.pl](chapter-29/01-counterexample_to_odd_square.pl) — Examples suggest; proofs compel
-- [02-noncommuting_pair.pl](chapter-29/02-noncommuting_pair.pl) — One counterexample has asymmetric power
+- [01-counterexample_to_odd_square.pl](chapter-29/01-counterexample_to_odd_square.pl)
 
 ## Chapter 31: Testing a theory
 
 - [01-edge.pl](chapter-31/01-edge.pl) — Positive and negative observers
-- [02-program.pl](chapter-31/02-program.pl)
-- [03-double.pl](chapter-31/03-double.pl) — Properties over finite domains
+- [02-double_is_even.pl](chapter-31/02-double_is_even.pl) — Properties over finite domains
 
 ## Chapter 32: Debugging by meaning, search, and proof
 
-- [01-eligible.pl](chapter-32/01-eligible.pl) — Follow bindings from left to right
-- [02-eligible-2.pl](chapter-32/02-eligible-2.pl)
-- [03-candidate_debug.pl](chapter-32/03-candidate_debug.pl) — Create diagnostic relations
-- [04-reference_square.pl](chapter-32/04-reference_square.pl) — Compare specification and implementation
+- [01-age.pl](chapter-32/01-age.pl) — Follow bindings left to right
+- [02-reference_square.pl](chapter-32/02-reference_square.pl) — Compare with a reference
 
 ## Chapter 33: A pattern catalog for reasoning
 
-- [01-assigned_badge.pl](chapter-33/01-assigned_badge.pl) — Pattern 1: Ground sentence first
-- [02-source_role.pl](chapter-33/02-source_role.pl) — Pattern 2: Normalize at the boundary
-- [03-chosen_pair.pl](chapter-33/03-chosen_pair.pl) — Pattern 3: Generate, constrain, describe
-- [04-path.pl](chapter-33/04-path.pl) — Pattern 4: Carry the witness
-- [05-unregistered.pl](chapter-33/05-unregistered.pl) — Pattern 5: Bound absence
-- [06-step.pl](chapter-33/06-step.pl) — Pattern 6: Explicit state transition
-- [07-depends.pl](chapter-33/07-depends.pl) — Pattern 7: Fixed-point closure
-- [08-within_limit.pl](chapter-33/08-within_limit.pl) — Pattern 8: Proof façade
-- [09-invalid_badge_assignment.pl](chapter-33/09-invalid_badge_assignment.pl) — Pattern 9: Integrity before inference
-- [10-theory_version.pl](chapter-33/10-theory_version.pl) — Pattern 10: Version the evidence boundary
+- [01-source_role.pl](chapter-33/01-source_role.pl)
+- [02-chosen_pair.pl](chapter-33/02-chosen_pair.pl)
+- [03-unregistered.pl](chapter-33/03-unregistered.pl)
+- [04-step.pl](chapter-33/04-step.pl)
+- [05-depends.pl](chapter-33/05-depends.pl)
+- [06-within_limit.pl](chapter-33/06-within_limit.pl)
+- [07-invalid_badge_assignment.pl](chapter-33/07-invalid_badge_assignment.pl)
+- [08-theory_version.pl](chapter-33/08-theory_version.pl)
 
 ## Chapter 34: Control, exceptions, and grouped solutions
 
 - [01-travel_status.pl](chapter-34/01-travel_status.pl)
-- [02-require_route.pl](chapter-34/02-require_route.pl)
-- [03-regional_total.pl](chapter-34/03-regional_total.pl)
+- [02-require_route.pl](chapter-34/02-require_route.pl) — Exceptions
+- [03-regional_total.pl](chapter-34/03-regional_total.pl) — Grouped solutions
 
 ## Chapter 35: Reflective terms and atomic conversion
 
@@ -223,7 +208,7 @@ node tools/extract-book-examples.mjs
 
 - [01-program.pl](chapter-36/01-program.pl)
 - [02-program-2.pl](chapter-36/02-program-2.pl)
-- [03-program-3.pl](chapter-36/03-program-3.pl)
+- [03-program-3.pl](chapter-36/03-program-3.pl) — Operators
 
 ## Chapter 37: Streams and term I/O
 
@@ -231,7 +216,7 @@ node tools/extract-book-examples.mjs
 
 ## Chapter 38: Language and ISO profile
 
-- [01-city.pl](chapter-38/01-city.pl)
+- [01-city.pl](chapter-38/01-city.pl) — Source text
 - [02-look_ahead.pl](chapter-38/02-look_ahead.pl) — Part 3-oriented definite clause grammars
 
 ## Chapter 39: Predicate reference
@@ -244,7 +229,6 @@ node tools/extract-book-examples.mjs
 - [06-cost.pl](chapter-39/06-cost.pl)
 - [07-message.pl](chapter-39/07-message.pl)
 - [08-task.pl](chapter-39/08-task.pl)
-- [09-program.pl](chapter-39/09-program.pl) — Specialized library implementation notes
 
 ## Chapter 40: Running EyeProlog: command line and corpus
 

package/examples/book/chapter-02/02-measurement.pl

@@ -1,5 +1,3 @@
 % From The Art of EyeProlog, Chapter 2.
-:- use_module(library(lists)).
-
 measurement(battery_1, sample(17, volts(28.4), amps(12.1))).
 route(a, d, path([a, b, d], cost(9))).

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

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 3.
-:- use_module(library(lists)).
-
 eligible(Person) :-
   age(Person, Years),
   (Years >= 18),

package/examples/book/chapter-03/04-ancestor.pl

@@ -0,0 +1,2 @@
+% From The Art of EyeProlog, Chapter 3 — Deeper foundations: the Herbrand world.
+ancestor(X, Z) :- parent(X, Y), ancestor(Y, Z).

package/examples/book/chapter-03/{07-different.pl → 05-different.pl}

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 3 — Why terms denote themselves.
+% From The Art of EyeProlog, Chapter 3 — Terms denote themselves.
 different(alice, bob) :- (alice \= bob).
 different(ticket(alice), ticket(bob)) :-
   (ticket(alice) \= ticket(bob)).

package/examples/book/chapter-03/{08-has_parent.pl → 06-has_parent.pl}

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 3 — Quantification and visible witnesses.
+% From The Art of EyeProlog, Chapter 3 — Witnesses instead of hidden objects.
 has_parent(Child, parent_of(Child)) :-
   person(Child).
 

package/examples/book/chapter-03/07-program.pl

@@ -0,0 +1,2 @@
+% From The Art of EyeProlog, Chapter 3 — The occurs check.
+cyclic_unification :- X = wrapper(X).

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

@@ -1,6 +1,4 @@
-% From The Art of EyeProlog, Chapter 4 — Constructing the recursive argument.
-:- use_module(library(lists)).
-
+% From The Art of EyeProlog, Chapter 4 — Cycles and tabling.
 path(X, Y, [X, Y]) :- edge(X, Y).
 path(X, Z, [X | Rest]) :-
   edge(X, Y),

package/examples/book/chapter-06/01-next.pl

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 6.
-:- use_module(library(lists)).
-
 next(X, Y) :- (Y is X + 1).
 area_rectangle(W, H, Area) :- (Area is W * H).
 

package/examples/book/chapter-06/03-square.pl

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 6.
-:- use_module(library(lists)).
-
 square(N, Square) :-
   between(1, 10, N),
   (Square is N * N).

package/examples/book/chapter-07/03-move.pl

@@ -0,0 +1,4 @@
+% From The Art of EyeProlog, Chapter 7 — Negation through recursion.
+move(a, b).
+move(b, a).
+win(X) :- move(X, Y), tnot(win(Y)).

package/examples/book/chapter-08/01-outgoing_costs.pl

@@ -1,7 +1,5 @@
 % From The Art of EyeProlog, Chapter 8.
 :- use_module(library(aggregate)).
-:- use_module(library(lists)).
-
 outgoing_costs(Node, Costs) :-
   findall(Cost, edge(Node, _, Cost), Costs).
 

package/examples/book/chapter-08/02-best_route.pl

@@ -1,7 +1,5 @@
 % From The Art of EyeProlog, Chapter 8.
 :- use_module(library(aggregate)).
-:- use_module(library(lists)).
-
 best_route(From, To, Route, Cost) :-
   aggregate_min(
     [CandidateCost, CandidateRoute],

package/examples/book/chapter-09/01-normalized.pl

@@ -1,7 +1,5 @@
 % From The Art of EyeProlog, Chapter 9.
 :- use_module(library(strings)).
-:- use_module(library(lists)).
-
 normalized(Input, Words) :-
   trim(Input, Trimmed),
   lowercase(Trimmed, Lower),

package/examples/book/chapter-09/02-message.pl

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 9.
-:- use_module(library(lists)).
-
 message(event_17, (severity(high), source(sensor_3), reading(temp, 91))).
 
 context_member((Left, _right), Member) :- context_member(Left, Member).

package/examples/book/chapter-12/01-invalid_probability.pl

@@ -2,3 +2,8 @@
 invalid_probability(Disease, Probability) :-
   probability(Disease, Probability),
   (Probability > 1).
+
+invalid_assignment(Person, Role, Other) :-
+  assigned(Person, Role),
+  incompatible_roles(Role, Other),
+  assigned(Person, Other).

package/examples/book/chapter-13/01-reach.pl

@@ -0,0 +1,3 @@
+% From The Art of EyeProlog, Chapter 13.
+reach(X, Y) :- edge(X, Y).
+reach(X, Z) :- edge(X, Y), reach(Y, Z).

package/examples/book/chapter-17/01-path.pl

@@ -1,5 +1,3 @@
 % From The Art of EyeProlog, Chapter 17.
-:- use_module(library(lists)).
-
 path(X, Y) :- edge(X, Y).
 path(X, Z) :- edge(X, Y), path(Y, Z).

package/examples/book/chapter-17/02-adult.pl

@@ -1,6 +1,4 @@
-% From The Art of EyeProlog, Chapter 17 — The same relation, a different computation.
-:- use_module(library(lists)).
-
+% From The Art of EyeProlog, Chapter 17 — Same meaning, different computation.
 adult(Person) :- person(Person), age(Person, Age), (Age >= 18).
 
 adult(Person) :- (Age >= 18), age(Person, Age), person(Person).

package/examples/book/chapter-17/03-bad_member.pl

@@ -1,5 +1,3 @@
 % From The Art of EyeProlog, Chapter 17.
-:- use_module(library(lists)).
-
 % Poor control: recursion starts before one list cell is exposed.
 bad_member(X, List) :- bad_member(X, Rest), (List = [_ | Rest]).

package/examples/book/chapter-18/01-routeable.pl

@@ -1,4 +1,2 @@
-% From The Art of EyeProlog, Chapter 18 — Begin with ground sentences.
-:- use_module(library(lists)).
-
+% From The Art of EyeProlog, Chapter 18 — Begin with a ground sentence.
 routeable(parcel_7, hub_north).

package/examples/book/chapter-18/02-routeable-2.pl

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 18.
-:- use_module(library(lists)).
-
 routeable(Parcel, Hub) :-
   destination_zone(Parcel, Zone),
   serves(Hub, Zone),

package/examples/book/chapter-18/03-prefix.pl

@@ -1,3 +1,3 @@
-% From The Art of EyeProlog, Chapter 18 — Invent examples before recursion.
+% From The Art of EyeProlog, Chapter 18 — Examples before recursion.
 prefix([], _).
 prefix([X | Xs], [X | Ys]) :- prefix(Xs, Ys).

package/examples/book/chapter-18/04-candidate_pair.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 18 — Separate generate, test, and describe.
+% From The Art of EyeProlog, Chapter 18 — Generate, then test.
 candidate_pair(A, B) :-
   person(A),
   person(B).
@@ -7,5 +7,3 @@ compatible_pair(A, B) :-
   candidate_pair(A, B),
   (A \= B),
   \+ conflict(A, B).
-
-answer(pair(A, B)) :- compatible_pair(A, B).

package/examples/book/chapter-19/01-factorial.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 19 — Termination needs its own argument.
+% From The Art of EyeProlog, Chapter 19 — Termination needs its own measure.
 factorial(0, 1).
 factorial(N, F) :-
   (N > 0),

package/examples/book/chapter-19/02-invalid_limits.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 19 — Integrity is not merely failure.
+% From The Art of EyeProlog, Chapter 19 — Integrity is not failure.
 invalid_limits(Name, Low, High) :-
   lower_limit(Name, Low),
   upper_limit(Name, High),

package/examples/book/chapter-20/01-connected.pl

@@ -1,2 +1,2 @@
-% From The Art of EyeProlog, Chapter 20 — Strengthen calls before adding machinery.
+% From The Art of EyeProlog, Chapter 20 — Ask a better question first.
 connected(X, Y) :- path_with_nodes(X, Y, _).

package/examples/book/chapter-20/02-within_thermal_limits.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 20 — Introduce helpers that express invariants.
+% From The Art of EyeProlog, Chapter 20 — Name invariants with helpers.
 within_thermal_limits(Battery) :-
   temperature(Battery, T),
   temperature_limit(Max),

package/examples/book/chapter-20/03-search.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 20 — Move invariant work outward.
+% From The Art of EyeProlog, Chapter 20 — Hoist invariant work.
 search(Request, Answer) :-
   normalized_request(Request, Normalized),
   search_normalized(Normalized, initial_state, Answer).

package/examples/book/chapter-21/02-grandparent.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 21 — Substitutions accumulate.
+% From The Art of EyeProlog, Chapter 21 — Bindings flow forward.
 grandparent(X, Z) :-
   parent(X, Y),
   parent(Y, Z).

package/examples/book/chapter-21/03-loop_edge.pl

@@ -1,4 +1,2 @@
 % From The Art of EyeProlog, Chapter 21.
-:- use_module(library(lists)).
-
 loop_edge(Node) :- edge(Node, Node).

package/examples/book/chapter-21/04-eligible.pl

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 21 — Failure rewinds choices, not facts.
-:- use_module(library(lists)).
-
 eligible(Person) :-
   applicant(Person),
   age(Person, Age),

package/examples/book/chapter-21/05-grows.pl

@@ -1,2 +1,2 @@
-% From The Art of EyeProlog, Chapter 21 — Variants, cycles, and tables.
+% From The Art of EyeProlog, Chapter 21 — Variants and tables.
 grows(X) :- grows(wrapper(X)).

package/examples/book/chapter-22/02-tree_member.pl

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 22.
-:- use_module(library(lists)).
-
 tree_member(X, tree(X, _, _)).
 tree_member(X, tree(_, Left, _)) :- tree_member(X, Left).
 tree_member(X, tree(_, _, Right)) :- tree_member(X, Right).

package/examples/book/chapter-22/03-mirror.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 22 — Transforming a tree.
+% From The Art of EyeProlog, Chapter 22 — Relating two trees.
 mirror(empty, empty).
 mirror(
   tree(Value, Left, Right),

package/examples/book/chapter-22/04-sentence.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 22 — A standard definite clause grammar.
+% From The Art of EyeProlog, Chapter 22 — A definite clause grammar.
 sentence --> noun_phrase, verb_phrase.
 
 noun_phrase --> [the], noun.

package/examples/book/chapter-22/05-evaluate.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 22 — Interpreting an expression.
+% From The Art of EyeProlog, Chapter 22 — An evaluator.
 evaluate(number(N), N).
 
 evaluate(add(Left, Right), Value) :-

package/examples/book/chapter-22/06-lookup.pl

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 22.
-:- use_module(library(lists)).
-
 lookup(Name, [binding(Name, Value) | _], Value).
 lookup(Name, [_ | Rest], Value) :- lookup(Name, Rest, Value).
 

package/examples/book/chapter-22/07-simplify.pl

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 22 — Rewriting symbolic expressions.
+% From The Art of EyeProlog, Chapter 22 — Rewriting.
 simplify(add(number(0), X), X).
 simplify(add(X, number(0)), X).
 simplify(multiply(number(1), X), X).

package/examples/book/chapter-23/01-adult.pl

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 23 — Unfolding and folding.
-:- use_module(library(lists)).
-
 adult(Person) :-
   recorded_age(Person, Age),
   adult_age(Age).

package/examples/book/chapter-23/02-adult-2.pl

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 23.
-:- use_module(library(lists)).
-
 adult(Person) :-
   recorded_age(Person, Age),
   (Age >= 18).

package/examples/book/chapter-23/03-can_board.pl

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 23.
-:- use_module(library(lists)).
-
 can_board(Person) :-
   registered(Person),
   identity_checked(Person),

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

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 23.
-:- use_module(library(lists)).
-
 traveler_in_good_standing(Person) :-
   registered(Person),
   identity_checked(Person),

package/examples/book/chapter-23/{06-rail_connection.pl → 05-rail_connection.pl}

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

package/examples/book/chapter-23/{07-sum_numbers.pl → 06-sum_numbers.pl}

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

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

@@ -1,4 +1,4 @@
-% From The Art of EyeProlog, Chapter 24 — Generate, constrain, describe.
+% From The Art of EyeProlog, Chapter 24 — Generate and constrain.
 worker(ada).
 worker(byron).
 worker(clara).

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

@@ -1,6 +1,5 @@
 % From The Art of EyeProlog, Chapter 24 — Optimization is search plus an order.
 :- use_module(library(aggregate)).
-:- use_module(library(lists)).
 
 best_plan(Request, Plan, Cost) :-
   aggregate_min(

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

@@ -1,6 +1,4 @@
-% From The Art of EyeProlog, Chapter 25 — Source and concept layers.
-:- use_module(library(lists)).
-
+% From The Art of EyeProlog, Chapter 25 — Sources and concepts.
 person(ada).
 badge(b17, ada).
 badge_status(b17, active).

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

@@ -1,6 +1,4 @@
 % From The Art of EyeProlog, Chapter 25.
-:- use_module(library(lists)).
-
 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 EyeProlog, Chapter 25 — Closed-world choice.
+% From The Art of EyeProlog, Chapter 25 — The closed-world choice.
 in_good_standing(Person) :-
   person(Person),
   \+ suspended(Person).