Elamur Groupantsmathlib-books-license
The groupant beside tools/mathlib/src/books.rs in the Mova repository: what the code computes, what it never does, how to go back from its outputs, its invariants, cost and checks.
Facts
Implementation material. A Mova code model describes this code at one source revision: partial models, finite checks and their stated scope. It is not a reviewed general exposition, and its labels are shown as written, never raised.
Components
| component | label | where |
|---|---|---|
| approximant | partial | approximant |
| ast | partial | ../syntax.json |
| cost | partial | invariant-and-cost |
| descriptant | present | descriptant |
| invariant | partial | invariant-and-cost |
| tests | bounded checks | tests |
Obernants
The typed relations around the forward model: the behaviour complement (what the code never does), the reverse reconstruction (every input compatible with an output) and specialised views.
| id | type | label | where |
|---|---|---|---|
behavior_complement | behavior_complement | partial source derived model | behavior_complement |
reverse_reconstruction | reverse_reconstruction | partial source derived model | reverse_reconstruction |
minimum_policy | minimum_policy | partial source derived model | minimum_policy |
modifier_priority | modifier_priority | partial source derived model | modifier_priority |
code_transport | code_transport | partial source derived model | code_transport |
split_component_ambiguity | split_component_ambiguity | partial source derived model | split_component_ambiguity |
Model text
descriptant
mathlib-books-license
BookLicense maps each split license component to a finite enum and selects the least enum; allowed is exactly Pd,Cc0,CcBy,CcBySa,Gfdl.
Epoch 2026-10-31
Prospective model retained before changes. Existing production bytes are preserved; additions are bounded inline tests. Nine source groupants expose ingestion and routing boundaries; typed children bind exact source bytes and reuse their parent syntax projection. Native tests run twice per profile; behavior mutants run as compiled source changes and exact bytes are restored before positive checks.
Important retained observation: network-looking helpers are not all pure (DNS inside github_host and books build); selection deliberately excludes those effects. Mixed-format manifest order is not deterministic, and error paths do not imply rollback.
No network/DNS/download, real catalog/corpus/model/teacher or database execution. Effect paths are source-derived; finite helper tests are not universal verification. No executable percentage surrogate or speed claim; future caps require metric/domain/reference and remain 1/2/5/10%.
approximant
Forward relation
BookLicense maps each split license component to a finite enum and selects the least enum; allowed is exactly Pd,Cc0,CcBy,CcBySa,Gfdl.
Model observations include returns, retained state and ordered partial effects; on external failures the successful-prefix relation replaces a total-function claim.
catalog
behavior_complement
Subject: mathlib-books-license, source SHA-256 c45e71334ccd3618e9fad4d6117ac8048db42001ffea61d02fa6d4121d1e5060; finite transition observation.
On all enum values, NC, ND and Other cannot produce allowed=true. This exclusion is about local enum policy, not downstream overrides.
Domain: stated source predicates, bounded inputs and available resources; arithmetic assumptions and external effect gaps as in the invariant. Operator is the stated relation/projection; complement is a source-derived inner exclusion, reverse retains compatible antecedents. Other views are source-derived partial constraints, not inverse laws.
Evidence: tests.md identifies executed helpers and unexecuted paths. No universal guarantee follows from the finite fixtures.
reverse_reconstruction
Subject: mathlib-books-license, source SHA-256 c45e71334ccd3618e9fad4d6117ac8048db42001ffea61d02fa6d4121d1e5060; finite transition observation.
Preimage of CcBySa includes recognized attribution/sharealike spellings and mixtures whose minimum enum is CcBySa; raw spelling and additional more restrictive terms are lost.
Domain: stated source predicates, bounded inputs and available resources; arithmetic assumptions and external effect gaps as in the invariant. Operator is the stated relation/projection; complement is a source-derived inner exclusion, reverse retains compatible antecedents. Other views are source-derived partial constraints, not inverse laws.
Evidence: tests.md identifies executed helpers and unexecuted paths. No universal guarantee follows from the finite fixtures.
minimum_policy
Subject: mathlib-books-license, source SHA-256 c45e71334ccd3618e9fad4d6117ac8048db42001ffea61d02fa6d4121d1e5060; finite transition observation.
For component enum sequence L, parse=min(L), default Other. Appending a less permissive enum cannot increase permissiveness of the minimum; appending Pd changes every non-Pd result.
Domain: stated source predicates, bounded inputs and available resources; arithmetic assumptions and external effect gaps as in the invariant. Operator is the stated relation/projection; complement is a source-derived inner exclusion, reverse retains compatible antecedents. Other views are source-derived partial constraints, not inverse laws.
Evidence: tests.md identifies executed helpers and unexecuted paths. No universal guarantee follows from the finite fixtures.
modifier_priority
Subject: mathlib-books-license, source SHA-256 c45e71334ccd3618e9fad4d6117ac8048db42001ffea61d02fa6d4121d1e5060; finite transition observation.
Within one component, NC and ND together select CcByNcNd regardless of SA; ND alone overrides SA. Domain: recognized CC cue.
Domain: stated source predicates, bounded inputs and available resources; arithmetic assumptions and external effect gaps as in the invariant. Operator is the stated relation/projection; complement is a source-derived inner exclusion, reverse retains compatible antecedents. Other views are source-derived partial constraints, not inverse laws.
Evidence: tests.md identifies executed helpers and unexecuted paths. No universal guarantee follows from the finite fixtures.
code_transport
Subject: mathlib-books-license, source SHA-256 c45e71334ccd3618e9fad4d6117ac8048db42001ffea61d02fa6d4121d1e5060; finite transition observation.
code(CcBySa)=cc-by-sa, an exact code accepted by fetch::allowed; unknown Other code is rejected by fetch. This bridge is string-exact, not fuzzy.
Domain: stated source predicates, bounded inputs and available resources; arithmetic assumptions and external effect gaps as in the invariant. Operator is the stated relation/projection; complement is a source-derived inner exclusion, reverse retains compatible antecedents. Other views are source-derived partial constraints, not inverse laws.
Evidence: tests.md identifies executed helpers and unexecuted paths. No universal guarantee follows from the finite fixtures.
split_component_ambiguity
The same raw and/or separator is treated as alternative components before minimum; conjunction is not independently validated. parse('CC-BY-SA and CC-BY-NC-SA') yields CcBySa, so reconstruction cannot infer whether the human intended a dual grant or cumulative restrictions. book_licenses fixes this textual behavior.
Subject and source identity: manifest.json. Domain: scoped forward/invariant; relation is source-derived and partial. Evidence: tests.md distinguishes actual checks from unexecuted effect paths; finite fixtures do not prove all inputs.
tests
Bounded evidence
Selected actual source checks:
- mathlib::books::tests::book_licenses
- mathlib::books::tests::topics_and_hosts
- mathlib::books::tests::aim_list_parses
These checks are file-level evidence; fragment branches not reached by these names remain source-derived.
External wave33 mathlib receipt retains native-commands.json, numeric statuses, raw debug/release logs, sorted exact outcomes, mutation logs and original/restored hashes. Seventeen named checks pass twice per profile; six production behavior mutants reject in both profiles, with restored positives. Source syntax is regenerated twice after formatting and compared byte-for-byte. Structural validation tests bindings, not Rust semantics.
No network/DNS/download, real catalog/corpus/model/teacher or database execution. Effect paths are source-derived; finite helper tests are not universal verification. No executable percentage surrogate or speed claim; future caps require metric/domain/reference and remain 1/2/5/10%.
invariant-and-cost
Invariant and cost
Invariant
Unknown empty components map Other; every code is a fixed string. Interpretation is textual policy, not legal verification.
Cost
Regex construction plus scans O(license bytes); enum minimum O(component count).
Domain and gaps
No network/DNS/download, real catalog/corpus/model/teacher or database execution. Effect paths are source-derived; finite helper tests are not universal verification. No executable percentage surrogate or speed claim; future caps require metric/domain/reference and remain 1/2/5/10%.
This page in Markdown → https://md.groupants.elamur.ai/free/en/mova/tools/mathlib/src/books.rs.groupant/license.groupant/