FPRD LabShare an approach

← Claims

Definition

FPRD-D10

Claim FPRD-D10

Exact statement

The finite distributive word normal form of a positive relational term maps failure to no words, identity to the empty word, terminals and calls to singleton words, union to finite set union, and sequence to finite word concatenation; for labeled presentations, an annotated enrichment records the finite origin relation from canonical normalized call occurrences to source call labels.

Statusdefinition
External reviewNo documented external or specialist review of this FPRD result is recorded.

Context

This row is imported exactly from the governed FPRD claims ledger. The matrix assignment records normalized inventory coverage; it is not a new proof or a promotion of the ledger status.

Proof or evidence

The ledger points to docs/specs/m14-cfg-normal-form.md. The matrix has not yet rewritten that source into a self-contained public proof summary.

docs/specs/m14-cfg-normal-form.md →

Verification notes

Reviewed on 2026-08-25 for identifier, status, provenance, evidence-link presence, and dependency import only. Mathematical proof audit remains the next action unless separately documented.

Limitations

  • Normalization is finite but may be exponentially larger. The origin relation may be partial, one-to-many, or many-to-one and is not defined as a runtime-activation or dynamic-isomorphism relation.

Open work

Add a self-contained definition page with examples, nonexamples, and dependency boundaries.

Notes

Normalization is finite but may be exponentially larger. The origin relation may be partial, one-to-many, or many-to-one and is not defined as a runtime-activation or dynamic-isomorphism relation.