tiny-datalog 0.1.0__tar.gz → 0.1.2__tar.gz

{tiny_datalog-0.1.0 → tiny_datalog-0.1.2}/PKG-INFO

@@ -1,10 +1,31 @@
 Metadata-Version: 2.4
 Name: tiny-datalog
-Version: 0.1.0
+Version: 0.1.2
 Summary: A Datalog engine small enough to read in an afternoon
 Author: Andrew Goodchild
 License-Expression: MIT
 Project-URL: Homepage, https://github.com/andrewgoodchild/tiny-datalog
+Project-URL: Source, https://github.com/andrewgoodchild/tiny-datalog
+Project-URL: Issues, https://github.com/andrewgoodchild/tiny-datalog/issues
+Project-URL: Changelog, https://github.com/andrewgoodchild/tiny-datalog/releases
+Project-URL: Lessons, https://github.com/andrewgoodchild/tiny-datalog/tree/main/lessons
+Keywords: datalog,logic programming,deductive database,semi-naive evaluation,magic sets,provenance,stable models,teaching
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Education
+Classifier: Intended Audience :: Science/Research
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Database
+Classifier: Topic :: Education
+Classifier: Topic :: Software Development :: Interpreters
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
 Requires-Python: >=3.9
 Description-Content-Type: text/markdown
 License-File: LICENSE
@@ -13,6 +34,7 @@ Dynamic: license-file
 # tiny-datalog
 
 [![tests](https://github.com/andrewgoodchild/tiny-datalog/actions/workflows/ci.yml/badge.svg)](https://github.com/andrewgoodchild/tiny-datalog/actions/workflows/ci.yml)
+[![PyPI](https://img.shields.io/pypi/v/tiny-datalog)](https://pypi.org/project/tiny-datalog/)
 
 **A logic engine small enough to read in an afternoon, and a course
 that builds it up from nothing.**
@@ -104,7 +126,7 @@ Nothing to install:
 
 ```sh
 git clone https://github.com/andrewgoodchild/tiny-datalog && cd tiny-datalog
-python3 tests.py        # 234 tests, ~12s
+python3 tests.py        # 235 tests, ~12s
 ```
 
 ## Why the language choice decides what you can ask later
@@ -126,7 +148,7 @@ particular decision came out the way it did, and somebody else asks
 whether the rules are even coherent before trusting any answer at all.
 
 (The sign-off case has its own demonstration:
-[lesson 17](lessons/17-writing-rules.md) writes a lending policy badly
+[lesson 17](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/17-writing-rules.md) writes a lending policy badly
 twice, and `--explain` names which of two rules wrongly let a
 suspended staff member borrow — three lines, no debugger.)
 
@@ -144,7 +166,7 @@ cannot answer them. Datalog can, because it gave things up:
 (Containment and equivalence become undecidable once recursion is
 involved — Shmueli, 1993, which is why `containment.py` handles
 conjunctive queries and refuses the rest.
-[Lesson 16](lessons/16-containment.md) covers the boundary.)
+[Lesson 16](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/16-containment.md) covers the boundary.)
 
 Being declarative, recursive and terminating is not a feature list. It
 is the trade that makes rules analysable, and three things follow from
@@ -174,7 +196,7 @@ the better tool, and that covers most problems.
 The worked example above is one row of a table. The full version — 20
 questions, each with the command that answers it and the lesson that
 builds the machinery — is in
-[getting started](lessons/getting-started.md), beside the reading
+[getting started](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/getting-started.md), beside the reading
 paths.
 
 ## Claims you can check
@@ -201,7 +223,7 @@ python3 benchmarks/generate.py chain 150 > chain150.dl
 The last two are the same rewriting on the same program. Magic sets
 pays in proportion to how much the query's bindings prune; when demand
 is the whole relation the guards are pure overhead.
-[Lesson 7](lessons/07-magic-sets.md) works through why.
+[Lesson 7](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/07-magic-sets.md) works through why.
 
 Correctness is checked by a seeded differential fuzzer that generates
 stratified programs and demands semi-naive, naive, magic-sets and
@@ -209,6 +231,13 @@ tabled evaluation all agree, and that incremental maintenance matches
 recomputation under random updates. 400 programs per run;
 `TINY_DATALOG_FUZZ=3000 python3 tests.py DifferentialFuzzTests` soaks.
 
+Answers are also checked against engines this repository did not write.
+[`conformance/`](https://github.com/andrewgoodchild/tiny-datalog/tree/main/conformance)
+runs the [datalog-conformance](https://pypi.org/project/datalog-conformance/)
+corpus, harvested from Soufflé, Nemo and Crepe, through all four
+strategies: 89 cases pass. The 25 it skips need arithmetic or 10⁵-fact
+joins, and both are omissions this course makes on purpose.
+
 ## Learning Datalog
 
 `lessons/` is a complete course, no prior exposure assumed, every
@@ -221,29 +250,29 @@ a lesson on authoring rules that survive review. And it is built to be
 inherited: `git clone`, no dependencies, no hosted anything, and every
 quoted transcript re-verified by CI — the exercises cannot rot. (For where each
 technique ships — CodeQL, RDFox, Feldera, SNOMED and the rest —
-[lesson 0](lessons/00-what-is-datalog.md) ends with the deployments.)
-[lessons/getting-started.md](lessons/getting-started.md) has the titles
+[lesson 0](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/00-what-is-datalog.md) ends with the deployments.)
+[lessons/getting-started.md](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/getting-started.md) has the titles
 and the reading order, and
-[lessons/glossary.md](lessons/glossary.md) defines every technical term
+[lessons/glossary.md](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/glossary.md) defines every technical term
 the course uses, and
-[lessons/references.md](lessons/references.md) collects every work the
+[lessons/references.md](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/references.md) collects every work the
 lessons cite.
 
 Three of them teach things that are hard to find taught well anywhere
 else, and they are the reason the course exists rather than just the
 engine:
 
-- **[Lesson 8](lessons/08-semirings.md)** proves that why-provenance
+- **[Lesson 8](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/08-semirings.md)** proves that why-provenance
   cannot be specialised into derivation counts, with a program that
   prints the disproof: two facts with identical provenance and different
   counts. That settles "materialise provenance once, specialise later,"
   which is a real design-review question with a real answer.
-- **[Lesson 16](lessons/16-containment.md)** shows that the containment
+- **[Lesson 16](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/16-containment.md)** shows that the containment
   test you need for query minimisation is the search already sitting in
   `datalog.py`: `_match` maps a rule body into a database,
   `find_homomorphism` maps a rule body into another rule body. Same
   backtracking, one level up.
-- **[Lesson 4](lessons/04-closed-and-open-worlds.md)** contrasts the
+- **[Lesson 4](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/04-closed-and-open-worlds.md)** contrasts the
   two reasoners in this repository, which disagree about what absence
   means, and leaves you with a habit: when you see `not`, ask whose
   authority says this is absent.
@@ -265,7 +294,7 @@ quietly:
 - **Arithmetic and comparisons.** A built-in isn't a relation you can
   enumerate, so it must be *evaluated* the moment its operands bind —
   which entangles correctness with join order and forces terms to
-  become trees. [Lesson 14](lessons/14-arithmetic.md) is the whole
+  become trees. [Lesson 14](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/14-arithmetic.md) is the whole
   story, including what to do instead.
 - **Indexes and join planning.** Every join is a nested loop so the
   algorithms stay one-screen readable. It is also why the magic-sets
@@ -277,7 +306,7 @@ quietly:
 - **A REPL (interactive prompt) and packaging.** `git clone` and run.
 
 Aggregation used to be on this list;
-[lesson 13](lessons/13-aggregation.md) is what promoting an omission
+[lesson 13](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/13-aggregation.md) is what promoting an omission
 into a feature looks like.
 
 ## Using it in your own project
@@ -329,8 +358,10 @@ programs/       teaching programs, numbered by the lesson that uses
 lessons/        getting started, glossary, and lessons 0–18
 exercises/      worked answers, verified by the test suite
 cases/          golden test cases — add one without writing Python
+conformance/    the external datalog-conformance corpus (Soufflé, Nemo,
+                Crepe), run against all four evaluation strategies
 benchmarks/     scaled input generators (chain/tree/clique/grid)
-tests.py        234 tests: every shipped program and exercise answer is
+tests.py        235 tests: every shipped program and exercise answer is
                 executed, a conformance suite runs every query through
                 every applicable strategy, and a seeded fuzzer checks
                 the same property on random programs

tiny_datalog-0.1.0/tiny_datalog.egg-info/PKG-INFO → tiny_datalog-0.1.2/README.md

@@ -1,18 +1,7 @@
-Metadata-Version: 2.4
-Name: tiny-datalog
-Version: 0.1.0
-Summary: A Datalog engine small enough to read in an afternoon
-Author: Andrew Goodchild
-License-Expression: MIT
-Project-URL: Homepage, https://github.com/andrewgoodchild/tiny-datalog
-Requires-Python: >=3.9
-Description-Content-Type: text/markdown
-License-File: LICENSE
-Dynamic: license-file
-
 # tiny-datalog
 
 [![tests](https://github.com/andrewgoodchild/tiny-datalog/actions/workflows/ci.yml/badge.svg)](https://github.com/andrewgoodchild/tiny-datalog/actions/workflows/ci.yml)
+[![PyPI](https://img.shields.io/pypi/v/tiny-datalog)](https://pypi.org/project/tiny-datalog/)
 
 **A logic engine small enough to read in an afternoon, and a course
 that builds it up from nothing.**
@@ -104,7 +93,7 @@ Nothing to install:
 
 ```sh
 git clone https://github.com/andrewgoodchild/tiny-datalog && cd tiny-datalog
-python3 tests.py        # 234 tests, ~12s
+python3 tests.py        # 235 tests, ~12s
 ```
 
 ## Why the language choice decides what you can ask later
@@ -126,7 +115,7 @@ particular decision came out the way it did, and somebody else asks
 whether the rules are even coherent before trusting any answer at all.
 
 (The sign-off case has its own demonstration:
-[lesson 17](lessons/17-writing-rules.md) writes a lending policy badly
+[lesson 17](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/17-writing-rules.md) writes a lending policy badly
 twice, and `--explain` names which of two rules wrongly let a
 suspended staff member borrow — three lines, no debugger.)
 
@@ -144,7 +133,7 @@ cannot answer them. Datalog can, because it gave things up:
 (Containment and equivalence become undecidable once recursion is
 involved — Shmueli, 1993, which is why `containment.py` handles
 conjunctive queries and refuses the rest.
-[Lesson 16](lessons/16-containment.md) covers the boundary.)
+[Lesson 16](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/16-containment.md) covers the boundary.)
 
 Being declarative, recursive and terminating is not a feature list. It
 is the trade that makes rules analysable, and three things follow from
@@ -174,7 +163,7 @@ the better tool, and that covers most problems.
 The worked example above is one row of a table. The full version — 20
 questions, each with the command that answers it and the lesson that
 builds the machinery — is in
-[getting started](lessons/getting-started.md), beside the reading
+[getting started](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/getting-started.md), beside the reading
 paths.
 
 ## Claims you can check
@@ -201,7 +190,7 @@ python3 benchmarks/generate.py chain 150 > chain150.dl
 The last two are the same rewriting on the same program. Magic sets
 pays in proportion to how much the query's bindings prune; when demand
 is the whole relation the guards are pure overhead.
-[Lesson 7](lessons/07-magic-sets.md) works through why.
+[Lesson 7](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/07-magic-sets.md) works through why.
 
 Correctness is checked by a seeded differential fuzzer that generates
 stratified programs and demands semi-naive, naive, magic-sets and
@@ -209,6 +198,13 @@ tabled evaluation all agree, and that incremental maintenance matches
 recomputation under random updates. 400 programs per run;
 `TINY_DATALOG_FUZZ=3000 python3 tests.py DifferentialFuzzTests` soaks.
 
+Answers are also checked against engines this repository did not write.
+[`conformance/`](https://github.com/andrewgoodchild/tiny-datalog/tree/main/conformance)
+runs the [datalog-conformance](https://pypi.org/project/datalog-conformance/)
+corpus, harvested from Soufflé, Nemo and Crepe, through all four
+strategies: 89 cases pass. The 25 it skips need arithmetic or 10⁵-fact
+joins, and both are omissions this course makes on purpose.
+
 ## Learning Datalog
 
 `lessons/` is a complete course, no prior exposure assumed, every
@@ -221,29 +217,29 @@ a lesson on authoring rules that survive review. And it is built to be
 inherited: `git clone`, no dependencies, no hosted anything, and every
 quoted transcript re-verified by CI — the exercises cannot rot. (For where each
 technique ships — CodeQL, RDFox, Feldera, SNOMED and the rest —
-[lesson 0](lessons/00-what-is-datalog.md) ends with the deployments.)
-[lessons/getting-started.md](lessons/getting-started.md) has the titles
+[lesson 0](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/00-what-is-datalog.md) ends with the deployments.)
+[lessons/getting-started.md](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/getting-started.md) has the titles
 and the reading order, and
-[lessons/glossary.md](lessons/glossary.md) defines every technical term
+[lessons/glossary.md](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/glossary.md) defines every technical term
 the course uses, and
-[lessons/references.md](lessons/references.md) collects every work the
+[lessons/references.md](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/references.md) collects every work the
 lessons cite.
 
 Three of them teach things that are hard to find taught well anywhere
 else, and they are the reason the course exists rather than just the
 engine:
 
-- **[Lesson 8](lessons/08-semirings.md)** proves that why-provenance
+- **[Lesson 8](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/08-semirings.md)** proves that why-provenance
   cannot be specialised into derivation counts, with a program that
   prints the disproof: two facts with identical provenance and different
   counts. That settles "materialise provenance once, specialise later,"
   which is a real design-review question with a real answer.
-- **[Lesson 16](lessons/16-containment.md)** shows that the containment
+- **[Lesson 16](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/16-containment.md)** shows that the containment
   test you need for query minimisation is the search already sitting in
   `datalog.py`: `_match` maps a rule body into a database,
   `find_homomorphism` maps a rule body into another rule body. Same
   backtracking, one level up.
-- **[Lesson 4](lessons/04-closed-and-open-worlds.md)** contrasts the
+- **[Lesson 4](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/04-closed-and-open-worlds.md)** contrasts the
   two reasoners in this repository, which disagree about what absence
   means, and leaves you with a habit: when you see `not`, ask whose
   authority says this is absent.
@@ -265,7 +261,7 @@ quietly:
 - **Arithmetic and comparisons.** A built-in isn't a relation you can
   enumerate, so it must be *evaluated* the moment its operands bind —
   which entangles correctness with join order and forces terms to
-  become trees. [Lesson 14](lessons/14-arithmetic.md) is the whole
+  become trees. [Lesson 14](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/14-arithmetic.md) is the whole
   story, including what to do instead.
 - **Indexes and join planning.** Every join is a nested loop so the
   algorithms stay one-screen readable. It is also why the magic-sets
@@ -277,7 +273,7 @@ quietly:
 - **A REPL (interactive prompt) and packaging.** `git clone` and run.
 
 Aggregation used to be on this list;
-[lesson 13](lessons/13-aggregation.md) is what promoting an omission
+[lesson 13](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/13-aggregation.md) is what promoting an omission
 into a feature looks like.
 
 ## Using it in your own project
@@ -329,8 +325,10 @@ programs/       teaching programs, numbered by the lesson that uses
 lessons/        getting started, glossary, and lessons 0–18
 exercises/      worked answers, verified by the test suite
 cases/          golden test cases — add one without writing Python
+conformance/    the external datalog-conformance corpus (Soufflé, Nemo,
+                Crepe), run against all four evaluation strategies
 benchmarks/     scaled input generators (chain/tree/clique/grid)
-tests.py        234 tests: every shipped program and exercise answer is
+tests.py        235 tests: every shipped program and exercise answer is
                 executed, a conformance suite runs every query through
                 every applicable strategy, and a seeded fuzzer checks
                 the same property on random programs

tiny_datalog-0.1.2/pyproject.toml

@@ -0,0 +1,56 @@
+[build-system]
+requires = ["setuptools>=77"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "tiny-datalog"
+version = "0.1.2"
+description = "A Datalog engine small enough to read in an afternoon"
+readme = "README.md"
+license = "MIT"
+license-files = ["LICENSE"]
+requires-python = ">=3.9"
+authors = [{name = "Andrew Goodchild"}]
+dependencies = []
+keywords = ["datalog", "logic programming", "deductive database",
+            "semi-naive evaluation", "magic sets", "provenance",
+            "stable models", "teaching"]
+# No "License ::" classifier: `license` above is an SPDX expression, and
+# setuptools refuses a build that declares the licence both ways.
+classifiers = [
+    "Development Status :: 3 - Alpha",
+    "Intended Audience :: Developers",
+    "Intended Audience :: Education",
+    "Intended Audience :: Science/Research",
+    "Operating System :: OS Independent",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3 :: Only",
+    "Programming Language :: Python :: 3.9",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
+    "Topic :: Database",
+    "Topic :: Education",
+    "Topic :: Software Development :: Interpreters",
+    "Topic :: Scientific/Engineering :: Artificial Intelligence",
+]
+
+[project.urls]
+Homepage = "https://github.com/andrewgoodchild/tiny-datalog"
+Source = "https://github.com/andrewgoodchild/tiny-datalog"
+Issues = "https://github.com/andrewgoodchild/tiny-datalog/issues"
+Changelog = "https://github.com/andrewgoodchild/tiny-datalog/releases"
+Lessons = "https://github.com/andrewgoodchild/tiny-datalog/tree/main/lessons"
+
+[project.scripts]
+tiny-datalog = "tiny_datalog.datalog:main"
+tiny-datalog-prolog = "tiny_datalog.prolog:main"
+tiny-datalog-semiring = "tiny_datalog.semiring:main"
+tiny-datalog-tabling = "tiny_datalog.tabling:main"
+tiny-datalog-incremental = "tiny_datalog.incremental:main"
+tiny-datalog-subsumption = "tiny_datalog.subsumption:main"
+tiny-datalog-containment = "tiny_datalog.containment:main"
+
+[tool.setuptools.packages.find]
+include = ["tiny_datalog*"]

{tiny_datalog-0.1.0 → tiny_datalog-0.1.2}/tiny_datalog/__init__.py

@@ -29,7 +29,7 @@ from tiny_datalog.datalog import (
     format_atom, format_fact,
 )
 
-__version__ = "0.1.0"
+__version__ = "0.1.2"
 
 __all__ = [
     "Var", "Const", "Struct", "Atom", "Literal", "Rule",

tiny_datalog-0.1.0/README.md → tiny_datalog-0.1.2/tiny_datalog.egg-info/PKG-INFO

@@ -1,6 +1,40 @@
+Metadata-Version: 2.4
+Name: tiny-datalog
+Version: 0.1.2
+Summary: A Datalog engine small enough to read in an afternoon
+Author: Andrew Goodchild
+License-Expression: MIT
+Project-URL: Homepage, https://github.com/andrewgoodchild/tiny-datalog
+Project-URL: Source, https://github.com/andrewgoodchild/tiny-datalog
+Project-URL: Issues, https://github.com/andrewgoodchild/tiny-datalog/issues
+Project-URL: Changelog, https://github.com/andrewgoodchild/tiny-datalog/releases
+Project-URL: Lessons, https://github.com/andrewgoodchild/tiny-datalog/tree/main/lessons
+Keywords: datalog,logic programming,deductive database,semi-naive evaluation,magic sets,provenance,stable models,teaching
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Education
+Classifier: Intended Audience :: Science/Research
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Database
+Classifier: Topic :: Education
+Classifier: Topic :: Software Development :: Interpreters
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
 # tiny-datalog
 
 [![tests](https://github.com/andrewgoodchild/tiny-datalog/actions/workflows/ci.yml/badge.svg)](https://github.com/andrewgoodchild/tiny-datalog/actions/workflows/ci.yml)
+[![PyPI](https://img.shields.io/pypi/v/tiny-datalog)](https://pypi.org/project/tiny-datalog/)
 
 **A logic engine small enough to read in an afternoon, and a course
 that builds it up from nothing.**
@@ -92,7 +126,7 @@ Nothing to install:
 
 ```sh
 git clone https://github.com/andrewgoodchild/tiny-datalog && cd tiny-datalog
-python3 tests.py        # 234 tests, ~12s
+python3 tests.py        # 235 tests, ~12s
 ```
 
 ## Why the language choice decides what you can ask later
@@ -114,7 +148,7 @@ particular decision came out the way it did, and somebody else asks
 whether the rules are even coherent before trusting any answer at all.
 
 (The sign-off case has its own demonstration:
-[lesson 17](lessons/17-writing-rules.md) writes a lending policy badly
+[lesson 17](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/17-writing-rules.md) writes a lending policy badly
 twice, and `--explain` names which of two rules wrongly let a
 suspended staff member borrow — three lines, no debugger.)
 
@@ -132,7 +166,7 @@ cannot answer them. Datalog can, because it gave things up:
 (Containment and equivalence become undecidable once recursion is
 involved — Shmueli, 1993, which is why `containment.py` handles
 conjunctive queries and refuses the rest.
-[Lesson 16](lessons/16-containment.md) covers the boundary.)
+[Lesson 16](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/16-containment.md) covers the boundary.)
 
 Being declarative, recursive and terminating is not a feature list. It
 is the trade that makes rules analysable, and three things follow from
@@ -162,7 +196,7 @@ the better tool, and that covers most problems.
 The worked example above is one row of a table. The full version — 20
 questions, each with the command that answers it and the lesson that
 builds the machinery — is in
-[getting started](lessons/getting-started.md), beside the reading
+[getting started](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/getting-started.md), beside the reading
 paths.
 
 ## Claims you can check
@@ -189,7 +223,7 @@ python3 benchmarks/generate.py chain 150 > chain150.dl
 The last two are the same rewriting on the same program. Magic sets
 pays in proportion to how much the query's bindings prune; when demand
 is the whole relation the guards are pure overhead.
-[Lesson 7](lessons/07-magic-sets.md) works through why.
+[Lesson 7](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/07-magic-sets.md) works through why.
 
 Correctness is checked by a seeded differential fuzzer that generates
 stratified programs and demands semi-naive, naive, magic-sets and
@@ -197,6 +231,13 @@ tabled evaluation all agree, and that incremental maintenance matches
 recomputation under random updates. 400 programs per run;
 `TINY_DATALOG_FUZZ=3000 python3 tests.py DifferentialFuzzTests` soaks.
 
+Answers are also checked against engines this repository did not write.
+[`conformance/`](https://github.com/andrewgoodchild/tiny-datalog/tree/main/conformance)
+runs the [datalog-conformance](https://pypi.org/project/datalog-conformance/)
+corpus, harvested from Soufflé, Nemo and Crepe, through all four
+strategies: 89 cases pass. The 25 it skips need arithmetic or 10⁵-fact
+joins, and both are omissions this course makes on purpose.
+
 ## Learning Datalog
 
 `lessons/` is a complete course, no prior exposure assumed, every
@@ -209,29 +250,29 @@ a lesson on authoring rules that survive review. And it is built to be
 inherited: `git clone`, no dependencies, no hosted anything, and every
 quoted transcript re-verified by CI — the exercises cannot rot. (For where each
 technique ships — CodeQL, RDFox, Feldera, SNOMED and the rest —
-[lesson 0](lessons/00-what-is-datalog.md) ends with the deployments.)
-[lessons/getting-started.md](lessons/getting-started.md) has the titles
+[lesson 0](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/00-what-is-datalog.md) ends with the deployments.)
+[lessons/getting-started.md](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/getting-started.md) has the titles
 and the reading order, and
-[lessons/glossary.md](lessons/glossary.md) defines every technical term
+[lessons/glossary.md](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/glossary.md) defines every technical term
 the course uses, and
-[lessons/references.md](lessons/references.md) collects every work the
+[lessons/references.md](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/references.md) collects every work the
 lessons cite.
 
 Three of them teach things that are hard to find taught well anywhere
 else, and they are the reason the course exists rather than just the
 engine:
 
-- **[Lesson 8](lessons/08-semirings.md)** proves that why-provenance
+- **[Lesson 8](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/08-semirings.md)** proves that why-provenance
   cannot be specialised into derivation counts, with a program that
   prints the disproof: two facts with identical provenance and different
   counts. That settles "materialise provenance once, specialise later,"
   which is a real design-review question with a real answer.
-- **[Lesson 16](lessons/16-containment.md)** shows that the containment
+- **[Lesson 16](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/16-containment.md)** shows that the containment
   test you need for query minimisation is the search already sitting in
   `datalog.py`: `_match` maps a rule body into a database,
   `find_homomorphism` maps a rule body into another rule body. Same
   backtracking, one level up.
-- **[Lesson 4](lessons/04-closed-and-open-worlds.md)** contrasts the
+- **[Lesson 4](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/04-closed-and-open-worlds.md)** contrasts the
   two reasoners in this repository, which disagree about what absence
   means, and leaves you with a habit: when you see `not`, ask whose
   authority says this is absent.
@@ -253,7 +294,7 @@ quietly:
 - **Arithmetic and comparisons.** A built-in isn't a relation you can
   enumerate, so it must be *evaluated* the moment its operands bind —
   which entangles correctness with join order and forces terms to
-  become trees. [Lesson 14](lessons/14-arithmetic.md) is the whole
+  become trees. [Lesson 14](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/14-arithmetic.md) is the whole
   story, including what to do instead.
 - **Indexes and join planning.** Every join is a nested loop so the
   algorithms stay one-screen readable. It is also why the magic-sets
@@ -265,7 +306,7 @@ quietly:
 - **A REPL (interactive prompt) and packaging.** `git clone` and run.
 
 Aggregation used to be on this list;
-[lesson 13](lessons/13-aggregation.md) is what promoting an omission
+[lesson 13](https://github.com/andrewgoodchild/tiny-datalog/blob/main/lessons/13-aggregation.md) is what promoting an omission
 into a feature looks like.
 
 ## Using it in your own project
@@ -317,8 +358,10 @@ programs/       teaching programs, numbered by the lesson that uses
 lessons/        getting started, glossary, and lessons 0–18
 exercises/      worked answers, verified by the test suite
 cases/          golden test cases — add one without writing Python
+conformance/    the external datalog-conformance corpus (Soufflé, Nemo,
+                Crepe), run against all four evaluation strategies
 benchmarks/     scaled input generators (chain/tree/clique/grid)
-tests.py        234 tests: every shipped program and exercise answer is
+tests.py        235 tests: every shipped program and exercise answer is
                 executed, a conformance suite runs every query through
                 every applicable strategy, and a seeded fuzzer checks
                 the same property on random programs

tiny_datalog-0.1.0/pyproject.toml

@@ -1,29 +0,0 @@
-[build-system]
-requires = ["setuptools>=77"]
-build-backend = "setuptools.build_meta"
-
-[project]
-name = "tiny-datalog"
-version = "0.1.0"
-description = "A Datalog engine small enough to read in an afternoon"
-readme = "README.md"
-license = "MIT"
-license-files = ["LICENSE"]
-requires-python = ">=3.9"
-authors = [{name = "Andrew Goodchild"}]
-dependencies = []
-
-[project.urls]
-Homepage = "https://github.com/andrewgoodchild/tiny-datalog"
-
-[project.scripts]
-tiny-datalog = "tiny_datalog.datalog:main"
-tiny-datalog-prolog = "tiny_datalog.prolog:main"
-tiny-datalog-semiring = "tiny_datalog.semiring:main"
-tiny-datalog-tabling = "tiny_datalog.tabling:main"
-tiny-datalog-incremental = "tiny_datalog.incremental:main"
-tiny-datalog-subsumption = "tiny_datalog.subsumption:main"
-tiny-datalog-containment = "tiny_datalog.containment:main"
-
-[tool.setuptools.packages.find]
-include = ["tiny_datalog*"]