The Art of Eyepl — inline examples
These files are generated from the complete eyepl code blocks in
The Art of Eyepl. They are grouped by chapter and
retain the source text from the book. Goal fragments and non-Eyepl blocks are
not extracted.
Regenerate them from the repository root with:
Chapter 1: A program is a little theory
Chapter 2: Terms, variables, and substitution
Chapter 3: Rules and their two readings
Chapter 4: Recursion: describing reachability
Chapter 5: Lists as relations
Chapter 6: Arithmetic and finite generation
Chapter 7: Failure, negation, and quantification
Chapter 8: Collecting and choosing answers
Chapter 9: Structured data, strings, and contexts
Chapter 10: From puzzles to models
Chapter 11: Queries, answers, and proofs
Chapter 12: Integrity constraints and inference fuses
Chapter 14: Knowledge engineering
Chapter 15: RDF 1.2 as relational data
Chapter 16: Embedding Eyepl
Chapter 17: Logic and control
Chapter 18: Constructing a program
Chapter 19: Correctness and termination
Chapter 20: Improving a program
Chapter 21: Reading the computation
Chapter 22: Trees, languages, and symbolic evaluation
Chapter 24: Designing finite search
Chapter 25: Case study: an auditable decision service
Chapter 26: A proof can be a computation
Chapter 27: Recursion is induction in motion
Chapter 28: Algebra, symmetry, and representation
Chapter 29: Search as experimental mathematics
Chapter 31: Testing a theory
Chapter 32: Debugging by meaning, search, and proof
Chapter 33: A pattern language for Eyepl